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="Tsugaki, Masao"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
Martin Hall
,
Colton Magnant
,
Kenta Ozeki
,
Masao Tsugaki
Journal of Graph Theory
75
(1), 2014, pp. 59-74
Closure and spanning
k
-trees
Ryota Matsubara
,
Masao Tsugaki
,
Tomoki Yamashita
Graphs and Combinatorics
30
(4), 2014, pp. 957-962
A
k
-tree containing specified vertices
Shuya Chiba
,
Ryota Matsubara
,
Kenta Ozeki
,
Masao Tsugaki
Graphs and Combinatorics
26
(2), 2010, pp. 187-205
On relative length of longest paths and cycles
Kenta Ozeki
,
Masao Tsugaki
,
Tomoki Yamashita
Journal of Graph Theory
62
(3), 2009, pp. 279-291
A note on a spanning 3-tree
Masao Tsugaki
Combinatorica
29
(1), 2009, pp. 127-129
Spanning trees with few leaves
Masao Tsugaki
,
Tomoki Yamashita
Graphs and Combinatorics
23
(5), 2007, pp. 585-598