default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIPEC 2013: Sophia Antipolis, France
- Gregory Z. Gutin, Stefan Szeider
:
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8246, Springer 2013, ISBN 978-3-319-03897-1 - Russell Impagliazzo, Ramamohan Paturi:
Exact Complexity and Satisfiability - (Invited Talk). 1-3 - Vikraman Arvind:
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. 4-15 - Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. 16-27 - Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. 28-40 - Hans L. Bodlaender, Paul S. Bonsma, Daniel Lokshtanov:
The Fine Details of Fast Dynamic Programming over Tree Decompositions. 41-53 - Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. 54-65 - Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. 66-77 - Jaroslaw Blasiok, Marcin Kaminski:
Chain Minors Are FPT. 78-83 - Leizhen Cai, Yufei Cai:
Incompressibility of H-Free Edge Modification. 84-96 - Leizhen Cai, Chengwei Guo:
Contracting Few Edges to Remove Forbidden Induced Subgraphs. 97-109 - Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. 110-122 - Mateus de Oliveira Oliveira:
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs. 123-136 - Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2 n. 137-149 - Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. 150-162 - Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. 163-176 - Sylvain Guillemot, Dániel Marx:
A Faster FPT Algorithm for Bipartite Contraction. 177-188 - Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. 189-201 - Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
A Completeness Theory for Polynomial (Turing) Kernelization. 202-215 - Bart M. P. Jansen:
On Sparsification for Computing Treewidth. 216-229 - Dieter Kratsch, Stefan Kratsch:
The Jump Number Problem: Exact and Parameterized. 230-242 - Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. 243-254 - Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). 255-267 - Lukás Mach, Tomas Toufar:
Amalgam Width of Matroids. 268-280 - Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. 281-294 - N. S. Narayanaswamy, R. Subashini:
FPT Algorithms for Consecutive Ones Submatrix Problems. 295-307 - Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle:
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. 308-320 - Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. 321-334 - Christoph Stockhusen, Till Tantau:
Completeness Results for Parameterized Space Classes. 335-347 - Antonis Thomas, Jan van Leeuwen:
Treewidth and Pure Nash Equilibria. 348-360 - Meirav Zehavi:
Algorithms for k-Internal Out-Branching. 361-373
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
