@Proceedings{niedermeier_et_al:LIPIcs.STACS.2019,
title = {{LIPIcs, Volume 126, STACS'19, Complete Volume}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
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},
URN = {urn:nbn:de:0030-drops-103324},
doi = {10.4230/LIPIcs.STACS.2019},
annote = {Keywords: Theory of computation, Models of computation, Mathematics of computing, Combinatorics, Graph theory, Formal language theory, Logic}
}
@InProceedings{niedermeier_et_al:LIPIcs.STACS.2019.0,
author = {Niedermeier, Rolf and Paul, Christophe},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {0:i--0:xvi},
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.0},
URN = {urn:nbn:de:0030-drops-102392},
doi = {10.4230/LIPIcs.STACS.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{goldberg:LIPIcs.STACS.2019.1,
author = {Goldberg, Leslie Ann},
title = {{Computational Complexity and Partition Functions}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {1:1--1:3},
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.1},
URN = {urn:nbn:de:0030-drops-102405},
doi = {10.4230/LIPIcs.STACS.2019.1},
annote = {Keywords: partition functions, approximation}
}
@InProceedings{muscholl_et_al:LIPIcs.STACS.2019.2,
author = {Muscholl, Anca and Puppis, Gabriele},
title = {{The Many Facets of String Transducers}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {2:1--2:21},
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.2},
URN = {urn:nbn:de:0030-drops-102410},
doi = {10.4230/LIPIcs.STACS.2019.2},
annote = {Keywords: String transducers, complexity}
}
@InProceedings{mutzel:LIPIcs.STACS.2019.3,
author = {Mutzel, Petra},
title = {{Algorithmic Data Science}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {3:1--3: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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.3},
URN = {urn:nbn:de:0030-drops-102425},
doi = {10.4230/LIPIcs.STACS.2019.3},
annote = {Keywords: Algorithmic Data Science, Graph Similarity, Weisfeiler-Leman}
}
@InProceedings{bringmann:LIPIcs.STACS.2019.4,
author = {Bringmann, Karl},
title = {{Fine-Grained Complexity Theory}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {4:1--4:7},
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.4},
URN = {urn:nbn:de:0030-drops-102437},
doi = {10.4230/LIPIcs.STACS.2019.4},
annote = {Keywords: Hardness in P, conditional lower bound, fine-grained reduction}
}
@InProceedings{friedrich:LIPIcs.STACS.2019.5,
author = {Friedrich, Tobias},
title = {{From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {5:1--5:9},
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.5},
URN = {urn:nbn:de:0030-drops-102445},
doi = {10.4230/LIPIcs.STACS.2019.5},
annote = {Keywords: Graph Theory, Graph Algorithms, Network Science, Hyperbolic Geometry}
}
@InProceedings{almagor_et_al:LIPIcs.STACS.2019.6,
author = {Almagor, Shaull and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{The Semialgebraic Orbit Problem}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {6:1--6: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.6},
URN = {urn:nbn:de:0030-drops-102450},
doi = {10.4230/LIPIcs.STACS.2019.6},
annote = {Keywords: linear dynamical systems, Orbit Problem, first order theory of the reals}
}
@InProceedings{angelopoulos_et_al:LIPIcs.STACS.2019.7,
author = {Angelopoulos, Spyros and D\"{u}rr, Christoph and Jin, Shendan},
title = {{Best-Of-Two-Worlds Analysis of Online Search}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {7:1--7: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.7},
URN = {urn:nbn:de:0030-drops-102467},
doi = {10.4230/LIPIcs.STACS.2019.7},
annote = {Keywords: Online computation, search problems, linear search, performance measures}
}
@InProceedings{aronov_et_al:LIPIcs.STACS.2019.8,
author = {Aronov, Boris and Filtser, Omrit and Katz, Matthew J. and Sheikhan, Khadijeh},
title = {{Bipartite Diameter and Other Measures Under Translation}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {8:1--8: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.8},
URN = {urn:nbn:de:0030-drops-102476},
doi = {10.4230/LIPIcs.STACS.2019.8},
annote = {Keywords: Translation-invariant similarity measures, Geometric optimization, Minimum-width annulus}
}
@InProceedings{auger_et_al:LIPIcs.STACS.2019.9,
author = {Auger, David and Coucheney, Pierre and Strozecki, Yann},
title = {{Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland’s Rule}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {9:1--9: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.9},
URN = {urn:nbn:de:0030-drops-102488},
doi = {10.4230/LIPIcs.STACS.2019.9},
annote = {Keywords: simple stochastic games, randomized algorithm, parametrized complexity, strategy improvement, Bland’s rule}
}
@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}
}
@InProceedings{bannach_et_al:LIPIcs.STACS.2019.11,
author = {Bannach, Max and Tantau, Till},
title = {{On the Descriptive Complexity of Color Coding}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {11:1--11: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.11},
URN = {urn:nbn:de:0030-drops-102509},
doi = {10.4230/LIPIcs.STACS.2019.11},
annote = {Keywords: color coding, descriptive complexity, fixed-parameter tractability, quantifier elimination, para-AC^0}
}
@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}
}
@InProceedings{belmonte_et_al:LIPIcs.STACS.2019.13,
author = {Belmonte, R\'{e}my and Kim, Eun Jung and Lampis, Michael and Mitsou, Valia and Otachi, Yota and Sikora, Florian},
title = {{Token Sliding on Split Graphs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {13:1--13: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.13},
URN = {urn:nbn:de:0030-drops-102529},
doi = {10.4230/LIPIcs.STACS.2019.13},
annote = {Keywords: reconfiguration, independent set, split graph}
}
@InProceedings{beyersdorff_et_al:LIPIcs.STACS.2019.14,
author = {Beyersdorff, Olaf and Blinkhorn, Joshua and Mahajan, Meena},
title = {{Building Strategies into QBF Proofs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {14:1--14: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.14},
URN = {urn:nbn:de:0030-drops-102538},
doi = {10.4230/LIPIcs.STACS.2019.14},
annote = {Keywords: QBF, DQBF, resolution, proof complexity}
}
@InProceedings{birx_et_al:LIPIcs.STACS.2019.15,
author = {Birx, Alexander and Disser, Yann},
title = {{Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {15:1--15: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.15},
URN = {urn:nbn:de:0030-drops-102543},
doi = {10.4230/LIPIcs.STACS.2019.15},
annote = {Keywords: dial-a-ride on the line, elevator problem, online algorithms, competitive analysis, smartstart, competitive ratio}
}
@InProceedings{bonamy_et_al:LIPIcs.STACS.2019.16,
author = {Bonamy, Marthe and Defrain, Oscar and Heinrich, Marc and Raymond, Jean-Florent},
title = {{Enumerating Minimal Dominating Sets in Triangle-Free Graphs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {16:1--16:12},
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.16},
URN = {urn:nbn:de:0030-drops-102557},
doi = {10.4230/LIPIcs.STACS.2019.16},
annote = {Keywords: Enumeration algorithms, output-polynomial algorithms, minimal dominating set, triangle-free graphs, split graphs}
}
@InProceedings{butti_et_al:LIPIcs.STACS.2019.17,
author = {Butti, Silvia and \v{Z}ivn\'{y}, Stanislav},
title = {{Sparsification of Binary CSPs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {17:1--17:8},
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.17},
URN = {urn:nbn:de:0030-drops-102564},
doi = {10.4230/LIPIcs.STACS.2019.17},
annote = {Keywords: constraint satisfaction problems, minimum cuts, sparsification}
}
@InProceedings{capelli_et_al:LIPIcs.STACS.2019.18,
author = {Capelli, Florent and Mengel, Stefan},
title = {{Tractable QBF by Knowledge Compilation}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {18:1--18: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.18},
URN = {urn:nbn:de:0030-drops-102571},
doi = {10.4230/LIPIcs.STACS.2019.18},
annote = {Keywords: QBF, knowledge compilation, parameterized algorithms}
}
@InProceedings{chalermsook_et_al:LIPIcs.STACS.2019.19,
author = {Chalermsook, Parinya and Schmid, Andreas and Uniyal, Sumedha},
title = {{A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {19:1--19: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.19},
URN = {urn:nbn:de:0030-drops-102583},
doi = {10.4230/LIPIcs.STACS.2019.19},
annote = {Keywords: Graph Drawing, Matroid Matching, Maximum Planar Subgraph, Local Search Algorithms}
}
@InProceedings{cook_et_al:LIPIcs.STACS.2019.20,
author = {Cook, Matthew and Neary, Turlough},
title = {{Average-Case Completeness in Tag Systems}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {20:1--20: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.20},
URN = {urn:nbn:de:0030-drops-102590},
doi = {10.4230/LIPIcs.STACS.2019.20},
annote = {Keywords: average-case NP-completeness, encoding complexity, tag system, bounded halting problem}
}
@InProceedings{cseh_et_al:LIPIcs.STACS.2019.21,
author = {Cseh, \'{A}gnes and Juhos, Attila},
title = {{Pairwise Preferences in the Stable Marriage Problem}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {21:1--21: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.21},
URN = {urn:nbn:de:0030-drops-102603},
doi = {10.4230/LIPIcs.STACS.2019.21},
annote = {Keywords: stable marriage, intransitivity, acyclic preferences, poset, weakly stable matching, strongly stable matching, super stable matching}
}
@InProceedings{descotte_et_al:LIPIcs.STACS.2019.22,
author = {Descotte, Mar{\'\i}a Emilia and Figueira, Diego and Figueira, Santiago},
title = {{Closure Properties of Synchronized Relations}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {22:1--22: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.22},
URN = {urn:nbn:de:0030-drops-102614},
doi = {10.4230/LIPIcs.STACS.2019.22},
annote = {Keywords: synchronized word relations, rational, closure, characterization, intersection, complement, Kleene star, concatenation}
}
@InProceedings{destombes_et_al:LIPIcs.STACS.2019.23,
author = {Destombes, Julien and Romashchenko, Andrei},
title = {{Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {23:1--23: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.23},
URN = {urn:nbn:de:0030-drops-102624},
doi = {10.4230/LIPIcs.STACS.2019.23},
annote = {Keywords: Sofic shifts, Block complexity, Kolmogorov complexity}
}
@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}
}
@InProceedings{eiben_et_al:LIPIcs.STACS.2019.25,
author = {Eiben, Eduard and Knop, Du\v{s}an and Panolan, Fahad and Such\'{y}, Ond\v{r}ej},
title = {{Complexity of the Steiner Network Problem with Respect to the Number of Terminals}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {25:1--25: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.25},
URN = {urn:nbn:de:0030-drops-102642},
doi = {10.4230/LIPIcs.STACS.2019.25},
annote = {Keywords: Directed Steiner Network, Planar Graphs, Parameterized Algorithms, Bounded Genus, Exponential Time Hypothesis}
}
@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}
}
@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}
}
@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}
}
@InProceedings{ganardi:LIPIcs.STACS.2019.29,
author = {Ganardi, Moses},
title = {{Visibly Pushdown Languages over Sliding Windows}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {29:1--29: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.29},
URN = {urn:nbn:de:0030-drops-102688},
doi = {10.4230/LIPIcs.STACS.2019.29},
annote = {Keywords: visibly pushdown languages, sliding windows, rational transductions}
}
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2019.30,
author = {Gawrychowski, Pawe{\l} and Manea, Florin and Serafin, Rados{\l}aw},
title = {{Fast and Longest Rollercoasters}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {30:1--30: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.30},
URN = {urn:nbn:de:0030-drops-102694},
doi = {10.4230/LIPIcs.STACS.2019.30},
annote = {Keywords: sequences, alternating runs, patterns in permutations}
}
@InProceedings{gemici_et_al:LIPIcs.STACS.2019.31,
author = {Gemici, Kurtulu\c{s} and Koutsoupias, Elias and Monnot, Barnab\'{e} and Papadimitriou, Christos H. and Piliouras, Georgios},
title = {{Wealth Inequality and the Price of Anarchy}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {31:1--31: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.31},
URN = {urn:nbn:de:0030-drops-102707},
doi = {10.4230/LIPIcs.STACS.2019.31},
annote = {Keywords: congestion games, inequality}
}
@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}
}
@InProceedings{grigoriev_et_al:LIPIcs.STACS.2019.33,
author = {Grigoriev, Alexander and Hartmann, Tim A. and Lendl, Stefan and Woeginger, Gerhard J.},
title = {{Dispersing Obnoxious Facilities on a Graph}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {33:1--33: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.33},
URN = {urn:nbn:de:0030-drops-102729},
doi = {10.4230/LIPIcs.STACS.2019.33},
annote = {Keywords: algorithms, complexity, optimization, graph theory, facility location}
}
@InProceedings{gupta_et_al:LIPIcs.STACS.2019.34,
author = {Gupta, Chetan and Sharma, Vimal Raj and Tewari, Raghunath},
title = {{Reachability in O(log n) Genus Graphs is in Unambiguous Logspace}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {34:1--34: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.34},
URN = {urn:nbn:de:0030-drops-102730},
doi = {10.4230/LIPIcs.STACS.2019.34},
annote = {Keywords: logspace unambiguity, high genus, path isolation}
}
@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}
}
@InProceedings{hols_et_al:LIPIcs.STACS.2019.36,
author = {Hols, Eva-Maria C. and Kratsch, Stefan},
title = {{On Kernelization for Edge Dominating Set under Structural Parameters}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {36:1--36: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.36},
URN = {urn:nbn:de:0030-drops-102752},
doi = {10.4230/LIPIcs.STACS.2019.36},
annote = {Keywords: Edge dominating set, kernelization, structural parameters}
}
@InProceedings{holt_et_al:LIPIcs.STACS.2019.37,
author = {Holt, Derek and Lohrey, Markus and Schleimer, Saul},
title = {{Compressed Decision Problems in Hyperbolic Groups}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {37:1--37: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.37},
URN = {urn:nbn:de:0030-drops-102766},
doi = {10.4230/LIPIcs.STACS.2019.37},
annote = {Keywords: hyperbolic groups, algorithms for compressed words, circuit evaluation problems}
}
@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}
}
@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}
}
@InProceedings{jeandel_et_al:LIPIcs.STACS.2019.40,
author = {Jeandel, Emmanuel and Vanier, Pascal},
title = {{A Characterization of Subshifts with Computable Language}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {40:1--40: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.40},
URN = {urn:nbn:de:0030-drops-102798},
doi = {10.4230/LIPIcs.STACS.2019.40},
annote = {Keywords: subshifts, computability, Enumeration degree, Turing degree, minimal subshifts}
}
@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}
}
@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}
}
@InProceedings{kiefer_et_al:LIPIcs.STACS.2019.43,
author = {Kiefer, Stefan and Mascle, Corto},
title = {{On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {43:1--43: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.43},
URN = {urn:nbn:de:0030-drops-102823},
doi = {10.4230/LIPIcs.STACS.2019.43},
annote = {Keywords: matrix semigroups, unambiguous automata, codes, Restivo’s conjecture}
}
@InProceedings{knop_et_al:LIPIcs.STACS.2019.44,
author = {Knop, Du\v{s}an and Pilipczuk, Micha{\l} and Wrochna, Marcin},
title = {{Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {44:1--44: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.44},
URN = {urn:nbn:de:0030-drops-102831},
doi = {10.4230/LIPIcs.STACS.2019.44},
annote = {Keywords: integer linear programming, fixed-parameter tractability, ETH}
}
@InProceedings{krauthgamer_et_al:LIPIcs.STACS.2019.45,
author = {Krauthgamer, Robert and Trabelsi, Ohad},
title = {{The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {45:1--45: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.45},
URN = {urn:nbn:de:0030-drops-102840},
doi = {10.4230/LIPIcs.STACS.2019.45},
annote = {Keywords: Conditional lower bounds, Hardness in P, Set Cover Conjecture, Subgraph Isomorphism}
}
@InProceedings{kreutzer_et_al:LIPIcs.STACS.2019.46,
author = {Kreutzer, Stephan and Muzi, Irene and Ossona de Mendez, Patrice and Rabinovich, Roman and Siebertz, Sebastian},
title = {{Algorithmic Properties of Sparse Digraphs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {46:1--46:20},
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.46},
URN = {urn:nbn:de:0030-drops-102859},
doi = {10.4230/LIPIcs.STACS.2019.46},
annote = {Keywords: Directed graphs, graph algorithms, parameterized complexity, approximation}
}
@InProceedings{landwehr_et_al:LIPIcs.STACS.2019.47,
author = {Landwehr, Patrick and L\"{o}ding, Christof},
title = {{Tree Automata with Global Constraints for Infinite Trees}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {47:1--47: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.47},
URN = {urn:nbn:de:0030-drops-102863},
doi = {10.4230/LIPIcs.STACS.2019.47},
annote = {Keywords: Tree automata, infinite trees, global constraints}
}
@InProceedings{larsen:LIPIcs.STACS.2019.48,
author = {Larsen, Kasper Green},
title = {{Constructive Discrepancy Minimization with Hereditary L2 Guarantees}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {48:1--48: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.48},
URN = {urn:nbn:de:0030-drops-102878},
doi = {10.4230/LIPIcs.STACS.2019.48},
annote = {Keywords: Discrepancy, Hereditary Discrepancy, Combinatorics, Computational Geometry}
}
@InProceedings{legall_et_al:LIPIcs.STACS.2019.49,
author = {Le Gall, Fran\c{c}ois and Nishimura, Harumichi and Rosmanis, Ansis},
title = {{Quantum Advantage for the LOCAL Model in Distributed Computing}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {49:1--49: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.49},
URN = {urn:nbn:de:0030-drops-102887},
doi = {10.4230/LIPIcs.STACS.2019.49},
annote = {Keywords: Quantum computing, distributed computing, LOCAL model}
}
@InProceedings{loff_et_al:LIPIcs.STACS.2019.50,
author = {Loff, Bruno and Mukhopadhyay, Sagnik},
title = {{Lifting Theorems for Equality}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {50:1--50:19},
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.50},
URN = {urn:nbn:de:0030-drops-102892},
doi = {10.4230/LIPIcs.STACS.2019.50},
annote = {Keywords: Communication complexity, Query complexity, Simulation theorem, Equality function}
}
@InProceedings{luo_et_al:LIPIcs.STACS.2019.51,
author = {Luo, Kelin and Erlebach, Thomas and Xu, Yinfeng},
title = {{Car-Sharing on a Star Network: On-Line Scheduling with k Servers}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {51:1--51: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.51},
URN = {urn:nbn:de:0030-drops-102907},
doi = {10.4230/LIPIcs.STACS.2019.51},
annote = {Keywords: Car-Sharing System, On-Line Scheduling, Competitive Analysis, Star Network}
}
@InProceedings{matl_et_al:LIPIcs.STACS.2019.52,
author = {Matl, Gregor and \v{Z}ivn\'{y}, Stanislav},
title = {{Beyond Boolean Surjective VCSPs}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {52:1--52: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.52},
URN = {urn:nbn:de:0030-drops-102911},
doi = {10.4230/LIPIcs.STACS.2019.52},
annote = {Keywords: constraint satisfaction problems, valued constraint satisfaction, surjective constraint satisfaction, graph cuts}
}
@InProceedings{mottet_et_al:LIPIcs.STACS.2019.53,
author = {Mottet, Antoine and Quaas, Karin},
title = {{The Containment Problem for Unambiguous Register Automata}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {53:1--53: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.53},
URN = {urn:nbn:de:0030-drops-102926},
doi = {10.4230/LIPIcs.STACS.2019.53},
annote = {Keywords: Data words, Register automata, Unambiguous Automata, Containment Problem, Language Inclusion Problem}
}
@InProceedings{papp_et_al:LIPIcs.STACS.2019.54,
author = {Papp, P\'{a}l Andr\'{a}s and Wattenhofer, Roger},
title = {{Stabilization Time in Weighted Minority Processes}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {54:1--54: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.54},
URN = {urn:nbn:de:0030-drops-102938},
doi = {10.4230/LIPIcs.STACS.2019.54},
annote = {Keywords: Minority process, Benevolent model}
}
@InProceedings{paul:LIPIcs.STACS.2019.55,
author = {Paul, Erik},
title = {{Finite Sequentiality of Unambiguous Max-Plus Tree Automata}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {55:1--55: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.55},
URN = {urn:nbn:de:0030-drops-102946},
doi = {10.4230/LIPIcs.STACS.2019.55},
annote = {Keywords: Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Ambiguity}
}
@InProceedings{peserico:LIPIcs.STACS.2019.56,
author = {Peserico, Enoch},
title = {{Paging with Dynamic Memory Capacity}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {56:1--56: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.56},
URN = {urn:nbn:de:0030-drops-102951},
doi = {10.4230/LIPIcs.STACS.2019.56},
annote = {Keywords: paging, cache, adaptive, elastic, online, competitive, virtual, energy}
}
@InProceedings{posobin_et_al:LIPIcs.STACS.2019.57,
author = {Posobin, Gleb and Shen, Alexander},
title = {{Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {57:1--57: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.57},
URN = {urn:nbn:de:0030-drops-102969},
doi = {10.4230/LIPIcs.STACS.2019.57},
annote = {Keywords: Kolmogorov complexity, effective Hausdorff dimension, random noise}
}
@InProceedings{sen:LIPIcs.STACS.2019.58,
author = {Sen, Sandeep},
title = {{A Unified Approach to Tail Estimates for Randomized Incremental Construction}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {58:1--58: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.58},
URN = {urn:nbn:de:0030-drops-102977},
doi = {10.4230/LIPIcs.STACS.2019.58},
annote = {Keywords: ric, tail estimates, martingale, lower bound}
}
@InProceedings{watson:LIPIcs.STACS.2019.59,
author = {Watson, Thomas},
title = {{A ZPP^NP\lbrack1\rbrack Lifting Theorem}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {59:1--59: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.59},
URN = {urn:nbn:de:0030-drops-102989},
doi = {10.4230/LIPIcs.STACS.2019.59},
annote = {Keywords: Query complexity, communication complexity, lifting}
}
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