Decomposition methods for discrete problems

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Twin-Width and Types

Autores: Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk
Publicado en: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Página(s) 123:1--123:21
Editor: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022
DOI: 10.4230/lipics.icalp.2022.123

Flipper games for monadically stable graph classes

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

Compact representation for matrices of bounded twin-width

Autores: Michał Pilipczuk, Marek Sokołowski, Anna Zych-Pawlewicz
Publicado en: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Página(s) 52:1-52:14
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2022.52

On the Complexity of Problems on Tree-Structured Graphs

Autores: Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
Publicado en: 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, 2023
Editor: 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

Autores: Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Publicado en: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Página(s) 683-691
Editor: ACM
DOI: 10.1145/3618260.3649791

Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time

Autores: Łukasz Kowalik
Publicado en: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.81

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Autores: Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk
Publicado en: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Página(s) 54:1-54:13
Editor: ACM
DOI: 10.1145/3531130.3533367

Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth

Autores: Tuukka Korhonen, Marek Sokołowski
Publicado en: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025, Página(s) 1538-1549
Editor: ACM
DOI: 10.1145/3618260.3649732

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set

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

Stable graphs of bounded twin-width

Autores: Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Publicado en: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Página(s) 39:1--39:12
Editor: ACM
DOI: 10.1145/3531130.3533356

Distal Combinatorial Tools for Graphs of Bounded Twin-Width

Autores: Wojciech Przybyszewski
Publicado en: 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2023, 2023, Página(s) 1--13
Editor: IEEE
DOI: 10.1109/lics56636.2023.10175719

Fully Dynamic Biconnectivity in Õ(log² n) Time

Autores: Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokołowski
Publicado en: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, Página(s) 156-165
Editor: ACM
DOI: 10.1145/3717823.3718270

List Locally Surjective Homomorphisms in Hereditary Graph Classes

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

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

Autores: Łukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Publicado en: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Página(s) 279-285
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.25

Characterising Memory in Infinite Games

Autores: Antonio Casares, Pierre Ohlmann
Publicado en: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Página(s) 122:1--122:18
Editor: 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

Autores: Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
Publicado en: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Página(s) 914-923
Editor: ACM
DOI: 10.1145/3519935.3520076

Elementary first-order model checking for sparse graphs

Autores: Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski, Giannos Stamoulis, Szymon Toruńczyk
Publicado en: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025, Página(s) 1-14
Editor: ACM
DOI: 10.1145/3661814.3662094

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments

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

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Autores: Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Toruńczyk
Publicado en: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Página(s) 125:1--125:18
Editor: 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

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

Exact Shortest Paths with Rational Weights on the Word RAM

Autores: Adam Karczmarz, Wojciech Nadara, Marek Sokołowski
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 2597-2608
Editor: 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

Autores: Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, Alexandre Vigny
Publicado en: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Página(s) 102:1--102:18
Editor: 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

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

Flipping and Forking

Autores: Wojciech Przybyszewski, Szymon Toruńczyk
Publicado en: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025, Página(s) 856-869
Editor: IEEE
DOI: 10.1109/lics65433.2025.00070

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

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

Faster Diameter Computation in Graphs of Bounded Euler Genus

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

Single-conflict colorings of degenerate graphs

Autores: Peter Bradshaw, Tomáš Masařík
Publicado en: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Página(s) 201-209
Editor: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-028

Separability Properties of Monadically Dependent Graph Classes

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

Autores: Groenland, Carla; Mannens, Isja; Nederlof, Jesper; Piecyk, Marta; Rzążewski, Paweł
Publicado en: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Editor: 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

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

Tabular Intermediate Logics Comparison

Autores: Paweł Rzążewski, Michał Stronkowski
Publicado en: Lecture Notes in Computer Science, Logic, Language, Information, and Computation, 2025, Página(s) 326-339
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-99536-1_20

Positionality in Σ^0_2 and a Completeness Result

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

Dynamic Data Structures for Parameterized String Problems

Autores: Jędrzej Olkowski, Michał Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz
Publicado en: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Página(s) 50:1--50:22
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.50

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

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

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

Autores: Hans L. Bodlaender, Carla Groenland, Michał Pilipczuk
Publicado en: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Página(s) 27:1--27:20
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.27

On Rational Recursive Sequences

Autores: Clemente, Lorenzo; Donten-Bury, Maria; Mazowiecki, Filip; Pilipczuk, Michał
Publicado en: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Página(s) 24:1--24:21
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2023.24

First-Order Model Checking on Monadically Stable Graph Classes

Autores: Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, Szymon Toruńczyk
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 21-30
Editor: IEEE
DOI: 10.1109/focs61266.2024.00012

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes

Autores: Ohlmann, Pierre; Pilipczuk, Michał; Przybyszewski, Wojciech; Toruńczyk, Szymon
Publicado en: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 2023, Página(s) 135:1--135:17
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.135

Sparse induced subgraphs in P6-free graphs

Autores: Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 5291-5299
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.190

Computing Treedepth in Polynomial Space and Linear FPT Time

Autores: Wojciech Nadara, Michał Pilipczuk, Marcin Smulewicz
Publicado en: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Página(s) 79:1--79:14
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.79

Determining 4-Edge-Connected Components in Linear Time

Autores: Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokołowski
Publicado en: 29th Annual European Symposium on Algorithms, ESA 2021, 2021, Página(s) 71:1-71:15
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2021.71

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

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

Flip-width: Cops and Robber on dense graphs

Autores: Szymon Toruńczyk
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 663-700
Editor: IEEE
DOI: 10.1109/focs57990.2023.00045

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

Autores: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 625-638
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.23

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

Autores: Katarzyna Kowalska, Michał Pilipczuk
Publicado en: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, 2024
Editor: 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

Autores: Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Publicado en: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, 2023, Página(s) 46:1--46:13
Editor: 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

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

Taming Graphs with No Large Creatures and Skinny Ladders

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

Box-Reachability in Vector Addition Systems

Autores: Shaull Almagor, Itay Hasson, Michał Pilipczuk, Michael Zaslavski
Publicado en: Lecture Notes in Computer Science, Reachability Problems, 2025, Página(s) 126-139
Editor: 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

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

Twin-width IV: ordered graphs and matrices

Autores: Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk
Publicado en: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, 2022, Página(s) 924-937
Editor: ACM
DOI: 10.1145/3519935.3520037

Cliquewidth and Dimension

Autores: Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 1437-1446
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.58

Dynamic treewidth

Autores: Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 1734-1744
Editor: IEEE
DOI: 10.1109/focs57990.2023.00105

3D-grids are not transducible from planar graphs

Autores: Jakub Gajarský, Michał Pilipczuk, Filip Pokrývka
Publicado en: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2025, Página(s) 831-842
Editor: IEEE
DOI: 10.1109/lics65433.2025.00068

Max Weight Independent Set in Sparse Graphs with No Long Claws

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

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

Autores: Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Publicado en: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Página(s) 88-123
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.3

Parameterized Dynamic Data Structure for Split Completion

Autores: Konrad Majewski, Michał Pilipczuk, Anna Zych-Pawlewicz
Publicado en: 32nd Annual European Symposium on Algorithms, ESA 2024, 2024
Editor: 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*

Autores: Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michał Pilipczuk
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, Página(s) 2262-2277
Editor: IEEE
DOI: 10.1109/focs57990.2023.00140

Polynomial Kernel for Immersion Hitting in Tournaments

Autores: Łukasz Bożyk, Michał Pilipczuk
Publicado en: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Página(s) 26:1--26:17
Editor: Schloss Dagstuhl --- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.esa.2022.26

Simpler and faster algorithms for detours in planar digraphs

Autores: Hatzel, Meike; Majewski, Konrad; Pilipczuk, Michał; Sokołowski, Marek
Publicado en: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, 2023, Página(s) 156--165
Editor: SIAM
DOI: 10.48550/arxiv.2301.02421

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

Autores: Tuukka Korhonen, Wojciech Nadara, Michał Pilipczuk, Marek Sokołowski
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Página(s) 296-313
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.12

Simple and tight complexity lower bounds for solving Rabin games

Autores: Antonio Casares, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
Publicado en: 2024 Symposium on Simplicity in Algorithms (SOSA), 2024, Página(s) 160-167
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977936.16

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

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

Parameterized Complexity of Directed Traveling Salesman Problem

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

Minor Containment and Disjoint Paths in Almost-Linear Time

Autores: Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 53-61
Editor: IEEE
DOI: 10.1109/focs61266.2024.00014

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

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

Treelike Decompositions for Transductions of Sparse Graphs

Autores: Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk
Publicado en: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, 2022, Página(s) 31:1-31:14
Editor: ACM
DOI: 10.1145/3531130.3533349

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

Autores: Jesper Nederlof; Michał Pilipczuk; Celine M. F. Swennenhuis; Karol Węgrzycki
Publicado en: SIAM Journal on Discrete Mathematics, Edición Volume 37(3), 2023, Página(s) 1566--1586, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1518943

Characterising memory in infinite games

Autores: Antonio Casares, Pierre Ohlmann
Publicado en: Logical Methods in Computer Science, Edición Volume 21, Edición 1, 2025, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-21(1:28)2025

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

Autores: Marthe Bonamy; Jadwiga Czyżewska; Łukasz Kowalik; Michał Pilipczuk
Publicado en: Journal of Graph Theory, Edición Volume 104, Edición 3, 2023, Página(s) 659-677, ISSN 0364-9024
Editor: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22995

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

Autores: Pilipczuk, Michał; Sokołowski, Marek
Publicado en: Journal of Combinatorial Theory, series B, Edición Volume 161, 2023, Página(s) 382--406, ISSN 0095-8956
Editor: Academic Press
DOI: 10.1016/j.jctb.2023.02.006

Transducing paths in graph classes with unbounded shrubdepth

Autores: Patrice Ossona de Mendez; Michał Pilipczuk; Sebastian Siebertz
Publicado en: European Journal of Combinatorics, Edición Available online, 2023, ISSN 0195-6698
Editor: 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

Autores: Konrad Majewski, Tomáš Masařík, Jana Masaříková, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, Marek Sokołowski
Publicado en: ACM Transactions on Computation Theory, Edición 16, 2025, Página(s) 1-18, ISSN 1942-3454
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3636422

Single‐conflict colorings of degenerate graphs

Autores: Peter Bradshaw, Tomáš Masařík
Publicado en: Journal of Graph Theory, Edición 109, 2025, Página(s) 170-183, ISSN 0364-9024
Editor: John Wiley & Sons Inc.
DOI: 10.1002/jgt.23025

Every graph is eventually Turán-good

Autores: Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek
Publicado en: Journal of Combinatorial Theory, series B, Edición Volume 162, 2023, Página(s) 231-243, ISSN 0095-8956
Editor: Academic Press
DOI: 10.1016/j.jctb.2023.06.004

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

Autores: Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
Publicado en: ACM Transactions on Computation Theory, Edición 17, 2025, Página(s) 1-72, ISSN 1942-3454
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3715884

Parameterized algorithms for block-structured integer programs with large entries

Autores: Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michał Pilipczuk, Adam Polak
Publicado en: TheoretiCS, Edición Volume 4, 2025, ISSN 2751-4838
Editor: 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

Autores: Marcin Pilipczuk, Paweł Rzążewski
Publicado en: Discrete Mathematics & Theoretical Computer Science, Edición vol. 27:2, 2025, ISSN 1365-8050
Editor: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.12438

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

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

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

Autores: Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Publicado en: Journal of Computational Geometry, Edición Volume 14(1), 2023, ISSN 0000-0000
Editor: 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

Autores: Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Paweł Rzążewski, Saket Saurabh, Roohani Sharma
Publicado en: ACM Transactions on Algorithms, Edición 21, 2025, Página(s) 1-14, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3708544

Treedepth vs Circumference

Autores: Marcin Briański; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michał T. Seweryn; Roohani Sharma
Publicado en: Combinatorica, Edición Volume 43(4), 2023, Página(s) 659--664, ISSN 0209-9683
Editor: Springer Verlag
DOI: 10.1007/s00493-023-00028-5

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Autores: Jesper Nederlof; Michał Pilipczuk; Karol Węgrzycki
Publicado en: Electronic Journal of Combinatorics, Edición Volume 30(3), number P3.33, 2023, ISSN 1077-8926
Editor: Electronic Journal of Combinatorics
DOI: 10.37236/11095

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

Autores: Albert Atserias; Joanna Fijalkow
Publicado en: SIAM Journal on Computing, Edición Volume 52(5), 2023, Página(s) 1193-1229, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1338435

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Autores: Mikołaj Bojańczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman
Publicado en: TheoretiCS, Edición Volume 3, 2024, ISSN 2751-4838
Editor: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.13

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

Autores: Pierre Ohlmann
Publicado en: TheoretiCS, Edición Volume 2, 2023, ISSN 2751-4838
Editor: TheoretiCS Foundation e.V.
DOI: 10.46298/theoretics.23.3

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

Autores: Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak
Publicado en: SIAM Journal on Discrete Mathematics, Edición 39, 2025, Página(s) 1189-1200, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/24m1659960

Buscando datos de OpenAIRE...

Publicaciones

Compartir esta página Compartir esta página en las redes sociales

Descargar Descargar el contenido de la página