E-LIB Suche - Ergebnisse für: Pilipczuk, Michał

1

Maximum Weight Independent Set in Graphs with no Long Claws..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Gartland, Peter ; Lokshtanov, Daniel ; Masařík, Tomáš... - p. 683-691 , 2024

Link: https://dl.acm.org/doi/1..

2

Quasi-Polynomial Time Approximation Schemes for the Maximum..:

Chudnovsky, Maria ; Pilipczuk, Marcin ; Pilipczuk, Michał.
SIAM Journal on Computing. 53 (2024) 1 - p. 47-86 , 2024

Link: https://doi.org/10.1137/..

3

Elementary first-order model checking for sparse graphs:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,

Gajarský, Jakub ; Pilipczuk, Michał ; Sokołowski, Marek.. - p. 1-14 , 2024

Link: https://dl.acm.org/doi/1..

4

Planar and Minor-Free Metrics Embed into Metrics of Polylog..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Cohen-Addad, Vincent ; Le, Hung ; Pilipczuk, Marcin. - p. 2262-2277 , 2023

Link: https://doi.org/10.1109/..

5

Dynamic treewidth:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Korhonen, Tuukka ; Majewski, Konrad ; Nadara, Wojciech.. - p. 1734-1744 , 2023

Link: https://doi.org/10.1109/..

6

Graphs of bounded twin-width are quasi-polynomially χ-bound..:

Pilipczuk, Michał ; Sokołowski, Marek
Journal of Combinatorial Theory, Series B. 161 (2023) - p. 382-406 , 2023

Link: https://doi.org/10.1016/..

7

Partitioning edges of a planar graph into linear forests an..:

Bonamy, Marthe ; Czyżewska, Jadwiga ; Kowalik, Łukasz.
Journal of Graph Theory. 104 (2023) 3 - p. 659-677 , 2023

Link: https://doi.org/10.1002/..

8

Hamiltonian Cycle Parameterized by Treedepth in Single Expo..:

Nederlof, Jesper ; Pilipczuk, Michał ; Swennenhuis, Celine M. F..
SIAM Journal on Discrete Mathematics. 37 (2023) 3 - p. 1566-1586 , 2023

Link: https://doi.org/10.1137/..

9

Preface:

Král, Daniel ; Pilipczuk, Michał ; Siebertz, Sebastian.
European Journal of Combinatorics. , 2023

Link: https://doi.org/10.1016/..

10

Correction to: Graph-Theoretic Concepts in Computer Science:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Kowalik, Łukasz ; Pilipczuk, Michał ; Rzążewski, Paweł - p. C2-C2 , 2023

Link: https://doi.org/10.1007/..

11

Degeneracy of P-free and C⩾-free graphs with no large compl..:

Bonamy, Marthe ; Bousquet, Nicolas ; Pilipczuk, Michał...
Journal of Combinatorial Theory, Series B. 152 (2022) - p. 353-378 , 2022

Link: https://doi.org/10.1016/..

12

Solving Connectivity Problems Parameterized by Treewidth in..:

Cygan, Marek ; Nederlof, Jesper ; Pilipczuk, Marcin...
ACM Transactions on Algorithms. 18 (2022) 2 - p. 1-31 , 2022

Link: https://doi.org/10.1145/..

13

Shorter Labeling Schemes for Planar Graphs:

Bonamy, Marthe ; Gavoille, Cyril ; Pilipczuk, Michał
SIAM Journal on Discrete Mathematics. 36 (2022) 3 - p. 2082-2099 , 2022

Link: https://doi.org/10.1137/..

14

Dynamic Data Structures for Timed Automata Acceptance:

Grez, Alejandro ; Mazowiecki, Filip ; Pilipczuk, Michał..
Algorithmica. 84 (2022) 11 - p. 3223-3245 , 2022

Link: https://doi.org/10.1007/..

15

Polynomial-time Algorithm for Maximum Weight Independent Se..:

Grzesik, Andrzej ; Klimošová, Tereza ; Pilipczuk, Marcin.
ACM Transactions on Algorithms. 18 (2022) 1 - p. 1-57 , 2022

Link: https://doi.org/10.1145/..