default search action
IPEC 2014: Wroclaw, Poland
- Marek Cygan
, Pinar Heggernes:
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8894, Springer 2014, ISBN 978-3-319-13523-6 - Hans L. Bodlaender
Lower Bounds for Kernelization. 1-14 - Tatsuya Akutsu
On the Parameterized Complexity of Associative and Commutative Unification. 15-27 - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of H -free Edge Deletion. 28-38 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
Solving Linear Equations Parameterized by Hamming Weight. 39-50 - Vikraman Arvind, Gaurav Rattan:
The Parameterized Complexity of Geometric Graph Isomorphism. 51-62 - Julien Baste
The Role of Planarity in Connectivity Problems Parameterized by Treewidth. 63-74 - Cristina Bazgan, André Nichterlein:
Parameterized Inapproximability of Degree Anonymization. 75-84 - Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi
The k -Distinct Language: Parameterized Automata Constructions. 85-96 - Marthe Bonamy, Lukasz Kowalik:
A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. 97-109 - Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. 110-121 - Simone Bova, Robert Ganian
Quantified Conjunctive Queries on Partially Ordered Sets. 122-134 - Jannis Bulian, Anuj Dawar
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. 135-146 - Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff:
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size. 147-158 - Rajesh Hemant Chitnis
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). 159-171 - Janka Chlebíková
The Firefighter Problem: A Structural Analysis. 172-183 - Holger Dell:
AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations. 184-195 - Petr A. Golovach
Editing to a Graph of Given Degrees. 196-207 - Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. 208-220 - Matthew Johnson
Finding Shortest Paths Between Graph Colourings. 221-233 - Zoltán Király
Shortest Paths in Nearly Conservative Digraphs. 234-245 - Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
Reconfiguration over Tree Decompositions. 246-257 - Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl
Finite Integer Index of Pathwidth and Treewidth. 258-269 - Sebastian Ordyniak, Alexandru Popa
A Parameterized Study of Maximum Generalized Pattern Matching Problems. 270-281 - Henri Perret du Cray, Ignasi Sau
Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs. 282-293 - Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
Improved Parameterized Algorithms for Network Query Problems. 294-306 - Stefan Kratsch, Vuong Anh Quyen:
On Kernels for Covering and Packing ILPs with Small Coefficients. 307-318 - Igor Razgon:
No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth. 319-331 - Patrick Traxler:
The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments. 332-341
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-11-22 19:32 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: