default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIPEC 2017: Vienna, Austria
- Daniel Lokshtanov, Naomi Nishimura:
12th International Symposium on Parameterized and Exact Computation, IPEC 2017, Vienna, Austria, September 6-8, 2017. LIPIcs 89, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-051-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Akanksha Agrawal
, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. 1:1-1:12 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. 2:1-2:13 - Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. 3:1-3:12 - Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. 4:1-4:12 - Julien Baste, Dimitrios M. Thilikos:
Contraction-Bidimensionality of Geometric Intersection Graphs. 5:1-5:13 - Andreas Björklund, Petteri Kaski, R. Ryan Williams:
Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. 6:1-6:13 - Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. 7:1-7:13 - Édouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the Parameterized Complexity of Red-Blue Points Separation. 8:1-8:13 - Ralph Bottesch:
Relativization and Interactive Proof Systems in Parameterized Complexity Theory. 9:1-9:12 - Marin Bougeret, Ignasi Sau:
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. 10:1-10:13 - Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. 11:1-11:12 - Karthekeyan Chandrasekaran, Sahand Mozaffari:
Odd Multiway Cut in Directed Acyclic Graphs. 12:1-12:12 - Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. 13:1-13:13 - Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. 14:1-14:12 - Lech Duraj, Marvin Künnemann, Adam Polak:
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. 15:1-15:13 - David Eppstein, Denis Kurz:
K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. 16:1-16:13 - Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. 17:1-17:13 - Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. 18:1-18:13 - Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO Model Checking of Geometric Graphs. 19:1-19:12 - Eva-Maria C. Hols, Stefan Kratsch:
Smaller Parameters for Vertex Cover Kernelization. 20:1-20:12 - Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. 21:1-21:13 - Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. 22:1-22:12 - Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. 23:1-23:13 - Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. 24:1-24:11 - Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki:
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. 25:1-25:12 - Michael Lampis, Valia Mitsou:
Treewidth with a Quantifier Alternation Revisited. 26:1-26:12 - George Manoussakis:
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. 27:1-27:8 - Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt:
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. 28:1-28:12 - Tom C. van der Zanden, Hans L. Bodlaender:
Computing Treewidth on the GPU. 29:1-29:13 - Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller:
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. 30:1-30:12
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 2025-12-23 00:51 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:
