Test2

From preprocessing
Jump to: navigation, search

Conferences

2013

Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen - Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) 20:353--364, Dagstuhl, Germany,2013
http://drops.dagstuhl.de/opus/volltexte/2013/3947
Bibtex
Author : Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
Title : Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
In : 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) -
Address : Dagstuhl, Germany
Date : 2013

Michal Pilipczuk - Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) 20:197--208, Dagstuhl, Germany,2013
http://drops.dagstuhl.de/opus/volltexte/2013/3934
Bibtex
Author : Michal Pilipczuk
Title : Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
In : 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) -
Address : Dagstuhl, Germany
Date : 2013

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger - Tight bounds for Parameterized Complexity of Cluster Editing
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) 20:32--43, Dagstuhl, Germany,2013
http://drops.dagstuhl.de/opus/volltexte/2013/3920
Bibtex
Author : Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
Title : Tight bounds for Parameterized Complexity of Cluster Editing
In : 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) -
Address : Dagstuhl, Germany
Date : 2013

Fedor V. Fomin, Yngve Villanger - Searching for better fill-in
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) 20:8--19, Dagstuhl, Germany,2013
http://drops.dagstuhl.de/opus/volltexte/2013/3918
Bibtex
Author : Fedor V. Fomin, Yngve Villanger
Title : Searching for better fill-in
In : 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) -
Address : Dagstuhl, Germany
Date : 2013

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos - Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) 20:92--103, Dagstuhl, Germany,2013
http://drops.dagstuhl.de/opus/volltexte/2013/3925
Bibtex
Author : Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Title : Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
In : 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) -
Address : Dagstuhl, Germany
Date : 2013

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk - Known algorithms for Edge Clique Cover are probably optimal
Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 1044--1053,2012
http://arxiv.org/abs/1203.1754
Bibtex
Author : Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk
Title : Known algorithms for Edge Clique Cover are probably optimal
In : Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA) -
Address :
Date : 2012

Fedor V. Fomin, Michał Pilipczuk - Jungles, bundles, and fixed parameter tractability
Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 396--413,2012
http://arxiv.org/abs/1112.1538
Bibtex
Author : Fedor V. Fomin, Michał Pilipczuk
Title : Jungles, bundles, and fixed parameter tractability
In : Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA) -
Address :
Date : 2012

2012

Petr A. Golovach, Dieter Kratsch, Daniel Paulusma - Detecting Induced Minors in AT-Free Graphs
Proceedings of the 23th International Symposium on Algorithms and Computation (ISAAC 2012), LNCS 7676:495-505,2012
Bibtex
Author : Petr A. Golovach, Dieter Kratsch, Daniel Paulusma
Title : Detecting Induced Minors in AT-Free Graphs
In : Proceedings of the 23th International Symposium on Algorithms and Computation (ISAAC 2012), LNCS -
Address :
Date : 2012

Petr A. Golovach, Daniel Paulusma, Jian Song - Closing Complexity Gaps for Coloring Problems on H-Free Graphs
Proceedings of the 23th International Symposium on Algorithms and Computation (ISAAC 2012), LNCS 7676:14-23,2012
Bibtex
Author : Petr A. Golovach, Daniel Paulusma, Jian Song
Title : Closing Complexity Gaps for Coloring Problems on H-Free Graphs
In : Proceedings of the 23th International Symposium on Algorithms and Computation (ISAAC 2012), LNCS -
Address :
Date : 2012

Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh - Planar {F}-Deletion: Approximation, Kernelization and Optimal {FPT} Algorithms
Proceedings of 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012) pp. 470-479,2012
http://arxiv.org/abs/1204.4230
Bibtex
Author : Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
Title : Planar {F}-Deletion: Approximation, Kernelization and Optimal {FPT} Algorithms
In : Proceedings of 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012) -
Address :
Date : 2012

Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michał Pilipczuk - Designing {FPT} algorithms for cut problems using randomized contractions
Proceedings of 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012) pp. 460-469,2012
http://arxiv.org/abs/1207.4079
Bibtex
Author : Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michał Pilipczuk
Title : Designing {FPT} algorithms for cut problems using randomized contractions
In : Proceedings of 53rd Annual Symposium on Foundations of Computer Science (FOCS 2012) -
Address :
Date : 2012

Fedor V. Fomin, Bart M. P. Jansen, Michał Pilipczuk - Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
Proceedings of 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), LNCS 7535:97-108,2012
http://arxiv.org/abs/1206.4912
Bibtex
Author : Fedor V. Fomin, Bart M. P. Jansen, Michał Pilipczuk
Title : Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
In : Proceedings of 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), LNCS -
Address :
Date : 2012

Marcin Pilipczuk, Michał Pilipczuk - Finding a Maximum Induced Degenerate Subgraph Faster Than 2^n
Proceedings of 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), LNCS 7535:3-12,2012
http://arxiv.org/abs/1208.4449
Bibtex
Author : Marcin Pilipczuk, Michał Pilipczuk
Title : Finding a Maximum Induced Degenerate Subgraph Faster Than 2^n
In : Proceedings of 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), LNCS -
Address :
Date : 2012

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei - An exact algorithm for subset feedback vertex set on chordal graphs
Proceedings of 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), LNCS 7535:85-96,2012
Bibtex
Author : Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
Title : An exact algorithm for subset feedback vertex set on chordal graphs
In : Proceedings of 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), LNCS -
Address :
Date : 2012

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk - On group feedback vertex set parameterized by the size of the cutset
Proceedings of 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012), LNCS 7551:194--205,2012
http://arxiv.org/abs/1112.6255
Bibtex
Author : Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk
Title : On group feedback vertex set parameterized by the size of the cutset
In : Proceedings of 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012), LNCS -
Address :
Date : 2012

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk - How to eliminate a graph
Proceedings of 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012), LNCS 7551:320--331,2012
Bibtex
Author : Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk
Title : How to eliminate a graph
In : Proceedings of 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012), LNCS -
Address :
Date : 2012

Fedor V. Fomin, Saket Saurabh, Yngve Villanger - A Polynomial kernel for Proper Interval Vertex Deletion
Proceedings of 20th European Symposium on Algorithms (ESA 2012), LNCS 7501:467-478,2012
http://arxiv.org/abs/1204.4880
Bibtex
Author : Fedor V. Fomin, Saket Saurabh, Yngve Villanger
Title : A Polynomial kernel for Proper Interval Vertex Deletion
In : Proceedings of 20th European Symposium on Algorithms (ESA 2012), LNCS -
Address :
Date : 2012

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen - Induced Disjoint Paths in Claw-Free Graphs
Proceedings of 20th European Symposium on Algorithms (ESA 2012), LNCS 7501:515-526,2012
http://arxiv.org/abs/1202.4419
Bibtex
Author : Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Title : Induced Disjoint Paths in Claw-Free Graphs
In : Proceedings of 20th European Symposium on Algorithms (ESA 2012), LNCS -
Address :
Date : 2012

Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström - Clique Cover and Graph Separation: New Incompressibility Results
Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track A, LNCS 7391:254-265,2012
http://arxiv.org/abs/1111.0570
Bibtex
Author : Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström
Title : Clique Cover and Graph Separation: New Incompressibility Results
In : Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track A, LNCS -
Address :
Date : 2012

Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström - Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track A, LNCS 7391:581-593,2012
http://arxiv.org/abs/1202.5749
Bibtex
Author : Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström
Title : Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In : Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track A, LNCS -
Address :
Date : 2012

Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michał Pilipczuk - Minimizing Rosenthal Potential in Multicast Games
Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track C, LNCS 7392:535-536,2012
http://www.springerlink.com/content/u2134702514j7303/
Bibtex
Author : Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michał Pilipczuk
Title : Minimizing Rosenthal Potential in Multicast Games
In : Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track C, LNCS -
Address :
Date : 2012

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk - Sitting closer to friends than enemies, revisited
Proceedings of 37th International Symposium on Mathematical Foundations of Computer Sciences (MFCS 2012), LNCS 7464:455-466,2012
http://arxiv.org/abs/1201.1869
Bibtex
Author : Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
Title : Sitting closer to friends than enemies, revisited
In : Proceedings of 37th International Symposium on Mathematical Foundations of Computer Sciences (MFCS 2012), LNCS -
Address :
Date : 2012

Petr A. Golovach, Pim Van 'T Hof, Daniël Paulusma - Obtaining planarity by contracting few edges
Proceedings of 37th International Symposium on Mathematical Foundations of Computer Sciences (MFCS 2012), LNCS 7464:455-466,2012
http://www.springerlink.com/content/u2134702514j7303/
Bibtex
Author : Petr A. Golovach, Pim Van 'T Hof, Daniël Paulusma
Title : Obtaining planarity by contracting few edges
In : Proceedings of 37th International Symposium on Mathematical Foundations of Computer Sciences (MFCS 2012), LNCS -
Address :
Date : 2012

Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger - k-Gap Interval Graphs
Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN 2012), LNCS 7256:350-361,2012
http://www.springerlink.com/content/702787k88kt08316/
Bibtex
Author : Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
Title : k-Gap Interval Graphs
In : Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN 2012), LNCS -
Address :
Date : 2012

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk - Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2^n
Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN 2012), LNCS 7256:195-206,2012
http://dx.doi.org/10.1007/978-3-642-29344-3_17
Bibtex
Author : Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
Title : Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2^n
In : Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN 2012), LNCS -
Address :
Date : 2012

Fedor V. Fomin, Petr A. Golovach - Parameterized Complexity of Connected Even/Odd Subgraph Problems
Proceedings of 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) 14:432-440,2012
http://drops.dagstuhl.de/opus/volltexte/2012/3398/
Bibtex
Author : Fedor V. Fomin, Petr A. Golovach
Title : Parameterized Complexity of Connected Even/Odd Subgraph Problems
In : Proceedings of 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) -
Address :
Date : 2012

Fedor V. Fomin, Yngve Vilanger - Subexponential Parameterized Algorithm for Minimum Fill-in
Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) pp. 1737--1746,2012
http://arxiv.org/abs/1104.2230
Bibtex
Author : Fedor V. Fomin, Yngve Vilanger
Title : Subexponential Parameterized Algorithm for Minimum Fill-in
In : Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) -
Address :
Date : 2012

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh - Bidimensionality and geometric graphs
Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) pp. 1563-1575,2012
http://arxiv.org/abs/1107.2221
Bibtex
Author : Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
Title : Bidimensionality and geometric graphs
In : Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) -
Address :
Date : 2012

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos - Linear kernels for (connected) dominating set on {H}-minor-free graphs
Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) pp. 82-93,2012
http://www.ii.uib.no/~daniello/papers/domsetHMinorFree.pdf
Bibtex
Author : Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
Title : Linear kernels for (connected) dominating set on {H}-minor-free graphs
In : Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) -
Address :
Date : 2012

2011

Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen - Parameterized complexity of firefighting revisited
Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC 2011), LNCS 7112:13--26,2011
http://arxiv.org/abs/1109.4729
Bibtex
Author : Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
Title : Parameterized complexity of firefighting revisited
In : Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC 2011), LNCS -
Address :
Date : 2011

Fedor V. Fomin, Geevarghese Philip, Yngve Villanger - Minimum fill-in of sparse graphs: Kernelization and approximation
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) 13:164-175,2011
http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.164
Bibtex
Author : Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
Title : Minimum fill-in of sparse graphs: Kernelization and approximation
In : IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) -
Address :
Date : 2011


Journals

2013

2012

Book Chapters

2013

2012

Fedor V. Fomin, Dániel Marx - FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, LNCS 7370:457-468,2012
http://dx.doi.org/10.1007/978-3-642-30891-8_19
Bibtex
Author : Fedor V. Fomin, Dániel Marx
Title : FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
In : The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, LNCS -
Address :
Date : 2012