default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHitoshi Suzuki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j15]Hitoshi Suzuki, Yuji Waizumi, Nei Kato, Yoshiaki Nemoto:
Discrimination of similar characters with a nonlinear compound discriminant function. Syst. Comput. Jpn. 38(11): 36-48 (2007)- [c9]Yoshifumi Shimodaira, Hitoshi Suzuki, Maciej Kretkowski:
New Imaging and Display System for Wide Gamut Color Reproduction. IAS 2007: 1153-1157
1990 – 1999
- 1999
- [j14]Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki:
A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. Int. J. Comput. Geom. Appl. 9(2): 151-170 (1999) - [j13]Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki:
A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. Inf. Process. Lett. 71(5-6): 205-212 (1999) - 1997
- [j12]Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki:
Shortest Non-Crossing Rectilinear Paths in Plane Regions. Int. J. Comput. Geom. Appl. 7(5): 419-436 (1997) - [j11]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997) - 1996
- [j10]Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki:
Shortest Noncrossing Paths in Plane Graphs. Algorithmica 16(3): 339-357 (1996) - [j9]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 20(1): 174-201 (1996) - 1995
- [c8]Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki:
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. ISAAC 1995: 42-51 - 1994
- [j8]Hitoshi Suzuki:
On Distance-Regular Graphs with ki = kj. J. Comb. Theory B 61(1): 103-110 (1994) - 1993
- [c7]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO 1993: 129-145 - [c6]Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki:
Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. ISAAC 1993: 98-107 - 1992
- [j7]András Frank
, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos:
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40(4): 363-378 (1992) - [j6]Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki:
Variable-Priority Queue and Doughnut Routing. J. Algorithms 13(4): 606-635 (1992) - [c5]Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki:
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. ISAAC 1992: 400-409 - [c4]Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki:
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529 - 1990
- [j5]Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki:
Edge-disjoint paths in a grid bounded by two nested rectangles. Discret. Appl. Math. 27(1-2): 157-178 (1990) - [j4]Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki:
A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. 33(5): 227-231 (1990) - [c3]Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki:
Parallel Algorithms for Finding Steiner Forests in Planar Graphs. SIGAL International Symposium on Algorithms 1990: 458-467 - [c2]Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki:
Finding Steiner Forests in Planar Graphs. SODA 1990: 444-453
1980 – 1989
- 1989
- [j3]Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito:
Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989) - [j2]Takashi Watanabe, Hitoshi Suzuki:
Compound decision theory and adaptive classification for multispectral image data. Syst. Comput. Jpn. 20(8): 37-47 (1989) - 1988
- [j1]Takashi Watanabe, Hitoshi Suzuki:
An Experimental Evaluation of Classifiers Using Spatial Context for Multispectral Images. Syst. Comput. Jpn. 19(4): 33-47 (1988) - 1985
- [c1]Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito:
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths. STOC 1985: 195-204
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-06-10 21:19 CEST 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:
