default search action
14th IPEC 2019: Munich, Germany
- Bart M. P. Jansen
, Jan Arne Telle
14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany. LIPIcs 148, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-129-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Benjamin Aram Berendsohn, László Kozma, Dániel Marx:
Finding and Counting Permutations via CSPs. 1:1-1:16 - Stéphane Bessy, Marin Bougeret
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. 2:1-2:16 - Markus Bläser, Christian Engels
Parameterized Valiant's Classes. 3:1-3:14 - Johannes Blum
Hierarchy of Transportation Network Parameters and Hardness Results. 4:1-4:15 - Édouard Bonnet
Metric Dimension Parameterized by Treewidth. 5:1-5:15 - Marco Bressan
Faster Subgraph Counting in Sparse Graphs. 6:1-6:15 - Rajesh Chitnis
Towards a Theory of Parameterized Streaming Algorithms. 7:1-7:15 - Rajesh Chitnis
FPT Inapproximability of Directed Cut and Connectivity Problems. 8:1-8:20 - Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. 9:1-9:17 - Jan Dreier
The Complexity of Packing Edge-Disjoint Paths. 10:1-10:16 - Jan Dreier
Hardness of FO Model-Checking on Random Graphs. 11:1-11:15 - Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa
Computing the Largest Bond of a Graph. 12:1-12:15 - Hiroshi Eto, Tesshu Hanaka
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. 13:1-13:15 - Till Fluschnik
Multistage Vertex Cover. 14:1-14:14 - Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron:
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. 15:1-15:16 - Jiawei Gao:
On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs. 16:1-16:17 - Alexander Göke, Lydia Mirabel Mendoza Cadena
Resolving Infeasibility of Linear Systems: A Parameterized Approach. 17:1-17:15 - Petr A. Golovach
Clustering to Given Connectivities. 18:1-18:17 - Guilherme de C. M. Gomes
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. 19:1-19:15 - Thekla Hamm
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. 20:1-20:14 - Edin Husic
The Independent Set Problem Is FPT for Even-Hole-Free Graphs. 21:1-21:12 - Yoichi Iwata, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. 22:1-22:11 - Jana Novotná
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. 23:1-23:11 - Gregory Rosenthal
Beating Treewidth for Average-Case Subgraph Isomorphism. 24:1-24:14 - Muhammad Ayaz Dzulfikar, Johannes Klaus Fichte
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). 25:1-25:23
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-13 19:00 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: