Publications

Journal: Acm Transactions On Computation Theory

Number of publications: 7

2018

• Michał Pilipczuk and Marcin Wrochna, On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs, Acm Transactions On Computation Theory 9 (4) 2018, p. 18:1–18:36.see in PBN
• Marcin Pilipczuk and Magnus Wahlström, Directed Multicut is W[1]-hard, Even for Four Terminal Pairs, Acm Transactions On Computation Theory 10 (3) 2018, p. 13:1–13:18.see in PBN
• Ivan Bliznets, Marek Cygan, Paweł Komosa and Michał Pilipczuk, Hardness of Approximation for H-free Edge Modification Problems, Acm Transactions On Computation Theory 10 (2) 2018, p. 9:1–9:32.see in PBN

2017

• Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk and Michał Pilipczuk, Hardness of Approximation for Strip Packing, Acm Transactions On Computation Theory 9 (3) 2017, p. 14:1–14:7.see in PBN

2015

• Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk and Yngve Villanger, Exploring the Subexponential Complexity of Completion Problems, Acm Transactions On Computation Theory 7 (4) 2015, p. 14.see in PBN

2014

• Marek Adam Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, Acm Transactions On Computation Theory 6 (2) 2014, p. 6.see in PBN

2013

• Marek Adam Cygan, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, On multiway cut parameterized above lower bounds, Acm Transactions On Computation Theory 5 (1) 2013, p. 3.see in PBN