|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hitoshi Suzuki, Yuji Waizumi, Nei Kato, Yoshiaki Nemoto |
Discrimination of similar characters with a nonlinear compound discriminant function.  |
Systems and Computers in Japan  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki |
A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki |
A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. |
Int. J. Comput. Geometry Appl. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki |
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
Shortest Non-Crossing Rectilinear Paths in Plane Regions. |
Int. J. Comput. Geometry Appl. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
Shortest Noncrossing Paths in Plane Graphs. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki |
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki |
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki |
On Distance-Regular Graphs with ki = kj. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki |
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. |
IPCO |
1993 |
DBLP BibTeX RDF |
|
| 1 | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki |
Variable-Priority Queue and Doughnut Routing. |
J. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki |
Algorithms for Routing around a Rectangle. |
Discrete Applied Mathematics |
1992 |
DBLP BibTeX RDF |
|
| 1 | Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki |
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. |
LATIN |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki |
A Linear Algorithm for Bipartition of Biconnected Graphs. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki |
Edge-disjoint paths in a grid bounded by two nested rectangles. |
Discrete Applied Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki |
Finding Steiner Forests in Planar Graphs. |
SODA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki |
Parallel Algorithms for Finding Steiner Forests in Planar Graphs. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito |
Algorithms for Multicommodity Flows in Planar Graphs. |
Algorithmica |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito |
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")