Publikacje

Czasopismo: ACM Transactions on Algorithms

Liczba publikacji: 28

2025

• Paweł Rzążewski , Akanksha Agrawal, Paloma Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Odd Cycle Transversal on P5-free Graphs in Polynomial Time, ACM Transactions on Algorithms, 21 (2) 2025, s. 1-14. Zobacz w PBN

2024

• Shaohua Li, Marcin Pilipczuk , Manuel Sorge, Cluster Editing Parameterized above Modification-disjoint P_3-packings, ACM Transactions on Algorithms, 20 (1) 2024, s. 1-43. Zobacz w PBN
• Paweł Rzążewski , Jacob Focke, Dániel Marx, Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds, ACM Transactions on Algorithms, 20 (2) 2024, s. 1-32. Zobacz w PBN
• Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk , Magnus Wahlström, Flow-augmentation II: Undirected Graphs, ACM Transactions on Algorithms, 20 (2) 2024, s. 1-26. Zobacz w PBN

2023

• Carla Groenland, Gwenaël Joret, Wojciech Nadara , Bartosz Walczak, Approximating pathwidth for graphs of small treewidth, ACM Transactions on Algorithms, 19 (2) 2023. Zobacz w PBN
• Balázs F. Mezei, Marcin Wrochna , Stanislav Živný, PTAS for Sparse General-Valued CSPs, ACM Transactions on Algorithms, 19 (2) 2023, s. 14:1-31. Zobacz w PBN

2022

• Dániel Marx, Michał Pilipczuk , Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, ACM Transactions on Algorithms, 18 (2) 2022, s. 1-64. Zobacz w PBN
• Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk , Michał Pilipczuk , Polynomial-time algorithm for maximum weight independent set on $P_{6}$-free graphs, ACM Transactions on Algorithms, 18 (1) 2022. Zobacz w PBN
• Marek Cygan , Jesper Nederlof, Marcin Pilipczuk , Michał Pilipczuk , Johan M. M. Van Rooij, Jakub Onufry Wojtaszczyk, Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, ACM Transactions on Algorithms, 18 (2) 2022, s. 1-31. Zobacz w PBN

2021

• Marek Cygan , Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Magnus Wahlström, Randomized Contractions Meet Lean Decompositions, ACM Transactions on Algorithms, 17 (1) 2021, s. 1948-1964. Zobacz w PBN

2020

• Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , A Linear-Time Algorithm for Seeds Computation, ACM Transactions on Algorithms, 16 (2) 2020, s. 1-23. Zobacz w PBN
• Antonios Antoniadis, Krzysztof Fleszar , Ruben Hoeksma, Kevin Schewior, A PTAS for Euclidean TSP with Hyperplane Neighborhoods, ACM Transactions on Algorithms, 16 (3) 2020, s. 1-16. Zobacz w PBN
• Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michał Pilipczuk , Jean-Florent Raymond, Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants, ACM Transactions on Algorithms, 16 (3) 2020, s. 39:1-39:23. Zobacz w PBN
• Ivan Bliznets, Paweł Komosa, Lukáš Mach, Marek Cygan , Michał Pilipczuk , Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems, ACM Transactions on Algorithms, 16 (2) 2020, s. 1-31. Zobacz w PBN

2019

• Marek Cygan , Łukasz Kowalik , Arkadiusz Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, ACM Transactions on Algorithms, 15 (4) 2019, s. 1-19. Zobacz w PBN
• Marek Cygan , Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , On Problems Equivalent to (min,+)-Convolution, ACM Transactions on Algorithms, 15 (1) 2019, s. 1-25. Zobacz w PBN

2018

• Florian Barbero, Christophe Paul, Michał Pilipczuk , Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs, ACM Transactions on Algorithms, 14 (3) 2018, s. 1–31. Zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk , Marcin Wrochna , Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth, ACM Transactions on Algorithms, 14 (3) 2018, s. 1–45. Zobacz w PBN
• Daniel Lokshtanov, Marcin Pilipczuk , Erik Jan van Leeuwen, Independence and Efficient Domination on P_6-free Graphs, ACM Transactions on Algorithms, 14 (1) 2018, s. 3:1-3:30. Zobacz w PBN
• Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, ACM Transactions on Algorithms, 14 (4) 2018, s. 53:1-53:73. Zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , Subexponential Parameterized Algorithm for Interval Completion, ACM Transactions on Algorithms, 14 (3) 2018, s. 35:1-35:62. Zobacz w PBN

2017

• Andreas Björklund, Petteri Kaski, Łukasz Kowalik , Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time, ACM Transactions on Algorithms, 13 (4) 2017, s. 1-26. Zobacz w PBN
• Marek Cygan , Fabrizio Grandoni, Danny Hermelin, Tight Kernel Bounds for Problems on Graphs with Small Degeneracy, ACM Transactions on Algorithms, 2017. Zobacz w PBN

2016

• Marek Cygan , Holger Dell, Daniel Lokshtanov, D\'aniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlstr\öm, On Problems as Hard as CNF-SAT, ACM Transactions on Algorithms, 2016. Zobacz w PBN

2015

• Rajesh Hemant Chitnis, Marek Cygan , Mohammad Taghi Hajiaghayi, D\'aniel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, ACM Transactions on Algorithms, 2015. Zobacz w PBN
• Piotr Sankowski , Glencora Borradaile, Christian Wulff-Nilsen, Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, ACM Transactions on Algorithms, 11 (3) 2015, s. 16:1-16:29. Zobacz w PBN

2012

• Marek Cygan , Marcin Pilipczuk , Even Faster Exact Bandwidth, ACM Transactions on Algorithms, 2012. Zobacz w PBN

2006

• Łukasz Kowalik , Maciej Kurowski, Oracles for Bounded Length Shortest Paths in Planar Graphs, ACM Transactions on Algorithms, 2006. Zobacz w PBN