| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed |
The disjoint paths problem in quadratic time. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi |
Minimally contraction-critically 6-connected graphs. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar |
Linkless and Flat Embeddings in 3-Space. |
Discrete & Computational Geometry |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan |
K_6 minors in large 6-connected graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan |
K_6 minors in 6-connected graphs of bounded tree-width |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
A linear time algorithm for the induced disjoint paths problem in planar graphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
List-coloring graphs without subdivisions and without immersions. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Kenta Ozeki |
Spanning closed walks and TSP in 3-connected planar graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Edge-disjoint Odd Cycles in 4-edge-connected Graphs. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Kenta Ozeki |
Non-separating subgraphs after deleting many disjoint paths. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx |
Packing cycles through prescribed vertices. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Ken-ichi Kawarabayashi |
High connectivity keeping connected subgraph. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Kenta Ozeki |
Hamilton cycles in 4-connected troidal triangulations. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota |
Toughness of Ka,t-Minor-Free Graphs. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas |
Three-coloring triangle-free planar graphs in linear time. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer |
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Mikkel Thorup |
Minimum k-way cut of bounded size is fixed-parameter tractable |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
An Improved Algorithm for the Half-Disjoint Paths Problem. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Hoshino, Ken-ichi Kawarabayashi |
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. |
J. Artif. Intell. Res. (JAIR) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Kenta Ozeki |
2- and 3-factors of graphs on surfaces. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer |
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Hoshino, Ken-ichi Kawarabayashi |
The Multi-Round Balanced Traveling Tournament Problem. |
ICAPS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
The Disjoint Paths Problem: Algorithm and Structure. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Mikkel Thorup |
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan |
The Graph Minor Algorithm with Parity Conditions. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Paul Wollan |
A simpler algorithm and shorter proof for the graph minor decomposition. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Contraction decomposition in h-minor-free graphs and algorithmic applications. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Hoshino, Ken-ichi Kawarabayashi |
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. |
AAAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Kenta Ozeki |
A simple algorithm for 4-coloring 3-colorable planar graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer |
A note on traversing specified vertices in graphs embedded with large representativity. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft |
Double-Critical Graphs and Complete Minors. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shinya Fujita, Ken-ichi Kawarabayashi |
Contractible Small Subgraphs in k-connected Graphs. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Ken-ichi Kawarabayashi |
Non-separating even cycles in highly connected graphs. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Algorithms for finding an induced cycle in planar graphs. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bojan Mohar |
Star Coloring and Acyclic Coloring of Locally Planar Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto |
Dominating sets in triangulations on surfaces. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
An (almost) Linear Time Algorithm for Odd Cyles Transversal. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ken-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 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar |
Linkless and flat embeddings in 3-space and the unknot problem. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
flat embedding, linkless embedding, unknot, knot |
| 1 | Ken-ichi Kawarabayashi, Fawad Nazir, Helmut Prendinger |
Message Duplication Reduction in Dense Mobile Social Networks. |
ICCCN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Improved Algorithm for the Half-Disjoint Paths Problem. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A Separator Theorem in Minor-Closed Classes. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Paul Wollan |
A shorter proof of the graph minor algorithm: the unique linkage theorem. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Odd cycle packing. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
odd cycle, packing |
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Carsten Thomassen |
Decomposing a planar graph of girth 5 into an independent set and a forest. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee |
Removable cycles in non-bipartite graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar |
Linear connectivity forces large complete bipartite minors. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
Note on coloring graphs without odd-Kk-minors. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki |
N-flips in even triangulations on surfaces. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma |
Disjoint Even Cycles Packing. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs |
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer |
Bounding the Size of Equimatchable Graphs of Fixed Genus. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Highly parity linked graphs. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický |
6-Critical Graphs on the Klein Bottle. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Ken-ichi Kawarabayashi |
Note on non-separating and removable cycles in highly connected graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
List-coloring graphs without K4, k-minors. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas |
Three-coloring triangle-free planar graphs in linear time. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bojan Mohar |
List-color-critical graphs on a fixed surface. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
critical graphs, surface, list-coloring |
| 1 | Yusuke Kobayashi, Ken-ichi Kawarabayashi |
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi |
Additive approximation algorithms for list-coloring minor-closed class of graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
Planarity Allowing Few Error Vertices in Linear Time. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Few errors, Approximation Algorithms, TSP, Planarity, linear time |
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Hadwiger's conjecture is decidable. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
Hadwiger's conjecture, the four color theorem |
| 1 | Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer |
On the matching extendability of graphs in surfaces. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan |
A weaker version of Lovász' path removal conjecture. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Ken-ichi Kawarabayashi |
Connectivity keeping edges in graphs with large minimum degree. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar |
Locally planar graphs are 5-choosable. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki |
N-Flips in even triangulations on surfaces. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Contractible edges in minimally k-connected graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita |
Long cycles in graphs without hamiltonian paths. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Fractional coloring and the odd Hadwiger's conjecture. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
A Weakening of the Odd Hadwiger's Conjecture. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi |
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Raiji Mukae, Atsuhiro Nakamoto |
K6-Minors in Triangulations on the Klein Bottle. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Ken-ichi Kawarabayashi |
Contractible elements in k-connected graphs not containing some specified graphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral disjoint paths packing. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
Approximating List-Coloring on a Fixed Surface. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood |
Improved upper bounds on the crossing number. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
convex crossing number, rectilinear crossing number, graph drawing, treewidth, crossing number, graph minors, pathwidth, maximum degree |
| 1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
The Induced Disjoint Paths Problem. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
An Improved Algorithm for Finding Cycles Through Elements. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bojan Mohar |
Graph and map isomorphism and all polyhedral embeddings in linear time. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
map isomorphism, graph isomorphism, linear time algorithm |
| 1 | Ken-ichi Kawarabayashi, Bojan Mohar |
A relaxed Hadwiger's Conjecture for list colorings. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark N. Ellingham, Ken-ichi Kawarabayashi |
2-Connected spanning subgraphs with low maximum degree in locally planar graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")