Antoine Bossard

60 papers B 1C 4Misc 8Journal 27Unranked 20
YearRankTypeTitle / Venue / Authors
2026 — conf
First-Class Functions in C: the Function-Oriented Programming Paradigm.
ICSIE
Antoine Bossard
2025 — conf
On CJK Support for Displays of Minimalistic IoT Devices.
IOTSMS
Antoine Bossard
2025 — conf
On the generation of bipartite graphs and application to routing.
CIIS
Antoine Bossard
2024 — conf
An Optimised PIC Programmer Also Having a High Pedagogical Value.
CCCE
Antoine Bossard
2024 — conf
On three fundamental graph enumeration problems and the corresponding graph generation algorithms.
iThings/GreenCom/CPSCom/SmartData/Cybermatics
Antoine Bossard
2023 J jnl
On Modern User Interface Development and the Case of Android Applications.
J. Softw.
Antoine Bossard
2023 J jnl
On the Crossing Number of a Torus Network.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Antoine Bossard, Keiichi Kaneko, Frederick C. Harris Jr.
2023 J jnl
Torus-Connected Toroids: An Efficient Topology for Interconnection Networks.
Comput.
Antoine Bossard
2022 Misc conf
On the Automatisation of the Realisation of a Banduke Table.
DB&IS
Antoine Bossard
2022 J jnl
On the Automatised Generation of a Japanese Banduke Table.
Balt. J. Mod. Comput.
Antoine Bossard
2022 J jnl
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs.
IEEE Access
Keiichi Kaneko, Antoine Bossard, Frederick C. Harris Jr.
2022 J jnl
The SOF Programming Paradigm: A Sequence of Pure Functions.
Int. J. Softw. Innov.
Antoine Bossard
2022 — conf
Topological properties of a 2-dimensional torus-connected cycles network.
ICCCM
Antoine Bossard
2021 — conf
On Bridging the Gap Between Far Eastern Cultures and the User Interface.
WorldCIST (1)
Antoine Bossard
2021 J jnl
On Solving the Decycling Problem in a Torus Network.
Wirel. Commun. Mob. Comput.
Antoine Bossard
2021 C conf
On the Erdős-Sós Conjecture for Stars, Paths and Some of Their Variants.
ICIS
Antoine Bossard
2020 J jnl
Cluster-Fault Tolerant Routing in a Torus.
Sensors
Antoine Bossard, Keiichi Kaneko
2020 — conf
On the Decycling Problem in a Torus.
PAAP
Antoine Bossard
2019 Misc conf
A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms.
SIGITE
Antoine Bossard, Keiichi Kaneko
2019 Misc conf
Refining the Unrestricted Character Encoding for Japanese.
CATA
Antoine Bossard, Keiichi Kaneko
2019 C conf
UCEJ Database Refinement and Applicability Proof.
ISM
Antoine Bossard, Keiichi Kaneko
2018 — conf
On the Torus Pairwise Disjoint-Path Routing Problem.
iThings/GreenCom/CPSCom/SmartData
Antoine Bossard, Keiichi Kaneko
2018 Misc conf
Proposal of an Unrestricted Character Encoding for Japanese.
DB&IS
Antoine Bossard, Keiichi Kaneko
2018 J jnl
Torus Pairwise Disjoint-Path Routing.
Sensors
Antoine Bossard, Keiichi Kaneko
2018 — conf
Unrestricted Character Encoding for Japanese.
DB&IS (Selected Papers)
Antoine Bossard, Keiichi Kaneko
2017 J jnl
A Set-to-Set Disjoint Paths Routing Algorithm in Tori.
Int. J. Netw. Comput.
Keiichi Kaneko, Antoine Bossard
2017 Misc conf
Automatic Segmentation of Chinese Characters as Wire-Frame Models.
ICCS
Antoine Bossard
2017 C conf
High-Performance Graphics in Racket with DirectX.
ICA3PP
Antoine Bossard
2016 J jnl
Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles.
IEICE Trans. Inf. Syst.
Antoine Bossard, Keiichi Kaneko
2016 — conf
Set-to-Set Disjoint Paths in Tori.
CANDAR
Keiichi Kaneko, Antoine Bossard
2015 J jnl
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint.
Int. J. Networked Distributed Comput.
Antoine Bossard, Keiichi Kaneko
2015 J jnl
Hypercube Fault Tolerant Routing with Bit Constraint.
Int. J. Netw. Comput.
Antoine Bossard, Keiichi Kaneko
2015 J jnl
Node-to-set disjoint paths routing in a metacube.
Int. J. High Perform. Comput. Netw.
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2015 — conf
On Solving the Container Problem in a Hypercube with Bit Constraint.
SNPD (revised selected papers)
Antoine Bossard, Keiichi Kaneko
2015 — conf
Premises of an algebra of Japanese characters.
C3S2E
Antoine Bossard
2015 J jnl
Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks.
Int. J. Appl. Math. Comput. Sci.
Antoine Bossard, Keiichi Kaneko
2014 J jnl
A Set-to-set Disjoint Paths Routing Algorithm in Hyper-star Graphs.
Int. J. Comput. Their Appl.
Antoine Bossard
2014 — conf
Analysis of the Poisson Distribution Applicability to the Japanese Seismic Activity.
IIAI-AAI
Antoine Bossard
2014 J jnl
Japanese Characters Cartography for Efficient Memorization.
Int. J. Comput. Their Appl.
Antoine Bossard
2014 — conf
On Hypercube Routing and Fault Tolerance with Bit Constraint.
CANDAR
Antoine Bossard, Keiichi Kaneko
2014 J jnl
Reconstruction and Auto-correction of Artificial Capillary with Flow Directions from Ultrasound Volume Data.
Int. J. Comput. Their Appl.
Antoine Bossard, Yuki Sugano, Shinya Onogi, Toshikazu Kato, Nobuhiko Shigehara, Takashi Mochizuki, Kohji Masuda
2014 J jnl
Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks.
Comput. J.
Antoine Bossard, Keiichi Kaneko
2014 Misc conf
The Container Problem in a Torus-connected Cycles Network.
ICCS
Antoine Bossard, Keiichi Kaneko
2014 J jnl
The decycling problem in hierarchical cubic networks.
J. Supercomput.
Antoine Bossard
2014 J jnl
Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes.
J. Inf. Sci. Eng.
Antoine Bossard, Keiichi Kaneko
2014 J jnl
k-pairwise disjoint paths routing in perfect hierarchical hypercubes.
J. Supercomput.
Antoine Bossard, Keiichi Kaneko
2013 J jnl
On the Decycling Problem in Hierarchical Hypercubes.
J. Interconnect. Networks
Antoine Bossard
2013 B conf
Reconstruction and error detection of blood vessel network from ultrasound volume data.
CBMS
Kohji Masuda, Antoine Bossard, Yuki Sugano, Toshikazu Kato, Shinya Onogi
2013 — conf
Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems.
ICA3PP (2)
Antoine Bossard, Keiichi Kaneko
2012 J jnl
Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks.
Comput. J.
Antoine Bossard, Keiichi Kaneko
2012 — conf
Supporting reconstruction of the blood vessel network using graph theory: An abstraction method.
EMBC
Antoine Bossard, Toshikazu Kato, Kohji Masuda
2012 J jnl
The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes.
Comput. J.
Antoine Bossard, Keiichi Kaneko
2011 J jnl
A Multilingual Chat System with Image Presentation for Detecting Mistranslation.
J. Comput. Inf. Technol.
Eri Hosogai, Tsubasa Mukai, Sinyu Jung, Yasufumi Kowase, Antoine Bossard, Yong Xu, Masatoshi Ishikawa, Keiichi Kaneko
2011 J jnl
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes.
Comput. J.
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2011 Misc conf
Node-to-set disjoint-path routing in perfect hierarchical hypercubes.
ICCS
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2011 Misc conf
Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs.
CATA
Nagateru Iwasawa, Antoine Bossard, Keiichi Kaneko
2011 — conf
Set-to-set disjoint-path routing in perfect hierarchical hypercubes.
C3S2E
Antoine Bossard, Keiichi Kaneko
2010 — conf
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes.
ICA3PP (1)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2009 — conf
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube.
ISPAN
Antoine Bossard, Keiichi Kaneko, Shietung Peng
2009 C conf
Node-to-Set Disjoint-path Routing in Metacube.
PDCAT
Antoine Bossard, Keiichi Kaneko, Shietung Peng