default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th IPEC 2020: Hong Kong (Virtual Conference)
- Yixin Cao
, Marcin Pilipczuk:
15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Hong Kong (Virtual Conference), December 14-18, 2020. LIPIcs 180, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-172-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Akanksha Agrawal, M. S. Ramanujan:
On the Parameterized Complexity of Clique Elimination Distance. 1:1-1:13 - Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. 2:1-2:16 - Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. 3:1-3:17 - Hans L. Bodlaender, Marieke van der Wegen:
Parameterized Complexity of Scheduling Chains of Jobs with Delays. 4:1-4:15 - Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa:
Vertex Deletion into Bipartite Permutation Graphs. 5:1-5:16 - Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the Mim-Width of Hereditary Graph Classes. 6:1-6:18 - Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. 7:1-7:16 - Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. 8:1-8:15 - Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. 9:1-9:17 - Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. 10:1-10:15 - Carl Einarson, Felix Reidl:
A General Kernelization Technique for Domination and Independence Problems in Sparse Classes. 11:1-11:15 - Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. 12:1-12:11 - Marcelo Garlet Milani:
A Polynomial Kernel for Funnel Arc Deletion Set. 13:1-13:13 - Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
FPT Approximation for Constrained Metric k-Median/Means. 14:1-14:19 - Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. 15:1-15:15 - Radek Husek, Dusan Knop, Tomás Masarík:
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. 16:1-16:18 - Andreas Emil Feldmann, Davis Issac, Ashutosh Rai:
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. 17:1-17:16 - Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Deletion to Scattered Graph Classes. 18:1-18:17 - Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. 19:1-19:18 - Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. 20:1-20:14 - Yasuaki Kobayashi, Yota Otachi:
Parameterized Complexity of Graph Burning. 21:1-21:10 - Tuukka Korhonen:
Finding Optimal Triangulations Parameterized by Edge Clique Cover. 22:1-22:18 - Lukasz Kowalik, Konrad Majewski:
The Asymmetric Travelling Salesman Problem In Sparse Digraphs. 23:1-23:18 - Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. 24:1-24:15 - Jesper Nederlof, Céline M. F. Swennenhuis:
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. 25:1-25:17 - Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Maximum Degree Contraction Problem. 26:1-26:16 - Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst:
PACE Solver Description: Fluid. 27:1-27:3 - Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst:
PACE Solver Description: PID^⋆. 28:1-28:4 - Ruben Brokkelkamp, Raymond van Venetië, Mees J. de Vries, Jan Westerdiep:
PACE Solver Description: tdULL. 29:1-29:4 - Tuukka Korhonen:
PACE Solver Description: SMS. 30:1-30:4 - Zijian Xu, Dejun Mao, Vorapong Suppakitpaisarn:
PACE Solver Description: Computing Exact Treedepth via Minimal Separators. 31:1-31:4 - Ben Strasser:
PACE Solver Description: Tree Depth with FlowCutter. 32:1-32:4 - Sylwester Swat:
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem. 33:1-33:4 - James Trimble:
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth. 34:1-34:4 - James Trimble:
PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth. 35:1-35:4 - Marcin Wrochna:
PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions. 36:1-36:4 - Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki:
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. 37:1-37:18
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:
