IPEC B

29 papers

YearTitle / Authors
2014A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition.
Marthe Bonamy, Lukasz Kowalik
2014A Parameterized Study of Maximum Generalized Pattern Matching Problems.
Sebastian Ordyniak, Alexandru Popa
2014A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
2014AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations.
Holger Dell
2014Editing to a Graph of Given Degrees.
Petr A. Golovach
2014Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.
Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff
2014Finding Shortest Paths Between Graph Colourings.
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014Finite Integer Index of Pathwidth and Treewidth.
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree.
Jannis Bulian, Anuj Dawar
2014Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs.
Henri Perret du Cray, Ignasi Sau
2014Improved Parameterized Algorithms for Network Query Problems.
Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2014Lower Bounds for Kernelization.
Hans L. Bodlaender
2014No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth.
Igor Razgon
2014On Kernels for Covering and Packing ILPs with Small Coefficients.
Stefan Kratsch, Vuong Anh Quyen
2014On Polynomial Kernelization of
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2014On the Parameterized Complexity of Associative and Commutative Unification.
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura
2014Parameterized Inapproximability of Degree Anonymization.
Cristina Bazgan, André Nichterlein
2014Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers
Marek Cygan, Pinar Heggernes
2014Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem.
Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2014Quantified Conjunctive Queries on Partially Ordered Sets.
Simone Bova, Robert Ganian, Stefan Szeider
2014Reconfiguration over Tree Decompositions.
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
2014Shortest Paths in Nearly Conservative Digraphs.
Zoltán Király
2014Solving Linear Equations Parameterized by Hamming Weight.
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2014The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration.
Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
2014The Firefighter Problem: A Structural Analysis.
Janka Chlebíková, Morgan Chopin
2014The Parameterized Complexity of Geometric Graph Isomorphism.
Vikraman Arvind, Gaurav Rattan
2014The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments.
Patrick Traxler
2014The Role of Planarity in Connectivity Problems Parameterized by Treewidth.
Julien Baste, Ignasi Sau
2014The k -Distinct Language: Parameterized Automata Constructions.
Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi