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="Katoh, Naoki"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimax regret 1-sink location problem in dynamic path networks
Yuya Higashikawa
,
John Augustine
,
Siu-Wing Cheng
,
Mordecai J. Golin
,
Naoki Katoh
,
Guanqun Ni
,
Bing Su
,
Yinfeng Xu
Theoretical Computer Science
588
, 2015, pp. 24-36
An inductive construction of minimally rigid body-hinge simple graphs
Yuki Kobayashi
,
Yuya Higashikawa
,
Naoki Katoh
,
Naoyuki Kamiyama
Theoretical Computer Science
556
, 2014, pp. 2-12
On the edge crossing properties of Euclidean minimum weight Laman graphs
Sergey Bereg
,
Seok-Hee Hong
,
Naoki Katoh
,
Sheung-Hung Poon
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
8283
, 2013, pp. 33-43
Testing maximal 1-planarity of graphs with a rotation system in linear time
Peter Eades
,
Seok-Hee Hong
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Lecture Notes in Computer Science
7704
, 2013, pp. 339-345
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Peter Eades
,
Seok-Hee Hong
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Theoretical Computer Science
513
, 2013, pp. 65-76
A linear-time algorithm for testing outer-1-planarity
Seok-Hee Hong
,
Peter Eades
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Lecture Notes in Computer Science
8242
, 2013, pp. 71-82
Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
Naoki Katoh
,
Shin-ichi Tanigawa
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 155-185
Arc-disjoint in-trees in directed graphs
Naoyuki Kamiyama
,
Naoki Katoh
,
Atsushi Takizawa
Combinatorica
29
(2), 2009, pp. 197-214
A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
Naoyuki Kamiyama
,
Naoki Katoh
Lecture Notes in Computer Science
5878
, 2009, pp. 802-811
On the infinitesimal rigidity of bar-and-slider frameworks
Naoki Katoh
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
5878
, 2009, pp. 524-533
A proof of the molecular conjecture
Naoki Katoh
Lecture Notes in Computer Science
5878
, 2009, pp. 2-3
Covering directed graphs by in-trees
Naoyuki Kamiyama
,
Naoki Katoh
Lecture Notes in Computer Science
5092
, 2008, pp. 444-457
Covering directed graphs by in-trees
Naoyuki Kamiyama
,
Naoki Katoh
Lecture Notes in Computer Science
5092
, 2008, pp. 444-457
Geometric spanner of objects under
L_1
distance
Yongding Zhu
,
Jinhui Xu
,
Yang Yang
,
Naoki Katoh
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
5092
, 2008, pp. 395-404
Geometric spanner of objects under
L_1
distance
Yongding Zhu
,
Jinhui Xu
,
Yang Yang
,
Naoki Katoh
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
5092
, 2008, pp. 395-404
Enumerating non-crossing minimally rigid frameworks
David Avis
,
Naoki Katoh
,
Makoto Ohsaki
,
Ileana Streinu
,
Shin-ichi Tanigawa
Graphs and Combinatorics
23
(S1), 2007, pp. 117-134
Enumerating constrained non-crossing geometric spanning trees
Naoki Katoh
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
4598
, 2007, pp. 243-253
Triangulating a convex polygon with fewer number of non-standard bars
Yinfeng Xu
,
Wenqiang Dai
,
Naoki Katoh
,
Makoto Ohsaki
Theoretical Computer Science
389
(1-2), 2007, pp. 143-151
Geometric spanner of segments
Yang Yang
,
Yongding Zhu
,
Jinhui Xu
,
Naoki Katoh
Lecture Notes in Computer Science
4835
, 2007, pp. 75-87
Enumerating non-crossing minimally rigid frameworks
David Avis
,
Naoki Katoh
,
Makoto Ohsaki
,
Ileana Streinu
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
4112
, 2006, pp. 205-215
Triangulating a convex polygon with small number of non-standard bars
Yinfeng Xu
,
Wenqiang Dai
,
Naoki Katoh
,
Makoto Ohsaki
Lecture Notes in Computer Science
3595
, 2005, pp. 481-489
Polyline fitting of planar points under min-sum criteria
Boris Aronov
,
Tetsuo Asano
,
Naoki Katoh
,
Kurt Mehlhorn
,
Takeshi Tokuyama
Lecture Notes in Computer Science
3341
, 2004, pp. 77-88
On geometric structure of global roundings for graphs and range spaces
Tetsuo Asano
,
Naoki Katoh
,
Hisao Tamaki
,
Takeshi Tokuyama
Lecture Notes in Computer Science
3111
, 2004, pp. 455-467
The structure and number of global roundings of a graph
Tetsuo Asano
,
Naoki Katoh
,
Hisao Tamaki
,
Takeshi Tokuyama
Theoretical Computer Science
325
(3), 2004, pp. 425-437
Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain
Danny Z. Chen
,
Jinhee Chun
,
Naoki Katoh
,
Takeshi Tokuyama
Lecture Notes in Computer Science
3106
, 2004, pp. 238-248
Seiten 1
2
3
4
5
6
>