research
∙
07/05/2023
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs
In 1982 Papadimitriou and Yannakakis introduced the Exact Matching probl...
share
research
∙
03/01/2023
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is cal...
research
∙
09/22/2022
On the Multi-Robber Damage Number
We study a variant of the Cops and Robbers game on graphs in which the r...
research
∙
09/17/2022
Exact Matching and the Top-k Perfect Matching Problem
The aim of this note is to provide a reduction of the Exact Matching pro...
research
∙
09/02/2022
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy
We study the computational complexity of multi-stage robust optimization...
research
∙
07/20/2022
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
Given an integer k and a graph where every edge is colored either red or...
research
∙
11/18/2021
On the Recoverable Traveling Salesman Problem
In this paper we consider the Recoverable Traveling Salesman Problem (TS...
research
∙
07/30/2021
Assistance and Interdiction Problems on Interval Graphs
We introduce a novel framework of graph modifications specific to interv...
research
∙
04/07/2021
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty
We consider two-stage robust optimization problems, which can be seen as...
research
∙
08/28/2020
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
Recoverable robust optimization is a multi-stage approach, where it is p...
research
∙
07/25/2018