16 citations · 31 across the 9 of their papers we have counts for
9 papers
Decomposition of (infinite) digraphs along directed 1-separations
Nathan Bowler, Florian Gut, Meike Hatzel +3
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the s…
Optimal Pricing for Submodular Valuations with Bounded Curvature
Takanori Maehara, Yasushi Kawase, Hanna Sumita +2
The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want…
Learning Word Representations from Relational Graphs
Danushka Bollegala, Takanori Maehara, Yuichi Yoshida +1
Attributes of words and relations between two words are central to numerous tasks in Artificial Intelligence such as knowledge representation, similarity measurement, and analogy d…
Beyond the Euler characteristic: Approximating the genus of general graphs
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter alg…
Efficient SimRank Computation via Linearization
Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi
SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for comput…
Existence of outsiders as a characteristic of online communication networks
Taro Takaguchi, Takanori Maehara, Masashi Toyoda +1
Online social networking services (SNSs) involve communication activities between large number of individuals over the public Internet and their crawled records are often regarded…