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 (18)
Publication types (Num. hits)
article(98) book(1) incollection(3) inproceedings(64)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 167 publication records. Showing 166 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
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, 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
1Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 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
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, 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
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 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 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, 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 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 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
1Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk How to Hunt an Invisible Rabbit on a Graph. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna Edge Bipartization faster than 2k. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh Lower bounds for approximation schemes for Closest String. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Michal Pilipczuk, Marcin Wrochna On space efficiency of algorithms working on structural decompositions of graphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dániel Marx, Michal Pilipczuk Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  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 CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar Shortest paths in one-counter systems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Michal Pilipczuk, Szymon Torunczyk On ultralimits of sparse graph classes. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala Linear kernels for outbranching problems in sparse digraphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  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 CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger Exploring the Subexponential Complexity of Completion Problems. Search on Bibsonomy TOCT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh Parameterized Algorithms Search on Bibsonomy 2015   DOI  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna Polynomial Kernelization for Removing Induced Claws and Diamonds. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala Linear Kernels for Outbranching Problems in Sparse Digraphs. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pål Grønås Drange, Michal Pilipczuk A Polynomial Kernel for Trivially Perfect Editing. Search on Bibsonomy ESA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Michal Pilipczuk Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. Search on Bibsonomy ESA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. Search on Bibsonomy ESA The full citation details ... 2015 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 CTW The full citation details ... 2015 DBLP  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk Scheduling Partially Ordered Jobs Faster than 2 n. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh On Cutwidth Parameterized by Vertex Cover. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter Parameterized Complexity of Eulerian Deletion Problems. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh On the Hardness of Losing Width. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk Preprocessing subgraph and minor problems: When does a small vertex cover help? Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk A subexponential parameterized algorithm for Interval Completion. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk A subexponential parameterized algorithm for Proper Interval Completion. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk Representative sets for multisets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar Kernelization and Sparseness: the case of Dominating Set. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk Hitting forbidden subgraphs in graphs of bounded treewidth. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Pål Grønås Drange, Michal Pilipczuk A Polynomial Kernel for Trivially Perfect Editing. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström Clique Cover and Graph Separation: New Incompressibility Results. Search on Bibsonomy TOCT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Michal Pilipczuk Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). Search on Bibsonomy STACS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger Exploring Subexponential Parameterized Complexity of Completion Problems. Search on Bibsonomy STACS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh Minimum bisection is fixed parameter tractable. Search on Bibsonomy STOC The full citation details ... 2014 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 FOCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. Search on Bibsonomy FOCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk A Subexponential Parameterized Algorithm for Proper Interval Completion. Search on Bibsonomy ESA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk Synthesizing transformations from XML schema mappings. Search on Bibsonomy ICDT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 166 (100 per page; Change: )
Pages: [1][2][>>]
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