|
|
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 Leizhen Cai and Chengwei Guo. Contracting Few Edges to Remove Forbidden
Subgraphs Leizhen
Cai and Yufei Cai. Incompressibility of
H-Free Edge Modification Problems N.S. Narayanaswamy and R. Subashini. FPT algorithms for Consecutive Ones Submatrix
problems Dieter Kratsch and
Stefan Kratsch. The Jump Number Problem:
Exact and Parameterized 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 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 Rémy Belmonte, Petr Golovach, Pim van 'T Hof and Daniel
Paulusma. Parameterized Complexity of Two
Edge Contraction Problems with Degree Constraints
|