970 citations · 1.7k across the 49 of their papers we have counts for
5 papers · 1 filter
Think Globally, Embed Locally --- Locally Linear Meta-embedding of Words
Danushka Bollegala, Kohei Hayashi, Ken-ichi Kawarabayashi
Distributed word embeddings have shown superior performances in numerous Natural Language Processing (NLP) tasks. However, their performances vary significantly across different ta…
Using -way Co-occurrences for Learning Word Embeddings
Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi
Co-occurrences between two words provide useful insights into the semantics of those words. Consequently, numerous prior work on word embedding learning have used co-occurrences be…
Polylogarithmic approximation for minimum planarization (almost)
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
In the minimum planarization problem, given some -vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves a planar graph. This is a funda…
Additive non-approximability of chromatic number in proper minor-closed classes
Zdeněk Dvořák, Ken-ichi Kawarabayashi
Robin Thomas asked whether for every proper minor-closed class C, there exists a polynomial-time algorithm approximating the chromatic number of graphs from C up to a constant addi…
Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable
Zdeněk Dvořák, Ken-ichi Kawarabayashi
We prove that every triangle-free graph of tree-width t has chromatic number at most ceil((t + 3)/2), and demonstrate that this bound is tight. The argument also establishes a conn…