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="Tomoki"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Closure and spanning
k
-trees
Ryota Matsubara
,
Masao Tsugaki
,
Tomoki Yamashita
Graphs and Combinatorics
30
(4), 2014, pp. 957-962
Spanning trees with a bounded number of branch vertices in a claw-free graph
Haruhide Matsuda
,
Kenta Ozeki
,
Tomoki Yamashita
Graphs and Combinatorics
30
(2), 2014, pp. 429-437
Degree sum conditions for cyclability in bipartite graphs
Haruko Okamura
,
Tomoki Yamashita
Graphs and Combinatorics
29
(4), 2013, pp. 1077-1085
Counting lattice paths via a new cycle lemma
Tomoki Nakamigawa
,
Norihide Tokushige
SIAM Journal on Discrete Mathematics
26
(2), 2012, pp. 745-754
Length of longest cycles in a graph whose relative length is at least two
Kenta Ozeki
,
Tomoki Yamashita
Graphs and Combinatorics
28
(6), 2012, pp. 859-868
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Toshinori Takabatake
,
Tomoki Nakamigawa
Theoretical Computer Science
465
, 2012, pp. 28-34
Spanning trees: A survey
Kenta Ozeki Yamashita
,
Tomoki
Graphs and Combinatorics
27
(1), 2011, pp. 1-26
Degree bounded spanning trees
Jun Fujisawa
,
Hajime Matsumura
,
Tomoki Yamashita
Graphs and Combinatorics
26
(5), 2010, pp. 695-720
A spanning tree with high degree vertices
Kenta Ozeki
,
Tomoki Yamashita
Graphs and Combinatorics
26
(4), 2010, pp. 591-596
Enumerating stereoisomers of tree structured molecules using dynamic programming
Tomoki Imada
,
Shunsuke Ota
,
Hiroshi Nagamochi
,
Tatsuya Akutsu
Lecture Notes in Computer Science
5878
, 2009, pp. 14-23
On relative length of longest paths and cycles
Kenta Ozeki
,
Masao Tsugaki
,
Tomoki Yamashita
Journal of Graph Theory
62
(3), 2009, pp. 279-291
On a spanning tree with specified leaves
Yoshimi Egawa
,
Haruhide Matsuda
,
Tomoki Yamashita
,
Kiyoshi Yoshimoto
Graphs and Combinatorics
24
(1), 2008, pp. 13-18
Cycles passing through
k + 1
vertices in
k
-connected graphs
Jun Fujisawa
,
Tomoki Yamashita
Journal of Graph Theory
58
(2), 2008, pp. 179-190
A degree sum condition concerning the connectivity and the independence number of a graph
Kenta Ozeki
,
Tomoki Yamashita
Graphs and Combinatorics
24
(5), 2008, pp. 469-483
Vertex disjoint equivalent subgraphs of order 3
Tomoki Nakamigawa
Journal of Graph Theory
56
(3), 2007, pp. 159-166
Spanning trees with few leaves
Masao Tsugaki
,
Tomoki Yamashita
Graphs and Combinatorics
23
(5), 2007, pp. 585-598
A degree sum condition for longest cycles in 3-connected graphs
Tomoki Yamashita
Journal of Graph Theory
54
(4), 2007, pp. 277-283
One-dimensional tilings using tiles with two gap lengths
Tomoki Nakamigawa
Graphs and Combinatorics
21
(1), 2005, pp. 97-105
On message packaging in task scheduling for distributed memory parallel machines
Noriyuki Fujimoto
,
Tomoki Baba
,
Takashi Hashimoto
,
Kenichi Hagihara
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 285-306
A generalization of diagonal flips in a convex polygon
Tomoki Nakamigawa
Theoretical Computer Science
235
(2), 2000, pp. 271-282
On the pagenumber of complete bipartite graphs
Hikoe Enomoto
,
Tomoki Nakamigawa
,
Katsuhiro Ota
Journal of Combinatorial Theory Series B
71
(1), 1997, pp. 111-120
Adaptive data parallel computation in the parallel object-oriented language OCore
Hiroki Konaka
,
Yoshiaki Itoh
,
Takashi Tomokiyo
,
Munenori Maeda
,
Yutaka Ishikawa
,
Atsushi Hori
Lecture Notes in Computer Science
1123
, 1996, pp. 587-596
A scalable time-sharing scheduling for partitionable, distributed memory parallel machines
Atsushi Hori
,
Yutaka Ishikawa
,
Hiroki Konaka
,
Munenori Maeda
,
Takashi Tomokiyo
Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, HICSS-28. Vol.~II: Software Technology (Kihei, Hawaii, January 3-6, 1995)
, 1995, pp. 173-182
Time space sharing scheduling: A simulation analysis
Atsushi Hori
,
Yutaka Ishikawa
,
Jörg Nolte
,
Hiroki Konaka
,
Munenori Maeda
,
Takashi Tomokiyo
Lecture Notes in Computer Science
966
, 1995, pp. 623-634
Time space sharing scheduling and architectural support
Atsushi Hori
,
Takashi Yokota
,
Yutaka Ishikawa
,
Shuichi Sakai
,
Hiroki Konaka
,
Munenori Maeda
,
Takashi Tomokiyo
,
Jörg Nolte
,
Hiroshi Matsuoka
,
Kazuaki Okamoto
,
Hideo Hirono
Lecture Notes in Computer Science
949
, 1995, pp. 92-105
Seiten 1
2
>