Geometric Transformations in Plane Triangulations. - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yoshiaki Oda; Mamoru Watanabe (JCDCG, 2000)

Relative Length of Longest Path and Longest Cycle. - Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2000)

Vertex-disjoint cycles containing specified edges in a bipartite graph. - Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; Akira Saito (Australas. J Comb., 2001)

Note on k-contractible edges in k-connected graphs. - Ken-ichi Kawarabayashi (Australas. J Comb., 2001)

Hamiltonian cycles in n-factor-critical graphs. - Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito (Discret. Math., 2001)

Vertices of degree 6 in a 6-contraction critical graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2001)

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

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

Path factors in claw-free graphs. - Kiyoshi Ando; Yoshimi Egawa; Atsushi Kaneko; Ken-ichi Kawarabayashi; Haruhide Matsuda (Discret. Math., 2002)

On a hamiltonian cycle in which specified vertices are not isolated. - Atsushi Kaneko; Ken-ichi Kawarabayashi; Katsuhiro Ota; Kiyoshi Yoshimoto (Discret. Math., 2002)

Graph partition into paths containing specified vertices. - Ken-ichi Kawarabayashi (Discret. Math., 2002)

On separable self-complementary graphs. - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yoshiaki Oda; Katsuhiro Ota; Shinsei Tazawa; Mamoru Watanabe (Discret. Math., 2002)

Contractible edges in minimally k-connected graphs. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2002)

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. - Yoshimi Egawa; Katsumi Inoue; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2002)

Contractible Edges and Triangles in k-Connected Graphs. - Ken-ichi Kawarabayashi (J. Comb. Theory B, 2002)

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

K4--factor in a graph. - Ken-ichi Kawarabayashi (J. Graph Theory, 2002)

Path factors in cubic graphs. - Ken-ichi Kawarabayashi; Haruhide Matsuda; Yoshiaki Oda; Katsuhiro Ota (J. Graph Theory, 2002)

Hamiltonian cycles in n-extendable graphs. - Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito (J. Graph Theory, 2002)

Cycles having the same modularity and removable edges in 2-connected graphs. - Kiyoshi Ando; Mariko Hagita; Atsushi Kaneko; Mikio Kano; Ken-ichi Kawarabayashi; Akira Saito (Discret. Math., 2003)

Some forbidden subgraph conditions for a graph to have a k-contractible edge. - Kiyoshi Ando; Ken-ichi Kawarabayashi (Discret. Math., 2003)

Vertices of degree 6 in a contraction critically 6-connected graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Discret. Math., 2003)

Covering vertices of a graph by k disjoint cycles. - Yoshimi Egawa; Mariko Hagita; Ken-ichi Kawarabayashi; Hong Wang 005 (Discret. Math., 2003)

On two equimatchable graph classes. - Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito (Discret. Math., 2003)

Subgraphs of graphs on surfaces with high representativity . - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Katsuhiro Ota (J. Comb. Theory B, 2003)

2-connected 7-coverings of 3-connected graphs on surfaces. - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Katsuhiro Ota (J. Graph Theory, 2003)

Rooted minor problems in highly connected graphs. - Ken-ichi Kawarabayashi (Discret. Math., 2004)

Vertex-disjoint copies of K4-. - Ken-ichi Kawarabayashi (Discuss. Math. Graph Theory, 2004)

A theorem on paths in locally planar triangulations. - Ken-ichi Kawarabayashi (Eur. J. Comb., 2004)

Cycles through a prescribed vertex set in N-connected graphs. - Ken-ichi Kawarabayashi (J. Comb. Theory B, 2004)

Vertex-disjoint cycles containing specified vertices in a bipartite graph. - Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; Akira Saito (J. Graph Theory, 2004)

K-linked graphs with girth condition. - Ken-ichi Kawarabayashi (J. Graph Theory, 2004)

Orientable and Nonorientable Genera for Some Complete Tripartite Graphs. - Ken-ichi Kawarabayashi; Chris Stephens; Xiaoya Zha (SIAM J. Discret. Math., 2004)

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

Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. - Ken-ichi Kawarabayashi; Bjarne Toft (Comb., 2005)

Existence of two disjoint long cycles in graphs. - Yoshimi Egawa; Shinya Fujita 001; Ken-ichi Kawarabayashi; Hong Wang 005 (Discret. Math., 2005)

Acute triangles in 4-connected maximal plane graphs. - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yoshiaki Oda; Mamoru Watanabe (Discret. Math., 2005)

On the structure of k-connected graphs without Kk-minor. - Ken-ichi Kawarabayashi; Rong Luo; Jianbing Niu; Cun-Quan Zhang (Eur. J. Comb., 2005)

Non-zero disjoint cycles in highly connected group labeled graphs. - Ken-ichi Kawarabayashi; Paul Wollan (Electron. Notes Discret. Math., 2005)

Vertices of Degree 5 in a Contraction Critically 5-connected Graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Graphs Comb., 2005)

Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. - Ken-ichi Kawarabayashi; Michael D. Plummer; Bjarne Toft (J. Comb. Theory B, 2005)

Graph minors and linkages. - Guantao Chen; Ronald J. Gould; Ken-ichi Kawarabayashi; Florian Pfender; Bing Wei 001 (J. Graph Theory, 2005)

Detecting even holes. - Maria Chudnovsky; Ken-ichi Kawarabayashi; Paul D. Seymour (J. Graph Theory, 2005)

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. - Ken-ichi Kawarabayashi; Bojan Mohar (STOC, 2006)

On Sufficient Degree Conditions for a Graph to be k-linked. - Ken-ichi Kawarabayashi; Alexandr V. Kostochka; Gexin Yu (Comb. Probab. Comput., 2006)

A pair of forbidden subgraphs and perfect matchings. - Shinya Fujita 001; Ken-ichi Kawarabayashi; Cláudio Leonardo Lucchesi; Katsuhiro Ota; Michael D. Plummer; Akira Saito (J. Comb. Theory B, 2006)

Non-zero disjoint cycles in highly connected group labelled graphs. - Ken-ichi Kawarabayashi; Paul Wollan (J. Comb. Theory B, 2006)

Domination in a graph with a 2-factor. - Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito (J. Graph Theory, 2006)

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

Computing crossing number in linear time. - Ken-ichi Kawarabayashi; Bruce A. Reed (STOC, 2007)

Some remarks on the odd hadwiger's conjecture. - Ken-ichi Kawarabayashi; Zi-Xia Song (Comb., 2007)

The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto (Discret. Math., 2007)

Chvátal Erdós condition and 2-factors with a specyfied number of components. - Guantao Chen; Ronald J. Gould; Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2007)

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

Some Recent Progress and Applications in Graph Minor Theory. - Ken-ichi Kawarabayashi; Bojan Mohar (Graphs Comb., 2007)

2-Connected spanning subgraphs with low maximum degree in locally planar graphs. - Mark N. Ellingham; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2007)

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

A relaxed Hadwiger's Conjecture for list colorings. - Ken-ichi Kawarabayashi; Bojan Mohar (J. Comb. Theory B, 2007)

Extremal results for rooted minor problems. - Leif K. Jørgensen; Ken-ichi Kawarabayashi (J. Graph Theory, 2007)

Independence number and clique minors. - Ken-ichi Kawarabayashi; Zi-Xia Song (J. Graph Theory, 2007)

Improved upper bounds on the crossing number. - Vida Dujmovic; Ken-ichi Kawarabayashi; Bojan Mohar; David R. Wood (SCG, 2008)

A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. - Ken-ichi Kawarabayashi; Bojan Mohar; Bruce A. Reed (FOCS, 2008)

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

An Improved Algorithm for Finding Cycles Through Elements. - Ken-ichi Kawarabayashi (IPCO, 2008)

The Induced Disjoint Paths Problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (IPCO, 2008)

A nearly linear time algorithm for the half integral disjoint paths packing. - Ken-ichi Kawarabayashi; Bruce A. Reed (SODA, 2008)

Graph and map isomorphism and all polyhedral embeddings in linear time. - Ken-ichi Kawarabayashi; Bojan Mohar (STOC, 2008)

A Weakening of the Odd Hadwiger's Conjecture. - Ken-ichi Kawarabayashi (Comb. Probab. Comput., 2008)

Long cycles in graphs without hamiltonian paths. - Ken-ichi Kawarabayashi; Kenta Ozeki; Tomoki Yamashita (Discret. Math., 2008)

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

Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

On the matching extendability of graphs in surfaces. - Robert E. L. Aldred; Ken-ichi Kawarabayashi; Michael D. Plummer (J. Comb. Theory B, 2008)

Locally planar graphs are 5-choosable. - Matt DeVos; Ken-ichi Kawarabayashi; Bojan Mohar (J. Comb. Theory B, 2008)

Connectivity keeping edges in graphs with large minimum degree. - Shinya Fujita 001; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2008)

A weaker version of Lovász' path removal conjecture. - Ken-ichi Kawarabayashi; Orlando Lee; Bruce A. Reed; Paul Wollan (J. Comb. Theory B, 2008)

Contractible elements in k-connected graphs not containing some specified graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (J. Graph Theory, 2008)

K6-Minors in Triangulations on the Klein Bottle. - Ken-ichi Kawarabayashi; Raiji Mukae; Atsuhiro Nakamoto (SIAM J. Discret. Math., 2008)

Planarity Allowing Few Error Vertices in Linear Time. - Ken-ichi Kawarabayashi (FOCS, 2009)

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

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

List-color-critical graphs on a fixed surface. - Ken-ichi Kawarabayashi; Bojan Mohar (SODA, 2009)

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

Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. - Yusuke Kobayashi 001; Ken-ichi Kawarabayashi (SODA, 2009)

Hadwiger's conjecture is decidable. - Ken-ichi Kawarabayashi; Bruce A. Reed (STOC, 2009)

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

Highly parity linked graphs. - Ken-ichi Kawarabayashi; Bruce A. Reed (Comb., 2009)

Note on non-separating and removable cycles in highly connected graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Discret. Appl. Math., 2009)

List-coloring graphs without K4, k-minors. - Ken-ichi Kawarabayashi (Discret. Appl. Math., 2009)

Disjoint Even Cycles Packing. - Shuya Chiba; Shinya Fujita 001; Ken-ichi Kawarabayashi; Tadashi Sakuma (Electron. Notes Discret. Math., 2009)

Bounding the Size of Equimatchable Graphs of Fixed Genus. - Ken-ichi Kawarabayashi; Michael D. Plummer (Graphs Comb., 2009)

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

Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] - Thomas Böhme 001; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

Linear connectivity forces large complete bipartite minors. - Thomas Böhme 001; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

Note on coloring graphs without odd-Kk-minors. - Ken-ichi Kawarabayashi (J. Comb. Theory B, 2009)

N-flips in even triangulations on surfaces. - Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yusuke Suzuki (J. Comb. Theory B, 2009)

Removable cycles in non-bipartite graphs. - Ken-ichi Kawarabayashi; Bruce A. Reed; Orlando Lee (J. Comb. Theory B, 2009)

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

6-Critical Graphs on the Klein Bottle. - Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (SIAM J. Discret. Math., 2009)

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

Improved Algorithm for the Half-Disjoint Paths Problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (APPROX-RANDOM, 2010)

Linkless and flat embeddings in 3-space and the unknot problem. - Ken-ichi Kawarabayashi; Stephan Kreutzer; Bojan Mohar (SCG, 2010)

A Separator Theorem in Minor-Closed Classes. - Ken-ichi Kawarabayashi; Bruce A. Reed (FOCS, 2010)

Message Duplication Reduction in Dense Mobile Social Networks. - Ken-ichi Kawarabayashi; Fawad Nazir; Helmut Prendinger (ICCCN, 2010)

Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Ken-ichi Kawarabayashi (SODA, 2010)

Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. - Ken-ichi Kawarabayashi; Zhentao Li; Bruce A. Reed (SODA, 2010)

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

Odd cycle packing. - Ken-ichi Kawarabayashi; Bruce A. Reed (STOC, 2010)

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

Immersing small complete graphs. - Matt DeVos; Ken-ichi Kawarabayashi; Bojan Mohar; Haruko Okamura (Ars Math. Contemp., 2010)

Non-separating even cycles in highly connected graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Comb., 2010)

Algorithms for finding an induced cycle in planar graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (Comb., 2010)

Double-Critical Graphs and Complete Minors. - Ken-ichi Kawarabayashi; Anders Sune Pedersen; Bjarne Toft (Electron. J. Comb., 2010)

A note on traversing specified vertices in graphs embedded with large representativity. - Ken-ichi Kawarabayashi; Michael D. Plummer (Discret. Math., 2010)

Contractible Small Subgraphs in k-connected Graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Graphs Comb., 2010)

Dominating sets in triangulations on surfaces. - Tatsuya Honjo; Ken-ichi Kawarabayashi; Atsuhiro Nakamoto (J. Graph Theory, 2010)

Star Coloring and Acyclic Coloring of Locally Planar Graphs. - Ken-ichi Kawarabayashi; Bojan Mohar (SIAM J. Discret. Math., 2010)

A simple algorithm for 4-coloring 3-colorable planar graphs. - Ken-ichi Kawarabayashi; Kenta Ozeki (Theor. Comput. Sci., 2010)

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

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

The Graph Minor Algorithm with Parity Conditions. - Ken-ichi Kawarabayashi; Bruce A. Reed; Paul Wollan (FOCS, 2011)

The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. - Ken-ichi Kawarabayashi; Mikkel Thorup (FOCS, 2011)

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

Contraction decomposition in h-minor-free graphs and algorithmic applications. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Ken-ichi Kawarabayashi (STOC, 2011)

Finding topological subgraphs is fixed-parameter tractable. - Martin Grohe; Ken-ichi Kawarabayashi; Dániel Marx; Paul Wollan (STOC, 2011)

Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (STOC, 2011)

A simpler algorithm and shorter proof for the graph minor decomposition. - Ken-ichi Kawarabayashi; Paul Wollan (STOC, 2011)

The Disjoint Paths Problem: Algorithm and Structure. - Ken-ichi Kawarabayashi (WALCOM, 2011)

Toughness of Ka,t-Minor-Free Graphs. - Guantao Chen; Yoshimi Egawa; Ken-ichi Kawarabayashi; Bojan Mohar; Katsuhiro Ota (Electron. J. Comb., 2011)

High connectivity keeping connected subgraph. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2011)

Hamilton cycles in 4-connected troidal triangulations. - Ken-ichi Kawarabayashi; Kenta Ozeki (Electron. Notes Discret. Math., 2011)

A multi-round generalization of the traveling tournament problem and its application to Japanese baseball. - Richard Hoshino; Ken-ichi Kawarabayashi (Eur. J. Oper. Res., 2011)

Scheduling Bipartite Tournaments to Minimize Total Travel Distance. - Richard Hoshino; Ken-ichi Kawarabayashi (J. Artif. Intell. Res., 2011)

Packing cycles through prescribed vertices. - Naonori Kakimura; Ken-ichi Kawarabayashi; Dániel Marx (J. Comb. Theory B, 2011)

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

Non-separating subgraphs after deleting many disjoint paths. - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2011)

2- and 3-factors of graphs on surfaces. - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Graph Theory, 2011)

Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1). - Satoru Iwata 001; Ken-ichi Kawarabayashi (NII Shonan Meet. Rep., 2011)

An Improved Algorithm for the Half-Disjoint Paths Problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2011)

Three-coloring triangle-free planar graphs in linear time. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi; Robin Thomas 001 (ACM Trans. Algorithms, 2011)

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

Cliques in Odd-Minor-Free Graphs. - Ken-ichi Kawarabayashi; David R. Wood (CATS, 2012)

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

Combinatorial Coloring of 3-Colorable Graphs. - Ken-ichi Kawarabayashi; Mikkel Thorup (FOCS, 2012)

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

List-coloring graphs without subdivisions and without immersions. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SODA, 2012)

Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (STACS, 2012)

Packing cycles through prescribed vertices under modularity constraints. - Naonori Kakimura; Ken-ichi Kawarabayashi (Adv. Appl. Math., 2012)

K_6 minors in 6-connected graphs of bounded tree-width - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

K_6 minors in large 6-connected graphs - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

Linkless and Flat Embeddings in 3-Space. - Ken-ichi Kawarabayashi; Stephan Kreutzer; Bojan Mohar (Discret. Comput. Geom., 2012)

Minimally contraction-critically 6-connected graphs. - Kiyoshi Ando; Shinya Fujita 001; Ken-ichi Kawarabayashi (Discret. Math., 2012)

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

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

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

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

Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2012)

The disjoint paths problem in quadratic time. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001; Bruce A. Reed (J. Comb. Theory B, 2012)

From the plane to higher surfaces. - Ken-ichi Kawarabayashi; Carsten Thomassen (J. Comb. Theory B, 2012)

Minors in large almost-5-connected non-planar graphs. - Ken-ichi Kawarabayashi; John Maharry (J. Graph Theory, 2012)

Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. - Naonori Kakimura; Ken-ichi Kawarabayashi (SIAM J. Discret. Math., 2012)

Balancing the Traveling Tournament Problem for Weekday and Weekend Games. - Richard Hoshino; Ken-ichi Kawarabayashi (IAAI, 2013)

Mining for Analogous Tuples from an Entity-Relation Graph. - Danushka Bollegala; Mitsuru Kusumoto; Yuichi Yoshida; Ken-ichi Kawarabayashi (IJCAI, 2013)

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. - Kord Eickmeyer; Ken-ichi Kawarabayashi; Stephan Kreutzer (LICS, 2013)

Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. - Kord Eickmeyer; Ken-ichi Kawarabayashi (SAGT, 2013)

List-coloring embedded graphs. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi (SODA, 2013)

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

5-coloring K3, k-minor-free graphs: Beyond Thomassen. - Ken-ichi Kawarabayashi (SODA, 2013)

Totally odd subdivisions and parity subdivisions: Structures and Coloring. - Ken-ichi Kawarabayashi (SODA, 2013)

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

More Compact Oracles for Approximate Distances in Undirected Planar Graphs. - Ken-ichi Kawarabayashi; Christian Sommer 001; Mikkel Thorup (SODA, 2013)

Testing subdivision-freeness: property testing meets structural graph theory. - Ken-ichi Kawarabayashi; Yuichi Yoshida (STOC, 2013)

Half-integral packing of odd cycles through prescribed vertices. - Naonori Kakimura; Ken-ichi Kawarabayashi (Comb., 2013)

A simpler proof for the two disjoint odd cycles theorem. - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2013)

Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. - Ken-ichi Kawarabayashi; Gexin Yu (J. Comb. Theory B, 2013)

An Approximation Algorithm for the Bipartite Traveling Tournament Problem. - Richard Hoshino; Ken-ichi Kawarabayashi (Math. Oper. Res., 2013)

An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (ACM Trans. Algorithms, 2013)

Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. - Marc Goerigk; Richard Hoshino; Ken-ichi Kawarabayashi; Stephan Westphal (AAAI, 2014)

Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. - Naoto Ohsaka; Takuya Akiba; Yuichi Yoshida; Ken-ichi Kawarabayashi (AAAI, 2014)

Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. - Takuya Akiba; Yoichi Iwata; Ken-ichi Kawarabayashi; Yuki Kawata (ALENEX, 2014)

Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. - Tasuku Soma; Naonori Kakimura; Kazuhiro Inaba; Ken-ichi Kawarabayashi (ICML, 2014)

Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. - Takuya Akiba; Takanori Maehara; Ken-ichi Kawarabayashi (KDD, 2014)

Efficient SimRank computation via linearizationPublication of this article pending inquiry. - Takanori Maehara; Mitsuru Kusumoto; Ken-ichi Kawarabayashi (KDD, 2014)

Scalable similarity search for SimRank. - Mitsuru Kusumoto; Takanori Maehara; Ken-ichi Kawarabayashi (SIGMOD Conference, 2014)

An Excluded Grid Theorem for Digraphs with Forbidden Minors. - Ken-ichi Kawarabayashi; Stephan Kreutzer (SODA, 2014)

Coloring 3-colorable graphs with o(n^{1/5}) colors. - Ken-ichi Kawarabayashi; Mikkel Thorup (STACS, 2014)

Embedding and canonizing graphs of bounded genus in logspace. - Michael Elberfeld; Ken-ichi Kawarabayashi (STOC, 2014)

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001; Stephan Kreutzer (STOC, 2014)

Minimum degree conditions for vertex-disjoint even cycles in large graphs. - Shuya Chiba; Shinya Fujita 001; Ken-ichi Kawarabayashi; Tadashi Sakuma (Adv. Appl. Math., 2014)

Efficient SimRank Computation via Linearization. - Takanori Maehara; Mitsuru Kusumoto; Ken-ichi Kawarabayashi (CoRR, 2014)

A connected subgraph maintaining high connectivity. - Shinya Fujita 001; Ken-ichi Kawarabayashi (Eur. J. Comb., 2014)

Removable paths and cycles with parity constraints. - Ken-ichi Kawarabayashi; Orlando Lee; Bruce A. Reed (J. Comb. Theory B, 2014)

Spanning closed walks and TSP in 3-connected planar graphs. - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2014)

Sub-exponential graph coloring algorithm for stencil-based Jacobian computations. - Michael Lülfesmann; Ken-ichi Kawarabayashi (J. Comput. Sci., 2014)

Computing Personalized PageRank Quickly by Exploiting Graph Structures. - Takanori Maehara; Takuya Akiba; Yoichi Iwata; Ken-ichi Kawarabayashi (Proc. VLDB Endow., 2014)

Learning Word Representations from Relational Graphs. - Danushka Bollegala; Takanori Maehara; Yuichi Yoshida; Ken-ichi Kawarabayashi (AAAI, 2015)

Lagrangian Decomposition Algorithm for Allocating Marketing Channels. - Daisuke Hatano; Takuro Fukunaga; Takanori Maehara; Ken-ichi Kawarabayashi (AAAI, 2015)

Unsupervised Cross-Domain Word Representation Learning. - Danushka Bollegala; Takanori Maehara; Ken-ichi Kawarabayashi (ACL (1), 2015)

Towards the Graph Minor Theorems for Directed Graphs. - Ken-ichi Kawarabayashi; Stephan Kreutzer (ICALP (2), 2015)

Scalable SimRank join algorithm. - Takanori Maehara; Mitsuru Kusumoto; Ken-ichi Kawarabayashi (ICDE, 2015)

Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View. - Takanori Maehara; Akihiro Yabe; Ken-ichi Kawarabayashi (ICML, 2015)

Embedding Semantic Relations into Word Representations. - Danushka Bollegala; Takanori Maehara; Ken-ichi Kawarabayashi (IJCAI, 2015)

Estimating Local Intrinsic Dimensionality. - Laurent Amsaleg; Oussama Chelly; Teddy Furon; Stéphane Girard; Michael E. Houle; Ken-ichi Kawarabayashi; Michael Nett (KDD, 2015)

Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering. - Kohei Hayashi; Takanori Maehara; Masashi Toyoda; Ken-ichi Kawarabayashi (KDD, 2015)

Efficient PageRank Tracking in Evolving Networks. - Naoto Ohsaka; Takanori Maehara; Ken-ichi Kawarabayashi (KDD, 2015)

Scalable sensor localization via ball-decomposition algorithm. - Yasushi Kawase; Takanori Maehara; Ken-ichi Kawarabayashi (Networking, 2015)

The Directed Grid Theorem. - Ken-ichi Kawarabayashi; Stephan Kreutzer (STOC, 2015)

Beyond the Euler Characteristic: Approximating the Genus of General Graphs. - Ken-ichi Kawarabayashi; Anastasios Sidiropoulos (STOC, 2015)

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. - Ken-ichi Kawarabayashi; Mikkel Thorup (STOC, 2015)

The edge density of critical digraphs. - Richard Hoshino; Ken-ichi Kawarabayashi (Comb., 2015)

The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (Comb., 2015)

The odd Hadwiger's conjecture is "almost" decidable. - Ken-ichi Kawarabayashi (CoRR, 2015)

Graph Isomorphism for Bounded Genus Graphs In Linear Time. - Ken-ichi Kawarabayashi (CoRR, 2015)

Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. - Ken-ichi Kawarabayashi; Zhentao Li; Bruce A. Reed (CoRR, 2015)

Edge-colouring seven-regular planar graphs. - Maria Chudnovsky; Katherine Edwards; Ken-ichi Kawarabayashi; Paul D. Seymour (J. Comb. Theory B, 2015)

Subdivisions of K5 in graphs containing K2, 3. - Ken-ichi Kawarabayashi; Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2015)

4-connected projective-planar graphs are Hamiltonian-connected. - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2015)

Fixed-parameter tractability for subset feedback set problems with parity constraints. - Naonori Kakimura; Ken-ichi Kawarabayashi (Theor. Comput. Sci., 2015)

Joint Word Representation Learning Using a Corpus and a Semantic Lexicon. - Danushka Bollegala; Mohammed Alsuhaibani; Takanori Maehara; Ken-ichi Kawarabayashi (AAAI, 2016)

Expected Tensor Decomposition with Stochastic Gradient Descent. - Takanori Maehara; Kohei Hayashi; Ken-ichi Kawarabayashi (AAAI, 2016)

Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. - Takanori Hayashi 002; Takuya Akiba; Ken-ichi Kawarabayashi (CIKM, 2016)

Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. - Kord Eickmeyer; Ken-ichi Kawarabayashi (CSL, 2016)

Adaptive Budget Allocation for Maximizing Influence of Advertisements. - Daisuke Hatano; Takuro Fukunaga; Ken-ichi Kawarabayashi (IJCAI, 2016)

Identifying Key Observers to Find Popular Information in Advance. - Takuya Konishi; Tomoharu Iwata; Kohei Hayashi; Ken-ichi Kawarabayashi (IJCAI, 2016)

Maximizing Time-Decaying Influence in Social Networks. - Naoto Ohsaka; Yutaro Yamaguchi 001; Naonori Kakimura; Ken-ichi Kawarabayashi (ECML/PKDD (1), 2016)

The Erdos-Posa Property for Directed Graphs. - Saeed Akhoondian Amiri; Ken-ichi Kawarabayashi; Stephan Kreutzer; Paul Wollan (CoRR, 2016)

Packing six T-joins in plane graphs. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi; Daniel Král' (J. Comb. Theory B, 2016)

Non-separating subgraphs in highly connected graphs. - Shinya Fujita 001; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2016)

Coloring immersion-free graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2016)

Edge-disjoint odd cycles in 4-edge-connected graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2016)

Dynamic Influence Analysis in Evolving Networks. - Naoto Ohsaka; Takuya Akiba; Yuichi Yoshida; Ken-ichi Kawarabayashi (Proc. VLDB Endow., 2016)

5-Connected Toroidal Graphs are Hamiltonian-Connected. - Ken-ichi Kawarabayashi; Kenta Ozeki (SIAM J. Discret. Math., 2016)

Reply trees in Twitter: data analysis and branching process models. - Ryosuke Nishi; Taro Takaguchi; Keigo Oka; Takanori Maehara; Masashi Toyoda; Ken-ichi Kawarabayashi; Naoki Masuda (Soc. Netw. Anal. Min., 2016)

An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (ACM Trans. Algorithms, 2016)

Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. - Daisuke Hatano; Takuro Fukunaga; Takanori Maehara; Ken-ichi Kawarabayashi (AAAI, 2017)

Optimal Pricing for Submodular Valuations with Bounded Curvature. - Takanori Maehara; Yasushi Kawase; Hanna Sumita; Katsuya Tono; Ken-ichi Kawarabayashi (AAAI, 2017)

FO Model Checking on Map Graphs. - Kord Eickmeyer; Ken-ichi Kawarabayashi (FCT, 2017)

Polylogarithmic Approximation for Minimum Planarization (Almost). - Ken-ichi Kawarabayashi; Anastasios Sidiropoulos (FOCS, 2017)

An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. - Hanna Sumita; Yuma Yonebayashi; Naonori Kakimura; Ken-ichi Kawarabayashi (IJCAI, 2017)

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NIPS, 2017)

Coarsening Massive Influence Networks for Scalable Diffusion Analysis. - Naoto Ohsaka; Tomohiro Sonobe; Sumio Fujita; Ken-ichi Kawarabayashi (SIGMOD Conference, 2017)

Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi (Eur. J. Comb., 2017)

Coloring 3-Colorable Graphs with Less than n1/5 Colors. - Ken-ichi Kawarabayashi; Mikkel Thorup (J. ACM, 2017)

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. - Ken-ichi Kawarabayashi; Kenta Ozeki; Michael D. Plummer (J. Graph Theory, 2017)

Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2017)

Using k-Way Co-Occurrences for Learning Word Embeddings. - Danushka Bollegala; Yuichi Yoshida; Ken-ichi Kawarabayashi (AAAI, 2018)

Online Regression with Partial Information: Generalization and Linear Projection. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2018)

Boosting PageRank Scores by Optimizing Internal Link Structure. - Naoto Ohsaka; Tomohiro Sonobe; Naonori Kakimura; Takuro Fukunaga; Sumio Fujita; Ken-ichi Kawarabayashi (DEXA (1), 2018)

Representation Learning on Graphs with Jumping Knowledge Networks. - Keyulu Xu; Chengtao Li; Yonglong Tian; Tomohiro Sonobe; Ken-ichi Kawarabayashi; Stefanie Jegelka (ICML, 2018)

Causal Bandits with Propagating Inference. - Akihiro Yabe; Daisuke Hatano; Hanna Sumita; Shinji Ito; Naonori Kakimura; Takuro Fukunaga; Ken-ichi Kawarabayashi (ICML, 2018)

Think Globally, Embed Locally - Locally Linear Meta-embedding of Words. - Danushka Bollegala; Kohei Hayashi; Ken-ichi Kawarabayashi (IJCAI, 2018)

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2018)

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O( log N log varDelta / log ^2 log varDelta ) Rounds. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (SIROCCO, 2018)

A Polynomial Excluded-Minor Approximation of Treedepth. - Ken-ichi Kawarabayashi; Benjamin Rossman (SODA, 2018)

NoSingles: a space-efficient algorithm for influence maximization. - Diana Popova; Naoto Ohsaka; Ken-ichi Kawarabayashi; Alex Thomo (SSDBM, 2018)

Adapting Local Sequential Algorithms to the Distributed Setting. - Ken-ichi Kawarabayashi; Gregory Schwartzman (DISC, 2018)

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (CoRR, 2018)

Scaling advantages of all-to-all connectivity in physical annealers: the Coherent Ising Machine vs. D-Wave 2000Q. - Ryan Hamerly; Takahiro Inagaki; Peter L. McMahon; Davide Venturelli; Alireza Marandi; Tatsuhiro Onodera; Edwin Ng; Carsten Langrock; Kensuke Inaba; Toshimori Honjo; Koji Enbutsu; Takeshi Umeki; et al. (CoRR, 2018)

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. - Vida Dujmovic; Ken-ichi Kawarabayashi; Bojan Mohar; David R. Wood (CoRR, 2018)

Optimal Distributed Weighted Set Cover Approximation. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (CoRR, 2018)

Extreme-value-theoretic estimation of local intrinsic dimensionality. - Laurent Amsaleg; Oussama Chelly; Teddy Furon; Stéphane Girard; Michael E. Houle; Ken-ichi Kawarabayashi; Michael Nett (Data Min. Knowl. Discov., 2018)

The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2018)

K6 minors in large 6-connected graphs. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

A new proof of the flat wall theorem. - Ken-ichi Kawarabayashi; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

Existence of outsiders as a characteristic of online communication networks. - Taro Takaguchi; Takanori Maehara; Ken-ichi Kawarabayashi; Masashi Toyoda (Netw. Sci., 2018)

All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Comput., 2018)

ClassiNet - Predicting Missing Features for Short-Text Classification. - Danushka Bollegala; Vincent Atanasov; Takanori Maehara; Ken-ichi Kawarabayashi (ACM Trans. Knowl. Discov. Data, 2018)

Stochastic Submodular Maximization with Performance-Dependent Item Costs. - Takuro Fukunaga; Takuya Konishi; Sumio Fujita; Ken-ichi Kawarabayashi (AAAI, 2019)

Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization. - Mozhi Zhang; Keyulu Xu; Ken-ichi Kawarabayashi; Stefanie Jegelka; Jordan L. Boyd-Graber (ACL (1), 2019)

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Improved Regret Bounds for Bandit Combinatorial Optimization. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. - Daisuke Hatano; Yuko Kuroki; Yasushi Kawase; Hanna Sumita; Naonori Kakimura; Ken-ichi Kawarabayashi (PRICAI (1), 2019)

Intrinsic Dimensionality Estimation within Tight Localities. - Laurent Amsaleg; Oussama Chelly; Michael E. Houle; Ken-ichi Kawarabayashi; Milos Radovanovic 001; Weeris Treeratanajaru (SDM, 2019)

Polynomial Planar Directed Grid Theorem. - Meike Hatzel; Ken-ichi Kawarabayashi; Stephan Kreutzer (SODA, 2019)

Polylogarithmic approximation for Euler genus on bounded degree graphs. - Ken-ichi Kawarabayashi; Anastasios Sidiropoulos (STOC, 2019)

Parameterized Distributed Algorithms. - Ran Ben-Basat; Ken-ichi Kawarabayashi; Gregory Schwartzman (DISC, 2019)

Improved Distributed Approximation to Maximum Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (CoRR, 2019)

Anonymising Queries by Semantic Decomposition. - Danushka Bollegala; Tomoya Machide; Ken-ichi Kawarabayashi (CoRR, 2019)

Deterministic Edge Connectivity in Near-Linear Time. - Ken-ichi Kawarabayashi; Mikkel Thorup (J. ACM, 2019)

K6 minors in 6-connected graphs of bounded tree-width. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2019)

What Can Neural Networks Reason About? - Keyulu Xu; Jingling Li; Mozhi Zhang; Simon S. Du; Ken-ichi Kawarabayashi; Stefanie Jegelka (ICLR, 2020)

Delay and Cooperation in Nonstochastic Linear Bandits. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2020)

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (PODC, 2020)

The Directed Flat Wall Theorem. - Archontia C. Giannopoulou; Ken-ichi Kawarabayashi; Stephan Kreutzer; O-joung Kwon (SODA, 2020)

A nearly 5/3-approximation FPT Algorithm for Min-k-Cut. - Ken-ichi Kawarabayashi; Bingkai Lin (SODA, 2020)

Improved Distributed Approximations for Maximum Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (DISC, 2020)

The NII Shonan meeting in Japan. - Ken-ichi Kawarabayashi (Commun. ACM, 2020)

Automorphism groups of maps in linear time. - Ken-ichi Kawarabayashi; Bojan Mohar; Roman Nedela; Peter Zeman 001 (CoRR, 2020)

The canonical directed tree decomposition and its applications to the directed disjoint paths problem. - Archontia C. Giannopoulou; Ken-ichi Kawarabayashi; Stephan Kreutzer; O-joung Kwon (CoRR, 2020)

Quickly excluding a non-planar graph. - Ken-ichi Kawarabayashi; Robin Thomas 001; Paul Wollan (CoRR, 2020)

Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2020)

Minimum Violation Vertex Maps and Their Applications to Cut Problems. - Ken-ichi Kawarabayashi; Chao Xu (SIAM J. Discret. Math., 2020)

Model-Checking on Ordered Structures. - Kord Eickmeyer; Jan van den Heuvel; Ken-ichi Kawarabayashi; Stephan Kreutzer; Patrice Ossona de Mendez; Michal Pilipczuk; Daniel A. Quiroz; Roman Rabinovich 001; Sebastian Siebertz (ACM Trans. Comput. Log., 2020)

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2021)

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2021)

RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding. - Danushka Bollegala; Huda Hakami; Yuichi Yoshida; Ken-ichi Kawarabayashi (EACL, 2021)

Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut. - Ken-ichi Kawarabayashi; Anastasios Sidiropoulos (FOCS, 2021)

How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks. - Keyulu Xu; Mozhi Zhang; Jingling Li; Simon Shaolei Du; Ken-ichi Kawarabayashi; Stefanie Jegelka (ICLR, 2021)

The Effect of Random Projection on Local Intrinsic Dimensionality. - Michael E. Houle; Ken-ichi Kawarabayashi (SISAP, 2021)

CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization. - Diana Popova; Ken-ichi Kawarabayashi; Alex Thomo (Comput. J., 2021)

Embeddings of Planar Quasimetrics into Directed 𝓁1 and Polylogarithmic Approximation for Directed Sparsest-Cut. - Ken-ichi Kawarabayashi; Anastasios Sidiropoulos (CoRR, 2021)

Online Task Assignment Problems with Reusable Resources. - Hanna Sumita; Shinji Ito; Kei Takemura; Daisuke Hatano; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2022)

Query Obfuscation by Semantic Decomposition. - Danushka Bollegala; Tomoya Machide; Ken-ichi Kawarabayashi (LREC, 2022)

Directed Tangle Tree-Decompositions and Applications. - Archontia C. Giannopoulou; Ken-ichi Kawarabayashi; Stephan Kreutzer; O-joung Kwon (SODA, 2022)

Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis. - Laurent Amsaleg; Oussama Chelly; Michael E. Houle; Ken-ichi Kawarabayashi; Milos Radovanovic 001; Weeris Treeratanajaru (CoRR, 2022)

A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings. - Danushka Bollegala; Shuichi Otake; Tomoya Machide; Ken-ichi Kawarabayashi (IJCNLP (Findings), 2023)

Bandit Task Assignment with Unknown Processing Time. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2023)

Decomposition of (infinite) digraphs along directed 1-separations. - Nathan J. Bowler; Florian Gut; Meike Hatzel; Ken-ichi Kawarabayashi; Irene Muzi; Florian Reich (CoRR, 2023)

Additive non-approximability of chromatic number in proper minor-closed classes. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2023)

Rooted topological minors on four vertices. - Koyo Hayashi; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2023)

Optimal distributed covering algorithms. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (Distributed Comput., 2023)

Welcome. - Flora D. Salim; Bingsheng He; Ken-ichi Kawarabayashi (Commun. ACM, 2023)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. - Koji Ichikawa; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2024)

Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. - Yuta Inoue; Ken-ichi Kawarabayashi; Atsuyuki Miyashita; Bojan Mohar; Tomohiro Sonobe (FOCS, 2024)

Edge-Disjoint Paths in Eulerian Digraphs. - Dario Giuliano Cavallaro; Ken-ichi Kawarabayashi; Stephan Kreutzer (STOC, 2024)

Packing Even Directed Circuits Quarter-Integrally. - Maximilian Gorsky; Ken-ichi Kawarabayashi; Stephan Kreutzer; Sebastian Wiederrecht (STOC, 2024)

Better Coloring of 3-Colorable Graphs. - Ken-ichi Kawarabayashi; Mikkel Thorup; Hirotaka Yoneda (STOC, 2024)

An analogue of Reed's conjecture for digraphs. - Ken-ichi Kawarabayashi; Lucas Picasarri-Arrieta (SODA, 2025)

A half-integral Erdős-Pósa theorem for directed odd cycles. - Ken-ichi Kawarabayashi; Stephan Kreutzer; O-joung Kwon; Qiqin Xie (J. Comb. Theory B, 2025)

Chasing Tripods to Obtain a Rooted Subdivision. - Koyo Hayashi; Ken-ichi Kawarabayashi; Youngho Yoo (SIAM J. Discret. Math., 2025)

Automorphisms and Isomorphisms of Maps in Linear Time. - Ken-ichi Kawarabayashi; Bojan Mohar; Roman Nedela; Peter Zeman 001 (ACM Trans. Algorithms, 2025)

A Metric Differential Privacy Mechanism for Sentence Embeddings. - Danushka Bollegala; Shuichi Otake; Tomoya Machide; Ken-ichi Kawarabayashi (ACM Trans. Priv. Secur., 2025)

Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors. - Ken-ichi Kawarabayashi; Nicola Lorenz; Marcelo Garlet Milani; Jacob Stegemann (CoRR, 2025)

(Δ-1)-dicolouring of digraphs. - Ararat Harutyunyan; Ken-ichi Kawarabayashi; Lucas Picasarri-Arrieta; Gil Puig i Surroca (CoRR, 2025)

The Directed Disjoint Paths Problem with Congestion. - Matthias Bentert; Dario Cavallaro; Amelie Heindl; Ken-ichi Kawarabayashi; Stephan Kreutzer; Johannes Schröder (CoRR, 2025)