Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Pilipczuk, Marcin L.
381  Ergebnisse:
Personensuche X
?
1

Induced Subgraphs of Bounded Treewidth and the Container Me..:

Abrishami, Tara ; Chudnovsky, Maria ; Pilipczuk, Marcin..
SIAM Journal on Computing.  53 (2024)  3 - p. 624-647 , 2024
Link: https://doi.org/10.1137/..
 
?
2

Max Weight Independent Set in Graphs with No Long Claws: An..:

Majewski, Konrad ; Masařík, Tomáš ; Masaříková, Jana...
ACM Transactions on Computation Theory.  16 (2024)  2 - p. 1-18 , 2024
Link: https://doi.org/10.1145/..
 
?
3

Combinatorial Correlation Clustering:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Cohen-Addad, Vincent ; Lolck, David Rasmussen ; Pilipczuk, Marcin... - p. 1617-1628 , 2024
Link: https://dl.acm.org/doi/1..
 
?
4

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..
 
?
5

On Weighted Graph Separation Problems and Flow Augmentation:

Kim, Eun Jung ; Masařík, Tomáš ; Pilipczuk, Marcin..
SIAM Journal on Discrete Mathematics.  38 (2024)  1 - p. 170-189 , 2024
Link: https://doi.org/10.1137/..
 
?
6

Flow-augmentation II: Undirected Graphs:

Kim, Eun Jung ; Kratsch, Stefan ; Pilipczuk, Marcin.
ACM Transactions on Algorithms.  20 (2024)  2 - p. 1-26 , 2024
Link: https://doi.org/10.1145/..
 
?
7

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/..
 
?
8

Tight Bound on Treedepth in Terms of Pathwidth and Longest ..:

Hatzel, Meike ; Joret, Gwenaël ; Micek, Piotr...
Combinatorica.  44 (2023)  2 - p. 417-427 , 2023
Link: https://doi.org/10.1007/..
 
?
9

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/..
 
?
10

Cluster Editing Parameterized above Modification-disjointP3..:

Li, Shaohua ; Pilipczuk, Marcin ; Sorge, Manuel
ACM Transactions on Algorithms.  20 (2023)  1 - p. 1-43 , 2023
Link: https://doi.org/10.1145/..
 
?
11

Hardness of Metric Dimension in Graphs of Constant Treewidt:

Li, Shaohua ; Pilipczuk, Marcin
Algorithmica.  84 (2022)  11 - p. 3110-3155 , 2022
Link: https://doi.org/10.1007/..
 
?
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

Solving Connectivity Problems Parameterized by Treewidth in..:

Cygan, Marek ; Nederlof, Jesper ; Pilipczuk, Marcin...
ACM Transactions on Algorithms (TALG).  18 (2022)  2 - p. 1-31 , 2022
Link: https://dl.acm.org/doi/1..
 
?
14

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/..
 
?
15

Packing Directed Cycles Quarter- and Half-Integrally:

Masařík, Tomáš ; Muzi, Irene ; Pilipczuk, Marcin..
Combinatorica.  42 (2022)  S2 - p. 1409-1438 , 2022
Link: https://doi.org/10.1007/..
 
1-15