research
∙
05/30/2023
Sparse dynamic discretization discovery via arc-dependent time discretizations
While many time-dependent network design problems can be formulated as t...
share
research
∙
03/02/2023
Dynamic discretization discovery under hard node storage constraints
The recently developed dynamic discretization discovery (DDD) is a power...
research
∙
07/10/2021
Hitting Weighted Even Cycles in Planar Graphs
A classical branch of graph algorithms is graph transversals, where one ...
research
∙
05/15/2021
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
We explore the complexity of nucleolus computation in b-matching games o...
research
∙
05/21/2020
A General Framework for Computing the Nucleolus Via Dynamic Programming
This paper defines a general class of cooperative games for which the nu...
research
∙
05/11/2020
Approximating Stable Matchings with Ties of Bounded Size
Finding a stable matching is one of the central problems in algorithmic ...
research
∙
05/11/2020
On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap
Finding a stable matching is one of the central problems in algorithmic ...
research
∙
03/08/2018