Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Suzuki, Hitoshi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear-time algorithm for solving the center problem on weighted cactus graphs
Yu-Feng Lan
,
Yue-Li Wang
,
Hitoshi Suzuki
Information Processing Letters
71
(5-6), 1999, pp. 205-212
An
NC
parallel algorithm for edge-coloring series -- Parallel multigraphs
Xiao Zhou
,
Hitoshi Suzuki
,
Takao Nishizeki
Journal of Algorithms
23
(2), 1997, pp. 359-374
Shortest noncrossing paths in plane graphs
Jun-ya Takahashi
,
Hitoshi Suzuki
,
Takao Nishizeki
Algorithmica
16
, 1996, pp. 339-357
A linear algorithm for edge-coloring series--parallel multigraphs
Xiao Zhou
,
Hitoshi Suzuki
,
Takao Nishizeki
Journal of Algorithms
20
(1), 1996, pp. 174-201
Finding a shortest pair of paths on the plane with obstacles and crossing areas
Yoshiyuki Kusakari
,
Hitoshi Suzuki
,
Takao Nishizeki
Lecture Notes in Computer Science
1004
, 1995, pp. 42-51
Finding shortest non-crossing rectilinear paths in plane regions
Jun-ya Takahashi
,
Hitoshi Suzuki
,
Takao Nishizeki
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 98-107
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs
Xiao Zhou
,
Hitoshi Suzuki
,
Takao Nishizeki
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 129-145
Algorithms for routing around a rectangle
András Frank
,
Takao Nishizeki
,
Nobuji Saito
,
Hitoshi Suzuki
,
éva Tardos
Discrete Applied Mathematics
40
, 1992, pp. 363-378
Variable-priority queue and doughnut routing
Hitoshi Suzuki
,
Akira Ishiguro
,
Takao Nishizeki
Journal of Algorithms
13
, 1992, pp. 606-635
Algorithms for finding non-crossing paths with minimum total length in plane graphs
Jun-ya Takahashi
,
Hitoshi Suzuki
,
Takao Nishizeki
Lecture Notes in Computer Science
650
, 1992, pp. 400-409
Finding Steiner forests in planar graphs
Hitoshi Suzuki
,
Takehiro Akama
,
Takao Nishizeki
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 444-453
Edge-disjoint paths in a grid bounded by two nested rectangles
Hitoshi Suzuki
,
Akira Ishiguro
,
Takao Nishizeki
Discrete Applied Mathematics
27
, 1990, pp. 157-178
Parallel algorithms for finding Steiner forests in planar graphs
Hitoshi Suzuki
,
Chiseko Yamanaka
,
Takao Nishizeki
Lecture Notes in Computer Science
450
, 1990, pp. 458-467
Algorithms for multicommodity flows in planar graphs
Hitoshi Suzuki
,
Takao Nishizeki
,
Nobuji Saito
Algorithmica
4
, 1989, pp. 471-501
A linear algorithm for bipartition of biconnected graphs
Hitoshi Suzuki
,
Naomi Takahashi
,
Takao Nishizeki
Information Processing Letters
33
, 1989/90, pp. 227-231