Ken-ichi Kawarabayashi

Ken-ichi Kawarabayashi, Yusuke Kobayashi: An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Transactions on Algorithms 9(2): 16 (2013)

Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer: Packing directed cycles through a specified vertex set. SODA 2013: 365-377

Ken-ichi Kawarabayashi, Kenta Ozeki: 4-connected projective-planar graphs are hamiltonian-connected. SODA 2013: 378-395

Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed: A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA 2013: 414-431

Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup: More Compact Oracles for Approximate Distances in Undirected Planar Graphs. SODA 2013: 550-563

Ken-ichi Kawarabayashi: 5-coloring K_{3, k}-minor-free graphs: Beyond Thomassen. SODA 2013: 985-1003

Zdenek Dvorak, Ken-ichi Kawarabayashi: List-coloring embedded graphs. SODA 2013: 1004-1012

Ken-ichi Kawarabayashi: Totally odd subdivisions and parity subdivisions: Structures and Coloring. SODA 2013: 1013-1029

Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. CoRR abs/1302.5121 (2013)

Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and Flat Embeddings in 3-Space. Discrete & Computational Geometry 47(4): 731-755 (2012)

Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi: Minimally contraction-critically 6-connected graphs. Discrete Mathematics 312(3): 671-679 (2012)

Richard Hoshino, Ken-ichi Kawarabayashi: Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. J. Artif. Intell. Res. (JAIR) 45: 257-286 (2012)

Ken-ichi Kawarabayashi, Yusuke Kobayashi: A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. 78(2): 670-680 (2012)

Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102(2): 424-435 (2012)

Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan: The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory, Ser. B 102(2): 454-469 (2012)

Ken-ichi Kawarabayashi, Carsten Thomassen: From the plane to higher surfaces. J. Comb. Theory, Ser. B 102(4): 852-868 (2012)

Ken-ichi Kawarabayashi, Yusuke Kobayashi: Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory, Ser. B 102(4): 1020-1034 (2012)

Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan: On the excluded minor structure theorem for graphs of large tree-width. J. Comb. Theory, Ser. B 102(6): 1189-1210 (2012)

Ken-ichi Kawarabayashi, John Maharry: Minors in large almost-5-connected non-planar graphs. Journal of Graph Theory 71(2): 128-141 (2012)

Naonori Kakimura, Ken-ichi Kawarabayashi: Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. SIAM J. Discrete Math. 26(3): 1121-1133 (2012)

Richard Hoshino, Ken-ichi Kawarabayashi: The Linear Distance Traveling Tournament Problem. AAAI 2012

Ken-ichi Kawarabayashi, David R. Wood: Cliques in Odd-Minor-Free Graphs. CATS 2012: 133-138

Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi: Shortest-path queries for complex networks: exploiting low tree-width outside the core. EDBT 2012: 144-155

Ken-ichi Kawarabayashi, Mikkel Thorup: Combinatorial Coloring of 3-Colorable Graphs. FOCS 2012: 68-75

Ken-ichi Kawarabayashi, Kenta Ozeki: Spanning closed walks and TSP in 3-connected planar graphs. SODA 2012: 671-682

Ken-ichi Kawarabayashi, Yusuke Kobayashi: List-coloring graphs without subdivisions and without immersions. SODA 2012: 1425-1435

Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi: Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA 2012: 1726-1736

Ken-ichi Kawarabayashi, Yusuke Kobayashi: Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS 2012: 206-217

Ken-ichi Kawarabayashi, Yusuke Kobayashi: Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS 2012: 278-289

Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan: K_6 minors in 6-connected graphs of bounded tree-width. CoRR abs/1203.2171 (2012)

Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan: K_6 minors in large 6-connected graphs. CoRR abs/1203.2192 (2012)

Ken-ichi Kawarabayashi, Mikkel Thorup: Combinatorial coloring of 3-colorable graphs. CoRR abs/1205.1254 (2012)

Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour: Edge-colouring seven-regular planar graphs. CoRR abs/1210.7349 (2012)

Zdenek Dvorak, Ken-ichi Kawarabayashi: List-coloring embedded graphs. CoRR abs/1210.7605 (2012)

Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota: Toughness of K_a,t-Minor-Free Graphs. Electr. J. Comb. 18(1) (2011)

Shinya Fujita, Ken-ichi Kawarabayashi: High connectivity keeping connected subgraph. Electronic Notes in Discrete Mathematics 38: 355-360 (2011)

Ken-ichi Kawarabayashi, Kenta Ozeki: Hamilton cycles in 4-connected troidal triangulations. Electronic Notes in Discrete Mathematics 38: 493-498 (2011)

Richard Hoshino, Ken-ichi Kawarabayashi: A multi-round generalization of the traveling tournament problem and its application to Japanese baseball. European Journal of Operational Research 215(2): 481-497 (2011)

Richard Hoshino, Ken-ichi Kawarabayashi: Scheduling Bipartite Tournaments to Minimize Total Travel Distance. J. Artif. Intell. Res. (JAIR) 42: 91-124 (2011)

Ken-ichi Kawarabayashi, Kenta Ozeki: Non-separating subgraphs after deleting many disjoint paths. J. Comb. Theory, Ser. B 101(1): 54-59 (2011)

Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki: The 2-extendability of 5-connected graphs on surfaces with large representativity. J. Comb. Theory, Ser. B 101(4): 206-213 (2011)

Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx: Packing cycles through prescribed vertices. J. Comb. Theory, Ser. B 101(5): 378-381 (2011)

Ken-ichi Kawarabayashi, Kenta Ozeki: 2- and 3-factors of graphs on surfaces. Journal of Graph Theory 67(4): 306-315 (2011)

Ken-ichi Kawarabayashi, Yusuke Kobayashi: An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discrete Math. 25(3): 1322-1330 (2011)

Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. ACM Transactions on Algorithms 7(4): 41 (2011)

Richard Hoshino, Ken-ichi Kawarabayashi: The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. AAAI 2011

Richard Hoshino, Ken-ichi Kawarabayashi: The Multi-Round Balanced Traveling Tournament Problem. ICAPS 2011

Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan: The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36

Ken-ichi Kawarabayashi, Mikkel Thorup: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. FOCS 2011: 160-169

Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. ICALP (1) 2011: 135-146

Ken-ichi Kawarabayashi, Yusuke Kobayashi: Breaking o(n^1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. STOC 2011: 81-88

Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450

Ken-ichi Kawarabayashi, Paul Wollan: A simpler algorithm and shorter proof for the graph minor decomposition. STOC 2011: 451-458

Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan: Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488

Ken-ichi Kawarabayashi: The Disjoint Paths Problem: Algorithm and Structure. WALCOM 2011: 2-7

Ken-ichi Kawarabayashi, Mikkel Thorup: Minimum k-way cut of bounded size is fixed-parameter tractable. CoRR abs/1101.4689 (2011)

Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs. CoRR abs/1104.5214 (2011)

Shinya Fujita, Ken-ichi Kawarabayashi: Non-separating even cycles in highly connected graphs. Combinatorica 30(5): 565-580 (2010)

Ken-ichi Kawarabayashi, Yusuke Kobayashi: Algorithms for finding an induced cycle in planar graphs. Combinatorica 30(6): 715-734 (2010)

Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft: Double-Critical Graphs and Complete Minors. Electr. J. Comb. 17(1) (2010)

Ken-ichi Kawarabayashi, Michael D. Plummer: A note on traversing specified vertices in graphs embedded with large representativity. Discrete Mathematics 310(20): 2655-2661 (2010)

Shinya Fujita, Ken-ichi Kawarabayashi: Contractible Small Subgraphs in k-connected Graphs. Graphs and Combinatorics 26(4): 499-511 (2010)

Tatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto: Dominating sets in triangulations on surfaces. Journal of Graph Theory 63(1): 17-30 (2010)

Ken-ichi Kawarabayashi, Bojan Mohar: Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discrete Math. 24(1): 56-71 (2010)

Ken-ichi Kawarabayashi, Kenta Ozeki: A simple algorithm for 4-coloring 3-colorable planar graphs. Theor. Comput. Sci. 411(26-28): 2619-2622 (2010)

Ken-ichi Kawarabayashi, Yusuke Kobayashi: An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. APPROX-RANDOM 2010: 274-286

Ken-ichi Kawarabayashi, Yusuke Kobayashi: Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM 2010: 287-297

Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and flat embeddings in 3-space and the unknot problem. Symposium on Computational Geometry 2010: 97-106

Ken-ichi Kawarabayashi, Bruce A. Reed: A Separator Theorem in Minor-Closed Classes. FOCS 2010: 153-162

Ken-ichi Kawarabayashi, Fawad Nazir, Helmut Prendinger: Message Duplication Reduction in Dense Mobile Social Networks. ICCCN 2010: 1-6

Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed: Recognizing a Totally Odd K₄-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. SODA 2010: 318-328

Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344

Ken-ichi Kawarabayashi, Yusuke Kobayashi: The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA 2010: 345-353

Ken-ichi Kawarabayashi, Bruce A. Reed: An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA 2010: 365-378

Ken-ichi Kawarabayashi, Paul Wollan: A shorter proof of the graph minor algorithm: the unique linkage theorem. STOC 2010: 687-694

Ken-ichi Kawarabayashi, Bruce A. Reed: Odd cycle packing. STOC 2010: 695-704

Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan: Finding topological subgraphs is fixed-parameter tractable. CoRR abs/1011.1827 (2010)

Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica 54(2): 142-180 (2009)

Ken-ichi Kawarabayashi, Bruce A. Reed: Highly parity linked graphs. Combinatorica 29(2): 215-225 (2009)

Shinya Fujita, Ken-ichi Kawarabayashi: Note on non-separating and removable cycles in highly connected graphs. Discrete Applied Mathematics 157(2): 398-399 (2009)

Ken-ichi Kawarabayashi: List-coloring graphs without K_{4, k}-minors. Discrete Applied Mathematics 157(4): 659-662 (2009)

Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma: Disjoint Even Cycles Packing. Electronic Notes in Discrete Mathematics 34: 113-119 (2009)

Ken-ichi Kawarabayashi, Michael D. Plummer: Bounding the Size of Equimatchable Graphs of Fixed Genus. Graphs and Combinatorics 25(1): 91-99 (2009)

Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee: Removable cycles in non-bipartite graphs. J. Comb. Theory, Ser. B 99(1): 30-38 (2009)

Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell: On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B 99(1): 97-109 (2009)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki: N-flips in even triangulations on surfaces. J. Comb. Theory, Ser. B 99(1): 229-246 (2009)

Thomas 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)

Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar: Linear connectivity forces large complete bipartite minors. J. Comb. Theory, Ser. B 99(3): 557-582 (2009)

Ken-ichi Kawarabayashi, Carsten Thomassen: Decomposing a planar graph of girth 5 into an independent set and a forest. J. Comb. Theory, Ser. B 99(4): 674-684 (2009)

Ken-ichi Kawarabayashi: Note on coloring graphs without odd-K_k-minors. J. Comb. Theory, Ser. B 99(4): 728-731 (2009)

Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: 6-Critical Graphs on the Klein Bottle. SIAM J. Discrete Math. 23(1): 372-383 (2009)

Ken-ichi Kawarabayashi: Planarity Allowing Few Error Vertices in Linear Time. FOCS 2009: 639-648

Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327

Yusuke Kobayashi, Ken-ichi Kawarabayashi: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155

Ken-ichi Kawarabayashi, Bojan Mohar: List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165

Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175

Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182

Ken-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192

Ken-ichi Kawarabayashi, Bruce A. Reed: Hadwiger's conjecture is decidable. STOC 2009: 445-454

Ken-ichi Kawarabayashi: A Weakening of the Odd Hadwiger's Conjecture. Combinatorics, Probability & Computing 17(6): 815-821 (2008)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Discrete Mathematics 308(4): 597-602 (2008)

Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita: Long cycles in graphs without hamiltonian paths. Discrete Mathematics 308(24): 5899-5906 (2008)

Ken-ichi Kawarabayashi, Bruce A. Reed: Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki: N-Flips in even triangulations on surfaces. Electronic Notes in Discrete Mathematics 31: 99-104 (2008)

Nathan 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)

Robert 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)

Shinya Fujita, Ken-ichi Kawarabayashi: Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory, Ser. B 98(4): 805-811 (2008)

Ken-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)

Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable. J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008)

Shinya Fujita, Ken-ichi Kawarabayashi: Contractible elements in k-connected graphs not containing some specified graphs. Journal of Graph Theory 58(2): 97-109 (2008)

Yoshimi 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)

Ken-ichi Kawarabayashi, Raiji Mukae, Atsuhiro Nakamoto: K₆-Minors in Triangulations on the Klein Bottle. SIAM J. Discrete Math. 23(1): 96-108 (2008)

Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384

Ken-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

Ken-ichi Kawarabayashi: Approximating List-Coloring on a Fixed Surface. ICALP (1) 2008: 333-344

Ken-ichi Kawarabayashi, Yusuke Kobayashi: The Induced Disjoint Paths Problem. IPCO 2008: 47-61

Ken-ichi Kawarabayashi: An Improved Algorithm for Finding Cycles Through Elements. IPCO 2008: 374-384

Ken-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454

Ken-ichi Kawarabayashi, Bojan Mohar: Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480

Ken-ichi Kawarabayashi, Zi-Xia Song: Some remarks on the odd hadwiger's conjecture. Combinatorica 27(4): 429-438 (2007)

Ken-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)

Guantao Chen, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer: Chvátal Erdós condition and 2-factors with a specyfied number of components. Discussiones Mathematicae Graph Theory 27(3): 401-407 (2007)

Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang: Chords of longest circuits in locally planar graphs. Eur. J. Comb. 28(1): 315-321 (2007)

Ken-ichi Kawarabayashi, Bojan Mohar: Some Recent Progress and Applications in Graph Minor Theory. Graphs and Combinatorics 23(1): 1-46 (2007)

Ken-ichi Kawarabayashi: On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory, Ser. B 97(1): 144-150 (2007)

Mark 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)

Ken-ichi Kawarabayashi, Bojan Mohar: A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory, Ser. B 97(4): 647-651 (2007)

Leif K. Jørgensen, Ken-ichi Kawarabayashi: Extremal results for rooted minor problems. Journal of Graph Theory 55(3): 191-207 (2007)

Ken-ichi Kawarabayashi, Zi-Xia Song: Independence number and clique minors. Journal of Graph Theory 56(3): 219-226 (2007)

Ken-ichi Kawarabayashi: Half integral packing, Erdős-Posá-property and graph minors. SODA 2007: 1187-1196

Ken-ichi Kawarabayashi, Bruce A. Reed: Computing crossing number in linear time. STOC 2007: 382-390

Ken-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)

Ken-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory, Ser. B 96(2): 296-301 (2006)

Shinya 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)

Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito: Domination in a graph with a 2-factor. Journal of Graph Theory 52(1): 1-6 (2006)

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15

Ken-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

Ken-ichi Kawarabayashi, Bjarne Toft: Any 7-Chromatic Graphs Has K₇ Or K_{4, 4} As A Minor. Combinatorica 25(3): 327-353 (2005)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe: Acute triangles in 4-connected maximal plane graphs. Discrete Mathematics 292(1-3): 95-106 (2005)

Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang: Existence of two disjoint long cycles in graphs. Discrete Mathematics 305(1-3): 154-169 (2005)

Ken-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang: On the structure of k-connected graphs without K_k-minor. Eur. J. Comb. 26(3-4): 293-308 (2005)

Ken-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labeled graphs. Electronic Notes in Discrete Mathematics 22: 271-275 (2005)

Kiyoshi 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)

Ken-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)

Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour: Detecting even holes. Journal of Graph Theory 48(2): 85-111 (2005)

Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei: Graph minors and linkages. Journal of Graph Theory 49(1): 75-91 (2005)

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646

Ken-ichi Kawarabayashi: Rooted minor problems in highly connected graphs. Discrete Mathematics 287(1-3): 121-123 (2004)

Ken-ichi Kawarabayashi: Vertex-disjoint copies of K₄^-. Discussiones Mathematicae Graph Theory 24(2): 249-262 (2004)

Ken-ichi Kawarabayashi: A theorem on paths in locally planar triangulations. Eur. J. Comb. 25(6): 781-784 (2004)

Ken-ichi Kawarabayashi: Cycles through a prescribed vertex set in N-connected graphs. J. Comb. Theory, Ser. B 90(2): 315-323 (2004)

Ken-ichi Kawarabayashi: K-linked graphs with girth condition. Journal of Graph Theory 45(1): 48-50 (2004)

Guantao 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)

Ken-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha: Orientable and Nonorientable Genera for Some Complete Tripartite Graphs. SIAM J. Discrete Math. 18(3): 479-487 (2004)

Kiyoshi 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)

Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito: On two equimatchable graph classes. Discrete Mathematics 266(1-3): 263-274 (2003)

Kiyoshi 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)

Yoshimi 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)

Kiyoshi 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)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota: Subgraphs of graphs on surfaces with high representativity . J. Comb. Theory, Ser. B 89(2): 207-229 (2003)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota: 2-connected 7-coverings of 3-connected graphs on surfaces. Journal of Graph Theory 43(1): 26-36 (2003)

Ken-ichi Kawarabayashi: F-factor and Vertex-disjoint F in a graph. Ars Comb. 62 (2002)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)

Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda: Path factors in claw-free graphs. Discrete Mathematics 243(1-3): 195-200 (2002)

Ken-ichi Kawarabayashi: Graph partition into paths containing specified vertices. Discrete Mathematics 248(1-3): 271-277 (2002)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe: On separable self-complementary graphs. Discrete Mathematics 257(1): 165-168 (2002)

Atsushi 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)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Electronic Notes in Discrete Mathematics 11: 20-29 (2002)

Yoshimi 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)

Ken-ichi Kawarabayashi: One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture. J. Comb. Theory, Ser. B 84(1): 1-44 (2002)

Ken-ichi Kawarabayashi: Contractible Edges and Triangles in k-Connected Graphs. J. Comb. Theory, Ser. B 85(2): 207-221 (2002)

Ken-ichi Kawarabayashi: K₄^--factor in a graph. Journal of Graph Theory 39(2): 111-128 (2002)

Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota: Path factors in cubic graphs. Journal of Graph Theory 39(3): 188-193 (2002)

Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito: Hamiltonian cycles in n-extendable graphs. Journal of Graph Theory 40(2): 75-82 (2002)

Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito: Hamiltonian cycles in n-factor-critical graphs. Discrete Mathematics 240(1-3): 71-82 (2001)

Kiyoshi 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)

Ken-ichi Kawarabayashi: Relative Length of Longest Path and Longest Cycle. Electronic Notes in Discrete Mathematics 5: 201 (2000)

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe: Geometric Transformations in Plane Triangulations. JCDCG 2000: 217-221