default search action
IPEC 2018: Helsinki, Finland
- Christophe Paul, Michal Pilipczuk:
13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland. LIPIcs 115, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-084-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Radu Curticapean:
Counting Problems in Parameterized Complexity. 1:1-1:18 - Julien Baste
, Ignasi Sau
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. 2:1-2:13 - Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel:
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. 3:1-3:14 - Karl Bringmann, Thore Husfeldt, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. 4:1-4:13 - Kustaa Kangas, Mikko Koivisto
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. 5:1-5:13 - Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. 6:1-6:14 - Junjie Luo, Hendrik Molter, Ondrej Suchý
A Parameterized Complexity View on Collapsing k-Cores. 7:1-7:14 - Saket Saurabh, Meirav Zehavi:
Parameterized Complexity of Multi-Node Hubs. 8:1-8:14 - Kitty Meeks
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. 9:1-9:14 - Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs. 10:1-10:14 - David Eppstein, Daniel Lokshtanov:
The Parameterized Complexity of Finding Point Sets with Hereditary Properties. 11:1-11:14 - Júlio Araújo
Dual Parameterization of Weighted Coloring. 12:1-12:14 - Max Bannach, Till Tantau:
Computing Kernels in Parallel: Lower and Upper Bounds. 13:1-13:14 - Akanksha Agrawal
Exploring the Kernelization Borders for Hitting Cycles. 14:1-14:14 - Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. 15:1-15:13 - David Eppstein, Elham Havvaei:
Parameterized Leaf Power Recognition via Embedding into Graph Products. 16:1-16:14 - Édouard Bonnet, Nicolas Bousquet, Pierre Charbit
Parameterized Complexity of Independent Set in H-Free Graphs. 17:1-17:13 - Stefan Kratsch, Shaohua Li
Multi-Budgeted Directed Cuts. 18:1-18:14 - Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. 19:1-19:13 - Charis Papadopoulos
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. 20:1-20:14 - Tomas Gavenciak
Integer Programming in Parameterized Complexity: Three Miniatures. 21:1-21:16 - Ivan Bliznets, Danil Sagunov
Solving Target Set Selection with Bounded Thresholds Faster than 2^n. 22:1-22:14 - Katrin Casel:
Resolving Conflicts for Lower-Bounded Clustering. 23:1-23:14 - Marc Roth
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. 24:1-24:14 - Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh:
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. 25:1-25:13 - Édouard Bonnet, Florian Sikora:
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. 26:1-26:15
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-12-05 20: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: