default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Bossard
Person information
- affiliation: Kanagawa University, Graduate School of Science, Hiratsuka, Japan
- affiliation (2012-2015): Advanced Institute of Industrial Technology, Tokyo, Japan
- affiliation (former, PhD 2011): Tokyo University of Agriculture and Technology, Graduate School of Engineering, Tokyo, Japan
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Antoine Bossard:
On three fundamental graph enumeration problems and the corresponding graph generation algorithms. iThings/GreenCom/CPSCom/SmartData/Cybermatics 2024: 408-414- 2023
- [j27]Antoine Bossard
:
Torus-Connected Toroids: An Efficient Topology for Interconnection Networks. Comput. 12(9): 173 (2023) - [j26]Antoine Bossard, Keiichi Kaneko, Frederick C. Harris Jr.:
On the Crossing Number of a Torus Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(1): 35-44 (2023) - [j25]Antoine Bossard:
On Modern User Interface Development and the Case of Android Applications. J. Softw. 18(4): 209-217 (2023) - 2022
- [j24]Keiichi Kaneko, Antoine Bossard, Frederick C. Harris Jr.:
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs. IEEE Access 10: 72731-72742 (2022) - [j23]Antoine Bossard:
On the Automatised Generation of a Japanese Banduke Table. Balt. J. Mod. Comput. 10(4) (2022) - [j22]Antoine Bossard:
The SOF Programming Paradigm: A Sequence of Pure Functions. Int. J. Softw. Innov. 10(1): 1-14 (2022) - [c28]Antoine Bossard:
On the Automatisation of the Realisation of a Banduke Table. DB&IS 2022: 80-92 - [c27]Antoine Bossard:
Topological properties of a 2-dimensional torus-connected cycles network. ICCCM 2022: 139-144 - 2021
- [j21]Antoine Bossard:
On Solving the Decycling Problem in a Torus Network. Wirel. Commun. Mob. Comput. 2021: 5598173:1-5598173:6 (2021) - [c26]Antoine Bossard:
On the Erdős-Sós Conjecture for Stars, Paths and Some of Their Variants. ICIS 2021: 49-53 - [c25]Antoine Bossard:
On Bridging the Gap Between Far Eastern Cultures and the User Interface. WorldCIST (1) 2021: 415-424 - 2020
- [j20]Antoine Bossard, Keiichi Kaneko:
Cluster-Fault Tolerant Routing in a Torus. Sensors 20(11): 3286 (2020) - [c24]Antoine Bossard:
On the Decycling Problem in a Torus. PAAP 2020: 12-21
2010 – 2019
- 2019
- [c23]Antoine Bossard, Keiichi Kaneko:
Refining the Unrestricted Character Encoding for Japanese. CATA 2019: 292-300 - [c22]Antoine Bossard, Keiichi Kaneko:
UCEJ Database Refinement and Applicability Proof. ISM 2019: 64-71 - [c21]Antoine Bossard, Keiichi Kaneko:
A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. SIGITE 2019: 63-68 - 2018
- [j19]Antoine Bossard, Keiichi Kaneko:
Torus Pairwise Disjoint-Path Routing. Sensors 18(11): 3912 (2018) - [c20]Antoine Bossard, Keiichi Kaneko:
Unrestricted Character Encoding for Japanese. DB&IS (Selected Papers) 2018: 161-175 - [c19]Antoine Bossard, Keiichi Kaneko:
Proposal of an Unrestricted Character Encoding for Japanese. DB&IS 2018: 189-201 - [c18]Antoine Bossard, Keiichi Kaneko:
On the Torus Pairwise Disjoint-Path Routing Problem. iThings/GreenCom/CPSCom/SmartData 2018: 1739-1746 - 2017
- [j18]Keiichi Kaneko, Antoine Bossard:
A Set-to-Set Disjoint Paths Routing Algorithm in Tori. Int. J. Netw. Comput. 7(2): 173-186 (2017) - [c17]Antoine Bossard:
High-Performance Graphics in Racket with DirectX. ICA3PP 2017: 814-825 - [c16]Antoine Bossard:
Automatic Segmentation of Chinese Characters as Wire-Frame Models. ICCS 2017: 415-424 - 2016
- [j17]Antoine Bossard, Keiichi Kaneko:
Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles. IEICE Trans. Inf. Syst. 99-D(11): 2821-2823 (2016) - [c15]Keiichi Kaneko, Antoine Bossard:
Set-to-Set Disjoint Paths in Tori. CANDAR 2016: 91-97 - 2015
- [j16]Antoine Bossard, Keiichi Kaneko:
Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks. Int. J. Appl. Math. Comput. Sci. 25(4): 723-735 (2015) - [j15]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-set disjoint paths routing in a metacube. Int. J. High Perform. Comput. Netw. 8(4): 315-323 (2015) - [j14]Antoine Bossard, Keiichi Kaneko:
Hypercube Fault Tolerant Routing with Bit Constraint. Int. J. Netw. Comput. 5(2): 272-289 (2015) - [j13]Antoine Bossard, Keiichi Kaneko:
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint. Int. J. Networked Distributed Comput. 3(4): 202-213 (2015) - [c14]Antoine Bossard:
Premises of an algebra of Japanese characters. C3S2E 2015: 79-87 - [c13]Antoine Bossard, Keiichi Kaneko:
On Solving the Container Problem in a Hypercube with Bit Constraint. SNPD (revised selected papers) 2015: 77-92 - 2014
- [j12]Antoine Bossard, Keiichi Kaneko:
Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. Comput. J. 57(2): 332-337 (2014) - [j11]Antoine Bossard:
A Set-to-set Disjoint Paths Routing Algorithm in Hyper-star Graphs. Int. J. Comput. Their Appl. 21(1): 76-82 (2014) - [j10]Antoine Bossard:
Japanese Characters Cartography for Efficient Memorization. Int. J. Comput. Their Appl. 21(3): 170-177 (2014) - [j9]Antoine Bossard, Yuki Sugano, Shinya Onogi, Toshikazu Kato, Nobuhiko Shigehara, Takashi Mochizuki, Kohji Masuda:
Reconstruction and Auto-correction of Artificial Capillary with Flow Directions from Ultrasound Volume Data. Int. J. Comput. Their Appl. 21(4): 203-210 (2014) - [j8]Antoine Bossard, Keiichi Kaneko:
Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng. 30(4): 1087-1093 (2014) - [j7]Antoine Bossard, Keiichi Kaneko:
k-pairwise disjoint paths routing in perfect hierarchical hypercubes. J. Supercomput. 67(2): 485-495 (2014) - [j6]Antoine Bossard:
The decycling problem in hierarchical cubic networks. J. Supercomput. 69(1): 293-305 (2014) - [c12]Antoine Bossard, Keiichi Kaneko:
On Hypercube Routing and Fault Tolerance with Bit Constraint. CANDAR 2014: 40-49 - [c11]Antoine Bossard, Keiichi Kaneko:
The Container Problem in a Torus-connected Cycles Network. ICCS 2014: 2182-2191 - [c10]Antoine Bossard:
Analysis of the Poisson Distribution Applicability to the Japanese Seismic Activity. IIAI-AAI 2014: 430-435 - 2013
- [j5]Antoine Bossard:
On the Decycling Problem in Hierarchical Hypercubes. J. Interconnect. Networks 14(2) (2013) - [c9]Kohji Masuda, Antoine Bossard, Yuki Sugano, Toshikazu Kato, Shinya Onogi:
Reconstruction and error detection of blood vessel network from ultrasound volume data. CBMS 2013: 497-501 - [c8]Antoine Bossard, Keiichi Kaneko:
Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. ICA3PP (2) 2013: 11-21 - 2012
- [j4]Antoine Bossard, Keiichi Kaneko:
The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. Comput. J. 55(6): 769-775 (2012) - [j3]Antoine Bossard, Keiichi Kaneko:
Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks. Comput. J. 55(12): 1440-1446 (2012) - [c7]Antoine Bossard, Toshikazu Kato, Kohji Masuda:
Supporting reconstruction of the blood vessel network using graph theory: An abstraction method. EMBC 2012: 5470-5473 - 2011
- [j2]Eri Hosogai, Tsubasa Mukai, Sinyu Jung, Yasufumi Kowase, Antoine Bossard, Yong Xu, Masatoshi Ishikawa, Keiichi Kaneko:
A Multilingual Chat System with Image Presentation for Detecting Mistranslation. J. Comput. Inf. Technol. 19(4): 247-253 (2011) - [j1]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. Comput. J. 54(8): 1372-1381 (2011) - [c6]Antoine Bossard, Keiichi Kaneko:
Set-to-set disjoint-path routing in perfect hierarchical hypercubes. C3S2E 2011: 51-57 - [c5]Nagateru Iwasawa, Antoine Bossard, Keiichi Kaneko:
Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. CATA 2011: 21-26 - [c4]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-set disjoint-path routing in perfect hierarchical hypercubes. ICCS 2011: 442-451 - 2010
- [c3]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. ICA3PP (1) 2010: 511-519
2000 – 2009
- 2009
- [c2]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. ISPAN 2009: 23-28 - [c1]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-Set Disjoint-path Routing in Metacube. PDCAT 2009: 57-62
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
