Ken-ichi Kawarabayashi

389 papers A* 108A 13B 15C 1Journal 233Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A TSP-Based Algorithm for Multi-League Traveling Tournament. AAAI Jingyang Zhao, Mingyu Xiao, Ken-ichi Kawarabayashi
2026	A*	`conf`	A quasi-polynomial bound for the minimal excluded minors for a surface. SODA Sarah Houdaigoui, Ken-ichi Kawarabayashi
2026	J	`jnl`	Accelerating Scientific Research with Gemini: Case Studies and Common Techniques. CoRR David P. Woodruff, Vincent Cohen-Addad, Lalit Jain, Jieming Mao, Song Zuo, MohammadHossein Bateni, Simina Brânzei, Michael P. Brenner, Lin Chen, Ying Feng, Lance Fortnow, Gang Fu, Ziyi Guan, Zahra Hadizadeh, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Adel Javanmard, Karthik C. S., Ken-ichi Kawarabayashi, Ravi Kumar, Silvio Lattanzi, Euiwoong Lee, Yi Li, Ioannis Panageas, Dimitris Paparas, Benjamin Przybocki, Bernardo Subercaseaux, Ola Svensson, Shayan Taherijam, Xuan Wu, Eylon Yogev, Morteza Zadimoghaddam, Samson Zhou, Yossi Matias, James Manyika, Vahab Mirrokni
2026	J	`jnl`	On the size of two minimal linkages. J. Comb. Theory B Koyo Hayashi, Ken-ichi Kawarabayashi, Daiki Kobayashi
2026	A*	`conf`	The Directed Disjoint Paths Problem with Congestion. SODA Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder
2026	J	`jnl`	The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring. CoRR Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup
2026	A*	`conf`	Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torus. SODA Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
2025	J	`jnl`	(Δ-1)-dicolouring of digraphs. CoRR Ararat Harutyunyan, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta, Gil Puig i Surroca
2025	J	`jnl`	A Metric Differential Privacy Mechanism for Sentence Embeddings. ACM Trans. Priv. Secur. Danushka Bollegala, Shuichi Otake, Tomoya Machide, Ken-ichi Kawarabayashi
2025	J	`jnl`	A half-integral Erdős-Pósa theorem for directed odd cycles. J. Comb. Theory B Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
2025	J	`jnl`	A quasi-polynomial bound for the minimal excluded minors for a surface. CoRR Sarah Houdaigoui, Ken-ichi Kawarabayashi
2025	A*	`conf`	An analogue of Reed's conjecture for digraphs. SODA Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
2025	J	`jnl`	Automorphisms and Isomorphisms of Maps in Linear Time. ACM Trans. Algorithms Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman
2025	J	`jnl`	Chasing Tripods to Obtain a Rooted Subdivision. SIAM J. Discret. Math. Koyo Hayashi, Ken-ichi Kawarabayashi, Youngho Yoo
2025	B	`conf`	Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors. IPEC Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani, Jacob Stegemann
2025	J	`jnl`	Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors. CoRR Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani, Jacob Stegemann
2025	J	`jnl`	Online Graph Coloring for CoRR Ken-ichi Kawarabayashi, Hirotaka Yoneda, Masataka Yoneda
2025	J	`jnl`	The Directed Disjoint Paths Problem with Congestion. CoRR Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder
2025	J	`jnl`	Well-Quasi-Ordering Eulerian Digraphs Embeddable in Surfaces by Strong Immersion. CoRR Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer
2024	J	`jnl`	An analogue of Reed's conjecture for digraphs. CoRR Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
2024	A*	`conf`	Better Coloring of 3-Colorable Graphs. STOC Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
2024	J	`jnl`	Better coloring of 3-colorable graphs. CoRR Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
2024	A*	`conf`	Edge-Disjoint Paths in Eulerian Digraphs. STOC Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer
2024	J	`jnl`	Edge-Disjoint Paths in Eulerian Digraphs. CoRR Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer
2024	A*	`conf`	New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2024	A*	`conf`	Packing Even Directed Circuits Quarter-Integrally. STOC Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht
2024	A*	`conf`	Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. FOCS Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
2024	J	`jnl`	Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem. CoRR Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
2023	—	`conf`	A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings. IJCNLP (Findings) Danushka Bollegala, Shuichi Otake, Tomoya Machide, Ken-ichi Kawarabayashi
2023	J	`jnl`	A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings. CoRR Danushka Bollegala, Shuichi Otake, Tomoya Machide, Ken-ichi Kawarabayashi
2023	A*	`conf`	A half-integral Erdős-Pósa theorem for directed odd cycles. SODA Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie
2023	J	`jnl`	Additive non-approximability of chromatic number in proper minor-closed classes. J. Comb. Theory B Zdenek Dvorák, Ken-ichi Kawarabayashi
2023	A*	`conf`	Bandit Task Assignment with Unknown Processing Time. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2023	J	`jnl`	Decomposition of (infinite) digraphs along directed 1-separations. CoRR Nathan J. Bowler, Florian Gut, Meike Hatzel, Ken-ichi Kawarabayashi, Irene Muzi, Florian Reich
2023	J	`jnl`	New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2023	J	`jnl`	Optimal distributed covering algorithms. Distributed Comput. Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2023	J	`jnl`	Packing even directed circuits quarter-integrally. CoRR Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht
2023	J	`jnl`	Rooted topological minors on four vertices. J. Comb. Theory B Koyo Hayashi, Ken-ichi Kawarabayashi
2023	J	`jnl`	Welcome. Commun. ACM Flora D. Salim, Bingsheng He, Ken-ichi Kawarabayashi
2022	A*	`conf`	Directed Tangle Tree-Decompositions and Applications. SODA Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2022	J	`jnl`	Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis. CoRR Laurent Amsaleg, Oussama Chelly, Michael E. Houle, Ken-ichi Kawarabayashi, Milos Radovanovic, Weeris Treeratanajaru
2022	A*	`conf`	Online Task Assignment Problems with Reusable Resources. AAAI Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	J	`jnl`	Online Task Assignment Problems with Reusable Resources. CoRR Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2022	B	`conf`	Query Obfuscation by Semantic Decomposition. LREC Danushka Bollegala, Tomoya Machide, Ken-ichi Kawarabayashi
2021	A	`conf`	A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	A*	`conf`	Automorphisms and Isomorphisms of Maps in Linear Time. ICALP Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman
2021	J	`jnl`	CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization. Comput. J. Diana Popova, Ken-ichi Kawarabayashi, Alex Thomo
2021	A*	`conf`	Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut. FOCS Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2021	J	`jnl`	Embeddings of Planar Quasimetrics into Directed 𝓁 CoRR Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2021	A*	`conf`	How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks. ICLR Keyulu Xu, Mozhi Zhang, Jingling Li, Simon Shaolei Du, Ken-ichi Kawarabayashi, Stefanie Jegelka
2021	A*	`conf`	Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	J	`jnl`	Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2021	A	`conf`	RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding. EACL Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi
2021	J	`jnl`	RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding. CoRR Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi
2021	B	`conf`	The Effect of Random Projection on Local Intrinsic Dimensionality. SISAP Michael E. Houle, Ken-ichi Kawarabayashi
2020	A*	`conf`	A nearly 5/3-approximation FPT Algorithm for Min- SODA Ken-ichi Kawarabayashi, Bingkai Lin
2020	J	`jnl`	Automorphism groups of maps in linear time. CoRR Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman
2020	A*	`conf`	Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. PODC Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
2020	A*	`conf`	Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2020	J	`jnl`	How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks. CoRR Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka
2020	A	`conf`	Improved Distributed Approximations for Maximum Independent Set. DISC Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
2020	J	`jnl`	Linear min-max relation between the treewidth of an J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi
2020	J	`jnl`	Minimum Violation Vertex Maps and Their Applications to Cut Problems. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Chao Xu
2020	J	`jnl`	Model-Checking on Ordered Structures. ACM Trans. Comput. Log. Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2020	J	`jnl`	Quickly excluding a non-planar graph. CoRR Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
2020	A*	`conf`	The Directed Flat Wall Theorem. SODA Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2020	J	`jnl`	The NII Shonan meeting in Japan. Commun. ACM Ken-ichi Kawarabayashi
2020	J	`jnl`	The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2020	A*	`conf`	What Can Neural Networks Reason About? ICLR Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka
2019	J	`jnl`	Anonymising Queries by Semantic Decomposition. CoRR Danushka Bollegala, Tomoya Machide, Ken-ichi Kawarabayashi
2019	—	`conf`	Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization. ACL (1) Mozhi Zhang, Keyulu Xu, Ken-ichi Kawarabayashi, Stefanie Jegelka, Jordan L. Boyd-Graber
2019	J	`jnl`	Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization. CoRR Mozhi Zhang, Keyulu Xu, Ken-ichi Kawarabayashi, Stefanie Jegelka, Jordan L. Boyd-Graber
2019	J	`jnl`	Deterministic Edge Connectivity in Near-Linear Time. J. ACM Ken-ichi Kawarabayashi, Mikkel Thorup
2019	J	`jnl`	Improved Distributed Approximation to Maximum Independent Set. CoRR Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman
2019	A*	`conf`	Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	A	`conf`	Intrinsic Dimensionality Estimation within Tight Localities. SDM Laurent Amsaleg, Oussama Chelly, Michael E. Houle, Ken-ichi Kawarabayashi, Milos Radovanovic, Weeris Treeratanajaru
2019	—	`conf`	Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	J	`jnl`	Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	A*	`conf`	Optimal Distributed Covering Algorithms. PODC Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	A	`conf`	Optimal Distributed Covering Algorithms. DISC Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	J	`jnl`	Optimal Distributed Covering Algorithms. CoRR Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	A*	`conf`	Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2019	A	`conf`	Parameterized Distributed Algorithms. DISC Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019	A*	`conf`	Polylogarithmic approximation for Euler genus on bounded degree graphs. STOC Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2019	A*	`conf`	Polynomial Planar Directed Grid Theorem. SODA Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer
2019	A*	`conf`	Stochastic Submodular Maximization with Performance-Dependent Item Costs. AAAI Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi
2019	J	`jnl`	What Can Neural Networks Reason About? CoRR Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka
2018	B	`conf`	A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. SIROCCO Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	J	`jnl`	A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log CoRR Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	A*	`conf`	A Polynomial Excluded-Minor Approximation of Treedepth. SODA Ken-ichi Kawarabayashi, Benjamin Rossman
2018	J	`jnl`	A new proof of the flat wall theorem. J. Comb. Theory B Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
2018	A	`conf`	Adapting Local Sequential Algorithms to the Distributed Setting. DISC Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	A*	`conf`	Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. ICALP Zdenek Dvorák, Ken-ichi Kawarabayashi
2018	J	`jnl`	All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2018	—	`conf`	Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
2018	A*	`conf`	Causal Bandits with Propagating Inference. ICML Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
2018	J	`jnl`	Causal Bandits with Propagating Inference. CoRR Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
2018	J	`jnl`	ClassiNet - Predicting Missing Features for Short-Text Classification. CoRR Danushka Bollegala, Vincent Atanasov, Takanori Maehara, Ken-ichi Kawarabayashi
2018	J	`jnl`	ClassiNet - Predicting Missing Features for Short-Text Classification. ACM Trans. Knowl. Discov. Data Danushka Bollegala, Vincent Atanasov, Takanori Maehara, Ken-ichi Kawarabayashi
2018	J	`jnl`	Existence of outsiders as a characteristic of online communication networks. Netw. Sci. Taro Takaguchi, Takanori Maehara, Ken-ichi Kawarabayashi, Masashi Toyoda
2018	J	`jnl`	Extreme-value-theoretic estimation of local intrinsic dimensionality. Data Min. Knowl. Discov. Laurent Amsaleg, Oussama Chelly, Teddy Furon, Stéphane Girard, Michael E. Houle, Ken-ichi Kawarabayashi, Michael Nett
2018	J	`jnl`	Model-Checking on Ordered Structures. CoRR Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2018	B	`conf`	NoSingles: a space-efficient algorithm for influence maximization. SSDBM Diana Popova, Naoto Ohsaka, Ken-ichi Kawarabayashi, Alex Thomo
2018	A	`conf`	Online Regression with Partial Information: Generalization and Linear Projection. AISTATS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2018	J	`jnl`	Optimal Distributed Weighted Set Cover Approximation. CoRR Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	J	`jnl`	Parameterized Distributed Algorithms. CoRR Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018	A*	`conf`	Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2018	A*	`conf`	Representation Learning on Graphs with Jumping Knowledge Networks. ICML Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, Stefanie Jegelka
2018	J	`jnl`	Representation Learning on Graphs with Jumping Knowledge Networks. CoRR Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, Stefanie Jegelka
2018	J	`jnl`	Scaling advantages of all-to-all connectivity in physical annealers: the Coherent Ising Machine vs. D-Wave 2000Q. CoRR 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, Ryoichi Kasahara, Shoko Utsunomiya, Satoshi Kako, Ken-ichi Kawarabayashi, Robert L. Byer, Martin M. Fejer, Hideo Mabuchi, Eleanor Gilbert Rieffel, Hiroki Takesue, Yoshihisa Yamamoto
2018	J	`jnl`	The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi
2018	A*	`conf`	Think Globally, Embed Locally - Locally Linear Meta-embedding of Words. IJCAI Danushka Bollegala, Kohei Hayashi, Ken-ichi Kawarabayashi
2018	J	`jnl`	Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
2018	A*	`conf`	Using k-Way Co-Occurrences for Learning Word Embeddings. AAAI Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi
2017	J	`jnl`	Additive non-approximability of chromatic number in proper minor-closed classes. CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi
2017	A*	`conf`	An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi
2017	—	`conf`	Coarsening Massive Influence Networks for Scalable Diffusion Analysis. SIGMOD Conference Naoto Ohsaka, Tomohiro Sonobe, Sumio Fujita, Ken-ichi Kawarabayashi
2017	J	`jnl`	Coloring 3-Colorable Graphs with Less than J. ACM Ken-ichi Kawarabayashi, Mikkel Thorup
2017	—	`conf`	Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
2017	B	`conf`	FO Model Checking on Map Graphs. FCT Kord Eickmeyer, Ken-ichi Kawarabayashi
2017	J	`jnl`	Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer
2017	A*	`conf`	Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi
2017	J	`jnl`	Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
2017	A*	`conf`	Polylogarithmic Approximation for Minimum Planarization (Almost). FOCS Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2017	J	`jnl`	Polylogarithmic approximation for minimum planarization (almost). CoRR Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2017	A*	`conf`	Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. AAAI Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi
2017	J	`jnl`	Think Globally, Embed Locally - Locally Linear Meta-embedding of Words. CoRR Danushka Bollegala, Kohei Hayashi, Ken-ichi Kawarabayashi
2017	J	`jnl`	Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. Eur. J. Comb. Zdenek Dvorák, Ken-ichi Kawarabayashi
2017	J	`jnl`	Using $k$-way Co-occurrences for Learning Word Embeddings. CoRR Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi
2016	J	`jnl`	5-Connected Toroidal Graphs are Hamiltonian-Connected. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Kenta Ozeki
2016	A*	`conf`	Adaptive Budget Allocation for Maximizing Influence of Advertisements. IJCAI Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi
2016	J	`jnl`	An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. ACM Trans. Algorithms Ken-ichi Kawarabayashi, Yusuke Kobayashi
2016	J	`jnl`	Coloring immersion-free graphs. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi
2016	J	`jnl`	Dynamic Influence Analysis in Evolving Networks. Proc. VLDB Endow. Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi
2016	J	`jnl`	Edge-disjoint odd cycles in 4-edge-connected graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi
2016	A*	`conf`	Expected Tensor Decomposition with Stochastic Gradient Descent. AAAI Takanori Maehara, Kohei Hayashi, Ken-ichi Kawarabayashi
2016	A	`conf`	Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. CIKM Takanori Hayashi, Takuya Akiba, Ken-ichi Kawarabayashi
2016	A*	`conf`	Identifying Key Observers to Find Popular Information in Advance. IJCAI Takuya Konishi, Tomoharu Iwata, Kohei Hayashi, Ken-ichi Kawarabayashi
2016	A*	`conf`	Joint Word Representation Learning Using a Corpus and a Semantic Lexicon. AAAI Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi
2016	—	`conf`	Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi
2016	J	`jnl`	Non-separating subgraphs in highly connected graphs. J. Comb. Theory B Shinya Fujita, Ken-ichi Kawarabayashi
2016	J	`jnl`	Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi
2016	J	`jnl`	Packing six T-joins in plane graphs. J. Comb. Theory B Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král'
2016	J	`jnl`	Reply trees in Twitter: data analysis and branching process models. Soc. Netw. Anal. Min. Ryosuke Nishi, Taro Takaguchi, Keigo Oka, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi, Naoki Masuda
2016	B	`conf`	Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CSL Kord Eickmeyer, Ken-ichi Kawarabayashi
2016	J	`jnl`	Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CoRR Kord Eickmeyer, Ken-ichi Kawarabayashi
2016	J	`jnl`	The Erdos-Posa Property for Directed Graphs. CoRR Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan
2015	J	`jnl`	4-connected projective-planar graphs are Hamiltonian-connected. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2015	A*	`conf`	Beyond the Euler Characteristic: Approximating the Genus of General Graphs. STOC Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2015	A*	`conf`	Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View. ICML Takanori Maehara, Akihiro Yabe, Ken-ichi Kawarabayashi
2015	J	`jnl`	Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. CoRR Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
2015	A*	`conf`	Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. STOC Ken-ichi Kawarabayashi, Mikkel Thorup
2015	J	`jnl`	Edge-colouring seven-regular planar graphs. J. Comb. Theory B Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour
2015	A*	`conf`	Efficient PageRank Tracking in Evolving Networks. KDD Naoto Ohsaka, Takanori Maehara, Ken-ichi Kawarabayashi
2015	A*	`conf`	Embedding Semantic Relations into Word Representations. IJCAI Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi
2015	J	`jnl`	Embedding Semantic Relations into Word Representations. CoRR Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi
2015	A*	`conf`	Estimating Local Intrinsic Dimensionality. KDD Laurent Amsaleg, Oussama Chelly, Teddy Furon, Stéphane Girard, Michael E. Houle, Ken-ichi Kawarabayashi, Michael Nett
2015	J	`jnl`	Fixed-parameter tractability for subset feedback set problems with parity constraints. Theor. Comput. Sci. Naonori Kakimura, Ken-ichi Kawarabayashi
2015	J	`jnl`	Graph Isomorphism for Bounded Genus Graphs In Linear Time. CoRR Ken-ichi Kawarabayashi
2015	J	`jnl`	Joint Word Representation Learning using a Corpus and a Semantic Lexicon. CoRR Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi
2015	A*	`conf`	Lagrangian Decomposition Algorithm for Allocating Marketing Channels. AAAI Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi
2015	A*	`conf`	Learning Word Representations from Relational Graphs. AAAI Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi
2015	A*	`conf`	Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering. KDD Kohei Hayashi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi
2015	A*	`conf`	Scalable SimRank join algorithm. ICDE Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
2015	B	`conf`	Scalable sensor localization via ball-decomposition algorithm. Networking Yasushi Kawase, Takanori Maehara, Ken-ichi Kawarabayashi
2015	J	`jnl`	Subdivisions of J. Comb. Theory B Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu
2015	A*	`conf`	The Directed Grid Theorem. STOC Ken-ichi Kawarabayashi, Stephan Kreutzer
2015	J	`jnl`	The edge density of critical digraphs. Comb. Richard Hoshino, Ken-ichi Kawarabayashi
2015	J	`jnl`	The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Comb. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2015	J	`jnl`	The odd Hadwiger's conjecture is "almost" decidable. CoRR Ken-ichi Kawarabayashi
2015	—	`conf`	Towards the Graph Minor Theorems for Directed Graphs. ICALP (2) Ken-ichi Kawarabayashi, Stephan Kreutzer
2015	—	`conf`	Unsupervised Cross-Domain Word Representation Learning. ACL (1) Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi
2015	J	`jnl`	Unsupervised Cross-Domain Word Representation Learning. CoRR Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi
2014	J	`jnl`	A connected subgraph maintaining high connectivity. Eur. J. Comb. Shinya Fujita, Ken-ichi Kawarabayashi
2014	A*	`conf`	An Excluded Grid Theorem for Digraphs with Forbidden Minors. SODA Ken-ichi Kawarabayashi, Stephan Kreutzer
2014	A*	`conf`	An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. STOC Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer
2014	J	`jnl`	Beyond the Euler characteristic: Approximating the genus of general graphs. CoRR Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
2014	A	`conf`	Coloring 3-colorable graphs with o(n^{1/5}) colors. STACS Ken-ichi Kawarabayashi, Mikkel Thorup
2014	J	`jnl`	Computing Personalized PageRank Quickly by Exploiting Graph Structures. Proc. VLDB Endow. Takanori Maehara, Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi
2014	J	`jnl`	Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. CoRR Ken-ichi Kawarabayashi, Mikkel Thorup
2014	J	`jnl`	Efficient SimRank Computation via Linearization. CoRR Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
2014	A*	`conf`	Efficient SimRank computation via linearizationPublication of this article pending inquiry. KDD Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
2014	A*	`conf`	Embedding and canonizing graphs of bounded genus in logspace. STOC Michael Elberfeld, Ken-ichi Kawarabayashi
2014	J	`jnl`	Existence of outsiders as a characteristic of online communication networks. CoRR Taro Takaguchi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi
2014	A	`conf`	Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. ALENEX Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata
2014	A*	`conf`	Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. AAAI Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi
2014	J	`jnl`	Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. CoRR Richard Hoshino, Ken-ichi Kawarabayashi
2014	J	`jnl`	Learning Word Representations from Relational Graphs. CoRR Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi
2014	J	`jnl`	Minimum degree conditions for vertex-disjoint even cycles in large graphs. Adv. Appl. Math. Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
2014	A*	`conf`	Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. KDD Takuya Akiba, Takanori Maehara, Ken-ichi Kawarabayashi
2014	A*	`conf`	Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi
2014	J	`jnl`	Removable paths and cycles with parity constraints. J. Comb. Theory B Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed
2014	—	`conf`	Scalable similarity search for SimRank. SIGMOD Conference Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi
2014	J	`jnl`	Scheduling Bipartite Tournaments to Minimize Total Travel Distance. CoRR Richard Hoshino, Ken-ichi Kawarabayashi
2014	A*	`conf`	Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal
2014	J	`jnl`	Spanning closed walks and TSP in 3-connected planar graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2014	J	`jnl`	Sub-exponential graph coloring algorithm for stencil-based Jacobian computations. J. Comput. Sci. Michael Lülfesmann, Ken-ichi Kawarabayashi
2014	J	`jnl`	The Directed Grid Theorem. CoRR Ken-ichi Kawarabayashi, Stephan Kreutzer
2013	A*	`conf`	4-connected projective-planar graphs are hamiltonian-connected. SODA Ken-ichi Kawarabayashi, Kenta Ozeki
2013	A*	`conf`	5-coloring K SODA Ken-ichi Kawarabayashi
2013	A*	`conf`	A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed
2013	J	`jnl`	A simpler proof for the two disjoint odd cycles theorem. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2013	A*	`conf`	All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. FOCS Ken-ichi Kawarabayashi, Yusuke Kobayashi
2013	J	`jnl`	An Approximation Algorithm for the Bipartite Traveling Tournament Problem. Math. Oper. Res. Richard Hoshino, Ken-ichi Kawarabayashi
2013	J	`jnl`	An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Trans. Algorithms Ken-ichi Kawarabayashi, Yusuke Kobayashi
2013	B	`conf`	Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. SAGT Kord Eickmeyer, Ken-ichi Kawarabayashi
2013	C	`conf`	Balancing the Traveling Tournament Problem for Weekday and Weekend Games. IAAI Richard Hoshino, Ken-ichi Kawarabayashi
2013	J	`jnl`	Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory B Ken-ichi Kawarabayashi, Gexin Yu
2013	J	`jnl`	Half-integral packing of odd cycles through prescribed vertices. Comb. Naonori Kakimura, Ken-ichi Kawarabayashi
2013	A*	`conf`	List-coloring embedded graphs. SODA Zdenek Dvorák, Ken-ichi Kawarabayashi
2013	A*	`conf`	Mining for Analogous Tuples from an Entity-Relation Graph. IJCAI Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, Ken-ichi Kawarabayashi
2013	A*	`conf`	Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. LICS Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer
2013	A*	`conf`	More Compact Oracles for Approximate Distances in Undirected Planar Graphs. SODA Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup
2013	A*	`conf`	Packing directed cycles through a specified vertex set. SODA Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer
2013	A*	`conf`	Testing subdivision-freeness: property testing meets structural graph theory. STOC Ken-ichi Kawarabayashi, Yuichi Yoshida
2013	J	`jnl`	Three-coloring triangle-free planar graphs in linear time CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2013	A*	`conf`	Totally odd subdivisions and parity subdivisions: Structures and Coloring. SODA Ken-ichi Kawarabayashi
2012	J	`jnl`	A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	—	`conf`	Cliques in Odd-Minor-Free Graphs. CATS Ken-ichi Kawarabayashi, David R. Wood
2012	A*	`conf`	Combinatorial Coloring of 3-Colorable Graphs. FOCS Ken-ichi Kawarabayashi, Mikkel Thorup
2012	J	`jnl`	Combinatorial coloring of 3-colorable graphs CoRR Ken-ichi Kawarabayashi, Mikkel Thorup
2012	J	`jnl`	Edge-colouring seven-regular planar graphs CoRR Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour
2012	A	`conf`	Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	A*	`conf`	Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	J	`jnl`	Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	J	`jnl`	From the plane to higher surfaces. J. Comb. Theory B Ken-ichi Kawarabayashi, Carsten Thomassen
2012	J	`jnl`	Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. J. Artif. Intell. Res. Richard Hoshino, Ken-ichi Kawarabayashi
2012	J	`jnl`	K_6 minors in 6-connected graphs of bounded tree-width CoRR Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
2012	J	`jnl`	K_6 minors in large 6-connected graphs CoRR Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
2012	A	`conf`	Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	J	`jnl`	Linkless and Flat Embeddings in 3-Space. Discret. Comput. Geom. Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
2012	J	`jnl`	List-coloring embedded graphs CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi
2012	A*	`conf`	List-coloring graphs without subdivisions and without immersions. SODA Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	J	`jnl`	Minimally contraction-critically 6-connected graphs. Discret. Math. Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi
2012	J	`jnl`	Minors in large almost-5-connected non-planar graphs. J. Graph Theory Ken-ichi Kawarabayashi, John Maharry
2012	J	`jnl`	On the excluded minor structure theorem for graphs of large tree-width. J. Comb. Theory B Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan
2012	J	`jnl`	Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. SIAM J. Discret. Math. Naonori Kakimura, Ken-ichi Kawarabayashi
2012	J	`jnl`	Packing cycles through prescribed vertices under modularity constraints. Adv. Appl. Math. Naonori Kakimura, Ken-ichi Kawarabayashi
2012	B	`conf`	Shortest-path queries for complex networks: exploiting low tree-width outside the core. EDBT Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi
2012	A*	`conf`	Spanning closed walks and TSP in 3-connected planar graphs. SODA Ken-ichi Kawarabayashi, Kenta Ozeki
2012	J	`jnl`	The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory B Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan
2012	A*	`conf`	The Linear Distance Traveling Tournament Problem. AAAI Richard Hoshino, Ken-ichi Kawarabayashi
2012	J	`jnl`	The disjoint paths problem in quadratic time. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed
2011	J	`jnl`	2- and 3-factors of graphs on surfaces. J. Graph Theory Ken-ichi Kawarabayashi, Kenta Ozeki
2011	J	`jnl`	A multi-round generalization of the traveling tournament problem and its application to Japanese baseball. Eur. J. Oper. Res. Richard Hoshino, Ken-ichi Kawarabayashi
2011	A*	`conf`	A simpler algorithm and shorter proof for the graph minor decomposition. STOC Ken-ichi Kawarabayashi, Paul Wollan
2011	J	`jnl`	An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2011	A*	`conf`	Breaking o(n STOC Ken-ichi Kawarabayashi, Yusuke Kobayashi
2011	A*	`conf`	Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2011	A*	`conf`	Finding topological subgraphs is fixed-parameter tractable. STOC Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
2011	J	`jnl`	Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1). NII Shonan Meet. Rep. Satoru Iwata, Ken-ichi Kawarabayashi
2011	J	`jnl`	Hamilton cycles in 4-connected troidal triangulations. Electron. Notes Discret. Math. Ken-ichi Kawarabayashi, Kenta Ozeki
2011	J	`jnl`	High connectivity keeping connected subgraph. Electron. Notes Discret. Math. Shinya Fujita, Ken-ichi Kawarabayashi
2011	—	`conf`	Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. ICALP (1) Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer
2011	J	`jnl`	Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs CoRR Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer
2011	J	`jnl`	Minimum k-way cut of bounded size is fixed-parameter tractable CoRR Ken-ichi Kawarabayashi, Mikkel Thorup
2011	J	`jnl`	Non-separating subgraphs after deleting many disjoint paths. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2011	J	`jnl`	Packing cycles through prescribed vertices. J. Comb. Theory B Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx
2011	J	`jnl`	Scheduling Bipartite Tournaments to Minimize Total Travel Distance. J. Artif. Intell. Res. Richard Hoshino, Ken-ichi Kawarabayashi
2011	J	`jnl`	The 2-extendability of 5-connected graphs on surfaces with large representativity. J. Comb. Theory B Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki
2011	B	`conf`	The Disjoint Paths Problem: Algorithm and Structure. WALCOM Ken-ichi Kawarabayashi
2011	A*	`conf`	The Graph Minor Algorithm with Parity Conditions. FOCS Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan
2011	A*	`conf`	The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. AAAI Richard Hoshino, Ken-ichi Kawarabayashi
2011	A*	`conf`	The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. FOCS Ken-ichi Kawarabayashi, Mikkel Thorup
2011	A*	`conf`	The Multi-Round Balanced Traveling Tournament Problem. ICAPS Richard Hoshino, Ken-ichi Kawarabayashi
2011	J	`jnl`	Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2011	J	`jnl`	Toughness of Electron. J. Comb. Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota
2010	A*	`conf`	A Separator Theorem in Minor-Closed Classes. FOCS Ken-ichi Kawarabayashi, Bruce A. Reed
2010	J	`jnl`	A note on traversing specified vertices in graphs embedded with large representativity. Discret. Math. Ken-ichi Kawarabayashi, Michael D. Plummer
2010	A*	`conf`	A shorter proof of the graph minor algorithm: the unique linkage theorem. STOC Ken-ichi Kawarabayashi, Paul Wollan
2010	J	`jnl`	A simple algorithm for 4-coloring 3-colorable planar graphs. Theor. Comput. Sci. Ken-ichi Kawarabayashi, Kenta Ozeki
2010	J	`jnl`	Algorithms for finding an induced cycle in planar graphs. Comb. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	—	`conf`	An APPROX-RANDOM Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	A*	`conf`	An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA Ken-ichi Kawarabayashi, Bruce A. Reed
2010	J	`jnl`	Contractible Small Subgraphs in Graphs Comb. Shinya Fujita, Ken-ichi Kawarabayashi
2010	A*	`conf`	Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2010	J	`jnl`	Dominating sets in triangulations on surfaces. J. Graph Theory Tatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
2010	J	`jnl`	Double-Critical Graphs and Complete Minors. Electron. J. Comb. Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft
2010	J	`jnl`	Finding topological subgraphs is fixed-parameter tractable CoRR Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
2010	J	`jnl`	Immersing small complete graphs. Ars Math. Contemp. Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura
2010	—	`conf`	Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	—	`conf`	Linkless and flat embeddings in 3-space and the unknot problem. SCG Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
2010	B	`conf`	Message Duplication Reduction in Dense Mobile Social Networks. ICCCN Ken-ichi Kawarabayashi, Fawad Nazir, Helmut Prendinger
2010	J	`jnl`	Non-separating even cycles in highly connected graphs. Comb. Shinya Fujita, Ken-ichi Kawarabayashi
2010	A*	`conf`	Odd cycle packing. STOC Ken-ichi Kawarabayashi, Bruce A. Reed
2010	A*	`conf`	Recognizing a Totally Odd K SODA Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
2010	J	`jnl`	Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Bojan Mohar
2010	A*	`conf`	The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA Ken-ichi Kawarabayashi, Yusuke Kobayashi
2009	J	`jnl`	6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
2009	A*	`conf`	A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA Ken-ichi Kawarabayashi, Bruce A. Reed
2009	A*	`conf`	Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi
2009	J	`jnl`	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2009	A*	`conf`	Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA Yusuke Kobayashi, Ken-ichi Kawarabayashi
2009	—	`conf`	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2009	J	`jnl`	Bounding the Size of Equimatchable Graphs of Fixed Genus. Graphs Comb. Ken-ichi Kawarabayashi, Michael D. Plummer
2009	J	`jnl`	Decomposing a planar graph of girth 5 into an independent set and a forest. J. Comb. Theory B Ken-ichi Kawarabayashi, Carsten Thomassen
2009	J	`jnl`	Disjoint Even Cycles Packing. Electron. Notes Discret. Math. Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
2009	A*	`conf`	Hadwiger's conjecture is decidable. STOC Ken-ichi Kawarabayashi, Bruce A. Reed
2009	J	`jnl`	Highly parity linked graphs. Comb. Ken-ichi Kawarabayashi, Bruce A. Reed
2009	J	`jnl`	Linear connectivity forces large complete bipartite minors. J. Comb. Theory B Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
2009	J	`jnl`	Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] J. Comb. Theory B Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
2009	A*	`conf`	List-color-critical graphs on a fixed surface. SODA Ken-ichi Kawarabayashi, Bojan Mohar
2009	J	`jnl`	List-coloring graphs without K Discret. Appl. Math. Ken-ichi Kawarabayashi
2009	J	`jnl`	N-flips in even triangulations on surfaces. J. Comb. Theory B Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki
2009	J	`jnl`	Note on coloring graphs without odd-K J. Comb. Theory B Ken-ichi Kawarabayashi
2009	J	`jnl`	Note on non-separating and removable cycles in highly connected graphs. Discret. Appl. Math. Shinya Fujita, Ken-ichi Kawarabayashi
2009	J	`jnl`	On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory B Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell
2009	A*	`conf`	Planarity Allowing Few Error Vertices in Linear Time. FOCS Ken-ichi Kawarabayashi
2009	J	`jnl`	Removable cycles in non-bipartite graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee
2009	A*	`conf`	Three-coloring triangle-free planar graphs in linear time. SODA Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2008	A*	`conf`	A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed
2008	J	`jnl`	A Weakening of the Odd Hadwiger's Conjecture. Comb. Probab. Comput. Ken-ichi Kawarabayashi
2008	A*	`conf`	A nearly linear time algorithm for the half integral disjoint paths packing. SODA Ken-ichi Kawarabayashi, Bruce A. Reed
2008	J	`jnl`	A weaker version of Lovász' path removal conjecture. J. Comb. Theory B Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan
2008	B	`conf`	An Improved Algorithm for Finding Cycles Through Elements. IPCO Ken-ichi Kawarabayashi
2008	—	`conf`	Approximating List-Coloring on a Fixed Surface. ICALP (1) Ken-ichi Kawarabayashi
2008	J	`jnl`	Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory B Shinya Fujita, Ken-ichi Kawarabayashi
2008	J	`jnl`	Contractible edges in minimally k-connected graphs. Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2008	J	`jnl`	Contractible elements in J. Graph Theory Shinya Fujita, Ken-ichi Kawarabayashi
2008	J	`jnl`	Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. Ken-ichi Kawarabayashi, Bruce A. Reed
2008	A*	`conf`	Graph and map isomorphism and all polyhedral embeddings in linear time. STOC Ken-ichi Kawarabayashi, Bojan Mohar
2008	—	`conf`	Improved upper bounds on the crossing number. SCG Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
2008	J	`jnl`	K SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Raiji Mukae, Atsuhiro Nakamoto
2008	J	`jnl`	Locally planar graphs are 5-choosable. J. Comb. Theory B Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar
2008	J	`jnl`	Long cycles in graphs without hamiltonian paths. Discret. Math. Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita
2008	J	`jnl`	N-Flips in even triangulations on surfaces. Electron. Notes Discret. Math. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki
2008	J	`jnl`	Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. SIAM J. Discret. Math. Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi
2008	J	`jnl`	On the matching extendability of graphs in surfaces. J. Comb. Theory B Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer
2008	J	`jnl`	Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
2008	B	`conf`	The Induced Disjoint Paths Problem. IPCO Ken-ichi Kawarabayashi, Yusuke Kobayashi
2007	J	`jnl`	2-Connected spanning subgraphs with low maximum degree in locally planar graphs. J. Comb. Theory B Mark N. Ellingham, Ken-ichi Kawarabayashi
2007	J	`jnl`	A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory B Ken-ichi Kawarabayashi, Bojan Mohar
2007	J	`jnl`	Chords of longest circuits in locally planar graphs. Eur. J. Comb. Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang
2007	J	`jnl`	Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer
2007	A*	`conf`	Computing crossing number in linear time. STOC Ken-ichi Kawarabayashi, Bruce A. Reed
2007	J	`jnl`	Extremal results for rooted minor problems. J. Graph Theory Leif K. Jørgensen, Ken-ichi Kawarabayashi
2007	A*	`conf`	Half integral packing, Erdős-Posá-property and graph minors. SODA Ken-ichi Kawarabayashi
2007	J	`jnl`	Independence number and clique minors. J. Graph Theory Ken-ichi Kawarabayashi, Zi-Xia Song
2007	J	`jnl`	On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory B Ken-ichi Kawarabayashi
2007	J	`jnl`	Some Recent Progress and Applications in Graph Minor Theory. Graphs Comb. Ken-ichi Kawarabayashi, Bojan Mohar
2007	J	`jnl`	Some remarks on the odd hadwiger's conjecture. Comb. Ken-ichi Kawarabayashi, Zi-Xia Song
2007	J	`jnl`	The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. Discret. Math. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
2006	J	`jnl`	A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory B Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
2006	B	`conf`	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
2006	A*	`conf`	Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. STOC Ken-ichi Kawarabayashi, Bojan Mohar
2006	J	`jnl`	Domination in a graph with a 2-factor. J. Graph Theory Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
2006	J	`jnl`	Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Paul Wollan
2006	J	`jnl`	On Sufficient Degree Conditions for a Graph to be k-linked. Comb. Probab. Comput. Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu
2005	J	`jnl`	Acute triangles in 4-connected maximal plane graphs. Discret. Math. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe
2005	A*	`conf`	Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
2005	J	`jnl`	Any 7-Chromatic Graphs Has Comb. Ken-ichi Kawarabayashi, Bjarne Toft
2005	J	`jnl`	Detecting even holes. J. Graph Theory Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
2005	J	`jnl`	Existence of two disjoint long cycles in graphs. Discret. Math. Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
2005	J	`jnl`	Graph minors and linkages. J. Graph Theory Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei
2005	J	`jnl`	Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. J. Comb. Theory B Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft
2005	J	`jnl`	Non-zero disjoint cycles in highly connected group labeled graphs. Electron. Notes Discret. Math. Ken-ichi Kawarabayashi, Paul Wollan
2005	J	`jnl`	On the structure of Eur. J. Comb. Ken-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang
2005	J	`jnl`	Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2004	J	`jnl`	A theorem on paths in locally planar triangulations. Eur. J. Comb. Ken-ichi Kawarabayashi
2004	J	`jnl`	Cycles through a prescribed vertex set in N-connected graphs. J. Comb. Theory B Ken-ichi Kawarabayashi
2004	J	`jnl`	Orientable and Nonorientable Genera for Some Complete Tripartite Graphs. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha
2004	J	`jnl`	Rooted minor problems in highly connected graphs. Discret. Math. Ken-ichi Kawarabayashi
2004	J	`jnl`	Vertex-disjoint copies of K Discuss. Math. Graph Theory Ken-ichi Kawarabayashi
2004	J	`jnl`	Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
2003	J	`jnl`	2-connected 7-coverings of 3-connected graphs on surfaces. J. Graph Theory Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota
2003	J	`jnl`	Covering vertices of a graph by k disjoint cycles. Discret. Math. Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
2003	J	`jnl`	Cycles having the same modularity and removable edges in 2-connected graphs. Discret. Math. Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito
2003	J	`jnl`	On two equimatchable graph classes. Discret. Math. Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
2003	J	`jnl`	Some forbidden subgraph conditions for a graph to have a Discret. Math. Kiyoshi Ando, Ken-ichi Kawarabayashi
2003	J	`jnl`	Subgraphs of graphs on surfaces with high representativity . J. Comb. Theory B Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota
2003	J	`jnl`	Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2002	J	`jnl`	Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
2002	J	`jnl`	Contractible Edges and Triangles in k-Connected Graphs. J. Comb. Theory B Ken-ichi Kawarabayashi
2002	J	`jnl`	Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2002	J	`jnl`	F-factor and Vertex-disjoint F in a graph. Ars Comb. Ken-ichi Kawarabayashi
2002	J	`jnl`	Graph partition into paths containing specified vertices. Discret. Math. Ken-ichi Kawarabayashi
2002	J	`jnl`	Hamiltonian cycles in J. Graph Theory Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
2002	J	`jnl`	Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. Electron. Notes Discret. Math. Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi
2002	J	`jnl`	On a hamiltonian cycle in which specified vertices are not isolated. Discret. Math. Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto
2002	J	`jnl`	On separable self-complementary graphs. Discret. Math. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe
2002	J	`jnl`	One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture. J. Comb. Theory B Ken-ichi Kawarabayashi
2002	J	`jnl`	Path factors in claw-free graphs. Discret. Math. Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
2002	J	`jnl`	Path factors in cubic graphs. J. Graph Theory Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota
2001	J	`jnl`	Hamiltonian cycles in Discret. Math. Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
2001	J	`jnl`	Note on k-contractible edges in k-connected graphs. Australas. J Comb. Ken-ichi Kawarabayashi
2001	J	`jnl`	Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
2001	J	`jnl`	Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2000	—	`conf`	Geometric Transformations in Plane Triangulations. JCDCG Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe
2000	J	`jnl`	Relative Length of Longest Path and Longest Cycle. Electron. Notes Discret. Math. Ken-ichi Kawarabayashi