Demo Data from EDBT 2026 / reviewers in the wild / expert
Hitoshi Suzuki
dblp:30/5125
· DBLP profile ↗
13ranked-venue papers
5as first author
0since 2021 · last 1999
0000-0001-6936-3019ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 13 · 5 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Graph algorithms and graph theory · 71% Approximation and online algorithms · 29% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
planar graphs |
0.0 | 1 | 1990 | Finding Steiner Forests in Planar Graphs · SODA 1990 |
Approximation and online algorithms › approximation algorithms › network design
steiner forest |
0.0 | 1 | 1990 | Finding Steiner Forests in Planar Graphs · SODA 1990 |
Graph algorithms and graph theory › graph algorithms › network flow
multicommodity flow |
0.0 | 1 | 1985 | Multicommodity Flows in Planar Undirected Graphs and Shortest Paths · STOC 1985 |
Graph algorithms and graph theory › graph algorithms › network flow › multicommodity flow
planar multicommodity flow |
0.0 | 1 | 1985 | Multicommodity Flows in Planar Undirected Graphs and Shortest Paths · STOC 1985 |
Graph algorithms and graph theory › graph algorithms › path problems
shortest path problem |
0.0 | 1 | 1985 | Multicommodity Flows in Planar Undirected Graphs and Shortest Paths · STOC 1985 |
Methods — techniques the papers use, named apart from their topics
graph duality · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs
Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki |
Inf. Process. Lett. | 3 |
| 1996 | Shortest Noncrossing Paths in Plane Graphs
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
Algorithmica | 2 |
| 1995 | Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas
Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki |
ISAAC | 2 |
| 1993 | Sequential and parallel algorithms for edge-coloring series-parallel multigraphs
Xiao Zhou 0001, Hitoshi Suzuki, Takao Nishizeki |
IPCO | 2 |
| 1993 | Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
ISAAC | 2 |
| 1992 | Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
ISAAC | 2 |
| 1992 | An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs
Xiao Zhou 0001, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki |
LATIN | 3 |
| 1992 | Algorithms for Routing around a Rectangle
András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos |
Discret. Appl. Math. | 4 |
| 1990 | Finding Steiner Forests in Planar Graphs
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki |
SODA | 1 |
| 1990 | Edge-disjoint paths in a grid bounded by two nested rectangles
Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki |
Discret. Appl. Math. | 1 |
| 1990 | A Linear Algorithm for Bipartition of Biconnected Graphs
Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki |
Inf. Process. Lett. | 1 |
| 1989 | Algorithms for Multicommodity Flows in Planar Graphs
Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito |
Algorithmica | 1 |
| 1985 | Multicommodity Flows in Planar Undirected Graphs and Shortest PathsabstractThis paper deals with the multicommodity flow problems for two classes of planar undirected graphs. The first class C12 consists of graphs in which each source-sink pair is located on one of two specified face boundaries. The second class C01 consists of graphs in which some of the source-sink pairs are located on a specified face boundary and all the other pairs share a common sink located on the boundary. We show that the multicommodity flow problem for a graph in C12 (resp. C01) can be reduced to the shortest path problem for an undirected (resp. a directed) graph obtained from the dual of the original undirected graph. Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito |
STOC | 1 |