Decomposition methods for discrete problems

CORDIS fournit des liens vers les livrables publics et les publications des projets HORIZON.

Les liens vers les livrables et les publications des projets du 7e PC, ainsi que les liens vers certains types de résultats spécifiques tels que les jeux de données et les logiciels, sont récupérés dynamiquement sur OpenAIRE .

Publications

Twin-Width and Types

Auteurs: Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk
Publié dans: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 123:1--123:21
Éditeur: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022
DOI: 10.4230/lipics.icalp.2022.123

Flipper games for monadically stable graph classes

Auteurs: Gajarský, Jakub; Mählmann, Nikolas; McCarty, Rose; Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Siebertz, Sebastian; Sokołowski, Marek; Toruńczyk, Szymon
Publié dans: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 128:1--128:16
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.48550/arxiv.2301.13735

Compact representation for matrices of bounded twin-width

Auteurs: Michał Pilipczuk, Marek Sokołowski, Anna Zych-Pawlewicz
Publié dans: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Page(s) 52:1-52:14
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2022.52

On the Complexity of Problems on Tree-Structured Graphs

Auteurs: Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
Publié dans: 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, 2023
Éditeur: 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

Auteurs: Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Publié dans: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 683-691
Éditeur: ACM
DOI: 10.1145/3618260.3649791

Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time

Auteurs: Łukasz Kowalik
Publié dans: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Éditeur: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.81

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Auteurs: Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk
Publié dans: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Page(s) 54:1-54:13
Éditeur: ACM
DOI: 10.1145/3531130.3533367

Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth

Auteurs: Tuukka Korhonen, Marek Sokołowski
Publié dans: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 1538-1549
Éditeur: ACM
DOI: 10.1145/3618260.3649732

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set

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

Stable graphs of bounded twin-width

Auteurs: Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Publié dans: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Page(s) 39:1--39:12
Éditeur: ACM
DOI: 10.1145/3531130.3533356

Distal Combinatorial Tools for Graphs of Bounded Twin-Width

Auteurs: Wojciech Przybyszewski
Publié dans: 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2023, 2023, Page(s) 1--13
Éditeur: IEEE
DOI: 10.1109/lics56636.2023.10175719

Finding irrelevant vertices in linear time on bounded-genus graphs

Auteurs: Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos
Publié dans: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 3762-3774
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.126

Fully Dynamic Biconnectivity in Õ(log² n) Time

Auteurs: Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokołowski
Publié dans: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 156-165
Éditeur: ACM
DOI: 10.1145/3717823.3718270

List Locally Surjective Homomorphisms in Hereditary Graph Classes

Auteurs: Dvořák, Pavel; Masařík, Tomáš; Novotná, Jana; Krawczyk, Monika; Rzążewski, Paweł; Żuk, Aneta
Publié dans: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, 2022, Page(s) 30:1--30:15
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2022.30

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

Auteurs: Łukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Publié dans: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Page(s) 279-285
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.25

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

Auteurs: Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Publié dans: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 3728-3742
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.124

Characterising Memory in Infinite Games

Auteurs: Antonio Casares, Pierre Ohlmann
Publié dans: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 122:1--122:18
Éditeur: 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

Auteurs: Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
Publié dans: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Page(s) 914-923
Éditeur: ACM
DOI: 10.1145/3519935.3520076

Elementary first-order model checking for sparse graphs

Auteurs: Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski, Giannos Stamoulis, Szymon Toruńczyk
Publié dans: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025, Page(s) 1-14
Éditeur: ACM
DOI: 10.1145/3661814.3662094

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments

Auteurs: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Publié dans: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Éditeur: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.43

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Auteurs: Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Toruńczyk
Publié dans: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 125:1--125:18
Éditeur: 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

Auteurs: Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, Marek Sokołowski
Publié dans: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 93:1-93:19
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2022.93

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

Auteurs: Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk
Publié dans: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Page(s) 1550-1560
Éditeur: ACM
DOI: 10.1145/3618260.3649739

Exact Shortest Paths with Rational Weights on the Word RAM

Auteurs: Adam Karczmarz, Wojciech Nadara, Marek Sokołowski
Publié dans: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 2597-2608
Éditeur: 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

Auteurs: Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, Alexandre Vigny
Publié dans: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 102:1--102:18
Éditeur: 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

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

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

Auteurs: Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Publié dans: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025, Page(s) 1-12
Éditeur: ACM
DOI: 10.1145/3661814.3662089

Flipping and Forking

Auteurs: Wojciech Przybyszewski, Szymon Toruńczyk
Publié dans: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025, Page(s) 856-869
Éditeur: IEEE
DOI: 10.1109/lics65433.2025.00070

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

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

Faster Diameter Computation in Graphs of Bounded Euler Genus

Auteurs: Kacper Kluk, Marcin Pilipczuk, Michał Pilipczuk, Giannos Stamoulis
Publié dans: 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, 2025
Éditeur: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2025.109

Single-conflict colorings of degenerate graphs

Auteurs: Peter Bradshaw, Tomáš Masařík
Publié dans: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Page(s) 201-209
Éditeur: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-028

Separability Properties of Monadically Dependent Graph Classes

Auteurs: Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis, Colin Geniet, Nikolas Mählmann, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk
Publié dans: 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, 2025
Éditeur: 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

Auteurs: Groenland, Carla; Mannens, Isja; Nederlof, Jesper; Piecyk, Marta; Rzążewski, Paweł
Publié dans: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Éditeur: 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

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

Tabular Intermediate Logics Comparison

Auteurs: Paweł Rzążewski, Michał Stronkowski
Publié dans: Lecture Notes in Computer Science, Logic, Language, Information, and Computation, 2025, Page(s) 326-339
Éditeur: Springer Nature Switzerland
DOI: 10.1007/978-3-031-99536-1_20

Positionality in Σ^0_2 and a Completeness Result

Auteurs: Pierre Ohlmann, Michał Skrzypczak
Publié dans: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Éditeur: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.54

Dynamic Data Structures for Parameterized String Problems

Auteurs: Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz
Publié dans: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Page(s) 50:1--50:22
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.50

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

Auteurs: Gajarský, Jakub; McCarty, Rose
Publié dans: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Éditeur: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2404.18904

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

Auteurs: Hans L. Bodlaender, Carla Groenland, Michał Pilipczuk
Publié dans: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 27:1--27:20
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.27

On Rational Recursive Sequences

Auteurs: Clemente, Lorenzo; Donten-Bury, Maria; Mazowiecki, Filip; Pilipczuk, Michał
Publié dans: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Page(s) 24:1--24:21
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.24

First-Order Model Checking on Monadically Stable Graph Classes

Auteurs: Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, Szymon Toruńczyk
Publié dans: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 21-30
Éditeur: IEEE
DOI: 10.1109/focs61266.2024.00012

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes

Auteurs: Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Toruńczyk, Szymon
Publié dans: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Page(s) 135:1--135:17
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.135

Sparse induced subgraphs in P6-free graphs

Auteurs: Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Publié dans: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 5291-5299
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.190

Computing Treedepth in Polynomial Space and Linear FPT Time

Auteurs: Wojciech Nadara, Michał Pilipczuk, Marcin Smulewicz
Publié dans: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 79:1--79:14
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.79

Determining 4-Edge-Connected Components in Linear Time

Auteurs: Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski
Publié dans: 29th Annual European Symposium on Algorithms, ESA 2021, 2021, Page(s) 71:1-71:15
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2021.71

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

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

Flip-width: Cops and Robber on dense graphs

Auteurs: Szymon Toruńczyk
Publié dans: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 663-700
Éditeur: IEEE
DOI: 10.1109/focs57990.2023.00045

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

Auteurs: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Publié dans: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 625-638
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.23

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

Auteurs: Katarzyna Kowalska, Michał Pilipczuk
Publié dans: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Éditeur: 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

Auteurs: Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Publié dans: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Page(s) 46:1--46:13
Éditeur: 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

Auteurs: Pilipczuk, Michal; Mari, Mathieu; Picavet, Timothe
Publié dans: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, 2023
Éditeur: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2307.10672

Taming Graphs with No Large Creatures and Skinny Ladders

Auteurs: Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Paweł Rzążewski, Uéverton S. Souza
Publié dans: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 58:1--58:8
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.58

Box-Reachability in Vector Addition Systems

Auteurs: Shaull Almagor, Itay Hasson, Michał Pilipczuk, Michael Zaslavski
Publié dans: Lecture Notes in Computer Science, Reachability Problems, 2025, Page(s) 126-139
Éditeur: 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

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

Twin-width IV: ordered graphs and matrices

Auteurs: Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk
Publié dans: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Page(s) 924-937
Éditeur: ACM
DOI: 10.1145/3519935.3520037

Cliquewidth and Dimension

Auteurs: Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Publié dans: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 1437-1446
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.58

Dynamic treewidth

Auteurs: Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Publié dans: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 1734-1744
Éditeur: IEEE
DOI: 10.1109/focs57990.2023.00105

3D-grids are not transducible from planar graphs

Auteurs: Jakub Gajarský, Michał Pilipczuk, Filip Pokrývka
Publié dans: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025, Page(s) 831-842
Éditeur: IEEE
DOI: 10.1109/lics65433.2025.00068

Max Weight Independent Set in Sparse Graphs with No Long Claws

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

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

Auteurs: Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Publié dans: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 88-123
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.3

Parameterized Dynamic Data Structure for Split Completion

Auteurs: Konrad Majewski, Michał Pilipczuk, Anna Zych-Pawlewicz
Publié dans: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Éditeur: 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*

Auteurs: Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Publié dans: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, Page(s) 2262-2277
Éditeur: IEEE
DOI: 10.1109/focs57990.2023.00140

Polynomial Kernel for Immersion Hitting in Tournaments

Auteurs: Łukasz Bożyk, Michał Pilipczuk
Publié dans: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 26:1--26:17
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.26

Simpler and faster algorithms for detours in planar digraphs

Auteurs: Hatzel, Meike; Majewski, Konrad; Pilipczuk, Michał; Sokołowski, Marek
Publié dans: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, 2023, Page(s) 156--165
Éditeur: SIAM
DOI: 10.48550/arxiv.2301.02421

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

Auteurs: Tuukka Korhonen, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Publié dans: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 296-313
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.12

Simple and tight complexity lower bounds for solving Rabin games

Auteurs: Antonio Casares, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
Publié dans: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Page(s) 160-167
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.16

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Auteurs: Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen
Publié dans: 31st Annual European Symposium on Algorithms, ESA 2023, 2023, Page(s) 18:1--18:18
Éditeur: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2023.18

Parameterized Complexity of Directed Traveling Salesman Problem

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

Minor Containment and Disjoint Paths in Almost-Linear Time

Auteurs: Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
Publié dans: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 53-61
Éditeur: IEEE
DOI: 10.1109/focs61266.2024.00014

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

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

Treelike Decompositions for Transductions of Sparse Graphs

Auteurs: Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk
Publié dans: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Page(s) 31:1-31:14
Éditeur: ACM
DOI: 10.1145/3531130.3533349

On Approximate MMS Allocations on Restricted Graph Classes

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

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

Auteurs: Jesper Nederlof; Michał Pilipczuk; Celine M. F. Swennenhuis; Karol Węgrzycki
Publié dans: SIAM Journal on Discrete Mathematics, Numéro Volume 37(3), 2023, Page(s) 1566--1586, ISSN 0895-4801
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1518943

Characterising memory in infinite games

Auteurs: Antonio Casares, Pierre Ohlmann
Publié dans: Logical Methods in Computer Science, Numéro Volume 21, Numéro 1, 2025, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:28)2025

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

Auteurs: Marthe Bonamy; Jadwiga Czyżewska; Łukasz Kowalik; Michał Pilipczuk
Publié dans: Journal of Graph Theory, Numéro Volume 104, Numéro 3, 2023, Page(s) 659-677, ISSN 0364-9024
Éditeur: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22995

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

Auteurs: Pilipczuk, Michał; Sokołowski, Marek
Publié dans: Journal of Combinatorial Theory, series B, Numéro Volume 161, 2023, Page(s) 382--406, ISSN 0095-8956
Éditeur: Academic Press
DOI: 10.1016/j.jctb.2023.02.006

Transducing paths in graph classes with unbounded shrubdepth

Auteurs: Patrice Ossona de Mendez; Michał Pilipczuk; Sebastian Siebertz
Publié dans: European Journal of Combinatorics, Numéro Available online, 2023, ISSN 0195-6698
Éditeur: 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

Auteurs: Konrad Majewski, Tomáš Masařík, Jana Masaříková, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, Marek Sokołowski
Publié dans: ACM Transactions on Computation Theory, Numéro 16, 2025, Page(s) 1-18, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3636422

Single‐conflict colorings of degenerate graphs

Auteurs: Peter Bradshaw, Tomáš Masařík
Publié dans: Journal of Graph Theory, Numéro 109, 2025, Page(s) 170-183, ISSN 0364-9024
Éditeur: John Wiley & Sons Inc.
DOI: 10.1002/jgt.23025

Every graph is eventually Turán-good

Auteurs: Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek
Publié dans: Journal of Combinatorial Theory, series B, Numéro Volume 162, 2023, Page(s) 231-243, ISSN 0095-8956
Éditeur: Academic Press
DOI: 10.1016/j.jctb.2023.06.004

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

Auteurs: Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Publié dans: ACM Transactions on Computation Theory, Numéro 17, 2025, Page(s) 1-72, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3715884

Parameterized algorithms for block-structured integer programs with large entries

Auteurs: Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michał Pilipczuk, Adam Polak
Publié dans: TheoretiCS, Numéro Volume 4, 2025, ISSN 2751-4838
Éditeur: 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

Auteurs: Marcin Pilipczuk, Paweł Rzążewski
Publié dans: Discrete Mathematics & Theoretical Computer Science, Numéro vol. 27:2, 2025, ISSN 1365-8050
Éditeur: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.12438

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

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

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

Auteurs: Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Publié dans: Journal of Computational Geometry, Numéro Volume 14(1), 2023, ISSN 0000-0000
Éditeur: 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

Auteurs: Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Paweł Rzążewski, Saket Saurabh, Roohani Sharma
Publié dans: ACM Transactions on Algorithms, Numéro 21, 2025, Page(s) 1-14, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3708544

Treedepth vs Circumference

Auteurs: Marcin Briański; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michał T. Seweryn; Roohani Sharma
Publié dans: Combinatorica, Numéro Volume 43(4), 2023, Page(s) 659--664, ISSN 0209-9683
Éditeur: Springer Verlag
DOI: 10.1007/s00493-023-00028-5

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Auteurs: Jesper Nederlof; Michał Pilipczuk; Karol Węgrzycki
Publié dans: Electronic Journal of Combinatorics, Numéro Volume 30(3), number P3.33, 2023, ISSN 1077-8926
Éditeur: Electronic Journal of Combinatorics
DOI: 10.37236/11095

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

Auteurs: Albert Atserias; Joanna Fijalkow
Publié dans: SIAM Journal on Computing, Numéro Volume 52(5), 2023, Page(s) 1193-1229, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1338435

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Auteurs: Mikołaj Bojańczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman
Publié dans: TheoretiCS, Numéro Volume 3, 2024, ISSN 2751-4838
Éditeur: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.13

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

Auteurs: Pierre Ohlmann
Publié dans: TheoretiCS, Numéro Volume 2, 2023, ISSN 2751-4838
Éditeur: TheoretiCS Foundation e.V.
DOI: 10.46298/theoretics.23.3

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

Auteurs: Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak
Publié dans: SIAM Journal on Discrete Mathematics, Numéro 39, 2025, Page(s) 1189-1200, ISSN 0895-4801
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/24m1659960

Recherche de données OpenAIRE...

Publications

Partager cette page Partager cette page sur les réseaux sociaux

Télécharger Télécharger le contenu de la page