Ken-ichi Kawarabayashi
Orcid: 0000-0001-6056-4287Affiliations:
- National Institute of Informatics, NII, Japan
According to our database1,
Ken-ichi Kawarabayashi
authored at least 316 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
J. Comb. Theory, Ser. B, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Findings of the Association for Computational Linguistics: IJCNLP-AACL 2023, 2023
2022
Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis.
CoRR, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Embeddings of Planar Quasimetrics into Directed 𝓁<sub>1</sub> and Polylogarithmic Approximation for Directed Sparsest-Cut.
CoRR, 2021
CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization.
Comput. J., 2021
Proceedings of the Similarity Search and Applications - 14th International Conference, 2021
Proceedings of the 9th International Conference on Learning Representations, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 2021
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
SIAM J. Discret. Math., 2020
Linear min-max relation between the treewidth of an <i>H</i>-minor-free graph and its largest grid minor.
J. Comb. Theory, Ser. B, 2020
The canonical directed tree decomposition and its applications to the directed disjoint paths problem.
CoRR, 2020
Proceedings of the 34th International Symposium on Distributed Computing, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 8th International Conference on Learning Representations, 2020
2019
J. Comb. Theory, Ser. B, 2019
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019
Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization.
Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
ACM Trans. Knowl. Discov. Data, 2018
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs.
SIAM J. Comput., 2018
Netw. Sci., 2018
J. Comb. Theory, Ser. B, 2018
J. Comb. Theory, Ser. B, 2018
Data Min. Knowl. Discov., 2018
Scaling advantages of all-to-all connectivity in physical annealers: the Coherent Ising Machine vs. D-Wave 2000Q.
CoRR, 2018
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log<sup>2</sup> logΔ) Rounds.
CoRR, 2018
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
Proceedings of the 30th International Conference on Scientific and Statistical Database Management, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds.
Proceedings of the Structural Information and Communication Complexity, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the Database and Expert Systems Applications, 2018
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs.
SIAM J. Discret. Math., 2017
J. Graph Theory, 2017
J. ACM, 2017
Proceedings of the 2017 ACM International Conference on Management of Data, 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2016
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two.
ACM Trans. Algorithms, 2016
Soc. Netw. Anal. Min., 2016
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
2015
Fixed-parameter tractability for subset feedback set problems with parity constraints.
Theor. Comput. Sci., 2015
J. Comb. Theory, Ser. B, 2015
Subdivisions of <sub>K</sub><sub>5</sub> in graphs containing <sub>K</sub><sub>2</sub><sub>, </sub><sub>3</sub>.
J. Comb. Theory, Ser. B, 2015
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time.
CoRR, 2015
Comb., 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the 14th IFIP Networking Conference, 2015
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
Proceedings of the 32nd International Conference on Machine Learning, 2015
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, 2015
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
2014
Proc. VLDB Endow., 2014
J. Comput. Sci., 2014
J. Comb. Theory, Ser. B, 2014
Adv. Appl. Math., 2014
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem.
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the International Conference on Management of Data, 2014
Efficient SimRank computation via linearizationPublication of this article pending inquiry.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014
Network structural analysis via core-tree-decomposition Publication of this article pending inquiry.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014
Proceedings of the 31th International Conference on Machine Learning, 2014
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
2013
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs.
ACM Trans. Algorithms, 2013
Math. Oper. Res., 2013
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture.
J. Comb. Theory, Ser. B, 2013
J. Comb. Theory, Ser. B, 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013
Proceedings of the IJCAI 2013, 2013
Proceedings of the Twenty-Fifth Innovative Applications of Artificial Intelligence Conference, 2013
2012
SIAM J. Discret. Math., 2012
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem.
J. Comb. Theory, Ser. B, 2012
J. Comb. Theory, Ser. B, 2012
J. Comb. Theory, Ser. B, 2012
J. Comput. Syst. Sci., 2012
J. Artif. Intell. Res., 2012
Adv. Appl. Math., 2012
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Shortest-path queries for complex networks: exploiting low tree-width outside the core.
Proceedings of the 15th International Conference on Extending Database Technology, 2012
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
2011
ACM Trans. Algorithms, 2011
SIAM J. Discret. Math., 2011
NII Shonan Meet. Rep., 2011
J. Comb. Theory, Ser. B, 2011
J. Comb. Theory, Ser. B, 2011
J. Artif. Intell. Res., 2011
A multi-round generalization of the traveling tournament problem and its application to Japanese baseball.
Eur. J. Oper. Res., 2011
Electron. Notes Discret. Math., 2011
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Breaking o(n<sup>1/2</sup>)-approximation algorithms for the edge-disjoint paths problem with congestion two.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
2010
Theor. Comput. Sci., 2010
SIAM J. Discret. Math., 2010
A note on traversing specified vertices in graphs embedded with large representativity.
Discret. Math., 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Recognizing a Totally Odd K<sub>4</sub>-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the 19th International Conference on Computer Communications and Networks, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
Proceedings of the Approximation, 2010
An <i>O</i>(log<i>n</i>)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs.
Proceedings of the Approximation, 2010
2009
J. Comb. Theory, Ser. B, 2009
J. Comb. Theory, Ser. B, 2009
J. Comb. Theory, Ser. B, 2009
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]
J. Comb. Theory, Ser. B, 2009
J. Comb. Theory, Ser. B, 2009
Discret. Appl. Math., 2009
Algorithmica, 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
A nearly linear time algorithm for the half integral parity disjoint paths packing problem.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
2008
SIAM J. Discret. Math., 2008
Contractible elements in <i>k</i>-connected graphs not containing some specified graphs.
J. Graph Theory, 2008
J. Comb. Theory, Ser. B, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
J. Comb. Theory, Ser. B, 2007
J. Comb. Theory, Ser. B, 2007
Discuss. Math. Graph Theory, 2007
The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces.
Discret. Math., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2006
J. Comb. Theory, Ser. B, 2006
Comb. Probab. Comput., 2006
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
J. Comb. Theory, Ser. B, 2005
Graphs Comb., 2005
Electron. Notes Discret. Math., 2005
Eur. J. Comb., 2005
Any 7-Chromatic Graphs Has <i>K</i><sub>7</sub> Or <i>K</i><sub>4, 4</sub> As A Minor.
Comb., 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
SIAM J. Discret. Math., 2004
J. Graph Theory, 2004
J. Comb. Theory, Ser. B, 2004
Discuss. Math. Graph Theory, 2004
2003
J. Comb. Theory, Ser. B, 2003
Discret. Math., 2003
Discret. Math., 2003
Discret. Math., 2003
2002
J. Comb. Theory, Ser. B, 2002
J. Comb. Theory, Ser. B, 2002
Electron. Notes Discret. Math., 2002
Electron. Notes Discret. Math., 2002
Discret. Math., 2002
F-factor and Vertex-disjoint F in a graph.
Ars Comb., 2002
Contractible Edges and Bowties in a k-Connected Graph.
Ars Comb., 2002
2001
Electron. Notes Discret. Math., 2001
Australas. J Comb., 2001
2000
Electron. Notes Discret. Math., 2000
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000