dblp.uni-trier.dewww.uni-trier.de

Ken-ichi Kawarabayashi

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
78EEYusuke Kobayashi, Ken-ichi Kawarabayashi: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155
77EEKen-ichi Kawarabayashi, Bojan Mohar: List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165
76EEKen-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175
75EEZdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182
74EEKen-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192
73EEShinya Fujita, Ken-ichi Kawarabayashi: Note on non-separating and removable cycles in highly connected graphs. Discrete Applied Mathematics 157(2): 398-399 (2009)
72EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki: N-flips in even triangulations on surfaces. J. Comb. Theory, Ser. B 99(1): 229-246 (2009)
71EEKen-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee: Removable cycles in non-bipartite graphs. J. Comb. Theory, Ser. B 99(1): 30-38 (2009)
70EEThomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar: Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] J. Comb. Theory, Ser. B 99(2): 323 (2009)
2008
69EEKen-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed: A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS 2008: 771-780
68EEKen-ichi Kawarabayashi: Approximating List-Coloring on a Fixed Surface. ICALP (1) 2008: 333-344
67EEKen-ichi Kawarabayashi: An Improved Algorithm for Finding Cycles Through Elements. IPCO 2008: 374-384
66EEKen-ichi Kawarabayashi, Yusuke Kobayashi: The Induced Disjoint Paths Problem. IPCO 2008: 47-61
65EEKen-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454
64EEKen-ichi Kawarabayashi, Bojan Mohar: Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480
63EEVida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384
62EEKen-ichi Kawarabayashi: A Weakening of the Odd Hadwiger's Conjecture. Combinatorics, Probability & Computing 17(6): 815-821 (2008)
61EEKen-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita: Long cycles in graphs without hamiltonian paths. Discrete Mathematics 308(24): 5899-5906 (2008)
60EEKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Discrete Mathematics 308(4): 597-602 (2008)
59EENathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: Six-Critical Graphs on the Klein Bottle. Electronic Notes in Discrete Mathematics 31: 235-240 (2008)
58EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki: N-Flips in even triangulations on surfaces. Electronic Notes in Discrete Mathematics 31: 99-104 (2008)
57EEKen-ichi Kawarabayashi, Bruce A. Reed: Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008)
56EERobert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer: On the matching extendability of graphs in surfaces. J. Comb. Theory, Ser. B 98(1): 105-115 (2008)
55EEShinya Fujita, Ken-ichi Kawarabayashi: Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory, Ser. B 98(4): 805-811 (2008)
54EEKen-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan: A weaker version of Lovász' path removal conjecture. J. Comb. Theory, Ser. B 98(5): 972-979 (2008)
53EEMatt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable. J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008)
52EEShinya Fujita, Ken-ichi Kawarabayashi: Contractible elements in k-connected graphs not containing some specified graphs. Journal of Graph Theory 58(2): 97-109 (2008)
51EEYoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi: Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. SIAM J. Discrete Math. 21(4): 1061-1070 (2008)
2007
50EEKen-ichi Kawarabayashi: Half integral packing, Erdős-Posá-property and graph minors. SODA 2007: 1187-1196
49EEKen-ichi Kawarabayashi, Bruce A. Reed: Computing crossing number in linear time. STOC 2007: 382-390
48EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto: The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. Discrete Mathematics 307(6): 764-768 (2007)
47EEKen-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang: Chords of longest circuits in locally planar graphs. Eur. J. Comb. 28(1): 315-321 (2007)
46EEKen-ichi Kawarabayashi: On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory, Ser. B 97(1): 144-150 (2007)
45EEMark N. Ellingham, Ken-ichi Kawarabayashi: 2-Connected spanning subgraphs with low maximum degree in locally planar graphs. J. Comb. Theory, Ser. B 97(3): 401-412 (2007)
44EEKen-ichi Kawarabayashi, Bojan Mohar: A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory, Ser. B 97(4): 647-651 (2007)
43EELeif K. Jørgensen, Ken-ichi Kawarabayashi: Extremal results for rooted minor problems. Journal of Graph Theory 55(3): 191-207 (2007)
42EEKen-ichi Kawarabayashi, Zi-Xia Song: Independence number and clique minors. Journal of Graph Theory 56(3): 219-226 (2007)
2006
41EEErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15
40EEKen-ichi Kawarabayashi, Bojan Mohar: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. STOC 2006: 401-416
39EEKen-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu: On Sufficient Degree Conditions for a Graph to be k-linked. Combinatorics, Probability & Computing 15(5): 685-694 (2006)
38EEKen-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory, Ser. B 96(2): 296-301 (2006)
37EEShinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito: A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory, Ser. B 96(3): 315-324 (2006)
36EEKen-ichi Kawarabayashi, Michael D. Plummer, Akira Saito: Domination in a graph with a 2-factor. Journal of Graph Theory 52(1): 1-6 (2006)
2005
35EEErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646
34EEKen-ichi Kawarabayashi, Bjarne Toft: Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. Combinatorica 25(3): 327-353 (2005)
33EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe: Acute triangles in 4-connected maximal plane graphs. Discrete Mathematics 292(1-3): 95-106 (2005)
32EEYoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang: Existence of two disjoint long cycles in graphs. Discrete Mathematics 305(1-3): 154-169 (2005)
31EEKen-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labeled graphs. Electronic Notes in Discrete Mathematics 22: 271-275 (2005)
30EEKen-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang: On the structure of k-connected graphs without Kk-minor. Eur. J. Comb. 26(3-4): 293-308 (2005)
29EEKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs and Combinatorics 21(1): 27-37 (2005)
28EEKen-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft: Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. J. Comb. Theory, Ser. B 95(1): 152-167 (2005)
27EEMaria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour: Detecting even holes. Journal of Graph Theory 48(2): 85-111 (2005)
2004
26EEKen-ichi Kawarabayashi: Rooted minor problems in highly connected graphs. Discrete Mathematics 287(1-3): 121-123 (2004)
25EEKen-ichi Kawarabayashi: A theorem on paths in locally planar triangulations. Eur. J. Comb. 25(6): 781-784 (2004)
24EEKen-ichi Kawarabayashi: Cycles through a prescribed vertex set in N-connected graphs. J. Comb. Theory, Ser. B 90(2): 315-323 (2004)
23EEKen-ichi Kawarabayashi: K-linked graphs with girth condition. Journal of Graph Theory 45(1): 48-50 (2004)
22EEGuantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito: Vertex-disjoint cycles containing specified vertices in a bipartite graph. Journal of Graph Theory 46(3): 145-166 (2004)
21EEKen-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha: Orientable and Nonorientable Genera for Some Complete Tripartite Graphs. SIAM J. Discrete Math. 18(3): 479-487 (2004)
2003
20EEKiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito: Cycles having the same modularity and removable edges in 2-connected graphs. Discrete Mathematics 265(1-3): 23-30 (2003)
19EEKen-ichi Kawarabayashi, Michael D. Plummer, Akira Saito: On two equimatchable graph classes. Discrete Mathematics 266(1-3): 263-274 (2003)
18EEKiyoshi Ando, Ken-ichi Kawarabayashi: Some forbidden subgraph conditions for a graph to have a k-contractible edge. Discrete Mathematics 267(1-3): 3-11 (2003)
17EEYoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang: Covering vertices of a graph by k disjoint cycles. Discrete Mathematics 270(1-3): 114-124 (2003)
16EEKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a contraction critically 6-connected graph. Discrete Mathematics 273(1-3): 55-69 (2003)
15EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota: Subgraphs of graphs on surfaces with high representativity . J. Comb. Theory, Ser. B 89(2): 207-229 (2003)
2002
14 Ken-ichi Kawarabayashi: F-factor and Vertex-disjoint F in a graph. Ars Comb. 62: (2002)
13 Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)
12EEKiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda: Path factors in claw-free graphs. Discrete Mathematics 243(1-3): 195-200 (2002)
11EEKen-ichi Kawarabayashi: Graph partition into paths containing specified vertices. Discrete Mathematics 248(1-3): 271-277 (2002)
10EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe: On separable self-complementary graphs. Discrete Mathematics 257(1): 165-168 (2002)
9EEAtsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto: On a hamiltonian cycle in which specified vertices are not isolated. Discrete Mathematics 258(1-3): 85-91 (2002)
8EEKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Electronic Notes in Discrete Mathematics 11: 20-29 (2002)
7EEYoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi: Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. Electronic Notes in Discrete Mathematics 11: 253-264 (2002)
6EEKen-ichi Kawarabayashi: One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture. J. Comb. Theory, Ser. B 84(1): 1-44 (2002)
5EEKen-ichi Kawarabayashi: Contractible Edges and Triangles in k-Connected Graphs. J. Comb. Theory, Ser. B 85(2): 207-221 (2002)
2001
4EEKen-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito: Hamiltonian cycles in n-factor-critical graphs. Discrete Mathematics 240(1-3): 71-82 (2001)
3EEKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a 6-contraction critical graph. Electronic Notes in Discrete Mathematics 10: 2-6 (2001)
2000
2EEKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe: Geometric Transformations in Plane Triangulations. JCDCG 2000: 217-221
1EEKen-ichi Kawarabayashi: Relative Length of Longest Path and Longest Cycle. Electronic Notes in Discrete Mathematics 5: 201 (2000)

Coauthor Index

1Robert E. L. Aldred [56]
2Kiyoshi Ando [3] [8] [12] [13] [16] [18] [20] [29] [60]
3Thomas Böhme [70]
4Guantao Chen [22]
5Nathan Chenette [59]
6Maria Chudnovsky [27]
7Matt DeVos [53]
8Erik D. Demaine [35] [41] [76]
9Vida Dujmovic [63]
10Zdenek Dvorak [75]
11Yoshimi Egawa [7] [12] [17] [32] [51]
12Mark N. Ellingham [45]
13Hikoe Enomoto [22]
14Shinya Fujita [32] [37] [52] [55] [73]
15Mariko Hagita [17] [20]
16Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [35] [41] [76]
17Katsumi Inoue [7] [51]
18Leif K. Jørgensen [43]
19Atsushi Kaneko [3] [8] [9] [12] [13] [16] [20] [29] [60]
20Mikio Kano (M. Kano) [20]
21Yusuke Kobayashi [66] [78]
22Alexandr V. Kostochka [39]
23Daniel Král [59]
24Jan Kyncl [59]
25Orlando Lee [54] [71]
26Bernard Lidický [59]
27Dingjun Lou [22]
28Claudio L. Lucchesi (Cláudio Leonardo Lucchesi) [37]
29Rong Luo [30]
30John Maharry [70]
31Haruhide Matsuda [12]
32Bojan Mohar [40] [44] [53] [63] [64] [69] [70] [77]
33Atsuhiro Nakamoto [2] [10] [15] [33] [48] [58] [72]
34Jianbing Niu [30] [47]
35Yoshiaki Oda [2] [10] [33]
36Katsuhiro Ota [4] [9] [10] [15] [22] [37]
37Kenta Ozeki [61]
38Michael D. Plummer [19] [28] [36] [37] [56]
39Luke Postle [59]
40Bruce A. Reed [49] [54] [57] [65] [69] [71] [74]
41Akira Saito [4] [19] [20] [22] [36] [37]
42Paul D. Seymour [27]
43Zi-Xia Song [42]
44Chris Stephens [21]
45Noah Streib [59]
46Yusuke Suzuki [58] [72]
47Shinsei Tazawa [10]
48Robin Thomas [59] [75]
49Bjarne Toft [28] [34]
50Hong Wang [17] [32]
51Mamoru Watanabe [2] [10] [33]
52Paul Wollan [31] [38] [54]
53David R. Wood [63]
54Tomoki Yamashita [61]
55Carl Yerger [59]
56Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto) [9] [13]
57Gexin Yu [39]
58Xiaoya Zha [21]
59Cun-Quan Zhang [30] [47]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)