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="Kawarabayashi, Ken-ichi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fixed-parameter tractability for subset feedback set problems with parity constraints
Naonori Kakimura
,
Ken-ichi Kawarabayashi
Theoretical Computer Science
576
, 2015, pp. 61-76
Removable paths and cycles with parity constraints
Ken-ichi Kawarabayashi
,
Orlando Lee
,
Bruce Reed
Journal of Combinatorial Theory Series B
106
, 2014, pp. 115-133
Spanning closed walks and TSP in 3-connected planar graphs
Ken-ichi Kawarabayashi
,
Kenta Ozeki
Journal of Combinatorial Theory Series B
109
, 2014, pp. 1-33
Coloring 3-colorable graphs with
o(n^{1/5})
colors
Ken-ichi Kawarabayashi
,
Mikkel Thorup
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 458-469
Half-integral packing of odd cycles through prescribed vertices
Naonori Kakimura
,
Ken-Ichi Kawarabayashi
Combinatorica
33
(5), 2013, pp. 549-572
A simpler proof for the two disjoint odd cycles theorem
Ken-ichi Kawarabayashi
,
Kenta Ozeki
Journal of Combinatorial Theory Series B
103
(3), 2013, pp. 313-319
Testing subdivision-freeness: Property testing meets structural graph theory
Ken-ichi Kawarabayashi
,
Yuichi Yoshida
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 437-446
Connectivities for
k
-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture
Ken-ichi Kawarabayashi
,
Gexin Yu
Journal of Combinatorial Theory Series B
103
(3), 2013, pp. 320-326
On the excluded minor structure theorem for graphs of large tree-width
Reinhard Diestel
,
Ken-ichi Kawarabayashi
,
Theodor Müller
,
Paul Wollan
Journal of Combinatorial Theory Series B
102
(6), 2012, pp. 1189-1210
The Erdŏs-Pósa property for clique minors in highly connected graphs
Reinhard Diestel
,
Ken-ichi Kawarabayashi
,
Paul Wollan
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 454-469
Packing directed circuits through prescribed vertices bounded fractionally
Naonori Kakimura
,
Ken-ichi Kawarabayashi
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1121-1133
The disjoint paths problem in quadratic time
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
,
Bruce Reed
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 424-435
A linear time algorithm for the induced disjoint paths problem in planar graphs
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Journal of Computer and System Sciences
78
(2), 2012, pp. 670-680
Fixed-parameter tractability for the subset feedback set problem and the
S
-cycle packing problem
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Journal of Combinatorial Theory Series B
102
(4), 2012, pp. 1020-1034
Linear min-max relation between the treewidth of
H
-minor-free graphs and its largest grid minor
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 278-289
Edge-disjoint odd cycles in 4-edge-connected graphs
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 206-217
Minors in large almost-5-connected non-planar graphs
Ken-Ichi Kawarabayashi
,
John Maharry
Journal of Graph Theory
71
(2), 2012, pp. 128-141
From the plane to higher surfaces
Ken-ichi Kawarabayashi
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
102
(4), 2012, pp. 852-868
Contraction decomposition in
H
-minor-free graphs and algorithmic applications
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Ken-ichi Kawarabayashi
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 441-450
Finding topological subgraphs is fixed-parameter tractable
Martin Grohe
,
Ken-ichi Kawarabayashi
,
Dániel Marx
,
Paul Wollan
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 479-488
Packing cycles through prescribed vertices
Naonori Kakimura
,
Ken-ichi Kawarabayashi
,
Dániel Marx
Journal of Combinatorial Theory Series B
101
(5), 2011, pp. 378-381
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
Ken-ichi Kawarabayashi
,
Philip N. Klein
,
Christian Sommer
Lecture Notes in Computer Science
6755
, 2011, pp. 135-146
An improved algorithm for the half-disjoint paths problem
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1322-1330
Breaking
O(n^{1/2})
-approximation algorithms for the edge-disjoint paths problem with congestion two
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 81-88
The 2-extendability of 5-connected graphs on surfaces with large representativity
Ken-ichi Kawarabayashi
,
Seiya Negami
,
Michael D. Plummer
,
Yusuke Suzuki
Journal of Combinatorial Theory Series B
101
(4), 2011, pp. 206-213
Seiten 1
2
3
4
>