|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fedor V. Fomin, Michal Pilipczuk |
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph  |
CoRR  |
2013 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk |
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pål G. Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
A O(c^k n) 5-Approximation Algorithm for Treewidth |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. |
SIAM J. Discrete Math. |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
Known algorithms for EDGE CLIQUE COVER are probably optimal. |
SODA |
2013 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Michal Pilipczuk |
Jungles, bundles, and fixed parameter tractability. |
SODA |
2013 |
DBLP BibTeX RDF |
|
| 1 | Michal Pilipczuk |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
Tight bounds for Parameterized Complexity of Cluster Editing. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk |
Finding a maximum induced degenerate subgraph faster than 2^n |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michal Pilipczuk |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström |
Fixed-parameter tractability of multicut in directed acyclic graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk |
Designing FPT algorithms for cut problems using randomized contractions |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Sitting closer to friends than enemies, revisited |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
Known algorithms for EDGE CLIQUE COVER are probably optimal |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk |
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Kernelization hardness of connectivity problems in d-degenerate graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski |
Some results on Vizing's conjecture and related problems. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk |
How to Eliminate a Graph. |
WG |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström |
Clique Cover and Graph Separation: New Incompressibility Results. |
ICALP |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström |
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. |
ICALP |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk |
Minimizing Rosenthal Potential in Multicast Games. |
ICALP |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Sitting Closer to Friends Than Enemies, Revisited. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk |
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? |
IPEC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk |
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. |
IPEC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk |
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. |
FOCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Dominating set is fixed parameter tractable in claw-free graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström |
Clique cover and graph separation: New incompressibility results |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Michal Pilipczuk |
Jungles, bundles, and fixed parameter tractability |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
On Multiway Cut parameterized above lower bounds |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Scheduling partially ordered jobs faster than 2^n |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
Subexponential fixed-parameter tractability of cluster editing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
Solving connectivity problems parameterized by treewidth in single exponential time |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michal Pilipczuk |
Problems parameterized by treewidth tractable in single exponential time: a logical approach |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
On group feedback vertex set parameterized by the size of the cutset |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter |
Parameterized Complexity of Eulerian Deletion Problems. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Scheduling Partially Ordered Jobs Faster Than 2 n. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk |
Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
On the Hardness of Losing Width. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
On Multiway Cut Parameterized above Lower Bounds. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
On Cutwidth Parameterized by Vertex Cover. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Dominating Set is Fixed Parameter Tractable in Claw-free Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Subset feedback vertex set is fixed parameter tractable |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #53 of 53 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")