default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKen-ichi Kawarabayashi
Person information
- affiliation: National Institute of Informatics, NII, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c150]Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI 2024: 12708-12716- [c149]Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe:
Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. FOCS 2024: 86-105 - [c148]Ken-ichi Kawarabayashi
, Mikkel Thorup, Hirotaka Yoneda:
Better Coloring of 3-Colorable Graphs. STOC 2024: 331-339 - [c147]Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht:
Packing Even Directed Circuits Quarter-Integrally. STOC 2024: 692-703 - [c146]Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Edge-Disjoint Paths in Eulerian Digraphs. STOC 2024: 704-715 - [i63]Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Edge-Disjoint Paths in Eulerian Digraphs. CoRR abs/2402.13716 (2024) - [i62]Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe:
Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem. CoRR abs/2405.16586 (2024) - [i61]Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda:
Better coloring of 3-colorable graphs. CoRR abs/2406.00357 (2024) - [i60]Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta:
An analogue of Reed's conjecture for digraphs. CoRR abs/2407.05827 (2024) - 2023
- [j161]Flora D. Salim, Bingsheng He, Ken-ichi Kawarabayashi:
Welcome. Commun. ACM 66(7): 36-38 (2023) - [j160]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal distributed covering algorithms. Distributed Comput. 36(1): 45-55 (2023) - [j159]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Additive non-approximability of chromatic number in proper minor-closed classes. J. Comb. Theory B 158(Part): 74-92 (2023) - [j158]Koyo Hayashi, Ken-ichi Kawarabayashi:
Rooted topological minors on four vertices. J. Comb. Theory B 158(Part): 146-185 (2023) - [c145]Danushka Bollegala, Shuichi Otake, Tomoya Machide, Ken-ichi Kawarabayashi:
A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings. IJCNLP (Findings) 2023: 65-79 - [c144]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Bandit Task Assignment with Unknown Processing Time. NeurIPS 2023 - [c143]Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie:
A half-integral Erdős-Pósa theorem for directed odd cycles. SODA 2023: 3043-3062 - [i59]Nathan J. Bowler, Florian Gut, Meike Hatzel, Ken-ichi Kawarabayashi, Irene Muzi, Florian Reich:
Decomposition of (infinite) digraphs along directed 1-separations. CoRR abs/2305.09192 (2023) - [i58]Danushka Bollegala, Shuichi Otake, Tomoya Machide, Ken-ichi Kawarabayashi:
A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings. CoRR abs/2309.10551 (2023) - [i57]Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht:
Packing even directed circuits quarter-integrally. CoRR abs/2311.16816 (2023) - [i56]Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR abs/2312.12400 (2023) - 2022
- [c142]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. AAAI 2022: 5199-5207 - [c141]Danushka Bollegala, Tomoya Machide, Ken-ichi Kawarabayashi:
Query Obfuscation by Semantic Decomposition. LREC 2022: 6200-6211 - [c140]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
Directed Tangle Tree-Decompositions and Applications. SODA 2022: 377-405 - [i55]Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Task Assignment Problems with Reusable Resources. CoRR abs/2203.07605 (2022) - [i54]Laurent Amsaleg, Oussama Chelly, Michael E. Houle, Ken-ichi Kawarabayashi, Milos Radovanovic, Weeris Treeratanajaru:
Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis. CoRR abs/2209.14475 (2022) - 2021
- [j157]Diana Popova, Ken-ichi Kawarabayashi, Alex Thomo:
CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization. Comput. J. 64(9): 1343-1357 (2021) - [c139]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI 2021: 9791-9798 - [c138]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS 2021: 3367-3375 - [c137]Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi:
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding. EACL 2021: 1551-1565 - [c136]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut. FOCS 2021: 480-491 - [c135]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. ICALP 2021: 86:1-86:15 - [c134]Keyulu Xu, Mozhi Zhang, Jingling Li, Simon Shaolei Du, Ken-ichi Kawarabayashi, Stefanie Jegelka:
How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks. ICLR 2021 - [c133]Michael E. Houle, Ken-ichi Kawarabayashi:
The Effect of Random Projection on Local Intrinsic Dimensionality. SISAP 2021: 201-214 - [i53]Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR abs/2101.07957 (2021) - [i52]Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi:
RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding. CoRR abs/2101.10070 (2021) - [i51]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Embeddings of Planar Quasimetrics into Directed 𝓁1 and Polylogarithmic Approximation for Directed Sparsest-Cut. CoRR abs/2111.07974 (2021) - 2020
- [j156]Ken-ichi Kawarabayashi:
The NII Shonan meeting in Japan. Commun. ACM 63(4): 48-49 (2020) - [j155]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. J. Comb. Theory B 141: 165-180 (2020) - [j154]Ken-ichi Kawarabayashi, Chao Xu:
Minimum Violation Vertex Maps and Their Applications to Cut Problems. SIAM J. Discret. Math. 34(4): 2183-2207 (2020) - [j153]Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020) - [c132]Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka:
What Can Neural Networks Reason About? ICLR 2020 - [c131]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS 2020 - [c130]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. PODC 2020: 283-285 - [c129]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The Directed Flat Wall Theorem. SODA 2020: 239-258 - [c128]Ken-ichi Kawarabayashi, Bingkai Lin:
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut. SODA 2020: 990-999 - [c127]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximations for Maximum Independent Set. DISC 2020: 35:1-35:16 - [i50]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphism groups of maps in linear time. CoRR abs/2008.01616 (2020) - [i49]Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka:
How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks. CoRR abs/2009.11848 (2020) - [i48]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR abs/2009.13184 (2020) - [i47]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
Quickly excluding a non-planar graph. CoRR abs/2010.12397 (2020)
2010 – 2019
- 2019
- [j152]Ken-ichi Kawarabayashi, Mikkel Thorup:
Deterministic Edge Connectivity in Near-Linear Time. J. ACM 66(1): 4:1-4:50 (2019) - [j151]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in 6-connected graphs of bounded tree-width. J. Comb. Theory B 136: 1-32 (2019) - [c126]Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi:
Stochastic Submodular Maximization with Performance-Dependent Item Costs. AAAI 2019: 1485-1494 - [c125]Mozhi Zhang, Keyulu Xu, Ken-ichi Kawarabayashi, Stefanie Jegelka, Jordan L. Boyd-Graber:
Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization. ACL (1) 2019: 3180-3189 - [c124]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS 2019: 10589-10598 - [c123]Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS 2019: 12027-12036 - [c122]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. PODC 2019: 104-106 - [c121]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) 2019: 568-582 - [c120]Laurent Amsaleg, Oussama Chelly, Michael E. Houle, Ken-ichi Kawarabayashi, Milos Radovanovic, Weeris Treeratanajaru:
Intrinsic Dimensionality Estimation within Tight Localities. SDM 2019: 181-189 - [c119]Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Polynomial Planar Directed Grid Theorem. SODA 2019: 1465-1484 - [c118]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic approximation for Euler genus on bounded degree graphs. STOC 2019: 164-175 - [c117]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. DISC 2019: 5:1-5:15 - [c116]Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. DISC 2019: 6:1-6:16 - [i46]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. CoRR abs/1902.09377 (2019) - [i45]Keyulu Xu, Jingling Li, Mozhi Zhang, Simon S. Du, Ken-ichi Kawarabayashi, Stefanie Jegelka:
What Can Neural Networks Reason About? CoRR abs/1905.13211 (2019) - [i44]Mozhi Zhang, Keyulu Xu, Ken-ichi Kawarabayashi, Stefanie Jegelka, Jordan L. Boyd-Graber:
Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization. CoRR abs/1906.01622 (2019) - [i43]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR abs/1906.05998 (2019) - [i42]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximation to Maximum Independent Set. CoRR abs/1906.11524 (2019) - [i41]Danushka Bollegala, Tomoya Machide, Ken-ichi Kawarabayashi:
Anonymising Queries by Semantic Decomposition. CoRR abs/1909.05819 (2019) - 2018
- [j150]Laurent Amsaleg, Oussama Chelly, Teddy Furon, Stéphane Girard, Michael E. Houle, Ken-ichi Kawarabayashi, Michael Nett:
Extreme-value-theoretic estimation of local intrinsic dimensionality. Data Min. Knowl. Discov. 32(6): 1768-1805 (2018) - [j149]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in large 6-connected graphs. J. Comb. Theory B 129: 158-203 (2018) - [j148]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
A new proof of the flat wall theorem. J. Comb. Theory B 129: 204-238 (2018) - [j147]Naonori Kakimura, Ken-ichi Kawarabayashi:
The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs. J. Comb. Theory B 131: 138-169 (2018) - [j146]Taro Takaguchi, Takanori Maehara, Ken-ichi Kawarabayashi, Masashi Toyoda:
Existence of outsiders as a characteristic of online communication networks. Netw. Sci. 6(4): 431-447 (2018) - [j145]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. 47(4): 1483-1504 (2018) - [j144]Danushka Bollegala, Vincent Atanasov, Takanori Maehara, Ken-ichi Kawarabayashi:
ClassiNet - Predicting Missing Features for Short-Text Classification. ACM Trans. Knowl. Discov. Data 12(5): 55:1-55:29 (2018) - [c115]Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Using k-Way Co-Occurrences for Learning Word Embeddings. AAAI 2018: 5037-5044 - [c114]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Online Regression with Partial Information: Generalization and Linear Projection. AISTATS 2018: 1599-1607 - [c113]Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi:
Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) 2018: 424-439 - [c112]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. ICALP 2018: 47:1-47:12 - [c111]Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, Stefanie Jegelka:
Representation Learning on Graphs with Jumping Knowledge Networks. ICML 2018: 5449-5458 - [c110]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. ICML 2018: 5508-5516 - [c109]Danushka Bollegala, Kohei Hayashi, Ken-ichi Kawarabayashi:
Think Globally, Embed Locally - Locally Linear Meta-embedding of Words. IJCAI 2018: 3970-3976 - [c108]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS 2018: 10611-10620 - [c107]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. SIROCCO 2018: 226-236 - [c106]Ken-ichi Kawarabayashi, Benjamin Rossman:
A Polynomial Excluded-Minor Approximation of Treedepth. SODA 2018: 234-246 - [c105]Diana Popova, Naoto Ohsaka, Ken-ichi Kawarabayashi, Alex Thomo:
NoSingles: a space-efficient algorithm for influence maximization. SSDBM 2018: 18:1-18:12 - [c104]Ken-ichi Kawarabayashi, Gregory Schwartzman:
Adapting Local Sequential Algorithms to the Distributed Setting. DISC 2018: 35:1-35:17 - [i40]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. CoRR abs/1804.01308 (2018) - [i39]Danushka Bollegala, Vincent Atanasov, Takanori Maehara, Ken-ichi Kawarabayashi:
ClassiNet - Predicting Missing Features for Short-Text Classification. CoRR abs/1804.05260 (2018) - [i38]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:
Scaling advantages of all-to-all connectivity in physical annealers: the Coherent Ising Machine vs. D-Wave 2000Q. CoRR abs/1805.05217 (2018) - [i37]Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Causal Bandits with Propagating Inference. CoRR abs/1806.02252 (2018) - [i36]Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, Stefanie Jegelka:
Representation Learning on Graphs with Jumping Knowledge Networks. CoRR abs/1806.03536 (2018) - [i35]Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. CoRR abs/1807.04900 (2018) - [i34]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood:
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR abs/1807.11617 (2018) - [i33]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Weighted Set Cover Approximation. CoRR abs/1808.05809 (2018) - [i32]Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. CoRR abs/1812.08003 (2018) - 2017
- [j143]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. Eur. J. Comb. 66: 95-100 (2017) - [j142]Ken-ichi Kawarabayashi, Mikkel Thorup:
Coloring 3-Colorable Graphs with Less than n1/5 Colors. J. ACM 64(1): 4:1-4:23 (2017) - [j141]Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer:
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory 85(1): 249-257 (2017) - [j140]Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. 31(2): 766-782 (2017) - [c103]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI 2017: 622-628 - [c102]Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. AAAI 2017: 1992-1999 - [c101]Kord Eickmeyer, Ken-ichi Kawarabayashi:
FO Model Checking on Map Graphs. FCT 2017: 204-216 - [c100]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic Approximation for Minimum Planarization (Almost). FOCS 2017: 779-788 - [c99]Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi:
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI 2017: 4412-4418 - [c98]Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi:
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS 2017: 4099-4108 - [c97]Naoto Ohsaka, Tomohiro Sonobe, Sumio Fujita, Ken-ichi Kawarabayashi:
Coarsening Massive Influence Networks for Scalable Diffusion Analysis. SIGMOD Conference 2017: 635-650 - [i31]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Additive non-approximability of chromatic number in proper minor-closed classes. CoRR abs/1707.03888 (2017) - [i30]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic approximation for minimum planarization (almost). CoRR abs/1708.04723 (2017) - [i29]Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Using $k$-way Co-occurrences for Learning Word Embeddings. CoRR abs/1709.01199 (2017) - [i28]Danushka Bollegala, Kohei Hayashi, Ken-ichi Kawarabayashi:
Think Globally, Embed Locally - Locally Linear Meta-embedding of Words. CoRR abs/1709.06671 (2017) - 2016
- [j139]Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král':
Packing six T-joins in plane graphs. J. Comb. Theory B 116: 287-305 (2016) - [j138]Shinya Fujita, Ken-ichi Kawarabayashi:
Non-separating subgraphs in highly connected graphs. J. Comb. Theory B 117: 1-21 (2016) - [j137]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Edge-disjoint odd cycles in 4-edge-connected graphs. J. Comb. Theory B 119: 12-27 (2016) - [j136]Naonori Kakimura, Ken-ichi Kawarabayashi:
Coloring immersion-free graphs. J. Comb. Theory B 121: 284-307 (2016) - [j135]Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Dynamic Influence Analysis in Evolving Networks. Proc. VLDB Endow. 9(12): 1077-1088 (2016) - [j134]Ken-ichi Kawarabayashi, Kenta Ozeki:
5-Connected Toroidal Graphs are Hamiltonian-Connected. SIAM J. Discret. Math. 30(1): 112-140 (2016) - [j133]Ryosuke Nishi, Taro Takaguchi, Keigo Oka, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi, Naoki Masuda:
Reply trees in Twitter: data analysis and branching process models. Soc. Netw. Anal. Min. 6(1): 26:1-26:13 (2016) - [j132]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. ACM Trans. Algorithms 13(1): 5:1-5:17 (2016) - [c96]Takanori Maehara, Kohei Hayashi, Ken-ichi Kawarabayashi:
Expected Tensor Decomposition with Stochastic Gradient Descent. AAAI 2016: 1919-1925 - [c95]Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi:
Joint Word Representation Learning Using a Corpus and a Semantic Lexicon. AAAI 2016: 2690-2696 - [c94]Takanori Hayashi, Takuya Akiba, Ken-ichi Kawarabayashi:
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. CIKM 2016: 1533-1542 - [c93]Kord Eickmeyer, Ken-ichi Kawarabayashi:
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CSL 2016: 18:1-18:15 - [c92]Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi:
Adaptive Budget Allocation for Maximizing Influence of Advertisements. IJCAI 2016: 3600-3608 - [c91]Takuya Konishi, Tomoharu Iwata, Kohei Hayashi, Ken-ichi Kawarabayashi:
Identifying Key Observers to Find Popular Information in Advance. IJCAI 2016: 3761-3767 - [c90]Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi:
Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) 2016: 132-147 - [i27]Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan:
The Erdos-Posa Property for Directed Graphs. CoRR abs/1603.02504 (2016) - [i26]Kord Eickmeyer, Ken-ichi Kawarabayashi:
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CoRR abs/1605.01198 (2016) - [i25]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR abs/1611.07605 (2016) - 2015
- [j131]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Comb. 35(4): 477-495 (2015) - [j130]Richard Hoshino, Ken-ichi Kawarabayashi:
The edge density of critical digraphs. Comb. 35(5): 619-631 (2015) - [j129]Ken-ichi Kawarabayashi, Kenta Ozeki:
4-connected projective-planar graphs are Hamiltonian-connected. J. Comb. Theory B 112: 36-69 (2015) - [j128]Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu:
Subdivisions of K5 in graphs containing K2, 3. J. Comb. Theory B 113: 18-67 (2015) - [j127]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. J. Comb. Theory B 115: 276-302 (2015) - [j126]Naonori Kakimura, Ken-ichi Kawarabayashi:
Fixed-parameter tractability for subset feedback set problems with parity constraints. Theor. Comput. Sci. 576: 61-76 (2015) - [c89]Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi:
Lagrangian Decomposition Algorithm for Allocating Marketing Channels. AAAI 2015: 1144-1150 - [c88]Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Learning Word Representations from Relational Graphs. AAAI 2015: 2146-2152 - [c87]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Unsupervised Cross-Domain Word Representation Learning. ACL (1) 2015: 730-740 - [c86]Ken-ichi Kawarabayashi, Stephan Kreutzer:
Towards the Graph Minor Theorems for Directed Graphs. ICALP (2) 2015: 3-10 - [c85]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Scalable SimRank join algorithm. ICDE 2015: 603-614 - [c84]Takanori Maehara, Akihiro Yabe, Ken-ichi Kawarabayashi:
Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View. ICML 2015: 428-437 - [c83]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Embedding Semantic Relations into Word Representations. IJCAI 2015: 1222-1228 - [c82]Laurent Amsaleg, Oussama Chelly, Teddy Furon, Stéphane Girard, Michael E. Houle, Ken-ichi Kawarabayashi, Michael Nett:
Estimating Local Intrinsic Dimensionality. KDD 2015: 29-38 - [c81]Kohei Hayashi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi:
Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering. KDD 2015: 417-426 - [c80]Naoto Ohsaka, Takanori Maehara, Ken-ichi Kawarabayashi:
Efficient PageRank Tracking in Evolving Networks. KDD 2015: 875-884 - [c79]Yasushi Kawase, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable sensor localization via ball-decomposition algorithm. Networking 2015: 1-9 - [c78]Ken-ichi Kawarabayashi, Stephan Kreutzer:
The Directed Grid Theorem. STOC 2015: 655-664 - [c77]Ken-ichi Kawarabayashi, Mikkel Thorup:
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. STOC 2015: 665-674 - [c76]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Beyond the Euler Characteristic: Approximating the Genus of General Graphs. STOC 2015: 675-682 - [i24]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Embedding Semantic Relations into Word Representations. CoRR abs/1505.00161 (2015) - [i23]Danushka Bollegala, Takanori Maehara, Ken-ichi Kawarabayashi:
Unsupervised Cross-Domain Word Representation Learning. CoRR abs/1505.07184 (2015) - [i22]Ken-ichi Kawarabayashi:
The odd Hadwiger's conjecture is "almost" decidable. CoRR abs/1508.04053 (2015) - [i21]Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed:
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time. CoRR abs/1509.07680 (2015) - [i20]Ken-ichi Kawarabayashi:
Graph Isomorphism for Bounded Genus Graphs In Linear Time. CoRR abs/1511.02460 (2015) - [i19]Danushka Bollegala, Mohammed Alsuhaibani, Takanori Maehara, Ken-ichi Kawarabayashi:
Joint Word Representation Learning using a Corpus and a Semantic Lexicon. CoRR abs/1511.06438 (2015) - 2014
- [j125]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Minimum degree conditions for vertex-disjoint even cycles in large graphs. Adv. Appl. Math. 54: 105-120 (2014) - [j124]Shinya Fujita, Ken-ichi Kawarabayashi:
A connected subgraph maintaining high connectivity. Eur. J. Comb. 35: 245-255 (2014) - [j123]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed:
Removable paths and cycles with parity constraints. J. Comb. Theory B 106: 115-133 (2014) - [j122]Ken-ichi Kawarabayashi, Kenta Ozeki:
Spanning closed walks and TSP in 3-connected planar graphs. J. Comb. Theory B 109: 1-33 (2014) - [j121]Michael Lülfesmann, Ken-ichi Kawarabayashi:
Sub-exponential graph coloring algorithm for stencil-based Jacobian computations. J. Comput. Sci. 5(1): 1-11 (2014) - [j120]Takanori Maehara, Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi:
Computing Personalized PageRank Quickly by Exploiting Graph Structures. Proc. VLDB Endow. 7(12): 1023-1034 (2014) - [c75]Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. AAAI 2014: 138-144 - [c74]Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal:
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI 2014: 2271-2277 - [c73]Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata:
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. ALENEX 2014: 147-154 - [c72]Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi:
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML 2014: 351-359 - [c71]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Efficient SimRank computation via linearizationPublication of this article pending inquiry. KDD 2014: 1426-1435 - [c70]Takuya Akiba, Takanori Maehara, Ken-ichi Kawarabayashi:
Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. KDD 2014: 1476-1485 - [c69]Mitsuru Kusumoto, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable similarity search for SimRank. SIGMOD Conference 2014: 325-336 - [c68]Ken-ichi Kawarabayashi, Stephan Kreutzer:
An Excluded Grid Theorem for Digraphs with Forbidden Minors. SODA 2014: 72-81 - [c67]Ken-ichi Kawarabayashi, Mikkel Thorup:
Coloring 3-colorable graphs with o(n^{1/5}) colors. STACS 2014: 458-469 - [c66]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer:
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. STOC 2014: 70-78 - [c65]Michael Elberfeld, Ken-ichi Kawarabayashi:
Embedding and canonizing graphs of bounded genus in logspace. STOC 2014: 383-392 - [i18]Richard Hoshino, Ken-ichi Kawarabayashi:
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. CoRR abs/1401.3909 (2014) - [i17]Richard Hoshino, Ken-ichi Kawarabayashi:
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. CoRR abs/1401.6049 (2014) - [i16]Ken-ichi Kawarabayashi, Mikkel Thorup:
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. CoRR abs/1411.5123 (2014) - [i15]Ken-ichi Kawarabayashi, Stephan Kreutzer:
The Directed Grid Theorem. CoRR abs/1411.5681 (2014) - [i14]Taro Takaguchi, Takanori Maehara, Masashi Toyoda, Ken-ichi Kawarabayashi:
Existence of outsiders as a characteristic of online communication networks. CoRR abs/1411.7091 (2014) - [i13]Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi:
Efficient SimRank Computation via Linearization. CoRR abs/1411.7228 (2014) - [i12]Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Beyond the Euler characteristic: Approximating the genus of general graphs. CoRR abs/1412.1792 (2014) - [i11]Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Learning Word Representations from Relational Graphs. CoRR abs/1412.2378 (2014) - 2013
- [j119]Naonori Kakimura, Ken-ichi Kawarabayashi:
Half-integral packing of odd cycles through prescribed vertices. Comb. 33(5): 549-572 (2013) - [j118]Ken-ichi Kawarabayashi, Kenta Ozeki:
A simpler proof for the two disjoint odd cycles theorem. J. Comb. Theory B 103(3): 313-319 (2013) - [j117]Ken-ichi Kawarabayashi, Gexin Yu:
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory B 103(3): 320-326 (2013) - [j116]Richard Hoshino, Ken-ichi Kawarabayashi:
An Approximation Algorithm for the Bipartite Traveling Tournament Problem. Math. Oper. Res. 38(4): 720-728 (2013) - [j115]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Trans. Algorithms 9(2): 16:1-16:13 (2013) - [c64]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. FOCS 2013: 187-196 - [c63]Richard Hoshino, Ken-ichi Kawarabayashi:
Balancing the Traveling Tournament Problem for Weekday and Weekend Games. IAAI 2013: 1525-1531 - [c62]Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Mining for Analogous Tuples from an Entity-Relation Graph. IJCAI 2013: 2064-2070 - [c61]Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. LICS 2013: 134-142 - [c60]Kord Eickmeyer, Ken-ichi Kawarabayashi:
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. SAGT 2013: 134-145 - [c59]Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer:
Packing directed cycles through a specified vertex set. SODA 2013: 365-377 - [c58]Ken-ichi Kawarabayashi, Kenta Ozeki:
4-connected projective-planar graphs are hamiltonian-connected. SODA 2013: 378-395 - [c57]Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed:
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA 2013: 414-431 - [c56]Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup:
More Compact Oracles for Approximate Distances in Undirected Planar Graphs. SODA 2013: 550-563 - [c55]Ken-ichi Kawarabayashi:
5-coloring K3, k-minor-free graphs: Beyond Thomassen. SODA 2013: 985-1003 - [c54]Zdenek Dvorák, Ken-ichi Kawarabayashi:
List-coloring embedded graphs. SODA 2013: 1004-1012 - [c53]Ken-ichi Kawarabayashi:
Totally odd subdivisions and parity subdivisions: Structures and Coloring. SODA 2013: 1013-1029 - [c52]Ken-ichi Kawarabayashi, Yuichi Yoshida:
Testing subdivision-freeness: property testing meets structural graph theory. STOC 2013: 437-446 - [i10]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. CoRR abs/1302.5121 (2013) - 2012
- [j114]Naonori Kakimura, Ken-ichi Kawarabayashi:
Packing cycles through prescribed vertices under modularity constraints. Adv. Appl. Math. 49(2): 97-110 (2012) - [j113]Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and Flat Embeddings in 3-Space. Discret. Comput. Geom. 47(4): 731-755 (2012) - [j112]Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi:
Minimally contraction-critically 6-connected graphs. Discret. Math. 312(3): 671-679 (2012) - [j111]Richard Hoshino, Ken-ichi Kawarabayashi:
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation. J. Artif. Intell. Res. 45: 257-286 (2012) - [j110]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. 78(2): 670-680 (2012) - [j109]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed:
The disjoint paths problem in quadratic time. J. Comb. Theory B 102(2): 424-435 (2012) - [j108]Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan:
The Erdős-Pósa property for clique minors in highly connected graphs. J. Comb. Theory B 102(2): 454-469 (2012) - [j107]Ken-ichi Kawarabayashi, Carsten Thomassen:
From the plane to higher surfaces. J. Comb. Theory B 102(4): 852-868 (2012) - [j106]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory B 102(4): 1020-1034 (2012) - [j105]Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan:
On the excluded minor structure theorem for graphs of large tree-width. J. Comb. Theory B 102(6): 1189-1210 (2012) - [j104]Ken-ichi Kawarabayashi, John Maharry:
Minors in large almost-5-connected non-planar graphs. J. Graph Theory 71(2): 128-141 (2012) - [j103]Naonori Kakimura, Ken-ichi Kawarabayashi:
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally. SIAM J. Discret. Math. 26(3): 1121-1133 (2012) - [c51]Richard Hoshino, Ken-ichi Kawarabayashi:
The Linear Distance Traveling Tournament Problem. AAAI 2012: 1770-1778 - [c50]Ken-ichi Kawarabayashi, David R. Wood:
Cliques in Odd-Minor-Free Graphs. CATS 2012: 133-138 - [c49]Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi:
Shortest-path queries for complex networks: exploiting low tree-width outside the core. EDBT 2012: 144-155 - [c48]Ken-ichi Kawarabayashi, Mikkel Thorup:
Combinatorial Coloring of 3-Colorable Graphs. FOCS 2012: 68-75 - [c47]Ken-ichi Kawarabayashi, Kenta Ozeki:
Spanning closed walks and TSP in 3-connected planar graphs. SODA 2012: 671-682 - [c46]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
List-coloring graphs without subdivisions and without immersions. SODA 2012: 1425-1435 - [c45]Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA 2012: 1726-1736 - [c44]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS 2012: 206-217 - [c43]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS 2012: 278-289 - [i9]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in 6-connected graphs of bounded tree-width. CoRR abs/1203.2171 (2012) - [i8]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in large 6-connected graphs. CoRR abs/1203.2192 (2012) - [i7]Ken-ichi Kawarabayashi, Mikkel Thorup:
Combinatorial coloring of 3-colorable graphs. CoRR abs/1205.1254 (2012) - [i6]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. CoRR abs/1210.7349 (2012) - [i5]Zdenek Dvorák, Ken-ichi Kawarabayashi:
List-coloring embedded graphs. CoRR abs/1210.7605 (2012) - 2011
- [j102]Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota:
Toughness of Ka,t-Minor-Free Graphs. Electron. J. Comb. 18(1) (2011) - [j101]Shinya Fujita, Ken-ichi Kawarabayashi:
High connectivity keeping connected subgraph. Electron. Notes Discret. Math. 38: 355-360 (2011) - [j100]Ken-ichi Kawarabayashi, Kenta Ozeki:
Hamilton cycles in 4-connected troidal triangulations. Electron. Notes Discret. Math. 38: 493-498 (2011) - [j99]Richard Hoshino, Ken-ichi Kawarabayashi:
A multi-round generalization of the traveling tournament problem and its application to Japanese baseball. Eur. J. Oper. Res. 215(2): 481-497 (2011) - [j98]Richard Hoshino, Ken-ichi Kawarabayashi:
Scheduling Bipartite Tournaments to Minimize Total Travel Distance. J. Artif. Intell. Res. 42: 91-124 (2011) - [j97]Ken-ichi Kawarabayashi, Kenta Ozeki:
Non-separating subgraphs after deleting many disjoint paths. J. Comb. Theory B 101(1): 54-59 (2011) - [j96]Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki:
The 2-extendability of 5-connected graphs on surfaces with large representativity. J. Comb. Theory B 101(4): 206-213 (2011) - [j95]Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx:
Packing cycles through prescribed vertices. J. Comb. Theory B 101(5): 378-381 (2011) - [j94]Ken-ichi Kawarabayashi, Kenta Ozeki:
2- and 3-factors of graphs on surfaces. J. Graph Theory 67(4): 306-315 (2011) - [j93]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discret. Math. 25(3): 1322-1330 (2011) - [j92]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms 7(4): 41:1-41:14 (2011) - [c42]Richard Hoshino, Ken-ichi Kawarabayashi:
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling. AAAI 2011: 977-984 - [c41]Richard Hoshino, Ken-ichi Kawarabayashi:
The Multi-Round Balanced Traveling Tournament Problem. ICAPS 2011 - [c40]Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan:
The Graph Minor Algorithm with Parity Conditions. FOCS 2011: 27-36 - [c39]Ken-ichi Kawarabayashi, Mikkel Thorup:
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. FOCS 2011: 160-169 - [c38]Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer:
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs. ICALP (1) 2011: 135-146 - [c37]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. STOC 2011: 81-88 - [c36]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450 - [c35]Ken-ichi Kawarabayashi, Paul Wollan:
A simpler algorithm and shorter proof for the graph minor decomposition. STOC 2011: 451-458 - [c34]Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan:
Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488 - [c33]Ken-ichi Kawarabayashi:
The Disjoint Paths Problem: Algorithm and Structure. WALCOM 2011: 2-7 - [i4]Ken-ichi Kawarabayashi, Mikkel Thorup:
Minimum k-way cut of bounded size is fixed-parameter tractable. CoRR abs/1101.4689 (2011) - [i3]Ken-ichi Kawarabayashi, Philip N. Klein, Christian Sommer:
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs. CoRR abs/1104.5214 (2011) - [i2]Satoru Iwata, Ken-ichi Kawarabayashi:
Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1). NII Shonan Meet. Rep. 2011 (2011) - 2010
- [j91]Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura:
Immersing small complete graphs. Ars Math. Contemp. 3(2): 139-146 (2010) - [j90]Shinya Fujita, Ken-ichi Kawarabayashi:
Non-separating even cycles in highly connected graphs. Comb. 30(5): 565-580 (2010) - [j89]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Algorithms for finding an induced cycle in planar graphs. Comb. 30(6): 715-734 (2010) - [j88]Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft:
Double-Critical Graphs and Complete Minors. Electron. J. Comb. 17(1) (2010) - [j87]Ken-ichi Kawarabayashi, Michael D. Plummer:
A note on traversing specified vertices in graphs embedded with large representativity. Discret. Math. 310(20): 2655-2661 (2010) - [j86]Shinya Fujita, Ken-ichi Kawarabayashi:
Contractible Small Subgraphs in k-connected Graphs. Graphs Comb. 26(4): 499-511 (2010) - [j85]Tatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto:
Dominating sets in triangulations on surfaces. J. Graph Theory 63(1): 17-30 (2010) - [j84]Ken-ichi Kawarabayashi, Bojan Mohar:
Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discret. Math. 24(1): 56-71 (2010) - [j83]Ken-ichi Kawarabayashi, Kenta Ozeki:
A simple algorithm for 4-coloring 3-colorable planar graphs. Theor. Comput. Sci. 411(26-28): 2619-2622 (2010) - [c32]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. APPROX-RANDOM 2010: 274-286 - [c31]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM 2010: 287-297 - [c30]Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and flat embeddings in 3-space and the unknot problem. SCG 2010: 97-106 - [c29]Ken-ichi Kawarabayashi, Bruce A. Reed:
A Separator Theorem in Minor-Closed Classes. FOCS 2010: 153-162 - [c28]Ken-ichi Kawarabayashi, Fawad Nazir, Helmut Prendinger:
Message Duplication Reduction in Dense Mobile Social Networks. ICCCN 2010: 1-6 - [c27]Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed:
Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. SODA 2010: 318-328 - [c26]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344 - [c25]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA 2010: 345-353 - [c24]Ken-ichi Kawarabayashi, Bruce A. Reed:
An (almost) Linear Time Algorithm for Odd Cyles Transversal. SODA 2010: 365-378 - [c23]Ken-ichi Kawarabayashi, Paul Wollan:
A shorter proof of the graph minor algorithm: the unique linkage theorem. STOC 2010: 687-694 - [c22]Ken-ichi Kawarabayashi, Bruce A. Reed:
Odd cycle packing. STOC 2010: 695-704 - [i1]Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan:
Finding topological subgraphs is fixed-parameter tractable. CoRR abs/1011.1827 (2010)
2000 – 2009
- 2009
- [j82]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica 54(2): 142-180 (2009) - [j81]Ken-ichi Kawarabayashi, Bruce A. Reed:
Highly parity linked graphs. Comb. 29(2): 215-225 (2009) - [j80]Shinya Fujita, Ken-ichi Kawarabayashi:
Note on non-separating and removable cycles in highly connected graphs. Discret. Appl. Math. 157(2): 398-399 (2009) - [j79]Ken-ichi Kawarabayashi:
List-coloring graphs without K4, k-minors. Discret. Appl. Math. 157(4): 659-662 (2009) - [j78]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Disjoint Even Cycles Packing. Electron. Notes Discret. Math. 34: 113-119 (2009) - [j77]Ken-ichi Kawarabayashi, Michael D. Plummer:
Bounding the Size of Equimatchable Graphs of Fixed Genus. Graphs Comb. 25(1): 91-99 (2009) - [j76]Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee:
Removable cycles in non-bipartite graphs. J. Comb. Theory B 99(1): 30-38 (2009) - [j75]Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory B 99(1): 97-109 (2009) - [j74]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki:
N-flips in even triangulations on surfaces. J. Comb. Theory B 99(1): 229-246 (2009) - [j73]Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. J. Comb. Theory B 99(2): 323 (2009) - [j72]Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors. J. Comb. Theory B 99(3): 557-582 (2009) - [j71]Ken-ichi Kawarabayashi, Carsten Thomassen:
Decomposing a planar graph of girth 5 into an independent set and a forest. J. Comb. Theory B 99(4): 674-684 (2009) - [j70]Ken-ichi Kawarabayashi:
Note on coloring graphs without odd-Kk-minors. J. Comb. Theory B 99(4): 728-731 (2009) - [j69]Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23(1): 372-383 (2009) - [c21]Ken-ichi Kawarabayashi:
Planarity Allowing Few Error Vertices in Linear Time. FOCS 2009: 639-648 - [c20]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327 - [c19]Yusuke Kobayashi, Ken-ichi Kawarabayashi:
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155 - [c18]Ken-ichi Kawarabayashi, Bojan Mohar:
List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165 - [c17]Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi:
Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175 - [c16]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182 - [c15]Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. SODA 2009: 1183-1192 - [c14]Ken-ichi Kawarabayashi, Bruce A. Reed:
Hadwiger's conjecture is decidable. STOC 2009: 445-454 - 2008
- [j68]Ken-ichi Kawarabayashi:
A Weakening of the Odd Hadwiger's Conjecture. Comb. Probab. Comput. 17(6): 815-821 (2008) - [j67]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Discret. Math. 308(4): 597-602 (2008) - [j66]Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita:
Long cycles in graphs without hamiltonian paths. Discret. Math. 308(24): 5899-5906 (2008) - [j65]Ken-ichi Kawarabayashi, Bruce A. Reed:
Fractional coloring and the odd Hadwiger's conjecture. Eur. J. Comb. 29(2): 411-417 (2008) - [j64]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki:
N-Flips in even triangulations on surfaces. Electron. Notes Discret. Math. 31: 99-104 (2008) - [j63]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31: 235-240 (2008) - [j62]Robert E. L. Aldred, Ken-ichi Kawarabayashi, Michael D. Plummer:
On the matching extendability of graphs in surfaces. J. Comb. Theory B 98(1): 105-115 (2008) - [j61]Shinya Fujita, Ken-ichi Kawarabayashi:
Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory B 98(4): 805-811 (2008) - [j60]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan:
A weaker version of Lovász' path removal conjecture. J. Comb. Theory B 98(5): 972-979 (2008) - [j59]Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar:
Locally planar graphs are 5-choosable. J. Comb. Theory B 98(6): 1215-1232 (2008) - [j58]Shinya Fujita, Ken-ichi Kawarabayashi:
Contractible elements in k-connected graphs not containing some specified graphs. J. Graph Theory 58(2): 97-109 (2008) - [j57]Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. SIAM J. Discret. Math. 21(4): 1061-1070 (2008) - [j56]Ken-ichi Kawarabayashi, Raiji Mukae, Atsuhiro Nakamoto:
K6-Minors in Triangulations on the Klein Bottle. SIAM J. Discret. Math. 23(1): 96-108 (2008) - [c13]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood:
Improved upper bounds on the crossing number. SCG 2008: 375-384 - [c12]Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed:
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS 2008: 771-780 - [c11]Ken-ichi Kawarabayashi:
Approximating List-Coloring on a Fixed Surface. ICALP (1) 2008: 333-344 - [c10]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Induced Disjoint Paths Problem. IPCO 2008: 47-61 - [c9]Ken-ichi Kawarabayashi:
An Improved Algorithm for Finding Cycles Through Elements. IPCO 2008: 374-384 - [c8]Ken-ichi Kawarabayashi, Bruce A. Reed:
A nearly linear time algorithm for the half integral disjoint paths packing. SODA 2008: 446-454 - [c7]Ken-ichi Kawarabayashi, Bojan Mohar:
Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480 - 2007
- [j55]Ken-ichi Kawarabayashi, Zi-Xia Song:
Some remarks on the odd hadwiger's conjecture. Comb. 27(4): 429-438 (2007) - [j54]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto:
The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. Discret. Math. 307(6): 764-768 (2007) - [j53]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - [j52]Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang:
Chords of longest circuits in locally planar graphs. Eur. J. Comb. 28(1): 315-321 (2007) - [j51]Ken-ichi Kawarabayashi, Bojan Mohar:
Some Recent Progress and Applications in Graph Minor Theory. Graphs Comb. 23(1): 1-46 (2007) - [j50]Ken-ichi Kawarabayashi:
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory B 97(1): 144-150 (2007) - [j49]Mark N. Ellingham, Ken-ichi Kawarabayashi:
2-Connected spanning subgraphs with low maximum degree in locally planar graphs. J. Comb. Theory B 97(3): 401-412 (2007) - [j48]Ken-ichi Kawarabayashi, Bojan Mohar:
A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory B 97(4): 647-651 (2007) - [j47]Leif K. Jørgensen, Ken-ichi Kawarabayashi:
Extremal results for rooted minor problems. J. Graph Theory 55(3): 191-207 (2007) - [j46]Ken-ichi Kawarabayashi, Zi-Xia Song:
Independence number and clique minors. J. Graph Theory 56(3): 219-226 (2007) - [c6]Ken-ichi Kawarabayashi:
Half integral packing, Erdős-Posá-property and graph minors. SODA 2007: 1187-1196 - [c5]Ken-ichi Kawarabayashi, Bruce A. Reed:
Computing crossing number in linear time. STOC 2007: 382-390 - 2006
- [j45]Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu:
On Sufficient Degree Conditions for a Graph to be k-linked. Comb. Probab. Comput. 15(5): 685-694 (2006) - [j44]Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory B 96(2): 296-301 (2006) - [j43]Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito:
A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory B 96(3): 315-324 (2006) - [j42]Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
Domination in a graph with a 2-factor. J. Graph Theory 52(1): 1-6 (2006) - [c4]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15 - [c3]Ken-ichi Kawarabayashi, Bojan Mohar:
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. STOC 2006: 401-416 - 2005
- [j41]Ken-ichi Kawarabayashi, Bjarne Toft:
Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. Comb. 25(3): 327-353 (2005) - [j40]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe:
Acute triangles in 4-connected maximal plane graphs. Discret. Math. 292(1-3): 95-106 (2005) - [j39]Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang:
Existence of two disjoint long cycles in graphs. Discret. Math. 305(1-3): 154-169 (2005) - [j38]Ken-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang:
On the structure of k-connected graphs without Kk-minor. Eur. J. Comb. 26(3-4): 293-308 (2005) - [j37]Ken-ichi Kawarabayashi, Paul Wollan:
Non-zero disjoint cycles in highly connected group labeled graphs. Electron. Notes Discret. Math. 22: 271-275 (2005) - [j36]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. 21(1): 27-37 (2005) - [j35]Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft:
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture. J. Comb. Theory B 95(1): 152-167 (2005) - [j34]Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour:
Detecting even holes. J. Graph Theory 48(2): 85-111 (2005) - [j33]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - [c2]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646 - 2004
- [j32]Ken-ichi Kawarabayashi:
Rooted minor problems in highly connected graphs. Discret. Math. 287(1-3): 121-123 (2004) - [j31]Ken-ichi Kawarabayashi:
Vertex-disjoint copies of K4-. Discuss. Math. Graph Theory 24(2): 249-262 (2004) - [j30]Ken-ichi Kawarabayashi:
A theorem on paths in locally planar triangulations. Eur. J. Comb. 25(6): 781-784 (2004) - [j29]Ken-ichi Kawarabayashi:
Cycles through a prescribed vertex set in N-connected graphs. J. Comb. Theory B 90(2): 315-323 (2004) - [j28]Ken-ichi Kawarabayashi:
K-linked graphs with girth condition. J. Graph Theory 45(1): 48-50 (2004) - [j27]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46(3): 145-166 (2004) - [j26]Ken-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha:
Orientable and Nonorientable Genera for Some Complete Tripartite Graphs. SIAM J. Discret. Math. 18(3): 479-487 (2004) - 2003
- [j25]Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito:
Cycles having the same modularity and removable edges in 2-connected graphs. Discret. Math. 265(1-3): 23-30 (2003) - [j24]Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
On two equimatchable graph classes. Discret. Math. 266(1-3): 263-274 (2003) - [j23]Kiyoshi Ando, Ken-ichi Kawarabayashi:
Some forbidden subgraph conditions for a graph to have a k-contractible edge. Discret. Math. 267(1-3): 3-11 (2003) - [j22]Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang:
Covering vertices of a graph by k disjoint cycles. Discret. Math. 270(1-3): 114-124 (2003) - [j21]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. 273(1-3): 55-69 (2003) - [j20]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota:
Subgraphs of graphs on surfaces with high representativity . J. Comb. Theory B 89(2): 207-229 (2003) - [j19]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota:
2-connected 7-coverings of 3-connected graphs on surfaces. J. Graph Theory 43(1): 26-36 (2003) - 2002
- [j18]Ken-ichi Kawarabayashi:
F-factor and Vertex-disjoint F in a graph. Ars Comb. 62 (2002) - [j17]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto:
Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002) - [j16]Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
Path factors in claw-free graphs. Discret. Math. 243(1-3): 195-200 (2002) - [j15]Ken-ichi Kawarabayashi:
Graph partition into paths containing specified vertices. Discret. Math. 248(1-3): 271-277 (2002) - [j14]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe:
On separable self-complementary graphs. Discret. Math. 257(1): 165-168 (2002) - [j13]Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto:
On a hamiltonian cycle in which specified vertices are not isolated. Discret. Math. 258(1-3): 85-91 (2002) - [j12]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. 11: 20-29 (2002) - [j11]Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. Electron. Notes Discret. Math. 11: 253-264 (2002) - [j10]Ken-ichi Kawarabayashi:
One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture. J. Comb. Theory B 84(1): 1-44 (2002) - [j9]Ken-ichi Kawarabayashi:
Contractible Edges and Triangles in k-Connected Graphs. J. Comb. Theory B 85(2): 207-221 (2002) - [j8]Ken-ichi Kawarabayashi:
K4--factor in a graph. J. Graph Theory 39(2): 111-128 (2002) - [j7]Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota:
Path factors in cubic graphs. J. Graph Theory 39(3): 188-193 (2002) - [j6]Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-extendable graphs. J. Graph Theory 40(2): 75-82 (2002) - 2001
- [j5]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23: 37-48 (2001) - [j4]Ken-ichi Kawarabayashi:
Note on k-contractible edges in k-connected graphs. Australas. J Comb. 24: 165-168 (2001) - [j3]Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-factor-critical graphs. Discret. Math. 240(1-3): 71-82 (2001) - [j2]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. 10: 2-6 (2001) - 2000
- [j1]Ken-ichi Kawarabayashi:
Relative Length of Longest Path and Longest Cycle. Electron. Notes Discret. Math. 5: 201 (2000) - [c1]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe:
Geometric Transformations in Plane Triangulations. JCDCG 2000: 217-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
