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

Ken-ichi Kawarabayashi Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: List-coloring graphs without subdivisions and without immersions. SODA 2012: 1425-1435
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaonori 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
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Kenta Ozeki: Spanning closed walks and TSP in 3-connected planar graphs. SODA 2012: 671-682
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS 2012: 206-217
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS 2012: 278-289
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan: K_6 minors in 6-connected graphs of bounded tree-width CoRR abs/1203.2171: (2012)
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan: K_6 minors in large 6-connected graphs CoRR abs/1203.2192: (2012)
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Mikkel Thorup: Combinatorial coloring of 3-colorable graphs CoRR abs/1205.1254: (2012)
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and Flat Embeddings in 3-Space. Discrete & Computational Geometry 47(4): 731-755 (2012)
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi: Minimally contraction-critically 6-connected graphs. Discrete Mathematics 312(3): 671-679 (2012)
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102(2): 424-435 (2012)
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLReinhard 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)
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
2011
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Hoshino, Ken-ichi Kawarabayashi: The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. AAAI 2011
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Mikkel Thorup: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. FOCS 2011: 160-169
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan: The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Hoshino, Ken-ichi Kawarabayashi: The Multi-Round Balanced Traveling Tournament Problem. ICAPS 2011
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Paul Wollan: A simpler algorithm and shorter proof for the graph minor decomposition. STOC 2011: 451-458
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan: Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. STOC 2011: 81-88
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: The Disjoint Paths Problem: Algorithm and Structure. WALCOM 2011: 2-7
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. ACM Transactions on Algorithms 7(4): 41 (2011)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Mikkel Thorup: Minimum k-way cut of bounded size is fixed-parameter tractable CoRR abs/1101.4689: (2011)
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota: Toughness of Ka,t-Minor-Free Graphs. Electr. J. Comb. 18(1): (2011)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi: High connectivity keeping connected subgraph. Electronic Notes in Discrete Mathematics 38: 355-360 (2011)
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Kenta Ozeki: Hamilton cycles in 4-connected troidal triangulations. Electronic Notes in Discrete Mathematics 38: 493-498 (2011)
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard 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)
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Hoshino, Ken-ichi Kawarabayashi: Scheduling Bipartite Tournaments to Minimize Total Travel Distance. J. Artif. Intell. Res. (JAIR) 42: 91-124 (2011)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Kenta Ozeki: Non-separating subgraphs after deleting many disjoint paths. J. Comb. Theory, Ser. B 101(1): 54-59 (2011)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNaonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx: Packing cycles through prescribed vertices. J. Comb. Theory, Ser. B 101(5): 378-381 (2011)
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Kenta Ozeki: 2- and 3-factors of graphs on surfaces. Journal of Graph Theory 67(4): 306-315 (2011)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discrete Math. 25(3): 1322-1330 (2011)
2010
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM 2010: 287-297
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: A Separator Theorem in Minor-Closed Classes. FOCS 2010: 153-162
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Fawad Nazir, Helmut Prendinger: Message Duplication Reduction in Dense Mobile Social Networks. ICCCN 2010: 1-6
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed: Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. SODA 2010: 318-328
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA 2010: 345-353
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA 2010: 365-378
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Paul Wollan: A shorter proof of the graph minor algorithm: the unique linkage theorem. STOC 2010: 687-694
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: Odd cycle packing. STOC 2010: 695-704
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and flat embeddings in 3-space and the unknot problem. Symposium on Computational Geometry 2010: 97-106
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan: Finding topological subgraphs is fixed-parameter tractable CoRR abs/1011.1827: (2010)
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi: Non-separating even cycles in highly connected graphs. Combinatorica 30(5): 565-580 (2010)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: Algorithms for finding an induced cycle in planar graphs. Combinatorica 30(6): 715-734 (2010)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Michael D. Plummer: A note on traversing specified vertices in graphs embedded with large representativity. Discrete Mathematics 310(20): 2655-2661 (2010)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft: Double-Critical Graphs and Complete Minors. Electr. J. Comb. 17(1): (2010)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi: Contractible Small Subgraphs in k-connected Graphs. Graphs and Combinatorics 26(4): 499-511 (2010)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto: Dominating sets in triangulations on surfaces. Journal of Graph Theory 63(1): 17-30 (2010)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bojan Mohar: Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discrete Math. 24(1): 56-71 (2010)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Kenta Ozeki: A simple algorithm for 4-coloring 3-colorable planar graphs. Theor. Comput. Sci. 411(26-28): 2619-2622 (2010)
2009
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Planarity Allowing Few Error Vertices in Linear Time. FOCS 2009: 639-648
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYusuke Kobayashi, Ken-ichi Kawarabayashi: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bojan Mohar: List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: Hadwiger's conjecture is decidable. STOC 2009: 445-454
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: Highly parity linked graphs. Combinatorica 29(2): 215-225 (2009)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi: Note on non-separating and removable cycles in highly connected graphs. Discrete Applied Mathematics 157(2): 398-399 (2009)
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: List-coloring graphs without K4, k-minors. Discrete Applied Mathematics 157(4): 659-662 (2009)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma: Disjoint Even Cycles Packing. Electronic Notes in Discrete Mathematics 34: 113-119 (2009)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Michael D. Plummer: Bounding the Size of Equimatchable Graphs of Fixed Genus. Graphs and Combinatorics 25(1): 91-99 (2009)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki: N-flips in even triangulations on surfaces. J. Comb. Theory, Ser. B 99(1): 229-246 (2009)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee: Removable cycles in non-bipartite graphs. J. Comb. Theory, Ser. B 99(1): 30-38 (2009)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi 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)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas 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)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas 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)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Note on coloring graphs without odd-Kk-minors. J. Comb. Theory, Ser. B 99(4): 728-731 (2009)
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
2008
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Approximating List-Coloring on a Fixed Surface. ICALP (1) 2008: 333-344
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: An Improved Algorithm for Finding Cycles Through Elements. IPCO 2008: 374-384
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Yusuke Kobayashi: The Induced Disjoint Paths Problem. IPCO 2008: 47-61
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bojan Mohar: Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: A Weakening of the Odd Hadwiger's Conjecture. Combinatorics, Probability & Computing 17(6): 815-821 (2008)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita: Long cycles in graphs without hamiltonian paths. Discrete Mathematics 308(24): 5899-5906 (2008)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Discrete Mathematics 308(4): 597-602 (2008)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNathan 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)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki: N-Flips in even triangulations on surfaces. Electronic Notes in Discrete Mathematics 31: 99-104 (2008)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert 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)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi: Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory, Ser. B 98(4): 805-811 (2008)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable. J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi: Contractible elements in k-connected graphs not containing some specified graphs. Journal of Graph Theory 58(2): 97-109 (2008)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoshimi 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)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Raiji Mukae, Atsuhiro Nakamoto: K6-Minors in Triangulations on the Klein Bottle. SIAM J. Discrete Math. 23(1): 96-108 (2008)
2007
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Half integral packing, Erdős-Posá-property and graph minors. SODA 2007: 1187-1196
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bruce A. Reed: Computing crossing number in linear time. STOC 2007: 382-390
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Zi-Xia Song: Some remarks on the odd hadwiger's conjecture. Combinatorica 27(4): 429-438 (2007)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuantao 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)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang: Chords of longest circuits in locally planar graphs. Eur. J. Comb. 28(1): 315-321 (2007)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bojan Mohar: Some Recent Progress and Applications in Graph Minor Theory. Graphs and Combinatorics 23(1): 1-46 (2007)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory, Ser. B 97(1): 144-150 (2007)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bojan Mohar: A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory, Ser. B 97(4): 647-651 (2007)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeif K. Jørgensen, Ken-ichi Kawarabayashi: Extremal results for rooted minor problems. Journal of Graph Theory 55(3): 191-207 (2007)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Zi-Xia Song: Independence number and clique minors. Journal of Graph Theory 56(3): 219-226 (2007)
2006
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory, Ser. B 96(2): 296-301 (2006)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya 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)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Bjarne Toft: Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. Combinatorica 25(3): 327-353 (2005)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe: Acute triangles in 4-connected maximal plane graphs. Discrete Mathematics 292(1-3): 95-106 (2005)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang: Existence of two disjoint long cycles in graphs. Discrete Mathematics 305(1-3): 154-169 (2005)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Paul Wollan: Non-zero disjoint cycles in highly connected group labeled graphs. Electronic Notes in Discrete Mathematics 22: 271-275 (2005)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi 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)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour: Detecting even holes. Journal of Graph Theory 48(2): 85-111 (2005)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei: Graph minors and linkages. Journal of Graph Theory 49(1): 75-91 (2005)
2004
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Rooted minor problems in highly connected graphs. Discrete Mathematics 287(1-3): 121-123 (2004)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: A theorem on paths in locally planar triangulations. Eur. J. Comb. 25(6): 781-784 (2004)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Cycles through a prescribed vertex set in N-connected graphs. J. Comb. Theory, Ser. B 90(2): 315-323 (2004)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: K-linked graphs with girth condition. Journal of Graph Theory 45(1): 48-50 (2004)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuantao 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)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi 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)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Michael D. Plummer, Akira Saito: On two equimatchable graph classes. Discrete Mathematics 266(1-3): 263-274 (2003)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi 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)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoshimi 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi 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)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-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
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: F-factor and Vertex-disjoint F in a graph. Ars Comb. 62: (2002)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda: Path factors in claw-free graphs. Discrete Mathematics 243(1-3): 195-200 (2002)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Graph partition into paths containing specified vertices. Discrete Mathematics 248(1-3): 271-277 (2002)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe: On separable self-complementary graphs. Discrete Mathematics 257(1): 165-168 (2002)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAtsushi 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Electronic Notes in Discrete Mathematics 11: 20-29 (2002)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoshimi 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)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture. J. Comb. Theory, Ser. B 84(1): 1-44 (2002)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Contractible Edges and Triangles in k-Connected Graphs. J. Comb. Theory, Ser. B 85(2): 207-221 (2002)
2001
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito: Hamiltonian cycles in n-factor-critical graphs. Discrete Mathematics 240(1-3): 71-82 (2001)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiyoshi 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe: Geometric Transformations in Plane Triangulations. JCDCG 2000: 217-221
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi: Relative Length of Longest Path and Longest Cycle. Electronic Notes in Discrete Mathematics 5: 201 (2000)

Coauthor Index

1Robert E. L. Aldred [61]
2Kiyoshi Ando [3] [8] [12] [13] [16] [18] [20] [30] [65] [80] [143]
3Thomas Böhme [78] [79]
4Guantao Chen [22] [27] [50] [126]
5Nathan Chenette [64]
6Shuya Chiba [84]
7Maria Chudnovsky [28]
8Matt DeVos [58]
9Erik D. Demaine [36] [42] [88] [92] [95] [111] [134]
10Reinhard Diestel [141]
11Vida Dujmovic [68]
12Zdenek Dvorak [91] [129]
13Yoshimi Egawa [7] [12] [17] [33] [56] [80] [126]
14Mark N. Ellingham [46]
15Hikoe Enomoto [22]
16Shinya Fujita [33] [38] [57] [60] [84] [86] [100] [104] [125] [143]
17Ronald J. Gould [27]
18Martin Grohe [105] [132]
19Mariko Hagita [17] [20]
20Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [36] [42] [88] [92] [95] [111] [134]
21Tatsuya Honjo [99]
22Richard Hoshino [122] [123] [135] [139]
23Katsumi Inoue [7] [56]
24Leif K. Jørgensen [44]
25Naonori Kakimura [119] [151]
26Atsushi Kaneko [3] [8] [9] [12] [13] [16] [20] [30] [65]
27Mikio Kano (M. Kano) [20]
28Philip N. Klein [127] [136]
29Yusuke Kobayashi [71] [94] [103] [110] [115] [116] [117] [131] [140] [142] [148] [149] [151] [152]
30Alexandr V. Kostochka [40]
31Daniel Král (Daniel Král') [64] [75]
32Stephan Kreutzer [106] [144]
33Matthias Kriesell [80]
34Jan Kyncl [64] [75]
35Orlando Lee [59] [81]
36Zhentao Li [112]
37Bernard Lidický [64] [75]
38Dingjun Lou [22]
39Claudio L. Lucchesi (Cláudio Leonardo Lucchesi) [38]
40Rong Luo [31]
41John Maharry [78] [79]
42Dániel Marx [105] [119] [132]
43Haruhide Matsuda [12]
44Bojan Mohar [41] [45] [48] [58] [68] [69] [74] [78] [79] [93] [98] [106] [126] [144]
45Raiji Mukae [55]
46Atsuhiro Nakamoto [2] [10] [15] [34] [51] [55] [63] [82] [99]
47Fawad Nazir [113]
48Seiya Negami [120]
49Jianbing Niu [31] [49]
50Serguei Norine [146] [147]
51Yoshiaki Oda [2] [10] [34]
52Katsuhiro Ota [4] [9] [10] [15] [22] [38] [50] [126]
53Kenta Ozeki [66] [97] [118] [121] [124] [150]
54Anders Sune Pedersen [101]
55Florian Pfender [27]
56Michael D. Plummer [19] [29] [37] [38] [61] [83] [102] [120]
57Luke Postle [64]
58Helmut Prendinger [113]
59Bruce A. Reed [53] [59] [62] [70] [74] [81] [87] [89] [90] [107] [109] [112] [114] [137] [142]
60Akira Saito [4] [19] [20] [22] [37] [38] [50]
61Tadashi Sakuma [84]
62Ingo Schiermeyer [50]
63Paul D. Seymour [28]
64Christian Sommer [127] [136]
65Zi-Xia Song [43] [52]
66Chris Stephens [21]
67Noah Streib [64]
68Yusuke Suzuki [63] [82] [120]
69Shinsei Tazawa [10]
70Robin Thomas [64] [91] [129] [146] [147]
71Carsten Thomassen [77]
72Mikkel Thorup [128] [138] [145]
73Bjarne Toft [29] [35] [101]
74Hong Wang [17] [33]
75Mamoru Watanabe [2] [10] [34]
76Bing Wei [27]
77Paul Wollan [32] [39] [59] [105] [108] [132] [133] [137] [141] [146] [147]
78David R. Wood [68]
79Tomoki Yamashita [66]
80Carl Yerger [64]
81Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto) [9] [13]
82Gexin Yu [40]
83Xiaoya Zha [21]
84Cun-Quan Zhang [31] [49]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page