Decomposition methods for discrete problems

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Twin-Width and Types

Autori: Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk
Pubblicato in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Pagina/e 123:1--123:21
Editore: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022
DOI: 10.4230/lipics.icalp.2022.123

Flipper games for monadically stable graph classes

Autori: Gajarský, Jakub; Mählmann, Nikolas; McCarty, Rose; Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Siebertz, Sebastian; Sokołowski, Marek; Toruńczyk, Szymon
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Pagina/e 128:1--128:16
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.48550/arxiv.2301.13735

Compact representation for matrices of bounded twin-width

Autori: Michał Pilipczuk, Marek Sokołowski, Anna Zych-Pawlewicz
Pubblicato in: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Pagina/e 52:1-52:14
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2022.52

On the Complexity of Problems on Tree-Structured Graphs

Autori: Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
Pubblicato in: 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, 2023
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ipec.2022.6

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

Autori: Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Pagina/e 683-691
Editore: ACM
DOI: 10.1145/3618260.3649791

Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time

Autori: Łukasz Kowalik
Pubblicato in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.81

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Autori: Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk
Pubblicato in: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Pagina/e 54:1-54:13
Editore: ACM
DOI: 10.1145/3531130.3533367

Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth

Autori: Tuukka Korhonen, Marek Sokołowski
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Pagina/e 1538-1549
Editore: ACM
DOI: 10.1145/3618260.3649732

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set

Autori: Paloma T. Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, Kenny Štorgel
Pubblicato in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.85

Stable graphs of bounded twin-width

Autori: Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Pubblicato in: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Pagina/e 39:1--39:12
Editore: ACM
DOI: 10.1145/3531130.3533356

Distal Combinatorial Tools for Graphs of Bounded Twin-Width

Autori: Wojciech Przybyszewski
Pubblicato in: 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2023, 2023, Pagina/e 1--13
Editore: IEEE
DOI: 10.1109/lics56636.2023.10175719

Finding irrelevant vertices in linear time on bounded-genus graphs

Autori: Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 3762-3774
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.126

Fully Dynamic Biconnectivity in Õ(log² n) Time

Autori: Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokołowski
Pubblicato in: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Pagina/e 156-165
Editore: ACM
DOI: 10.1145/3717823.3718270

List Locally Surjective Homomorphisms in Hereditary Graph Classes

Autori: Dvořák, Pavel; Masařík, Tomáš; Novotná, Jana; Krawczyk, Monika; Rzążewski, Paweł; Żuk, Aneta
Pubblicato in: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, 2022, Pagina/e 30:1--30:15
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2022.30

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Autori: Łukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Pubblicato in: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Pagina/e 279-285
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.25

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes

Autori: Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 3728-3742
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.124

Characterising Memory in Infinite Games

Autori: Antonio Casares, Pierre Ohlmann
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Pagina/e 122:1--122:18
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.122

Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor

Autori: Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
Pubblicato in: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Pagina/e 914-923
Editore: ACM
DOI: 10.1145/3519935.3520076

Elementary first-order model checking for sparse graphs

Autori: Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski, Giannos Stamoulis, Szymon Toruńczyk
Pubblicato in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025, Pagina/e 1-14
Editore: ACM
DOI: 10.1145/3661814.3662094

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments

Autori: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Pubblicato in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.43

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Autori: Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Toruńczyk
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Pagina/e 125:1--125:18
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.125

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

Autori: Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, Marek Sokołowski
Pubblicato in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Pagina/e 93:1-93:19
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.93

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes

Autori: Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Pagina/e 1550-1560
Editore: ACM
DOI: 10.1145/3618260.3649739

Exact Shortest Paths with Rational Weights on the Word RAM

Autori: Adam Karczmarz, Wojciech Nadara, Marek Sokołowski
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 2597-2608
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.92

Algorithms and Data Structures for First-Order Logic with Connectivity under Vertex Failures

Autori: Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, Alexandre Vigny
Pubblicato in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Pagina/e 102:1--102:18
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.102

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games

Autori: K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdziński
Pubblicato in: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, 2022
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.fsttcs.2022.44

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes

Autori: Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Pubblicato in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025, Pagina/e 1-12
Editore: ACM
DOI: 10.1145/3661814.3662089

Flipping and Forking

Autori: Wojciech Przybyszewski, Szymon Toruńczyk
Pubblicato in: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025, Pagina/e 856-869
Editore: IEEE
DOI: 10.1109/lics65433.2025.00070

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP

Autori: Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
Pubblicato in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.15

Faster Diameter Computation in Graphs of Bounded Euler Genus

Autori: Kacper Kluk, Marcin Pilipczuk, Michał Pilipczuk, Giannos Stamoulis
Pubblicato in: 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, 2025
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2025.109

Single-conflict colorings of degenerate graphs

Autori: Peter Bradshaw, Tomáš Masařík
Pubblicato in: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Pagina/e 201-209
Editore: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-028

Separability Properties of Monadically Dependent Graph Classes

Autori: Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk
Pubblicato in: 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, 2025
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2025.147

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters

Autori: Groenland, Carla; Mannens, Isja; Nederlof, Jesper; Piecyk, Marta; Rzążewski, Paweł
Pubblicato in: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2024.77

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument

Autori: Romain Bourneuf, Jana Masaříková, Wojciech Nadara, and Marcin Pilipczuk
Pubblicato in: 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, 2025
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2025.28

Tabular Intermediate Logics Comparison

Autori: Paweł Rzążewski, Michał Stronkowski
Pubblicato in: Lecture Notes in Computer Science, Logic, Language, Information, and Computation, 2025, Pagina/e 326-339
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-99536-1_20

Positionality in Σ^0_2 and a Completeness Result

Autori: Pierre Ohlmann, Michał Skrzypczak
Pubblicato in: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.54

Dynamic Data Structures for Parameterized String Problems

Autori: Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz
Pubblicato in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Pagina/e 50:1--50:22
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.50

On classes of bounded tree rank, their interpretations, and efficient sparsification

Autori: Gajarský, Jakub; McCarty, Rose
Pubblicato in: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2404.18904

Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters

Autori: Hans L. Bodlaender, Carla Groenland, Michał Pilipczuk
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Pagina/e 27:1--27:20
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.27

On Rational Recursive Sequences

Autori: Clemente, Lorenzo; Donten-Bury, Maria; Mazowiecki, Filip; Pilipczuk, Michał
Pubblicato in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Pagina/e 24:1--24:21
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.24

First-Order Model Checking on Monadically Stable Graph Classes

Autori: Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, Szymon Toruńczyk
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 21-30
Editore: IEEE
DOI: 10.1109/focs61266.2024.00012

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes

Autori: Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Toruńczyk, Szymon
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Pagina/e 135:1--135:17
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.135

Sparse induced subgraphs in P6-free graphs

Autori: Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 5291-5299
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.190

Computing Treedepth in Polynomial Space and Linear FPT Time

Autori: Wojciech Nadara, Michał Pilipczuk, Marcin Smulewicz
Pubblicato in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Pagina/e 79:1--79:14
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.79

Determining 4-Edge-Connected Components in Linear Time

Autori: Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski
Pubblicato in: 29th Annual European Symposium on Algorithms, ESA 2021, 2021, Pagina/e 71:1-71:15
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2021.71

Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number

Autori: Maria Chudnovsky, Jadwiga Czyżewska, Kacper Kluk, Marcin Pilipczuk, Paweł Rzążewski
Pubblicato in: 36th International Symposium on Algorithms and Computation, ISAAC 2025, 2025
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.isaac.2025.20

Flip-width: Cops and Robber on dense graphs

Autori: Szymon Toruńczyk
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 663-700
Editore: IEEE
DOI: 10.1109/focs57990.2023.00045

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

Autori: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 625-638
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.23

Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane

Autori: Katarzyna Kowalska, Michał Pilipczuk
Pubblicato in: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.47

Maintaining CMSO2 Properties on Dynamic Structures with Bounded Feedback Vertex Number

Autori: Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Pubblicato in: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Pagina/e 46:1--46:13
Editore: Schloss Dagstuhl --- Leibniz Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.46

A parameterized approximation scheme for the 2D-Knapsack problem with wide items

Autori: Pilipczuk, Michal; Mari, Mathieu; Picavet, Timothe
Pubblicato in: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2307.10672

Taming Graphs with No Large Creatures and Skinny Ladders

Autori: Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Paweł Rzążewski, Uéverton S. Souza
Pubblicato in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Pagina/e 58:1--58:8
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.58

Box-Reachability in Vector Addition Systems

Autori: Shaull Almagor, Itay Hasson, Michał Pilipczuk, Michael Zaslavski
Pubblicato in: Lecture Notes in Computer Science, Reachability Problems, 2025, Pagina/e 126-139
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-09524-4_9

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs

Autori: Barış Can Esmer, Jacob Focke, Dániel Marx, Paweł Rzążewski
Pubblicato in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.39

Twin-width IV: ordered graphs and matrices

Autori: Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk
Pubblicato in: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Pagina/e 924-937
Editore: ACM
DOI: 10.1145/3519935.3520037

Cliquewidth and Dimension

Autori: Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 1437-1446
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.58

Dynamic treewidth

Autori: Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 1734-1744
Editore: IEEE
DOI: 10.1109/focs57990.2023.00105

3D-grids are not transducible from planar graphs

Autori: Jakub Gajarský, Michał Pilipczuk, Filip Pokrývka
Pubblicato in: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025, Pagina/e 831-842
Editore: IEEE
DOI: 10.1109/lics65433.2025.00068

Max Weight Independent Set in Sparse Graphs with No Long Claws

Autori: Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski
Pubblicato in: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.4

Embedding Planar Graphs into Graphs of Treewidth O (log3 n )

Autori: Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 88-123
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.3

Parameterized Dynamic Data Structure for Split Completion

Autori: Konrad Majewski, Michał Pilipczuk, Anna Zych-Pawlewicz
Pubblicato in: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.87

Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*

Autori: Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, Pagina/e 2262-2277
Editore: IEEE
DOI: 10.1109/focs57990.2023.00140

Polynomial Kernel for Immersion Hitting in Tournaments

Autori: Łukasz Bożyk, Michał Pilipczuk
Pubblicato in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Pagina/e 26:1--26:17
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.26

Simpler and faster algorithms for detours in planar digraphs

Autori: Hatzel, Meike; Majewski, Konrad; Pilipczuk, Michał; Sokołowski, Marek
Pubblicato in: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, 2023, Pagina/e 156--165
Editore: SIAM
DOI: 10.48550/arxiv.2301.02421

Fully dynamic approximation schemes on planar and apex-minor-free graphs

Autori: Tuukka Korhonen, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 296-313
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.12

Simple and tight complexity lower bounds for solving Rabin games

Autori: Antonio Casares, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
Pubblicato in: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Pagina/e 160-167
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.16

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Autori: Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen
Pubblicato in: 31st Annual European Symposium on Algorithms, ESA 2023, 2023, Pagina/e 18:1--18:18
Editore: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2023.18

Parameterized Complexity of Directed Traveling Salesman Problem

Autori: Václav Blažej, Andreas Emil Feldmann, Foivos Fioravantes, Paweł Rzążewski, Ondřej Suchý
Pubblicato in: 36th International Symposium on Algorithms and Computation, ISAAC 2025, 2025
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.isaac.2025.15

Minor Containment and Disjoint Paths in Almost-Linear Time

Autori: Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 53-61
Editore: IEEE
DOI: 10.1109/focs61266.2024.00014

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

Autori: Bergougnoux, Benjamin; Gajarský, Jakub; Guśpiel, Grzegorz; Hliněný, Petr; Pokrývka, Filip; Sokołowski, Marek
Pubblicato in: 34th International Symposium on Algorithms and Computation, ISAAC 2023, 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.isaac.2023.11

Treelike Decompositions for Transductions of Sparse Graphs

Autori: Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk
Pubblicato in: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Pagina/e 31:1-31:14
Editore: ACM
DOI: 10.1145/3531130.3533349

On Approximate MMS Allocations on Restricted Graph Classes

Autori: Václav Blažej, Michał Dębski, Zbigniew Lonc, Marta Piecyk, Paweł Rzążewski
Pubblicato in: Frontiers in Artificial Intelligence and Applications, ECAI 2025, 2025
Editore: IOS Press
DOI: 10.3233/faia251271

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Autori: Jesper Nederlof; Michał Pilipczuk; Celine M. F. Swennenhuis; Karol Węgrzycki
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero Volume 37(3), 2023, Pagina/e 1566--1586, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1518943

Characterising memory in infinite games

Autori: Antonio Casares, Pierre Ohlmann
Pubblicato in: Logical Methods in Computer Science, Numero Volume 21, Numero 1, 2025, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:28)2025

Partitioning edges of a planar graph into linear forests and a matching

Autori: Marthe Bonamy; Jadwiga Czyżewska; Łukasz Kowalik; Michał Pilipczuk
Pubblicato in: Journal of Graph Theory, Numero Volume 104, Numero 3, 2023, Pagina/e 659-677, ISSN 0364-9024
Editore: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22995

Graphs of bounded twin-width are quasi-polynomially $\chi$-bounded

Autori: Pilipczuk, Michał; Sokołowski, Marek
Pubblicato in: Journal of Combinatorial Theory, series B, Numero Volume 161, 2023, Pagina/e 382--406, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2023.02.006

Transducing paths in graph classes with unbounded shrubdepth

Autori: Patrice Ossona de Mendez; Michał Pilipczuk; Sebastian Siebertz
Pubblicato in: European Journal of Combinatorics, Numero Available online, 2023, ISSN 0195-6698
Editore: Academic Press
DOI: 10.1016/j.ejc.2022.103660

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument

Autori: Konrad Majewski, Tomáš Masařík, Jana Masaříková, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, Marek Sokołowski
Pubblicato in: ACM Transactions on Computation Theory, Numero 16, 2025, Pagina/e 1-18, ISSN 1942-3454
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3636422

Single‐conflict colorings of degenerate graphs

Autori: Peter Bradshaw, Tomáš Masařík
Pubblicato in: Journal of Graph Theory, Numero 109, 2025, Pagina/e 170-183, ISSN 0364-9024
Editore: John Wiley & Sons Inc.
DOI: 10.1002/jgt.23025

Every graph is eventually Turán-good

Autori: Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek
Pubblicato in: Journal of Combinatorial Theory, series B, Numero Volume 162, 2023, Pagina/e 231-243, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2023.06.004

Maintaining CMSO 2 properties on dynamic structures with bounded feedback vertex number

Autori: Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Pubblicato in: ACM Transactions on Computation Theory, Numero 17, 2025, Pagina/e 1-72, ISSN 1942-3454
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3715884

Parameterized algorithms for block-structured integer programs with large entries

Autori: Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michał Pilipczuk, Adam Polak
Pubblicato in: TheoretiCS, Numero Volume 4, 2025, ISSN 2751-4838
Editore: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.25.15

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number

Autori: Marcin Pilipczuk, Paweł Rzążewski
Pubblicato in: Discrete Mathematics & Theoretical Computer Science, Numero vol. 27:2, 2025, ISSN 1365-8050
Editore: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.12438

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Autori: Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen
Pubblicato in: ACM Transactions on Computation Theory, 2025, ISSN 1942-3454
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3723880

On the independence number of intersection graphs of axis-parallel segments

Autori: Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Pubblicato in: Journal of Computational Geometry, Numero Volume 14(1), 2023, ISSN 0000-0000
Editore: Journal of Computational Geometry, member of Free Journals Network
DOI: 10.20382/jocg.v14i1a5

Odd Cycle Transversal on P 5 -free Graphs in Polynomial Time

Autori: Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Paweł Rzążewski, Saket Saurabh, Roohani Sharma
Pubblicato in: ACM Transactions on Algorithms, Numero 21, 2025, Pagina/e 1-14, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3708544

Treedepth vs Circumference

Autori: Marcin Briański; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michał T. Seweryn; Roohani Sharma
Pubblicato in: Combinatorica, Numero Volume 43(4), 2023, Pagina/e 659--664, ISSN 0209-9683
Editore: Springer Verlag
DOI: 10.1007/s00493-023-00028-5

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Autori: Jesper Nederlof; Michał Pilipczuk; Karol Węgrzycki
Pubblicato in: Electronic Journal of Combinatorics, Numero Volume 30(3), number P3.33, 2023, ISSN 1077-8926
Editore: Electronic Journal of Combinatorics
DOI: 10.37236/11095

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem

Autori: Albert Atserias; Joanna Fijalkow
Pubblicato in: SIAM Journal on Computing, Numero Volume 52(5), 2023, Pagina/e 1193-1229, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1338435

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Autori: Mikołaj Bojańczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman
Pubblicato in: TheoretiCS, Numero Volume 3, 2024, ISSN 2751-4838
Editore: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.13

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

Autori: Pierre Ohlmann
Pubblicato in: TheoretiCS, Numero Volume 2, 2023, ISSN 2751-4838
Editore: TheoretiCS Foundation e.V.
DOI: 10.46298/theoretics.23.3

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth

Autori: Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 39, 2025, Pagina/e 1189-1200, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/24m1659960

È in corso la ricerca di dati su OpenAIRE...

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina