Representation learning on graphs with jumping knowledge networks K Xu, C Li, Y Tian, T Sonobe, K Kawarabayashi, S Jegelka arXiv preprint arXiv:1806.03536, 2018 | 331 | 2018 |

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 | 276 | 2016 |

Algorithmic graph minor theory: Decomposition, approximation, and coloring ED Demaine, MT Hajiaghayi, K Kawarabayashi 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 637-646, 2005 | 202 | 2005 |

The disjoint paths problem in quadratic time K Kawarabayashi, Y Kobayashi, B Reed Journal of Combinatorial Theory, Series B 102 (2), 424-435, 2012 | 149 | 2012 |

Fast and accurate influence maximization on large networks with pruned monte-carlo simulations N Ohsaka, T Akiba, Y Yoshida, K Kawarabayashi Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014 | 124 | 2014 |

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 | 123 | 2011 |

Computing crossing number in linear time K Kawarabayashi, B Reed Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 111 | 2007 |

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 | 94 | 2019 |

Scalable similarity search for SimRank M Kusumoto, T Maehara, K Kawarabayashi Proceedings of the 2014 ACM SIGMOD international conference on Management of …, 2014 | 88 | 2014 |

Optimal budget allocation: Theoretical guarantee and efficient algorithm T Soma, N Kakimura, K Inaba, K Kawarabayashi International Conference on Machine Learning, 351-359, 2014 | 81 | 2014 |

Shortest-path queries for complex networks: exploiting low tree-width outside the core T Akiba, C Sommer, K Kawarabayashi Proceedings of the 15th International Conference on Extending Database …, 2012 | 75 | 2012 |

A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width K Kawarabayashi, B Mohar, B Reed 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 771-780, 2008 | 74 | 2008 |

Estimating local intrinsic dimensionality L Amsaleg, O Chelly, T Furon, S Girard, ME Houle, K Kawarabayashi, ... Proceedings of the 21th ACM SIGKDD International Conference on Knowledge …, 2015 | 73 | 2015 |

Deterministic edge connectivity in near-linear time K Kawarabayashi, M Thorup Journal of the ACM (JACM) 66 (1), 1-50, 2018 | 70* | 2018 |

A separator theorem in minor-closed classes K Kawarabayashi, B Reed 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 153-162, 2010 | 70 | 2010 |

Fast shortest-path distance queries on road networks by pruned highway labeling T Akiba, Y Iwata, K Kawarabayashi, Y Kawata 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and …, 2014 | 64 | 2014 |

A shorter proof of the graph minor algorithm: the unique linkage theorem K Kawarabayashi, P Wollan Proceedings of the forty-second ACM symposium on Theory of computing, 687-694, 2010 | 64 | 2010 |

Unsupervised cross-domain word representation learning D Bollegala, T Maehara, K Kawarabayashi arXiv preprint arXiv:1505.07184, 2015 | 62 | 2015 |

Any 7-Chromatic Graphs Has *K* _{7} Or *K* _{4,4} As A MinorK Kawarabayashi, B Toft Combinatorica 25 (3), 327-353, 2005 | 62 | 2005 |

The minimum k-way cut of bounded size is fixed-parameter tractable K Kawarabayashi, M Thorup 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 160-169, 2011 | 61 | 2011 |