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

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

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

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

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

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

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

Flow-augmentation II:Undirected graphs:

Kim, Eun Jung ; Kratsch, Stefan ; Pilipczuk, Marcin.
https://rhul.elsevierpure.com/en/publications/4a30869c-4d58-413a-a152-0b12873b7180.  , 2024
Link: https://rhul.elsevierpur..
 
?
9

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

Hatzel, Meike ; Joret, Gwenaël ; Micek, Piotr...
info:eu-repo/semantics/altIdentifier/wos/001127353800002.  , 2024
Link: https://publikationen.bi..
 
?
10

Cluster Editing Parameterized above Modification-disjoint P..:

Shaohua Li ; Marcin Pilipczuk ; Manuel Sorge
doi:10.60882/cispa.25243222.v1.  , 2024
Link: https://doi.org/10.60882..
 
?
11

Cluster Editing Parameterized above Modification-disjoint P..:

Shaohua Li ; Marcin Pilipczuk ; Manuel Sorge
doi:10.60882/cispa.25243222.v1.  , 2024
Link: https://doi.org/10.60882..
 
?
12

On Weighted Graph Separation Problems and Flow-Augmentation:

Kim, Eun Jung ; Masarik, Tomas ; Pilipczuk, Marcin..
https://rhul.elsevierpure.com/en/publications/a29f9c43-9a98-472d-934a-f32b0ade0cef.  , 2024
Link: https://rhul.elsevierpur..
 
?
13

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

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

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