Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search BC Esmer, A Kulik, D Marx, D Neuen, R Sharma arXiv preprint arXiv:2206.13481, 2022 | 4 | 2022 |
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations B Can Esmer, A Kulik, D Marx, D Neuen, R Sharma Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 3 | 2024 |
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs BC Esmer, J Focke, D Marx, P Rzążewski arXiv preprint arXiv:2210.10677, 2022 | 3 | 2022 |
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness BC Esmer, J Focke, D Marx, P Rzążewski arXiv preprint arXiv:2402.07331, 2024 | 2 | 2024 |
Approximate Monotone Local Search for Weighted Problems BC Esmer, A Kulik, D Marx, D Neuen, R Sharma arXiv preprint arXiv:2308.15306, 2023 | 2 | 2023 |
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems BC Esmer, A Kulik arXiv preprint arXiv:2407.12654, 2024 | | 2024 |
Computing Generalized Convolutions Faster Than Brute Force BC Esmer, A Kulik, D Marx, P Schepper, K Węgrzycki Algorithmica 86 (1), 334-366, 2024 | | 2024 |
On (1+ ϵ)-Approximate Block Sparse Recovery BC Esmer, V Nakos 2022 IEEE International Symposium on Information Theory (ISIT), 1815-1820, 2022 | | 2022 |