| No. |
Title |
Author |
Year |
| 1 |
Minimum Common String Partition: Exact Algorithms |
Cygan, Marek et al. |
2021 |
| 2 |
Online Facility Location with Deletions |
Cygan, Marek et al. |
2018 |
| 3 |
On Problems Equivalent to (min,+)-Convolution |
Cygan, Marek et al. |
2017 |
| 4 |
Improving TSP Tours Using Dynamic Programming over Tree Decompositions |
Cygan, Marek et al. |
2017 |
| 5 |
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) |
Cygan, Marek et al. |
2017 |
| 6 |
Hardness of Approximation for H-Free Edge Modification Problems |
Bliznets, Ivan et al. |
2016 |
| 7 |
Lower Bounds for Approximation Schemes for Closest String |
Cygan, Marek et al. |
2016 |
| 8 |
Approximating Upper Degree-Constrained Partial Orientations |
Cygan, Marek et al. |
2015 |
| 9 |
Constant Factor Approximation for Capacitated k-Center with Outliers |
Cygan, Marek et al. |
2014 |
| 10 |
On Pairwise Spanners |
Cygan, Marek et al. |
2013 |
| 11 |
Approximation Algorithms for Union and Intersection Covering Problems |
Cygan, Marek et al. |
2011 |
