pith. machine review for the scientific record. sign in

Ken-ichi Kawarabayashi

Identifiers

  • name variant Ken-ichi Kawarabayashi 0.60 · backfill

Papers (55)

  1. Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width cs.DM · 2026 · author #2
  2. EPTAS for Hard Graph Cut Problems for Dense Graphs cs.DS · 2026 · author #2
  3. A polynomial bound for the minimal excluded minors for a surface math.CO · 2026 · author #2
  4. The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring math.CO · 2026 · author #2
  5. Online Graph Coloring for $k$-Colorable Graphs cs.DS · 2025 · author #1
  6. Edge-colouring and orientations: applications to degree- and $\chi$-boundedness math.CO · 2025 · author #2
  7. Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising cs.GT · 2019 · author #6
  8. Optimal Distributed Covering Algorithms cs.DC · 2019 · author #3
  9. Optimal Distributed Weighted Set Cover Approximation cs.DC · 2018 · author #3
  10. Tight Upper Bounds on the Crossing Number in a Minor-Closed Class math.CO · 2018 · author #2
  11. Parameterized Distributed Algorithms cs.DC · 2018 · author #2
  12. Representation Learning on Graphs with Jumping Knowledge Networks cs.LG · 2018 · author #5
  13. Causal Bandits with Propagating Inference stat.ML · 2018 · author #7
  14. Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer quant-ph · 2018 · author #16
  15. ClassiNet -- Predicting Missing Features for Short-Text Classification cs.CL · 2018 · author #4
  16. A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds cs.DC · 2018 · author #3
  17. Adapting Local Sequential Algorithms to the Distributed Setting cs.DC · 2017 · author #1
  18. Think Globally, Embed Locally --- Locally Linear Meta-embedding of Words cs.CL · 2017 · author #3
  19. Using $k$-way Co-occurrences for Learning Word Embeddings cs.CL · 2017 · author #3
  20. Polylogarithmic approximation for minimum planarization (almost) cs.DS · 2017 · author #1
  21. Additive non-approximability of chromatic number in proper minor-closed classes cs.DM · 2017 · author #2
  22. Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable math.CO · 2017 · author #2
  23. Optimal Pricing for Submodular Valuations with Bounded Curvature cs.GT · 2016 · author #5
  24. Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs cs.LO · 2016 · author #2
  25. The Erdos-Posa Property for Directed Graphs cs.DM · 2016 · author #2
  26. Joint Word Representation Learning using a Corpus and a Semantic Lexicon cs.CL · 2015 · author #4
  27. Graph Isomorphism for Bounded Genus Graphs In Linear Time cs.DS · 2015 · author #1
  28. Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time cs.DS · 2015 · author #1
  29. The odd Hadwiger's conjecture is "almost'' decidable math.CO · 2015 · author #1
  30. Unsupervised Cross-Domain Word Representation Learning cs.CL · 2015 · author #3
  31. Embedding Semantic Relations into Word Representations cs.CL · 2015 · author #3
  32. A coherent Ising machine for MAX-CUT problems : Performance evaluation against semidefinite programming relaxation and simulated annealing quant-ph · 2015 · author #3
  33. Learning Word Representations from Relational Graphs cs.CL · 2014 · author #4
  34. Beyond the Euler characteristic: Approximating the genus of general graphs cs.DS · 2014 · author #1
  35. Efficient SimRank Computation via Linearization cs.DS · 2014 · author #3
  36. Existence of outsiders as a characteristic of online communication networks physics.soc-ph · 2014 · author #4
  37. Deterministic Edge Connectivity in Near-Linear Time cs.DS · 2014 · author #1
  38. Linkages in Large Graphs of Bounded Tree-Width math.CO · 2014 · author #2
  39. Generating Approximate Solutions to the TTP using a Linear Distance Relaxation cs.AI · 2014 · author #2
  40. Scheduling Bipartite Tournaments to Minimize Total Travel Distance cs.AI · 2014 · author #2
  41. Three-coloring triangle-free planar graphs in linear time math.CO · 2013 · author #2
  42. List-coloring embedded graphs cs.DS · 2012 · author #2
  43. Edge-colouring seven-regular planar graphs cs.DM · 2012 · author #3
  44. A New Proof of the Flat Wall Theorem math.CO · 2012 · author #1
  45. Combinatorial coloring of 3-colorable graphs cs.DM · 2012 · author #1
  46. K_6 minors in large 6-connected graphs math.CO · 2012 · author #1
  47. K_6 minors in 6-connected graphs of bounded tree-width math.CO · 2012 · author #1
  48. Choosability of planar graphs of girth 5 math.CO · 2011 · author #2
  49. Cliques in Odd-Minor-Free Graphs math.CO · 2011 · author #1
  50. Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs cs.DS · 2011 · author #1
  51. Minimum k-way cut of bounded size is fixed-parameter tractable cs.DM · 2011 · author #1
  52. Finding topological subgraphs is fixed-parameter tractable cs.DS · 2010 · author #2
  53. Packing six T-joins in plane graphs math.CO · 2010 · author #2
  54. The Erd\"os-P\'osa property for clique minors in highly connected graphs math.CO · 2010 · author #2
  55. Double-critical graphs and complete minors math.CO · 2008 · author #1

Mentions

  • 0810.3133 #1 · backfill · confidence 0.70 Ken-ichi Kawarabayashi

Frequent Coauthors