The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michal Pilipczuk" ( http://dblp.L3S.de/Authors/Michal_Pilipczuk )

  Author page on DBLP  Author page in RDF  Community of Michal Pilipczuk in ASPL-2

Publication years (Num. hits)
2010-2011 (23) 2012 (21) 2013 (22) 2014 (23) 2015 (25) 2016 (34) 2017 (24) 2018 (26) 2019 (10)
Publication types (Num. hits)
article(123) book(1) incollection(4) inproceedings(79) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(77) Algorithmica(13) IPEC(11) STACS(10) ESA(9) FOCS(8) SODA(8) WG(7) TOCT(6) LICS(5) MFCS(5) SIAM J. Comput.(5) ACM Trans. Algorithms(4) ICALP(4) SIAM J. Discrete Math.(4) Theory Comput. Syst.(4) More (+10 of total 37)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 209 publication records. Showing 208 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna Cutwidth: Obstructions and Algorithmic Aspects. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna Edge Bipartization Faster than $$2^k$$ 2 k. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florian Barbero, Christophe Paul, Michal Pilipczuk Strong immersion is a well-quasi-ordering for semicomplete digraphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar Shortest paths in one-counter systems. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2019 DBLP  BibTeX  RDF
1Dusan Knop, Michal Pilipczuk, Marcin Wrochna Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk Progressive Algorithms for Domination and Independence. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz Polynomial bounds for centered colorings on proper minor-closed graph classes. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrzej Grzesik, Tereza Klimosova, Marcin Pilipczuk, Michal Pilipczuk Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christophe Paul, Michal Pilipczuk (eds.) 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland Search on Bibsonomy IPEC The full citation details ... 2019 DBLP  BibTeX  RDF
1Pål Grønås Drange, Michal Pilipczuk A Polynomial Kernel for Trivially Perfect Editing. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Florian Barbero, Christophe Paul, Michal Pilipczuk Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk Subexponential Parameterized Algorithm for Interval Completion. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001 Below All Subsets for Minimal Connected Dominating Set. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz Kernelization and approximation of distance-r independent sets on nowhere dense graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dusan Knop, Michal Pilipczuk, Marcin Wrochna Tight complexity lower bounds for integer linear programming with few constraints. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh 0001 Randomized contractions meet lean decompositions. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk Progressive Algorithms for Domination and Independence. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz Model-Checking on Ordered Structures. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz Polynomial bounds for centered colorings on proper minor-closed graph classes. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk First-order interpretations of bounded expansion classes. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk Parameterized circuit complexity of model checking first-order logic on sparse structures. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk Definable decompositions for graphs of bounded linear cliquewidth. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Michal Pilipczuk, Marcin Wrochna On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. Search on Bibsonomy TOCT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk Hardness of Approximation for H-free Edge Modification Problems. Search on Bibsonomy TOCT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marcin Pilipczuk, Michal Pilipczuk Planar Digraphs. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna On Directed Feedback Vertex Set Parameterized by Treewidth. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk First-Order Interpretations of Bounded Expansion Classes. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk Definable decompositions for graphs of bounded linear cliquewidth. Search on Bibsonomy LICS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk On the number of types in sparse graphs. Search on Bibsonomy LICS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk Parameterized circuit complexity of model-checking on sparse structures. Search on Bibsonomy LICS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala Linear Kernels for Outbranching Problems in Sparse Digraphs. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk Hitting forbidden subgraphs in graphs of bounded treewidth. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna Polynomial Kernelization for Removing Induced Claws and Diamonds. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Florian Barbero, Christophe Paul, Michal Pilipczuk Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Andrzej Grzesik, Tereza Klimosova, Marcin Pilipczuk, Michal Pilipczuk Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Florian Barbero, Christophe Paul, Michal Pilipczuk Strong immersion is a well-quasi-ordering for semi-complete digraphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Mikolaj Bojanczyk, Michal Pilipczuk Optimizing tree decompositions in MSO. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna On Directed Feedback Vertex Set parameterized by treewidth. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz On low rank-width colorings. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk On Wideness and Stability. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk Hardness of Approximation for Strip Packing. Search on Bibsonomy TOCT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz On Low Rank-Width Colorings. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mikolaj Bojanczyk, Michal Pilipczuk Optimizing Tree Decompositions in MSO. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Florian Barbero, Christophe Paul, Michal Pilipczuk Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001, Marcin Wrochna Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna Tight Lower Bounds for the Complexity of Multicoloring. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. Search on Bibsonomy LICS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk On Group Feedback Vertex Set Parameterized by the Size of the Cutset. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk How to hunt an invisible rabbit on a graph. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001 Below all subsets for Minimal Connected Dominating Set. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna Cutwidth: obstructions and algorithmic aspects. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese Approximation and parameterized algorithms for geometric independent set with shrinking. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna Linear kernels for edge deletion problems to immersion-closed graph classes. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz The Generalised Colouring Numbers on Classes of Bounded Expansion. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Mikolaj Bojanczyk, Michal Pilipczuk Definability equals recognizability for graphs of bounded treewidth. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk Hardness of approximation for strip packing. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz Neighborhood complexity and kernelization for nowhere dense classes of graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna Tight lower bounds for the complexity of multicoloring. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk Hardness of approximation for H-free edge modification problems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Michal Pilipczuk, Szymon Torunczyk On Ultralimits of Sparse Graph Classes. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2016 DBLP  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk Known Algorithms for Edge Clique Cover are Probably Optimal. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk Designing FPT Algorithms for Cut Problems Using Randomized Contractions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk A ck n 5-Approximation Algorithm for Treewidth. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk Computing Cutwidth and Pathwidth of Semi-complete Digraphs. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk Exact Algorithms for Induced Subgraph Problems. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar Shortest Paths in One-Counter Systems. Search on Bibsonomy FoSSaCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh 0001, Sebastian Siebertz, Somnath Sikdar Kernelization and Sparseness: the Case of Dominating Set. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Marcin Wrochna On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Filip Murlak, Charles Paperman, Michal Pilipczuk Schema Validation via Streaming Circuits. Search on Bibsonomy PODS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk Subexponential parameterized algorithm for Interval Completion. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna Cutwidth: Obstructions and Algorithmic Aspects. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna Edge Bipartization Faster Than 2^k. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz The Generalised Colouring Numbers on Classes of Bounded Expansion. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Lower Bounds for Approximation Schemes for Closest String. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk Hardness of Approximation for H-Free Edge Modification Problems. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mikolaj Bojanczyk, Michal Pilipczuk Definability equals recognizability for graphs of bounded treewidth. Search on Bibsonomy LICS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk Computing Tree-Depth Faster Than 2n. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk Modifying a Graph Using Vertex Elimination. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk Minimizing Rosenthal Potential in Multicast Games. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk Sitting Closer to Friends than Enemies, Revisited. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk A Subexponential Parameterized Algorithm for Proper Interval Completion. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 208 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license