Publikacje

Czasopismo: Acm Transactions On Algorithms

Liczba publikacji: 13

2018

• Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski i Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, Acm Transactions On Algorithms 14 (4) 2018, s. 53:1–53:73.zobacz w PBN
• Daniel Lokshtanov, Marcin Pilipczuk i Erik Jan van Leeuwen, Independence and Efficient Domination on P_6-free Graphs, Acm Transactions On Algorithms 14 (1) 2018, s. 3:1–3:30.zobacz w PBN
• Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk i Michał Pilipczuk, Subexponential Parameterized Algorithm for Interval Completion, Acm Transactions On Algorithms 14 (3) 2018, s. 35:1–35:62.zobacz w PBN
• Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk i Marcin Wrochna, Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth, Acm Transactions On Algorithms 14 (3) 2018, s. 34:1–34:45.zobacz w PBN
• Florian Barbero, Christophe Paul i Michał Pilipczuk, Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs, Acm Transactions On Algorithms 14 (3) 2018, s. 38:1–38:31.zobacz w PBN

2017

• Marek Adam Cygan, Fabrizio Grandoni i Danny Hermelin, Tight Kernel Bounds for Problems on Graphs with Small Degeneracy, Acm Transactions On Algorithms 13 (3) 2017, s. 43:1–43:22.zobacz w PBN
• Andreas Björklund, Petteri Kaski i Łukasz Kowalik, Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time, Acm Transactions On Algorithms 13 (4) 2017, s. 48:1–48:26.zobacz w PBN

2016

• Arkadiusz Aleksander Socała, Tight Lower Bound for the Channel Assignment Problem, Acm Transactions On Algorithms 12 (4) 2016, s. 48.zobacz w PBN
• Marek Adam Cygan, Holger Dell, Daniel Lokshtanov, D\'aniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh i Magnus Wahlstr\öm, On Problems as Hard as CNF-SAT, Acm Transactions On Algorithms 12 (3) 2016, s. 41:1–41:24.zobacz w PBN

2015

• Glencora Borradaile, Piotr Sankowski i Christian Wulff-Nilsen, Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, Acm Transactions On Algorithms 2015.zobacz w PBN
• Rajesh Hemant Chitnis, Marek Adam Cygan, Mohammad Taghi Hajiaghayi i D\'aniel Marx, Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Acm Transactions On Algorithms 11 (4) 2015, s. 28.zobacz w PBN

2012

• Marek Cygan i Marcin Pilipczuk, Even Faster Exact Bandwidth, Acm Transactions On Algorithms 8 (1) 2012.zobacz w PBN

2006

• Łukasz Kowalik i Maciej Kurowski, Oracles for Bounded Length Shortest Paths in Planar Graphs, Acm Transactions On Algorithms 2 (3) 2006, s. 335–363.zobacz w PBN