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="Imai, Keiko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On total unimodularity of edge-edge adjacency matrices
Yusuke Matsumoto
,
Naoyuki Kamiyama
,
Keiko Imai
Algorithmica
67
(2), 2013, pp. 277-292
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Yusuke Matsumoto
,
Naoyuki Kamiyama
,
Keiko Imai
Information Processing Letters
111
(10), 2011, pp. 465-468
On totally unimodularity of edge-edge adjacency matrices
Yusuke Matsumoto
,
Naoyuki Kamiyama
,
Keiko Imai
Lecture Notes in Computer Science
6842
, 2011, pp. 354-365
An improved algorithm for the minimum Manhattan network problem
Ryo Kato
,
Keiko Imai
,
Takao Asano
Lecture Notes in Computer Science
2518
, 2002, pp. 344-356
A branch-and-cut approach for minimum weight triangulation
Yoshiaki Kyoda
,
Keiko Imai
,
Fumihiko Takeuchi
,
Akira Tajima
Lecture Notes in Computer Science
1350
, 1997, pp. 384-393
Orthogonal weighted linear
L_1
and
L_{infty}
approximation and applications
Michael E. Houle
,
Hiroshi Imai
,
Keiko Imai
,
Jean-Marc Robert
,
Peter Yamamoto
Discrete Applied Mathematics
43
(3), 1993, pp. 217-232
Weighted orthogonal linear
L_\infty
-approximation and applications
Michael E. Houle
,
Hiroshi Imai
,
Keiko Imai
,
Jean-Marc Robert
Lecture Notes in Computer Science
382
, 1989, pp. 183-191