research
∙
11/11/2021
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
In the non-uniform sparsest cut problem, we are given a supply graph G a...
share
research
∙
08/09/2021
Apportionment with Parity Constraints
In the classic apportionment problem the goal is to decide how many seat...
research
∙
07/16/2021
The Convergence Rates of Blockchain Mining Games: A Markovian Approach
Understanding the strategic behavior of miners in a blockchain is of gre...
research
∙
07/09/2021
Preserving Diversity when Partitioning: A Geometric Approach
Diversity plays a crucial role in multiple contexts such as team formati...
research
∙
02/27/2019
On the extension complexity of scheduling
Linear programming is a powerful method in combinatorial optimization wi...
research
∙
11/21/2018
Breaking symmetries to rescue Sum of Squares: The case of makespan scheduling
The Sum of Squares (SoS) hierarchy gives an automatized technique to cre...
research
∙
02/06/2018
