A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ISPAN, 2009)

Node-to-Set Disjoint-path Routing in Metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (PDCAT, 2009)

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ICA3PP (1), 2010)

Set-to-set disjoint-path routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko (C3S2E, 2011)

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. - Nagateru Iwasawa; Antoine Bossard; Keiichi Kaneko (CATA, 2011)

A Multilingual Chat System with Image Presentation for Detecting Mistranslation. - Eri Hosogai; Tsubasa Mukai; Sinyu Jung; Yasufumi Kowase; Antoine Bossard; Yong Xu; Masatoshi Ishikawa; Keiichi Kaneko (J. Comput. Inf. Technol., 2011)

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (Comput. J., 2011)

Node-to-set disjoint-path routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ICCS, 2011)

Supporting reconstruction of the blood vessel network using graph theory: An abstraction method. - Antoine Bossard; Toshikazu Kato; Kohji Masuda (EMBC, 2012)

The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. - Antoine Bossard; Keiichi Kaneko (Comput. J., 2012)

Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks. - Antoine Bossard; Keiichi Kaneko (Comput. J., 2012)

Reconstruction and error detection of blood vessel network from ultrasound volume data. - Kohji Masuda; Antoine Bossard; Yuki Sugano; Toshikazu Kato; Shinya Onogi (CBMS, 2013)

Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. - Antoine Bossard; Keiichi Kaneko (ICA3PP (2), 2013)

On the Decycling Problem in Hierarchical Hypercubes. - Antoine Bossard (J. Interconnect. Networks, 2013)

On Hypercube Routing and Fault Tolerance with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (CANDAR, 2014)

The Container Problem in a Torus-connected Cycles Network. - Antoine Bossard; Keiichi Kaneko (ICCS, 2014)

Analysis of the Poisson Distribution Applicability to the Japanese Seismic Activity. - Antoine Bossard (IIAI-AAI, 2014)

Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. - Antoine Bossard; Keiichi Kaneko (Comput. J., 2014)

A Set-to-set Disjoint Paths Routing Algorithm in Hyper-star Graphs. - Antoine Bossard (Int. J. Comput. Their Appl., 2014)

Japanese Characters Cartography for Efficient Memorization. - Antoine Bossard (Int. J. Comput. Their Appl., 2014)

Reconstruction and Auto-correction of Artificial Capillary with Flow Directions from Ultrasound Volume Data. - Antoine Bossard; Yuki Sugano; Shinya Onogi; Toshikazu Kato; Nobuhiko Shigehara; Takashi Mochizuki; Kohji Masuda (Int. J. Comput. Their Appl., 2014)

Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. - Antoine Bossard; Keiichi Kaneko (J. Inf. Sci. Eng., 2014)

The decycling problem in hierarchical cubic networks. - Antoine Bossard (J. Supercomput., 2014)

k-pairwise disjoint paths routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko (J. Supercomput., 2014)

Premises of an algebra of Japanese characters. - Antoine Bossard (C3S2E, 2015)

On Solving the Container Problem in a Hypercube with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (SNPD (revised selected papers), 2015)

Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks. - Antoine Bossard; Keiichi Kaneko (Int. J. Appl. Math. Comput. Sci., 2015)

Node-to-set disjoint paths routing in a metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (Int. J. High Perform. Comput. Netw., 2015)

Hypercube Fault Tolerant Routing with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (Int. J. Netw. Comput., 2015)

A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (Int. J. Networked Distributed Comput., 2015)

Set-to-Set Disjoint Paths in Tori. - Keiichi Kaneko; Antoine Bossard (CANDAR, 2016)

Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles. - Antoine Bossard; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2016)

High-Performance Graphics in Racket with DirectX. - Antoine Bossard (ICA3PP, 2017)

Automatic Segmentation of Chinese Characters as Wire-Frame Models. - Antoine Bossard (ICCS, 2017)

A Set-to-Set Disjoint Paths Routing Algorithm in Tori. - Keiichi Kaneko; Antoine Bossard (Int. J. Netw. Comput., 2017)

Proposal of an Unrestricted Character Encoding for Japanese. - Antoine Bossard; Keiichi Kaneko (DB&IS, 2018)

Unrestricted Character Encoding for Japanese. - Antoine Bossard; Keiichi Kaneko (DB&IS (Selected Papers), 2018)

On the Torus Pairwise Disjoint-Path Routing Problem. - Antoine Bossard; Keiichi Kaneko (iThings/GreenCom/CPSCom/SmartData, 2018)

Torus Pairwise Disjoint-Path Routing. - Antoine Bossard; Keiichi Kaneko (Sensors, 2018)

Refining the Unrestricted Character Encoding for Japanese. - Antoine Bossard; Keiichi Kaneko (CATA, 2019)

UCEJ Database Refinement and Applicability Proof. - Antoine Bossard; Keiichi Kaneko (ISM, 2019)

A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. - Antoine Bossard; Keiichi Kaneko (SIGITE, 2019)

On the Decycling Problem in a Torus. - Antoine Bossard (PAAP, 2020)

Cluster-Fault Tolerant Routing in a Torus. - Antoine Bossard; Keiichi Kaneko (Sensors, 2020)

On the Erdős-Sós Conjecture for Stars, Paths and Some of Their Variants. - Antoine Bossard (ICIS, 2021)

On Bridging the Gap Between Far Eastern Cultures and the User Interface. - Antoine Bossard (WorldCIST (1), 2021)

On Solving the Decycling Problem in a Torus Network. - Antoine Bossard (Wirel. Commun. Mob. Comput., 2021)

On the Automatisation of the Realisation of a Banduke Table. - Antoine Bossard (DB&IS, 2022)

Topological properties of a 2-dimensional torus-connected cycles network. - Antoine Bossard (ICCCM, 2022)

Set-to-Set Disjoint Path Routing in Bijective Connection Graphs. - Keiichi Kaneko; Antoine Bossard; Frederick C. Harris Jr. (IEEE Access, 2022)

On the Automatised Generation of a Japanese Banduke Table. - Antoine Bossard (Balt. J. Mod. Comput., 2022)

The SOF Programming Paradigm: A Sequence of Pure Functions. - Antoine Bossard (Int. J. Softw. Innov., 2022)

On the Crossing Number of a Torus Network. - Antoine Bossard; Keiichi Kaneko; Frederick C. Harris Jr. (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Torus-Connected Toroids: An Efficient Topology for Interconnection Networks. - Antoine Bossard (Comput., 2023)

On Modern User Interface Development and the Case of Android Applications. - Antoine Bossard (J. Softw., 2023)

An Optimised PIC Programmer Also Having a High Pedagogical Value. - Antoine Bossard (CCCE, 2024)

On three fundamental graph enumeration problems and the corresponding graph generation algorithms. - Antoine Bossard (iThings/GreenCom/CPSCom/SmartData/Cybermatics, 2024)