@Proceedings{jansen_et_al:LIPIcs.IPEC.2019,
title = {{LIPIcs, Volume 148, IPEC'19, Complete Volume}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019},
URN = {urn:nbn:de:0030-drops-116409},
doi = {10.4230/LIPIcs.IPEC.2019},
annote = {Keywords: Theory of computation, Parameterized complexity and exact algorithms}
}
@InProceedings{jansen_et_al:LIPIcs.IPEC.2019.0,
author = {Jansen, Bart M. P. and Telle, Jan Arne},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.0},
URN = {urn:nbn:de:0030-drops-114618},
doi = {10.4230/LIPIcs.IPEC.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{berendsohn_et_al:LIPIcs.IPEC.2019.1,
author = {Berendsohn, Benjamin Aram and Kozma, L\'{a}szl\'{o} and Marx, D\'{a}niel},
title = {{Finding and Counting Permutations via CSPs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {1:1--1:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.1},
URN = {urn:nbn:de:0030-drops-114627},
doi = {10.4230/LIPIcs.IPEC.2019.1},
annote = {Keywords: permutations, pattern matching, constraint satisfaction, exponential time}
}
@InProceedings{bessy_et_al:LIPIcs.IPEC.2019.2,
author = {Bessy, St\'{e}phane and Bougeret, Marin and Carneiro, Alan D. A. and Protti, F\'{a}bio and Souza, U\'{e}verton S.},
title = {{Width Parameterizations for Knot-Free Vertex Deletion on Digraphs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {2:1--2:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.2},
URN = {urn:nbn:de:0030-drops-114631},
doi = {10.4230/LIPIcs.IPEC.2019.2},
annote = {Keywords: Knot, deadlock, width measure, FPT, W\lbrack1\rbrack-hard, directed feedback vertex set}
}
@InProceedings{blaser_et_al:LIPIcs.IPEC.2019.3,
author = {Bl\"{a}ser, Markus and Engels, Christian},
title = {{Parameterized Valiant’s Classes}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.3},
URN = {urn:nbn:de:0030-drops-114648},
doi = {10.4230/LIPIcs.IPEC.2019.3},
annote = {Keywords: Algebraic complexity theory, parameterized complexity theory, Valiant’s classes}
}
@InProceedings{blum:LIPIcs.IPEC.2019.4,
author = {Blum, Johannes},
title = {{Hierarchy of Transportation Network Parameters and Hardness Results}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.4},
URN = {urn:nbn:de:0030-drops-114656},
doi = {10.4230/LIPIcs.IPEC.2019.4},
annote = {Keywords: Graph Parameters, Skeleton Dimension, Highway Dimension, k-Center}
}
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2019.5,
author = {Bonnet, \'{E}douard and Purohit, Nidhi},
title = {{Metric Dimension Parameterized by Treewidth}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.5},
URN = {urn:nbn:de:0030-drops-114668},
doi = {10.4230/LIPIcs.IPEC.2019.5},
annote = {Keywords: Metric Dimension, Treewidth, Parameterized Hardness}
}
@InProceedings{bressan:LIPIcs.IPEC.2019.6,
author = {Bressan, Marco},
title = {{Faster Subgraph Counting in Sparse Graphs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.6},
URN = {urn:nbn:de:0030-drops-114673},
doi = {10.4230/LIPIcs.IPEC.2019.6},
annote = {Keywords: subgraph counting, tree decomposition, degeneracy}
}
@InProceedings{chitnis_et_al:LIPIcs.IPEC.2019.7,
author = {Chitnis, Rajesh and Cormode, Graham},
title = {{Towards a Theory of Parameterized Streaming Algorithms}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.7},
URN = {urn:nbn:de:0030-drops-114682},
doi = {10.4230/LIPIcs.IPEC.2019.7},
annote = {Keywords: Parameterized Algorithms, Streaming Algorithms, Kernels}
}
@InProceedings{chitnis_et_al:LIPIcs.IPEC.2019.8,
author = {Chitnis, Rajesh and Feldmann, Andreas Emil},
title = {{FPT Inapproximability of Directed Cut and Connectivity Problems}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.8},
URN = {urn:nbn:de:0030-drops-114692},
doi = {10.4230/LIPIcs.IPEC.2019.8},
annote = {Keywords: Directed graphs, cuts, connectivity, Steiner problems, FPT inapproximability}
}
@InProceedings{dalozzo_et_al:LIPIcs.IPEC.2019.9,
author = {Da Lozzo, Giordano and Eppstein, David and Goodrich, Michael T. and Gupta, Siddharth},
title = {{C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.9},
URN = {urn:nbn:de:0030-drops-114705},
doi = {10.4230/LIPIcs.IPEC.2019.9},
annote = {Keywords: Clustered planarity, carving-width, non-crossing partitions, FPT}
}
@InProceedings{dreier_et_al:LIPIcs.IPEC.2019.10,
author = {Dreier, Jan and Fuchs, Janosch and Hartmann, Tim A. and Kuinke, Philipp and Rossmanith, Peter and Tauer, Bjoern and Wang, Hung-Lung},
title = {{The Complexity of Packing Edge-Disjoint Paths}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.10},
URN = {urn:nbn:de:0030-drops-114710},
doi = {10.4230/LIPIcs.IPEC.2019.10},
annote = {Keywords: parameterized complexity, embedding, packing, covering, Hamiltonian path, unary binpacking, path-perfect graphs}
}
@InProceedings{dreier_et_al:LIPIcs.IPEC.2019.11,
author = {Dreier, Jan and Rossmanith, Peter},
title = {{Hardness of FO Model-Checking on Random Graphs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.11},
URN = {urn:nbn:de:0030-drops-114721},
doi = {10.4230/LIPIcs.IPEC.2019.11},
annote = {Keywords: random graphs, FO model-checking}
}
@InProceedings{duarte_et_al:LIPIcs.IPEC.2019.12,
author = {Duarte, Gabriel L. and Lokshtanov, Daniel and Pedrosa, Lehilton L. C. and Schouery, Rafael C. S. and Souza, U\'{e}verton S.},
title = {{Computing the Largest Bond of a Graph}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.12},
URN = {urn:nbn:de:0030-drops-114732},
doi = {10.4230/LIPIcs.IPEC.2019.12},
annote = {Keywords: bond, cut, maximum cut, connected cut, FPT, treewidth, clique-width}
}
@InProceedings{eto_et_al:LIPIcs.IPEC.2019.13,
author = {Eto, Hiroshi and Hanaka, Tesshu and Kobayashi, Yasuaki and Kobayashi, Yusuke},
title = {{Parameterized Algorithms for Maximum Cut with Connectivity Constraints}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.13},
URN = {urn:nbn:de:0030-drops-114747},
doi = {10.4230/LIPIcs.IPEC.2019.13},
annote = {Keywords: Maximum cut, Parameterized algorithm, NP-hardness, Graph parameter}
}
@InProceedings{fluschnik_et_al:LIPIcs.IPEC.2019.14,
author = {Fluschnik, Till and Niedermeier, Rolf and Rohm, Valentin and Zschoche, Philipp},
title = {{Multistage Vertex Cover}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.14},
URN = {urn:nbn:de:0030-drops-114753},
doi = {10.4230/LIPIcs.IPEC.2019.14},
annote = {Keywords: NP-hardness, dynamic graph problems, temporal graphs, time-evolving networks, W\lbrack1\rbrack-hardness, fixed-parameter tractability, kernelization}
}
@InProceedings{foucaud_et_al:LIPIcs.IPEC.2019.15,
author = {Foucaud, Florent and Hocquard, Herv\'{e} and Lajou, Dimitri and Mitsou, Valia and Pierron, Th\'{e}o},
title = {{Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.15},
URN = {urn:nbn:de:0030-drops-114765},
doi = {10.4230/LIPIcs.IPEC.2019.15},
annote = {Keywords: Graph homomorphism, Graph modification, Edge-coloured graph, Signed graph}
}
@InProceedings{gao:LIPIcs.IPEC.2019.16,
author = {Gao, Jiawei},
title = {{On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.16},
URN = {urn:nbn:de:0030-drops-114778},
doi = {10.4230/LIPIcs.IPEC.2019.16},
annote = {Keywords: fine-grained complexity, dynamic programming, graph reachability}
}
@InProceedings{goke_et_al:LIPIcs.IPEC.2019.17,
author = {G\"{o}ke, Alexander and Mendoza Cadena, Lydia Mirabel and Mnich, Matthias},
title = {{Resolving Infeasibility of Linear Systems: A Parameterized Approach}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.17},
URN = {urn:nbn:de:0030-drops-114787},
doi = {10.4230/LIPIcs.IPEC.2019.17},
annote = {Keywords: Infeasible subsystems, linear programming, fixed-parameter algorithms}
}
@InProceedings{golovach_et_al:LIPIcs.IPEC.2019.18,
author = {Golovach, Petr A. and Thilikos, Dimitrios M.},
title = {{Clustering to Given Connectivities}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.18},
URN = {urn:nbn:de:0030-drops-114796},
doi = {10.4230/LIPIcs.IPEC.2019.18},
annote = {Keywords: graph clustering, edge connectivity, parameterized complexity}
}
@InProceedings{c.m.gomes_et_al:LIPIcs.IPEC.2019.19,
author = {C. M. Gomes, Guilherme and Sau, Ignasi},
title = {{Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.19},
URN = {urn:nbn:de:0030-drops-114809},
doi = {10.4230/LIPIcs.IPEC.2019.19},
annote = {Keywords: matching cut, bounded degree cut, parameterized complexity, FPT algorithm, polynomial kernel, distance to cluster}
}
@InProceedings{hamm:LIPIcs.IPEC.2019.20,
author = {Hamm, Thekla},
title = {{Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.20},
URN = {urn:nbn:de:0030-drops-114812},
doi = {10.4230/LIPIcs.IPEC.2019.20},
annote = {Keywords: Fixed parameter linear, Path decomposition, Hypergraph}
}
@InProceedings{husic_et_al:LIPIcs.IPEC.2019.21,
author = {Husi\'{c}, Edin and Thomass\'{e}, St\'{e}phan and Trotignon, Nicolas},
title = {{The Independent Set Problem Is FPT for Even-Hole-Free Graphs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {21:1--21:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.21},
URN = {urn:nbn:de:0030-drops-114826},
doi = {10.4230/LIPIcs.IPEC.2019.21},
annote = {Keywords: independent set, FPT algorithm, even-hole-free graph, augmenting graph}
}
@InProceedings{iwata_et_al:LIPIcs.IPEC.2019.22,
author = {Iwata, Yoichi and Kobayashi, Yusuke},
title = {{Improved Analysis of Highest-Degree Branching for Feedback Vertex Set}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {22:1--22:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.22},
URN = {urn:nbn:de:0030-drops-114833},
doi = {10.4230/LIPIcs.IPEC.2019.22},
annote = {Keywords: Feedback Vertex Set, Branch and bound, Measure and conquer}
}
@InProceedings{novotna_et_al:LIPIcs.IPEC.2019.23,
author = {Novotn\'{a}, Jana and Okrasa, Karolina and Pilipczuk, Micha{\l} and Rz\k{a}\.{z}ewski, Pawe{\l} and van Leeuwen, Erik Jan and Walczak, Bartosz},
title = {{Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {23:1--23:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.23},
URN = {urn:nbn:de:0030-drops-114845},
doi = {10.4230/LIPIcs.IPEC.2019.23},
annote = {Keywords: subexponential algorithm, feedback vertex set, P\underlinet-free graphs, string graphs}
}
@InProceedings{rosenthal:LIPIcs.IPEC.2019.24,
author = {Rosenthal, Gregory},
title = {{Beating Treewidth for Average-Case Subgraph Isomorphism}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.24},
URN = {urn:nbn:de:0030-drops-114850},
doi = {10.4230/LIPIcs.IPEC.2019.24},
annote = {Keywords: subgraph isomorphism, average-case complexity, AC^0, circuit complexity}
}
@InProceedings{dzulfikar_et_al:LIPIcs.IPEC.2019.25,
author = {Dzulfikar, M. Ayaz and Fichte, Johannes K. and Hecher, Markus},
title = {{The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {25:1--25:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Jansen, Bart M. P. and Telle, Jan Arne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.25},
URN = {urn:nbn:de:0030-drops-114861},
doi = {10.4230/LIPIcs.IPEC.2019.25},
annote = {Keywords: Parameterized Algorithms, Vertex Cover Problem, Hypertree Decompositions, Implementation Challenge, FPT}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing