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
Hilfe
Suche: Author="Kusakari, Yoshiyuki"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding a region with the minimum total
L-1
distance from prescribed terminals
Yoshiyuki Kusakari
,
Takao Nishizeki
Algorithmica
35
(3), 2003, pp. 225-256
Algorithms for finding noncrossing Steiner forests in plane graphs
Yoshiyuki Kusakari
,
Daisuke Masubuchi
,
Takao Nishizeki
Lecture Notes in Computer Science
1741
, 1999, pp. 337-346
An algorithm for finding a region with the minimum total
L_1
from prescribed terminals
Yoshiyuki Kusakari
,
Takao Nishizeki
Lecture Notes in Computer Science
1350
, 1997, pp. 324-333
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