Jakub Onufry Wojtaszczyk
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
9
Venues
8
Active years
2010–2012
Best venue rank
A*
Where they publish
Papers
9 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2012 | LATIN | Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2012 | MFCS | Sitting Closer to Friends Than Enemies, Revisited. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | ESA | Scheduling Partially Ordered Jobs Faster Than 2 n. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | FOCS | Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
| 2011 | ICALP | Approximation Schemes for Capacitated Geometric Network Design. | Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk |
| 2011 | ICALP | Subset Feedback Vertex Set Is Fixed-Parameter Tractable. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | SODA | The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2010 | CIAC | Irredundant Set Faster Than | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2010 | WG | Kernelization Hardness of Connectivity Problems in | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |