Published in: LIPIcs, Volume 148, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, and Philipp Zschoche. Multistage Vertex Cover. In 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@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-dev.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} }
Published in: OASIcs, Volume 68, Workshop on Autonomous Systems Design (ASD 2019)
M. Baha E. Zarrouki, Verena Klös, Markus Grabowski, and Sabine Glesner. Fault-Tolerance by Graceful Degradation for Car Platoons. In Workshop on Autonomous Systems Design (ASD 2019). Open Access Series in Informatics (OASIcs), Volume 68, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{zarrouki_et_al:OASIcs.ASD.2019.1, author = {Zarrouki, M. Baha E. and Kl\"{o}s, Verena and Grabowski, Markus and Glesner, Sabine}, title = {{Fault-Tolerance by Graceful Degradation for Car Platoons}}, booktitle = {Workshop on Autonomous Systems Design (ASD 2019)}, pages = {1:1--1:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-102-3}, ISSN = {2190-6807}, year = {2019}, volume = {68}, editor = {Saidi, Selma and Ernst, Rolf and Ziegenbein, Dirk}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ASD.2019.1}, URN = {urn:nbn:de:0030-drops-103344}, doi = {10.4230/OASIcs.ASD.2019.1}, annote = {Keywords: fault-tolerance, degradation, car platoons, autonomous driving, contracts} }
Published in: OASIcs, Volume 68, Workshop on Autonomous Systems Design (ASD 2019)
Mischa Möstl, Marcus Nolte, Johannes Schlatow, and Rolf Ernst. Controlling Concurrent Change - A Multiview Approach Toward Updatable Vehicle Automation Systems. In Workshop on Autonomous Systems Design (ASD 2019). Open Access Series in Informatics (OASIcs), Volume 68, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{mostl_et_al:OASIcs.ASD.2019.4, author = {M\"{o}stl, Mischa and Nolte, Marcus and Schlatow, Johannes and Ernst, Rolf}, title = {{Controlling Concurrent Change - A Multiview Approach Toward Updatable Vehicle Automation Systems}}, booktitle = {Workshop on Autonomous Systems Design (ASD 2019)}, pages = {4:1--4:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-102-3}, ISSN = {2190-6807}, year = {2019}, volume = {68}, editor = {Saidi, Selma and Ernst, Rolf and Ziegenbein, Dirk}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ASD.2019.4}, URN = {urn:nbn:de:0030-drops-103376}, doi = {10.4230/OASIcs.ASD.2019.4}, annote = {Keywords: safety, behavior, functional, architecture, multi-view, automated driving} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Étienne Bamas and Louis Esperet. Distributed Coloring of Graphs with an Optimal Number of Colors. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bamas_et_al:LIPIcs.STACS.2019.10, author = {Bamas, \'{E}tienne and Esperet, Louis}, title = {{Distributed Coloring of Graphs with an Optimal Number of Colors}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.10}, URN = {urn:nbn:de:0030-drops-102496}, doi = {10.4230/LIPIcs.STACS.2019.10}, annote = {Keywords: Graph coloring, distributed algorithm, maximum degree} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, and Troy Lee. Bounding Quantum-Classical Separations for Classes of Nonlocal Games. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 12:1-12:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bannink_et_al:LIPIcs.STACS.2019.12, author = {Bannink, Tom and Bri\"{e}t, Jop and Buhrman, Harry and Labib, Farrokh and Lee, Troy}, title = {{Bounding Quantum-Classical Separations for Classes of Nonlocal Games}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {12:1--12:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.12}, URN = {urn:nbn:de:0030-drops-102512}, doi = {10.4230/LIPIcs.STACS.2019.12}, annote = {Keywords: Nonlocal games, communication complexity, bounded separations, semidefinite programming, pseudorandomness, Gowers norms} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Martin Dietzfelbinger and Stefan Walzer. Constant-Time Retrieval with O(log m) Extra Bits. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dietzfelbinger_et_al:LIPIcs.STACS.2019.24, author = {Dietzfelbinger, Martin and Walzer, Stefan}, title = {{Constant-Time Retrieval with O(log m) Extra Bits}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.24}, URN = {urn:nbn:de:0030-drops-102639}, doi = {10.4230/LIPIcs.STACS.2019.24}, annote = {Keywords: Retrieval, Hashing, Succinct Data Structure, Randomised Data Structure, Structured Gaussian Elimination, Method of Four Russians} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Faith Ellen, Rati Gelashvili, Philipp Woelfel, and Leqi Zhu. Space Lower Bounds for the Signal Detection Problem. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{ellen_et_al:LIPIcs.STACS.2019.26, author = {Ellen, Faith and Gelashvili, Rati and Woelfel, Philipp and Zhu, Leqi}, title = {{Space Lower Bounds for the Signal Detection Problem}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.26}, URN = {urn:nbn:de:0030-drops-102654}, doi = {10.4230/LIPIcs.STACS.2019.26}, annote = {Keywords: Signal detection, ABA problem, space complexity, lower bound} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Grzegorz Fabiański, Michał Pilipczuk, Sebastian Siebertz, and Szymon Toruńczyk. Progressive Algorithms for Domination and Independence. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fabianski_et_al:LIPIcs.STACS.2019.27, author = {Fabia\'{n}ski, Grzegorz and Pilipczuk, Micha{\l} and Siebertz, Sebastian and Toru\'{n}czyk, Szymon}, title = {{Progressive Algorithms for Domination and Independence}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.27}, URN = {urn:nbn:de:0030-drops-102660}, doi = {10.4230/LIPIcs.STACS.2019.27}, annote = {Keywords: Dominating Set, Independent Set, nowhere denseness, stability, fixed-parameter tractability} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos. Modification to Planarity is Fixed Parameter Tractable. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fomin_et_al:LIPIcs.STACS.2019.28, author = {Fomin, Fedor V. and Golovach, Petr A. and Thilikos, Dimitrios M.}, title = {{Modification to Planarity is Fixed Parameter Tractable}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.28}, URN = {urn:nbn:de:0030-drops-102677}, doi = {10.4230/LIPIcs.STACS.2019.28}, annote = {Keywords: Modification problems, Planar graphs, Irrelevant vertex technique} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dimitrios M. Thilikos. Lean Tree-Cut Decompositions: Obstructions and Algorithms. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 32:1-32:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{giannopoulou_et_al:LIPIcs.STACS.2019.32, author = {Giannopoulou, Archontia C. and Kwon, O-joung and Raymond, Jean-Florent and Thilikos, Dimitrios M.}, title = {{Lean Tree-Cut Decompositions: Obstructions and Algorithms}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.32}, URN = {urn:nbn:de:0030-drops-102716}, doi = {10.4230/LIPIcs.STACS.2019.32}, annote = {Keywords: tree-cut width, lean decompositions, immersions, obstructions, parameterized algorithms} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, and David Saulpic. Dominating Sets and Connected Dominating Sets in Dynamic Graphs. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 35:1-35:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hjuler_et_al:LIPIcs.STACS.2019.35, author = {Hjuler, Niklas and Italiano, Giuseppe F. and Parotsidis, Nikos and Saulpic, David}, title = {{Dominating Sets and Connected Dominating Sets in Dynamic Graphs}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {35:1--35:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.35}, URN = {urn:nbn:de:0030-drops-102741}, doi = {10.4230/LIPIcs.STACS.2019.35}, annote = {Keywords: Dominating Set, Connected Dominating Set, Dynamic Graph Algorithms} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt. How to Secure Matchings Against Edge Failures. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hommelsheim_et_al:LIPIcs.STACS.2019.38, author = {Hommelsheim, Felix and M\"{u}hlenthaler, Moritz and Schaudt, Oliver}, title = {{How to Secure Matchings Against Edge Failures}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.38}, URN = {urn:nbn:de:0030-drops-102772}, doi = {10.4230/LIPIcs.STACS.2019.38}, annote = {Keywords: Matchings, Robustness, Connectivity Augmentation, Graph Algorithms, Treewidth} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Bart M. P. Jansen, Marcin Pilipczuk, and Erik Jan van Leeuwen. A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 39:1-39:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jansen_et_al:LIPIcs.STACS.2019.39, author = {Jansen, Bart M. P. and Pilipczuk, Marcin and van Leeuwen, Erik Jan}, title = {{A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {39:1--39:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.39}, URN = {urn:nbn:de:0030-drops-102783}, doi = {10.4230/LIPIcs.STACS.2019.39}, annote = {Keywords: planar graphs, kernelization, odd cycle transversal, multiway cut} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Stasys Jukna and Andrzej Lingas. Lower Bounds for DeMorgan Circuits of Bounded Negation Width. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 41:1-41:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jukna_et_al:LIPIcs.STACS.2019.41, author = {Jukna, Stasys and Lingas, Andrzej}, title = {{Lower Bounds for DeMorgan Circuits of Bounded Negation Width}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {41:1--41:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.41}, URN = {urn:nbn:de:0030-drops-102801}, doi = {10.4230/LIPIcs.STACS.2019.41}, annote = {Keywords: Boolean circuits, monotone circuits, lower bounds} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Shahbaz Khan and Shashank K. Mehta. Depth First Search in the Semi-streaming Model. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 42:1-42:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{khan_et_al:LIPIcs.STACS.2019.42, author = {Khan, Shahbaz and K. Mehta, Shashank}, title = {{Depth First Search in the Semi-streaming Model}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {42:1--42:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.42}, URN = {urn:nbn:de:0030-drops-102818}, doi = {10.4230/LIPIcs.STACS.2019.42}, annote = {Keywords: Depth First Search, DFS, Semi-Streaming, Streaming, Algorithm} }
Feedback for Dagstuhl Publishing