| 2026 | AAAI | A TSP-Based Algorithm for Multi-League Traveling Tournament. | Jingyang Zhao, Mingyu Xiao, Ken-ichi Kawarabayashi |
| 2026 | ICALP | Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width. | Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2026 | SODA | The Directed Disjoint Paths Problem with Congestion. | Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schrder |
| 2026 | SODA | A quasi-polynomial bound for the minimal excluded minors for a surface. | Sarah Houdaigoui, Ken-ichi Kawarabayashi |
| 2026 | SODA | Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torus. | Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe |
| 2025 | SODA | An analogue of Reed's conjecture for digraphs. | Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta |
| 2024 | AAAI | 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 |
| 2024 | FOCS | 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 |
| 2024 | STOC | Edge-Disjoint Paths in Eulerian Digraphs. | Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2024 | STOC | Packing Even Directed Circuits Quarter-Integrally. | Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht |
| 2024 | STOC | Better Coloring of 3-Colorable Graphs. | Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda |
| 2023 | IJCNLP | A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings. | Danushka Bollegala, Shuichi Otake, Tomoya Machide, Ken-ichi Kawarabayashi |
| 2023 | SODA | A half-integral Erdős-Psa theorem for directed odd cycles. | Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie |
| 2022 | AAAI | Online Task Assignment Problems with Reusable Resources. | Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi |
| 2022 | LREC | Query Obfuscation by Semantic Decomposition. | Danushka Bollegala, Tomoya Machide, Ken-ichi Kawarabayashi |
| 2022 | SODA | Directed Tangle Tree-Decompositions and Applications. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2021 | AAAI | 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 |
| 2021 | AISTATS | A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. | Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi |
| 2021 | EACL | RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding. | Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi |
| 2021 | FOCS | Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut. | Ken-ichi Kawarabayashi, Anastasios Sidiropoulos |
| 2021 | ICALP | Automorphisms and Isomorphisms of Maps in Linear Time. | Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman |
| 2021 | ICLR | How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks. | Keyulu Xu, Mozhi Zhang, Jingling Li, Simon Shaolei Du, Ken-ichi Kawarabayashi, Stefanie Jegelka |
| 2021 | SISAP | The Effect of Random Projection on Local Intrinsic Dimensionality. | Michael E. Houle, Ken-ichi Kawarabayashi |
| 2020 | ICLR | What Can Neural Networks Reason About? | Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka |
| 2020 | PODC | Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. | Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman |
| 2020 | SODA | The Directed Flat Wall Theorem. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2020 | SODA | A nearly 5/3-approximation FPT Algorithm for Min- | Ken-ichi Kawarabayashi, Bingkai Lin |
| 2019 | AAAI | Stochastic Submodular Maximization with Performance-Dependent Item Costs. | Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi |
| 2019 | ACL | 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 |
| 2019 | PODC | Optimal Distributed Covering Algorithms. | Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman |
| 2019 | PRICAI | Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. | Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi |
| 2019 | SODA | Polynomial Planar Directed Grid Theorem. | Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2019 | STOC | Polylogarithmic approximation for Euler genus on bounded degree graphs. | Ken-ichi Kawarabayashi, Anastasios Sidiropoulos |
| 2019 | SDM | Intrinsic Dimensionality Estimation within Tight Localities. | Laurent Amsaleg, Oussama Chelly, Michael E. Houle, Ken-ichi Kawarabayashi, Milos Radovanovic, Weeris Treeratanajaru |
| 2018 | AAAI | Using k-Way Co-Occurrences for Learning Word Embeddings. | Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi |
| 2018 | AISTATS | Online Regression with Partial Information: Generalization and Linear Projection. | Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi |
| 2018 | DEXA | Boosting PageRank Scores by Optimizing Internal Link Structure. | Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi |
| 2018 | ICALP | Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. | Zdenek Dvork, Ken-ichi Kawarabayashi |
| 2018 | ICML | Representation Learning on Graphs with Jumping Knowledge Networks. | Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, Stefanie Jegelka |
| 2018 | ICML | Causal Bandits with Propagating Inference. | Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi |
| 2018 | IJCAI | Think Globally, Embed Locally - Locally Linear Meta-embedding of Words. | Danushka Bollegala, Kohei Hayashi, Ken-ichi Kawarabayashi |
| 2018 | SODA | A Polynomial Excluded-Minor Approximation of Treedepth. | Ken-ichi Kawarabayashi, Benjamin Rossman |
| 2018 | SIROCCO | 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 |
| 2018 | SSDBM | NoSingles: a space-efficient algorithm for influence maximization. | Diana Popova, Naoto Ohsaka, Ken-ichi Kawarabayashi, Alex Thomo |
| 2017 | AAAI | Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. | Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2017 | AAAI | Optimal Pricing for Submodular Valuations with Bounded Curvature. | Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi |
| 2017 | FCT | FO Model Checking on Map Graphs. | Kord Eickmeyer, Ken-ichi Kawarabayashi |
| 2017 | FOCS | Polylogarithmic Approximation for Minimum Planarization (Almost). | Ken-ichi Kawarabayashi, Anastasios Sidiropoulos |
| 2017 | IJCAI | An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. | Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi |
| 2017 | SIGMOD | Coarsening Massive Influence Networks for Scalable Diffusion Analysis. | Naoto Ohsaka, Tomohiro Sonobe, Sumio Fujita, Ken-ichi Kawarabayashi |
| 2016 | AAAI | Joint Word Representation Learning Using a Corpus and a Semantic Lexicon. | Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2016 | AAAI | Expected Tensor Decomposition with Stochastic Gradient Descent. | Takanori Maehara, Kohei Hayashi, Ken-ichi Kawarabayashi |
| 2016 | CIKM | Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. | Takanori Hayashi, Takuya Akiba, Ken-ichi Kawarabayashi |
| 2016 | CSL | Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. | Kord Eickmeyer, Ken-ichi Kawarabayashi |
| 2016 | IJCAI | Adaptive Budget Allocation for Maximizing Influence of Advertisements. | Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi |
| 2016 | IJCAI | Identifying Key Observers to Find Popular Information in Advance. | Takuya Konishi, Tomoharu Iwata, Kohei Hayashi, Ken-ichi Kawarabayashi |
| 2015 | AAAI | Learning Word Representations from Relational Graphs. | Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi |
| 2015 | AAAI | Lagrangian Decomposition Algorithm for Allocating Marketing Channels. | Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2015 | ACL | Unsupervised Cross-Domain Word Representation Learning. | Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2015 | ICALP | Towards the Graph Minor Theorems for Directed Graphs. | Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2015 | ICDE | Scalable SimRank join algorithm. | Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi |
| 2015 | ICML | Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View. | Takanori Maehara, Akihiro Yabe, Ken-ichi Kawarabayashi |
| 2015 | IJCAI | Embedding Semantic Relations into Word Representations. | Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2015 | KDD | Estimating Local Intrinsic Dimensionality. | Laurent Amsaleg, Oussama Chelly, Teddy Furon, Stphane Girard, Michael E. Houle, Ken-ichi Kawarabayashi, Michael Nett |
| 2015 | KDD | Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering. | Kohei Hayashi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi |
| 2015 | KDD | Efficient PageRank Tracking in Evolving Networks. | Naoto Ohsaka, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2015 | Networking | Scalable sensor localization via ball-decomposition algorithm. | Yasushi Kawase, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2015 | STOC | The Directed Grid Theorem. | Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2015 | STOC | Beyond the Euler Characteristic: Approximating the Genus of General Graphs. | Ken-ichi Kawarabayashi, Anastasios Sidiropoulos |
| 2015 | STOC | Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2014 | AAAI | Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. | Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal |
| 2014 | AAAI | Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. | Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi |
| 2014 | ALENEX | Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. | Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata |
| 2014 | ICML | Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. | Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi |
| 2014 | KDD | Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. | Takuya Akiba, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2014 | KDD | Efficient SimRank computation via linearizationPublication of this article pending inquiry. | Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi |
| 2014 | SIGMOD | Scalable similarity search for SimRank. | Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2014 | SODA | An Excluded Grid Theorem for Digraphs with Forbidden Minors. | Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2014 | STOC | Embedding and canonizing graphs of bounded genus in logspace. | Michael Elberfeld, Ken-ichi Kawarabayashi |
| 2014 | STOC | An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. | Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer |
| 2014 | STACS | Coloring 3-colorable graphs with o(n^{1/5}) colors. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2013 | FOCS | All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2013 | IAAI | Balancing the Traveling Tournament Problem for Weekday and Weekend Games. | Richard Hoshino, Ken-ichi Kawarabayashi |
| 2013 | IJCAI | Mining for Analogous Tuples from an Entity-Relation Graph. | Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, Ken-ichi Kawarabayashi |
| 2013 | LICS | Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. | Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2013 | SODA | List-coloring embedded graphs. | Zdenek Dvork, Ken-ichi Kawarabayashi |
| 2013 | SODA | A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. | Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2013 | SODA | 5-coloring K | Ken-ichi Kawarabayashi |
| 2013 | SODA | Totally odd subdivisions and parity subdivisions: Structures and Coloring. | Ken-ichi Kawarabayashi |
| 2013 | SODA | Packing directed cycles through a specified vertex set. | Ken-ichi Kawarabayashi, Daniel Krl', Marek Krcl, Stephan Kreutzer |
| 2013 | SODA | 4-connected projective-planar graphs are hamiltonian-connected. | Ken-ichi Kawarabayashi, Kenta Ozeki |
| 2013 | SODA | More Compact Oracles for Approximate Distances in Undirected Planar Graphs. | Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup |
| 2013 | STOC | Testing subdivision-freeness: property testing meets structural graph theory. | Ken-ichi Kawarabayashi, Yuichi Yoshida |
| 2013 | SAGT | Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. | Kord Eickmeyer, Ken-ichi Kawarabayashi |
| 2012 | AAAI | The Linear Distance Traveling Tournament Problem. | Richard Hoshino, Ken-ichi Kawarabayashi |
| 2012 | EDBT | Shortest-path queries for complex networks: exploiting low tree-width outside the core. | Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi |
| 2012 | FOCS | Combinatorial Coloring of 3-Colorable Graphs. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2012 | SODA | Erds-Psa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. | Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | SODA | List-coloring graphs without subdivisions and without immersions. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | SODA | Spanning closed walks and TSP in 3-connected planar graphs. | Ken-ichi Kawarabayashi, Kenta Ozeki |
| 2012 | STACS | Edge-disjoint Odd Cycles in 4-edge-connected Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | STACS | Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2011 | AAAI | The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. | Richard Hoshino, Ken-ichi Kawarabayashi |
| 2011 | FOCS | The Graph Minor Algorithm with Parity Conditions. | Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan |
| 2011 | FOCS | The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2011 | ICALP | Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. | Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer |
| 2011 | STOC | Contraction decomposition in h-minor-free graphs and algorithmic applications. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2011 | STOC | Finding topological subgraphs is fixed-parameter tractable. | Martin Grohe, Ken-ichi Kawarabayashi, Dniel Marx, Paul Wollan |
| 2011 | STOC | Breaking o(n | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2011 | STOC | A simpler algorithm and shorter proof for the graph minor decomposition. | Ken-ichi Kawarabayashi, Paul Wollan |
| 2011 | WALCOM | The Disjoint Paths Problem: Algorithm and Structure. | Ken-ichi Kawarabayashi |
| 2010 | FOCS | A Separator Theorem in Minor-Closed Classes. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2010 | ICCCN | Message Duplication Reduction in Dense Mobile Social Networks. | Ken-ichi Kawarabayashi, Fawad Nazir, Helmut Prendinger |
| 2010 | SODA | Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2010 | SODA | The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2010 | SODA | Recognizing a Totally Odd K | Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed |
| 2010 | SODA | An (almost) Linear Time Algorithm for Odd Cyles Transversal. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2010 | STOC | Odd cycle packing. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2010 | STOC | A shorter proof of the graph minor algorithm: the unique linkage theorem. | Ken-ichi Kawarabayashi, Paul Wollan |
| 2009 | FOCS | Planarity Allowing Few Error Vertices in Linear Time. | Ken-ichi Kawarabayashi |
| 2009 | ICALP | Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2009 | SODA | Three-coloring triangle-free planar graphs in linear time. | Zdenek Dvork, Ken-ichi Kawarabayashi, Robin Thomas |
| 2009 | SODA | Additive approximation algorithms for list-coloring minor-closed class of graphs. | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi |
| 2009 | SODA | List-color-critical graphs on a fixed surface. | Ken-ichi Kawarabayashi, Bojan Mohar |
| 2009 | SODA | A nearly linear time algorithm for the half integral parity disjoint paths packing problem. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2009 | SODA | Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. | Yusuke Kobayashi, Ken-ichi Kawarabayashi |
| 2009 | STOC | Hadwiger's conjecture is decidable. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2008 | FOCS | 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 |
| 2008 | ICALP | Approximating List-Coloring on a Fixed Surface. | Ken-ichi Kawarabayashi |
| 2008 | IPCO | An Improved Algorithm for Finding Cycles Through Elements. | Ken-ichi Kawarabayashi |
| 2008 | IPCO | The Induced Disjoint Paths Problem. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2008 | SODA | A nearly linear time algorithm for the half integral disjoint paths packing. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2008 | STOC | Graph and map isomorphism and all polyhedral embeddings in linear time. | Ken-ichi Kawarabayashi, Bojan Mohar |
| 2007 | SODA | Half integral packing, Erdős-Posá-property and graph minors. | Ken-ichi Kawarabayashi |
| 2007 | STOC | Computing crossing number in linear time. | Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2006 | ISAAC | Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2006 | STOC | Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. | Ken-ichi Kawarabayashi, Bojan Mohar |
| 2005 | FOCS | Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi |