IPEC 2013
September 04-06
Sophia Antipolis, France

IPEC 2013 Accepted Papers

Sylvain Guillemot and Daniel Marx. A faster FPT algorithm for Bipartite Contraction
Fafianie Stefan, Hans L. Bodlaender and Jesper Nederlof. Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
Bart M. P. Jansen. On Sparsification for Treewidth Computations
Edouard Bonnet, Bruno Escoffier, Eunjung Kim and Vangelis Paschos. On Subexponential and FPT-time Inapproximability
Edouard Bonnet, Bruno Escoffier, Vangelis Paschos and Emeric Tourniaire. Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization
Leizhen Cai and Chengwei Guo. Contracting Few Edges to Remove Forbidden Subgraphs
Leizhen Cai and Yufei Cai. Incompressibility of H-Free Edge Modification Problems
Bernhard Bliem, Reinhard Pichler and Stefan Woltran. Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem
Fedor Fomin, Daniel Lokshtanov, Rajesh Chitnis, Pranabendu Misra, Ramanujan M. S. and Saket Saurabh. Faster Exact Algorithms for Some Terminal Set Problems
Jarosław Błasiok and Marcin Kaminski. Chain minors are FPT
Christoph Stockhusen and Till Tantau. Completeness Results for Parameterized Space Classes
N.S. Narayanaswamy and R. Subashini. FPT algorithms for Consecutive Ones Submatrix problems
Meirav Zehavi. Algorithms for k-Internal Out-Branching
Dieter Kratsch and Stefan Kratsch. The Jump Number Problem: Exact and Parameterized
Ramanujan M. S., Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh and Geevarghese Philip. Hardness of r-Dominating Set on graphs of diameter (r+1)
Fedor Fomin, Archontia Giannopoulou and Michał Pilipczuk. Computing Tree-depth Faster Than $2^{n}$
Mateus de Oliveira Oliveira. Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström and Xi Wu. A Completeness Theory for Polynomial (Turing) Kernelization
Jakub Gajarský, Michael Lampis and Sebastian Ordyniak. Parameterized Algorithms for Modular-Width
Hans Bodlaender, Paul Bonsma and Daniel Lokshtanov. The fine details of fast dynamic programming over tree decompositions
Lukas Mach and Tomas Toufar. Amalgam width of matroids
Olawale Hassan, Iyad Kanj, Daniel Lokshtanov and Ljubomir Perkovic. On the Ordered List Subgraph Embedding Problems
Rajesh Chitnis, Mohammadtaghi Hajiaghayi and Guy Kortsarz. Fixed-Parameter and Approximation Algorithms: A New Look
Daniel Lokshtanov, Neeldhara Misra and Saket Saurabh. On the hardness of eliminating small induced subgraphs by contracting edges
Amer Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour and Akira Suzuki. On the Parameterized Complexity of Reconfiguration Problems
Vikraman Arvind. The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups
Antonis Thomas and Jan van Leeuwen. Treewidth and Pure Nash Equilibria
Yuri Rabinovich, Jan Arne Telle and Martin Vatshelle. Upper bounds on boolean-width with applications to exact algorithms
Rémy Belmonte, Petr Golovach, Pim van 'T Hof and Daniel Paulusma. Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints

logo Inria logo U-Nice   logo I3S   logo I3S                     logo EATCS    logo eurecom    logo paca                   logo Google       
webmaster - credits