Items where Author is "Pilipczuk, Marcin"
Group by: Item Type | No Grouping Jump to: Article | Conference or Workshop Item Number of items: 5. ArticleCygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2014) On Cutwidth Parameterized by Vertex Cover Algorithmica, 68 (4). pp. 940-953. ISSN 0178-4617 Cygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2012) On the Hardness of Losing Width Lecture Notes in Computer Science, 7112 . pp. 159-168. ISSN 0302-9743 Cygan, Marek ; Fomin, Fedor V. ; Kowalik, Łukasz ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2011) Lower bounds based on the Exponential Time Hypothesis EATCS Bulletin, 105 . pp. 41-71. Conference or Workshop ItemLokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michal ; Saurabh, Saket (2014) Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth In: IEEE 55th Annual Symposium on Foundations of Computer Science, 18-21 Oct. 2014, Philadelphia, PA, USA. Cygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2014) Minimum bisection is fixed parameter tractable In: STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing, May 2014, NY, United States. |