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="Iri, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Topology-oriented implementation - An approach to robust geometric algorithms
K. Sugihara
,
M. Iri
,
H. Inagaki
,
T. Imai
Algorithmica
27
(1), 2000, pp. 5-20
Voronoi diagram in the Laguerre geometry and its applications
H. Imai
,
M. Iri
,
K. Murota
SIAM Journal on Computing
14
(1), 1985, February, pp. 93-105
A fast Voronoi-diagram algorithm with quaternary tree bucketing
T. Ohya
,
M. Iri
,
K. Murota
Information Processing Letters
18
(4), 1984, May, pp. 227-231
Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
M. Iri
,
K. Murota
,
S. Matsui
Information Processing Letters
12
(4), 1981, August, pp. 206-209
Comments on F. Hadlock's paper: ``Finding a maximum cut of a planar graph in polynomial time''
K. Aoshima
,
M. Iri
SIAM Journal on Computing
6
(1), 1977, March, pp. 86-87
A new method of solving transportation-network problems
M. Iri
Journal of the Operations Research Society of Japan
3
, 1960, pp. 27-87