33 citations · 48 across the 11 of their papers we have counts for
4 papers · 1 filter
Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges
Ryuhei Mori, Osamu Watanabe
When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including only one variable is chosen at each step, and the var…
Random Almost-Popular Matchings
Suthee Ruangwises, Osamu Watanabe
For a set of people and a set of items, with each person having a preference list that ranks all items from most wanted to least wanted, we consider the problem of…
Polynomial size linear programs for problems in P
David Avis, David Bremner, Hans Raj Tiwary +1
A perfect matching in an undirected graph is a set of vertex disjoint edges from that include all vertices in . The perfect matching problem is to decide if ha…
Weighted Random Popular Matchings
Toshiya Itoh, Osamu Watanabe
For a set A of n applicants and a set I of m items, we consider a problem of computing a matching of applicants to items, i.e., a function M mapping A to I; here we assume that eac…