Чланци са овлашћеним јавним приступом - Ken-ichi KawarabayashiСазнајте више
Није доступно нигде: 1
Towards the graph minor theorems for directed graphs
KI Kawarabayashi, S Kreutzer
International Colloquium on Automata, Languages, and Programming, 3-10, 2015
Овлашћења: European Commission
Доступно негде: 33
Representation learning on graphs with jumping knowledge networks
K Xu, C Li, Y Tian, T Sonobe, K Kawarabayashi, S Jegelka
International conference on machine learning, 5453-5462, 2018
Овлашћења: US National Science Foundation
A coherent Ising machine for 2000-node optimization problems
T Inagaki, Y Haribara, K Igarashi, T Sonobe, S Tamate, T Honjo, ...
Science 354 (6312), 603-606, 2016
Овлашћења: US National Aeronautics and Space Administration
Experimental investigation of performance differences between coherent Ising machines and a quantum annealer
R Hamerly, T Inagaki, PL McMahon, D Venturelli, A Marandi, T Onodera, ...
Science advances 5 (5), eaau0823, 2019
Овлашћења: US National Science Foundation, US Department of Energy, US Department of …
Finding topological subgraphs is fixed-parameter tractable
M Grohe, K Kawarabayashi, D Marx, P Wollan
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Овлашћења: Hungarian Scientific Research Fund
Deterministic edge connectivity in near-linear time
K Kawarabayashi, M Thorup
Journal of the ACM (JACM) 66 (1), 1-50, 2018
Овлашћења: Danish Council for Independent Research, Villum Foundation
The directed grid theorem
K Kawarabayashi, S Kreutzer
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
Овлашћења: German Research Foundation
Coloring 3-Colorable Graphs with Less than n1/5 Colors
K Kawarabayashi, M Thorup
Journal of the ACM (JACM) 64 (1), 1-23, 2017
Овлашћења: Danish Council for Independent Research
Quickly excluding a non-planar graph
K Kawarabayashi, R Thomas, P Wollan
arXiv preprint arXiv:2010.12397, 2020
Овлашћења: US National Science Foundation, European Commission
Packing cycles through prescribed vertices
N Kakimura, K Kawarabayashi, D Marx
Journal of Combinatorial Theory, Series B 101 (5), 378-381, 2011
Овлашћења: Hungarian Scientific Research Fund
K6 minors in large 6-connected graphs
K Kawarabayashi, S Norine, R Thomas, P Wollan
Journal of Combinatorial Theory, Series B 129, 158-203, 2018
Овлашћења: US National Science Foundation, European Commission
A new proof of the flat wall theorem
K Kawarabayashi, R Thomas, P Wollan
Journal of Combinatorial Theory, Series B 129, 204-238, 2018
Овлашћења: US National Science Foundation, European Commission
More compact oracles for approximate distances in undirected planar graphs
K Kawarabayashi, C Sommer, M Thorup
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
Овлашћења: Swiss National Science Foundation
The directed flat wall theorem
AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Овлашћења: European Commission
Directed Tangle Tree-Decompositions and Applications∗
AC Giannopoulou, K Kawarabayashi, S Kreutzer, O Kwon
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Овлашћења: European Commission
Polylogarithmic approximation for minimum planarization (almost)
K Kawarabayashi, A Sidiropoulos
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Овлашћења: US National Science Foundation
K6 minors in 6-connected graphs of bounded tree-width
K Kawarabayashi, S Norine, R Thomas, P Wollan
Journal of Combinatorial Theory, Series B 136, 1-32, 2019
Овлашћења: US National Science Foundation, European Commission
Edge-colouring seven-regular planar graphs
M Chudnovsky, K Edwards, K Kawarabayashi, P Seymour
Journal of Combinatorial Theory, Series B 115, 276-302, 2015
Овлашћења: Natural Sciences and Engineering Research Council of Canada
Polynomial planar directed grid theorem
M Hatzel, K Kawarabayashi, S Kreutzer
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Овлашћења: European Commission
Polylogarithmic approximation for Euler genus on bounded degree graphs
K Kawarabayashi, A Sidiropoulos
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Овлашћења: US National Science Foundation
Публикације и информације о финансирању аутоматски одређује рачунарски програм