research
∙
02/01/2023
Hardness of braided quantum circuit optimization in the surface code
Large-scale quantum information processing requires the use of quantum e...
share
research
∙
09/29/2022
Matroid Intersection under Restricted Oracles
Matroid intersection is one of the most powerful frameworks of matroid t...
research
∙
09/06/2022
Solving the Maximum Popular Matching Problem with Matroid Constraints
We consider the problem of finding a maximum popular matching in a many-...
research
∙
08/24/2022
Maintaining Optimality in Assignment Problem against Weight Updates around Vertices
We consider a dynamic situation in the weighted bipartite matching probl...
research
∙
08/20/2022
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching
The Stable Marriage problem (SM), solved by the famous deferred acceptan...
research
∙
08/16/2022
Random Assignment of Indivisible Goods under Constraints
We consider the problem of random assignment of indivisible goods, in wh...
research
∙
03/13/2022
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas
To mitigate the imbalance in the number of assignees in the Hospitals/Re...
research
∙
02/09/2022
Hypergraph characterization of split matroids
We provide a combinatorial study of split matroids, a class that was mot...
research
∙
07/21/2021
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems
We study how good a lexicographically maximal solution is in the weighte...
research
∙
07/07/2021
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints
We present a polynomial-time 3/2-approximation algorithm for the problem...
research
∙
05/07/2021
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties
Motivated by a serious issue that hospitals in rural areas suffer from s...
research
∙
05/05/2021
Fair and Truthful Mechanism with Limited Subsidy
The notion of envy-freeness is a natural and intuitive fairness requirem...
research
∙
09/29/2019
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
The present note is a strengthening of a recent paper by K. Takazawa and...
research
∙
09/10/2019
Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow
Let G=(V,E) be a multigraph with a set T⊆ V of terminals. A path in G is...
research
∙
11/19/2018
Equitable Partitions into Matchings and Coverings in Mixed Graphs
Matchings and coverings are central topics in graph theory. The close re...
research
∙
04/27/2018
Subgame Perfect Equilibria of Sequential Matching Games
We study a decentralized matching market in which firms sequentially mak...
research
∙
04/27/2018
