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="Ito, Akira"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The existence of a 2-factor in a graph satisfying the local Chvátal-Erdŏs condition
Guantao Chen
,
Akira Saito
,
Songling Shan
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1788-1799
Clique or hole in claw-free graphs
Henning Bruhn
,
Akira Saito
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 1-13
Closures, cycles, and paths
Jochen Harant
,
Arnfried Kemnitz
,
Akira Saito
,
Ingo Schiermeyer
Journal of Graph Theory
69
(3), 2012, pp. 314-323
The existence of a 2-factor in
K_{1, n}
-free graphs with large connectivity and large edge-connectivity
R.E.L. Aldred
,
Yoshimi Egawa
,
Jun Fujisawa
,
Katsuhiro Ota
,
Akira Saito
Journal of Graph Theory
68
(1), 2011, pp. 77-89
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Jun Fujisawa
,
Shinya Fujita
,
Michael D. Plummer
,
Akira Saito
,
Ingo Schiermeyer
Combinatorica
31
(6), 2011, pp. 703-723
Forbidden triples for perfect matchings
Katsuhiro Ota
,
Michael D. Plummer
,
Akira Saito
Journal of Graph Theory
67
(3), 2011, pp. 250-259
Forbidden subgraphs and the existence of a 2-factor
R.E.L. Aldred
,
Jun Fujisawa
,
Akira Saito
Journal of Graph Theory
64
(3), 2010, pp. 250-266
Reduction for 3-connected graphs of minimum degree at least four
Sheng Bau
,
Akira Saito
Graphs and Combinatorics
23
(S1), 2007, pp. 135-144
A pair of forbidden subgraphs and perfect matchings
Shinya Fujita
,
Ken-ichi Kawarabayashi
,
Claudio Leonardo Lucchesi
,
Katsuhiro Ota
,
Michael D. Plummer
,
Akira Saito
Journal of Combinatorial Theory Series B
96
(3), 2006, pp. 315-324
Domination in a graph with a 2-factor
Ken-ichi Kawarabayashi
,
Michael D. Plummer
,
Akira Saito
Journal of Graph Theory
52
(1), 2006, pp. 1-6
Some properties of one-pebble Turing machines with sublogarithmic space
Atsuyuki Inoue
,
Akira Ito
,
Katsushi Inoue
,
Tokio Okazaki
Theoretical Computer Science
341
(1-3), 2005, pp. 138-149
Forbidden subgraphs and bounds on the size of a maximum matching
Michael D. Plummer
,
Akira Saito
Journal of Graph Theory
50
(1), 2005, pp. 1-12
Vertex-disjoint cycles containing specified vertices in a bipartite graph
Guantao Chen
,
Hikoe Enomoto
,
Ken-ichi Kawarabayashi
,
Katsuhiro Ota
,
Dingjun Lou
,
Akira Saito
Journal of Graph Theory
46
(3), 2004, pp. 145-166
Long cycles in triangle-free graphs with prescribed independence number and connectivity
Hikoe Enomoto
,
Atsushi Kaneko
,
Akira Saito
,
Bing Wei
Journal of Combinatorial Theory Series B
91
(1), 2004, pp. 43-55
A note on rebound Turing machines
Katsushi Inoue
,
Akira Ito
,
Takashi Kamiura
,
Holger Petersen
,
Lan Zhang
International Journal of Foundations of Computer Science
15
(5), 2004, pp. 791-807
Degree conditions for
k
-ordered Hamiltonian graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Alexandr V. Kostochka
,
Linda Lesniak
,
Ingo Schiermeyer
,
Akira Saito
Journal of Graph Theory
42
(3), 2003, pp. 199-210
Some properties of one-pebble Turing machines with sublogarithmic space
Atsuyuki Inoue
,
Akira Ito
,
Katsushi Inoue
,
Tokio Okazaki
Lecture Notes in Computer Science
2906
, 2003, pp. 635-644
Splitting and contractible edges in 4-connected graphs
Akira Saito
Journal of Combinatorial Theory Series B
88
(2), 2003, pp. 227-235
Hamiltonian cycles in
n
-extendable graphs
Ken-ichi Kawarabayashi
,
Katsuhiro Ota
,
Akira Saito
Journal of Graph Theory
40
(2), 2002, pp. 75-82
Probabilistic rebound Turing machines
Lan Zhang
,
Katsushi Inoue
,
Akira Ito
,
Yue Wang
Theoretical Computer Science
270
(1-2), 2002, pp. 739-760
Closure property of probabilistic Turing machines and alternating Turing machines with sublogarithmic spaces
Géza Harváth
,
Katsushi Inoue
,
Akira Ito
,
Yue Wang
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 397-409
Relative length of longest paths and cycles in 3-connected graphs
Rao Li
,
Akira Saito
,
R.H. Schelp
Journal of Graph Theory
(3), 2001, pp. 137-156
Alternation for sublogarithmic space-bounded alternating pushdown automata
Jianliang Xu
,
Tsunehiro Yoshinaga
,
Katsushi Inoue
,
Yue Wang
,
Akira Ito
Theoretical Computer Science
259
(1-2), 2001, pp. 475-492
Closure, 2-factors, and cycle coverings in claw-free graphs
Zdenȇk Ryjác̑ek
,
Akira Saito
,
R.H. Schelp
Journal of Graph Theory
32
(2), 1999, pp. 109-117
Long paths, long cycles, and their relative length
Akira Saito
Journal of Graph Theory
30
(2), 1999, pp. 91-99
Seiten 1
2
>