You are not logged in | Log in

Conference: European Symposium on Algorithms

Number of publications: 53

2025

Yuto Nakashima, Jakub Radoszewski , Tomasz Waleń , Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares, The 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 15 September 2025 - 17 September 2025, 351 (8) 2025, p. 1-18. See in PBN
Michał Włodarczyk , Going Beyond Surfaces in Diameter Approximation, The 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 15 September 2025 - 17 September 2025, 351 (39) 2025, p. 1-19. See in PBN

2024

Julia Baligacs, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz , A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
Jean-Daniel Boissonnat, Kunal Dutta , A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
Łukasz Kowalik , Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
Paweł Rzążewski , Baris Can Esmer, Jacob Focke, Dániel Marx, List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs, 32nd Annual European Symposium on Algorithms, Londyn, the United Kingdom of Great Britain and Northern Ireland, 1 September 2024 - 3 September 2024. See in PBN
Jana Cslovjecsek, Michał Pilipczuk , Karol Węgrzycki, Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
George Osipov, Marcin Pilipczuk , Magnus Wahlström, Parameterized Complexity of MinCSP over the Point Algebra, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
Konrad Majewski , Michał Pilipczuk , Anna Zych-Pawlewicz , Parameterized Dynamic Data Structure for Split Completion, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 September 2024 - 4 September 2024. See in PBN
Karolina Okrasa, Paweł Rzążewski , Paloma Lima, Martin Milanič, Peter Muršič, Kenny Štorgel, Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set, 32nd Annual European Symposium on Algorithms, Londyn, the United Kingdom of Great Britain and Northern Ireland, 1 September 2024 - 3 September 2024. See in PBN

2023

Michał Włodarczyk , Bart M. P. Jansen, Jari J. H. de Kroon, 5-Approximation for H-Treewidth Essentially as Fast as H-Deletion Parameterized by Solution Size, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023, 274 2023, p. 66:1-66:16. See in PBN
Jacek Sroka , Jerzy Tyszkiewicz , Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023. See in PBN
Ashwin Jacob, Michał Włodarczyk , Meirav Zehavi, Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023, 274 2023, p. 65:1-65:17. See in PBN
Jakub Radoszewski , Linear Time Construction of Cover Suffix Tree and Applications, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023. See in PBN
Adam Karczmarz , Marcin Smulewicz, On Fully Dynamic Strongly Connected Components, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023, 274 2023, p. 68:1--68:15. See in PBN
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk , Erik Jan van Leeuwen, Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023. See in PBN

2022

Panagiotis Charalampopoulos, Kociumaka Tomasz, Jakub Radoszewski , Solon P. Pissis, Wojciech Rytter , Tomasz Waleń , Wiktor Zuba , Approximate Circular Pattern Matching, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 September 2022 - 7 September 2022. See in PBN
Wojciech Nadara , Michał Pilipczuk , Marcin Smulewicz, Computing Treedepth in Polynomial Space and Linear {FPT} Time, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 September 2022 - 7 September 2022, 244 2022, p. 79:1--79:14. See in PBN
Bartłomiej Bosek , Anna Zych-Pawlewicz , Dynamic coloring of unit interval graphs with limited recourse budget, 30TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, Berlin/Potsdam, Germany, 5 September 2022 - 7 September 2022. See in PBN
Łukasz Bożyk , Michał Pilipczuk , Polynomial Kernel for Immersion Hitting in Tournaments, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 September 2022 - 7 September 2022, 244 2022, p. 26:1--26:17. See in PBN
Paweł Rzążewski , Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Uéverton S. Souza, Taming Graphs with No Large Creatures and Skinny Ladders, 30th Annual European Symposium on Algorithms (ESA 2022), Potsdam, Germany, 4 September 2022 - 8 September 2022. See in PBN

2021

Wojciech Nadara , Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski , Determining 4-Edge-Connected Components in Linear Time, 29th Annual European Symposium on Algorithms, Lizbona, Portugal, 6 September 2021 - 8 September 2021, 204 2021, p. 71:1--71:15. See in PBN
Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk , Moritz Venzin, Robert Weismantel, Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 September 2021 - 7 September 2021. See in PBN
Paweł Rzążewski , Michał Dębski, Marta Piecyk, Faster 3-Coloring of Small-Diameter Graphs, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 September 2021 - 7 September 2021. See in PBN
Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski , Faster Algorithms for Longest Common Substring, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 September 2021 - 7 September 2021, 204 2021, p. 30:1-30:17. See in PBN
Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, Juliusz Straszyński , Hardness of Detecting Abelian and Additive Square Factors in Strings, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 September 2021 - 7 September 2021, 204 2021, p. 77:1-77:19. See in PBN
Marek Cygan , Alexander Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov, Minimum Common String Partition: Exact Algorithms, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 September 2021 - 7 September 2021. See in PBN

2020

Jakub Radoszewski , Juliusz Straszyński , Efficient Computation of 2-Covers of a String, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
Maria Chudnovsky, Jason King, Michał Pilipczuk , Paweł Rzążewski, Sophie Spirkl, Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, LIPIcs, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
Paweł Rzążewski , Marta Piecyk, Karolina Okrasa, Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs, 28th Annual European Symposium on Algorithms (ESA 2019), Piza, Italy, 6 September 2020 - 8 September 2020. See in PBN
Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many Visits TSP Revisited, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
Bart M.P. Jansen, Michał Włodarczyk , Optimal Polynomial-Time Compression for Boolean Max CSP, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
Adam Karczmarz , Panagiotis Charalampopoulos, Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
Panagiotis Charalampopoulos, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba, The Number of Repetitions in 2D-Strings, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN

2019

Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski , Sophie Spirkl, Mingxian Zhong, Complexity of C_k-Coloring in Hereditary Classes of Graphs, Leibniz International Proceedings in Informatics, LIPIcs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Marek Adamczyk, Jarosław Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michał Włodarczyk , Constant-factor FPT approximation for capacitated k-median, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Cohen-Addad, Vincent, Marcin Pilipczuk , Michał Pilipczuk , Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 33:1--33:14. See in PBN
Jesper Nederlof, Karol Węgrzycki, Jakub Pawlewicz , Marcin Mucha , Equal-Subset-Sum Faster Than the Meet-in-the-Middle, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Edouard Bonnet, Yoichi Iwata, Bart M. Jansen, Łukasz Kowalik , Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 23:1--23:14. See in PBN
Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 34:1--34:13. See in PBN
Amihood Amir, Panagiotis Charalamp, Solon P. Pissis, Jakub Radoszewski , Longest Common Substring Made Fully Dynamic, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 6:1--6:17. See in PBN
Piotr Sankowski , Adam Karczmarz , Min-Cost Flow in Unit-Capacity Planar Graphs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 66:1--66:17. See in PBN
Karl Bringmann, Sándor Kisfaludi-Bak, Marcin Pilipczuk , Erik Jan van Leeuwen, On Geometric Set Cover for Orthants, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Packing Directed Circuits Quarter-Integrally, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Kunal Dutta , Jean-Daniel Boissonnat, Olivier Devillers, Marc Glisse, Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Adam Karczmarz , Jakub Łącki, Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN

2018

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz , Eva Rotenberg, Jakub Łącki, Decremental SPQR-trees for Planar Graphs, 26th Annual European Symposium on Algorithms, Helsinki, Finland, 20 August 2018 - 22 August 2018. See in PBN
Marek Cygan , Artur Czumaj, Marcin Mucha , Piotr Sankowski , Online Facility Location with Deletions, 26th Annual European Symposium on Algorithms, Helsinki, Finland, 20 August 2018 - 22 August 2018. See in PBN
Michał Pilipczuk , Andreas Wiese, Erik Jan van Leeuwen, Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs, 26th Annual European Symposium on Algorithms, Helsinki, Finland, 20 August 2018 - 22 August 2018. See in PBN