|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 43 publication records. Showing 43 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 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 | Marek Cygan, Marcin Pilipczuk |
Even Faster Exact Bandwidth. |
ACM Transactions on Algorithms |
2012 |
DBLP DOI 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 | 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 | Marek Cygan, Marcin Pilipczuk |
Bandwidth and distortion revisited. |
Discrete Applied Mathematics |
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 | 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 | 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 | Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan |
Towards optimal kernel for connected vertex cover in planar graphs |
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 | Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Approximation Algorithms for Union and Intersection Covering Problems |
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 | Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski |
On the Zagreb index inequality of graphs with prescribed vertex degrees. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk |
Breaking the 2n-barrier for Irredundance: Two lines of attack. |
J. Discrete Algorithms |
2011 |
DBLP DOI 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 | 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, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Approximation Algorithms for Union and Intersection Covering Problems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk |
Exact and approximate bandwidth. |
Theor. Comput. Sci. |
2010 |
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 |
Bandwidth and Distortion Revisited |
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, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Fast Approximation in Subspaces by Doubling Metric Decomposition. |
ESA |
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 |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
Capacitated Domination Faster Than O(2n). |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
Irredundant Set Faster Than O(2n). |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Fast Approximation in Subspaces by Doubling Metric Decomposition |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk |
Even Faster Exact Bandwidth |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
Beyond O*(2^n) in domination-type problems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk |
Exact and Approximate Bandwidth. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz |
Exponential-Time Approximation of Hard Problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk |
Faster Exact Bandwidth. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #43 of 43 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")