@Proceedings{niedermeier_et_al:LIPIcs.STACS.2018,
title = {{LIPIcs, Volume 96, STACS'18, Complete Volume}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018},
URN = {urn:nbn:de:0030-drops-86179},
doi = {10.4230/LIPIcs.STACS.2018},
annote = {Keywords: Mathematics of computing, Theory of computation}
}
@InProceedings{niedermeier_et_al:LIPIcs.STACS.2018.0,
author = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.0},
URN = {urn:nbn:de:0030-drops-84807},
doi = {10.4230/LIPIcs.STACS.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{salvy:LIPIcs.STACS.2018.1,
author = {Salvy, Bruno},
title = {{Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {1:1--1:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.1},
URN = {urn:nbn:de:0030-drops-85352},
doi = {10.4230/LIPIcs.STACS.2018.1},
annote = {Keywords: Analytic Combinatorics, Generating Functions, Random Generation}
}
@InProceedings{mahajan:LIPIcs.STACS.2018.2,
author = {Mahajan, Meena},
title = {{Lower Bound Techniques for QBF Proof Systems}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {2:1--2:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.2},
URN = {urn:nbn:de:0030-drops-85362},
doi = {10.4230/LIPIcs.STACS.2018.2},
annote = {Keywords: Proof Complexity, Quantified Boolean formulas, Resolution, Lower Bound Techniques}
}
@InProceedings{pous:LIPIcs.STACS.2018.3,
author = {Pous, Damien},
title = {{On the Positive Calculus of Relations with Transitive Closure}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {3:1--3:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.3},
URN = {urn:nbn:de:0030-drops-85382},
doi = {10.4230/LIPIcs.STACS.2018.3},
annote = {Keywords: Relation Algebra, Kleene Algebra, Allegories, Automata, Graphs}
}
@InProceedings{woeginger:LIPIcs.STACS.2018.4,
author = {Woeginger, Gerhard J.},
title = {{The Open Shop Scheduling Problem}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {4:1--4:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.4},
URN = {urn:nbn:de:0030-drops-85375},
doi = {10.4230/LIPIcs.STACS.2018.4},
annote = {Keywords: Algorithms, Complexity, Scheduling, Approximation}
}
@InProceedings{adamaszek_et_al:LIPIcs.STACS.2018.5,
author = {Adamaszek, Anna and Antoniadis, Antonios and Kumar, Amit and M\"{o}mke, Tobias},
title = {{Approximating Airports and Railways}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.5},
URN = {urn:nbn:de:0030-drops-85183},
doi = {10.4230/LIPIcs.STACS.2018.5},
annote = {Keywords: Network Design, Facility Location, Approximation Algorithms, PTAS, Metric, Euclidean}
}
@InProceedings{adler_et_al:LIPIcs.STACS.2018.6,
author = {Adler, Isolde and Harwath, Frederik},
title = {{Property Testing for Bounded Degree Databases}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.6},
URN = {urn:nbn:de:0030-drops-85288},
doi = {10.4230/LIPIcs.STACS.2018.6},
annote = {Keywords: logic and databases, property testing, logical meta-theorems, bounded degree model, sublinear algorithms}
}
@InProceedings{agrawal_et_al:LIPIcs.STACS.2018.7,
author = {Agrawal, Akanksha and Lokshtanov, Daniel and Misra, Pranabendu and Saurabh, Saket and Zehavi, Meirav},
title = {{Erd\"{o}s-P\'{o}sa Property of Obstructions to Interval Graphs}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.7},
URN = {urn:nbn:de:0030-drops-84815},
doi = {10.4230/LIPIcs.STACS.2018.7},
annote = {Keywords: Interval Graphs, Obstructions, Erd\"{o}s-P\'{o}sa Property}
}
@InProceedings{ambainis_et_al:LIPIcs.STACS.2018.8,
author = {Ambainis, Andris and Kokainis, Martins and Prusis, Krisjanis and Vihrovs, Jevgenijs},
title = {{All Classical Adversary Methods are Equivalent for Total Functions}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.8},
URN = {urn:nbn:de:0030-drops-84953},
doi = {10.4230/LIPIcs.STACS.2018.8},
annote = {Keywords: Randomized Query Complexity, Lower Bounds, Adversary Bounds, Fractional Block Sensitivity}
}
@InProceedings{bannach_et_al:LIPIcs.STACS.2018.9,
author = {Bannach, Max and Tantau, Till},
title = {{Computing Hitting Set Kernels By AC^0-Circuits}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.9},
URN = {urn:nbn:de:0030-drops-84998},
doi = {10.4230/LIPIcs.STACS.2018.9},
annote = {Keywords: parallel computation, fixed-parameter tractability, kernelization}
}
@InProceedings{belmonte_et_al:LIPIcs.STACS.2018.10,
author = {Belmonte, R\'{e}my and Lampis, Michael and Mitsou, Valia},
title = {{Parameterized (Approximate) Defective Coloring}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.10},
URN = {urn:nbn:de:0030-drops-85304},
doi = {10.4230/LIPIcs.STACS.2018.10},
annote = {Keywords: Treewidth, Parameterized Complexity, Approximation, Coloring}
}
@InProceedings{berkholz:LIPIcs.STACS.2018.11,
author = {Berkholz, Christoph},
title = {{The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.11},
URN = {urn:nbn:de:0030-drops-85279},
doi = {10.4230/LIPIcs.STACS.2018.11},
annote = {Keywords: Proof Complexity, Polynomial Calculus, Sum-of-Squares, Sherali-Adams}
}
@InProceedings{beyersdorff_et_al:LIPIcs.STACS.2018.12,
author = {Beyersdorff, Olaf and Blinkhorn, Joshua},
title = {{Genuine Lower Bounds for QBF Expansion}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.12},
URN = {urn:nbn:de:0030-drops-85174},
doi = {10.4230/LIPIcs.STACS.2018.12},
annote = {Keywords: QBF, proof complexity, lower-bound techniques, resolution}
}
@InProceedings{bilo_et_al:LIPIcs.STACS.2018.13,
author = {Bil\`{o}, Davide and Choudhary, Keerti and Gual\`{a}, Luciano and Leucci, Stefano and Parter, Merav and Proietti, Guido},
title = {{Efficient Oracles and Routing Schemes for Replacement Paths}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.13},
URN = {urn:nbn:de:0030-drops-85249},
doi = {10.4230/LIPIcs.STACS.2018.13},
annote = {Keywords: Fault tolerant, Shortest path, Oracle, Routing}
}
@InProceedings{bilo_et_al:LIPIcs.STACS.2018.14,
author = {Bil\`{o}, Davide and Lenzner, Pascal},
title = {{On the Tree Conjecture for the Network Creation Game}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.14},
URN = {urn:nbn:de:0030-drops-85092},
doi = {10.4230/LIPIcs.STACS.2018.14},
annote = {Keywords: Algorithmic Game Theory, Network Creation Game, Price of Anarchy, Quality of Nash Equilibria}
}
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2018.15,
author = {Bienvenu, Laurent and Downey, Rodney},
title = {{On Low for Speed Oracles}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.15},
URN = {urn:nbn:de:0030-drops-85226},
doi = {10.4230/LIPIcs.STACS.2018.15},
annote = {Keywords: Lowness for speed, Oracle computations, Turing degrees}
}
@InProceedings{blondin_et_al:LIPIcs.STACS.2018.16,
author = {Blondin, Michael and Esparza, Javier and Jaax, Stefan},
title = {{Large Flocks of Small Birds: on the Minimal Size of Population Protocols}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.16},
URN = {urn:nbn:de:0030-drops-85116},
doi = {10.4230/LIPIcs.STACS.2018.16},
annote = {Keywords: Population protocols, Presburger arithmetic}
}
@InProceedings{bollig_et_al:LIPIcs.STACS.2018.17,
author = {Bollig, Benedikt and Fortin, Marie and Gastin, Paul},
title = {{Communicating Finite-State Machines and Two-Variable Logic}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.17},
URN = {urn:nbn:de:0030-drops-85298},
doi = {10.4230/LIPIcs.STACS.2018.17},
annote = {Keywords: communicating finite-state machines, MSO logic, message sequence charts}
}
@InProceedings{bressan_et_al:LIPIcs.STACS.2018.18,
author = {Bressan, Marco and Peserico, Enoch and Pretto, Luca},
title = {{On Approximating the Stationary Distribution of Time-reversible Markov Chains}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.18},
URN = {urn:nbn:de:0030-drops-84949},
doi = {10.4230/LIPIcs.STACS.2018.18},
annote = {Keywords: Markov chains, MCMC sampling, large graph algorithms, randomized algorithms, sublinear algorithms}
}
@InProceedings{carbonnel_et_al:LIPIcs.STACS.2018.19,
author = {Carbonnel, Cl\'{e}ment and Cohen, David A. and Cooper, Martin C. and Zivny, Stanislav},
title = {{On Singleton Arc Consistency for CSPs Defined by Monotone Patterns}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.19},
URN = {urn:nbn:de:0030-drops-84876},
doi = {10.4230/LIPIcs.STACS.2018.19},
annote = {Keywords: constraint satisfaction problems, forbidden patterns, singleton arc consistency}
}
@InProceedings{charronbost_et_al:LIPIcs.STACS.2018.20,
author = {Charron-Bost, Bernadette and Moran, Shlomo},
title = {{The Firing Squad Problem Revisited}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.20},
URN = {urn:nbn:de:0030-drops-85195},
doi = {10.4230/LIPIcs.STACS.2018.20},
annote = {Keywords: Synchronization, Detection, Simultaneity, Dynamic Networks}
}
@InProceedings{chillara_et_al:LIPIcs.STACS.2018.21,
author = {Chillara, Suryajith and Limaye, Nutan and Srinivasan, Srikanth},
title = {{Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.21},
URN = {urn:nbn:de:0030-drops-85235},
doi = {10.4230/LIPIcs.STACS.2018.21},
annote = {Keywords: Algebraic circuit complexity, Multilinear formulas, Lower Bounds}
}
@InProceedings{clifford_et_al:LIPIcs.STACS.2018.22,
author = {Clifford, Rapha\"{e}l and Gr{\o}nlund, Allan and Larsen, Kasper Green and Starikovskaya, Tatiana},
title = {{Upper and Lower Bounds for Dynamic Data Structures on Strings}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.22},
URN = {urn:nbn:de:0030-drops-85088},
doi = {10.4230/LIPIcs.STACS.2018.22},
annote = {Keywords: exact pattern matching with wildcards, hamming distance, inner product, conditional lower bounds}
}
@InProceedings{das_et_al:LIPIcs.STACS.2018.23,
author = {Das, Debarati and Kouck\'{y}, Michal and Saks, Michael},
title = {{Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.23},
URN = {urn:nbn:de:0030-drops-85050},
doi = {10.4230/LIPIcs.STACS.2018.23},
annote = {Keywords: Lower bounds, Combinatorial algorithm, Boolean matrix multiplication}
}
@InProceedings{demaine_et_al:LIPIcs.STACS.2018.24,
author = {Demaine, Erik D. and Eisenstat, Sarah and Rudoy, Mikhail},
title = {{Solving the Rubik's Cube Optimally is NP-complete}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.24},
URN = {urn:nbn:de:0030-drops-85336},
doi = {10.4230/LIPIcs.STACS.2018.24},
annote = {Keywords: combinatorial puzzles, NP-hardness, group theory, Hamiltonicity}
}
@InProceedings{demirci_et_al:LIPIcs.STACS.2018.25,
author = {Demirci, G\"{o}kalp and Hoffmann, Henry and Kim, David H. K.},
title = {{Approximation Algorithms for Scheduling with Resource and Precedence Constraints}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.25},
URN = {urn:nbn:de:0030-drops-85319},
doi = {10.4230/LIPIcs.STACS.2018.25},
annote = {Keywords: scheduling, resource, precedence, weighted completion time}
}
@InProceedings{dvorak_et_al:LIPIcs.STACS.2018.26,
author = {Dvor\'{a}k, Pavel and Feldmann, Andreas Emil and Knop, Du\v{s}an and Masar{\'\i}k, Tom\'{a}\v{s} and Toufar, Tom\'{a}\v{s} and Vesel\'{y}, Pavel},
title = {{Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.26},
URN = {urn:nbn:de:0030-drops-85158},
doi = {10.4230/LIPIcs.STACS.2018.26},
annote = {Keywords: Steiner Tree, Steiner Forest, Approximation Algorithms, Parameterized Algorithms, Lossy Kernelization}
}
@InProceedings{egri_et_al:LIPIcs.STACS.2018.27,
author = {Egri, L\'{a}szl\'{o} and Marx, D\'{a}niel and Rzazewski, Pawel},
title = {{Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.27},
URN = {urn:nbn:de:0030-drops-84867},
doi = {10.4230/LIPIcs.STACS.2018.27},
annote = {Keywords: graph homomorphism, list homomorphism, reflexive graph, treewidth}
}
@InProceedings{eiben_et_al:LIPIcs.STACS.2018.28,
author = {Eiben, Eduard and Ganian, Robert and Ordyniak, Sebastian},
title = {{Small Resolution Proofs for QBF using Dependency Treewidth}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.28},
URN = {urn:nbn:de:0030-drops-85135},
doi = {10.4230/LIPIcs.STACS.2018.28},
annote = {Keywords: QBF, treewidth, fixed parameter tractability, dependency schemes}
}
@InProceedings{eiben_et_al:LIPIcs.STACS.2018.29,
author = {Eiben, Eduard and Kumar, Mithilesh and Mouawad, Amer E. and Panolan, Fahad and Siebertz, Sebastian},
title = {{Lossy Kernels for Connected Dominating Set on Sparse Graphs}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.29},
URN = {urn:nbn:de:0030-drops-85027},
doi = {10.4230/LIPIcs.STACS.2018.29},
annote = {Keywords: Lossy Kernelization, Connected Dominating Set, Sparse Graph Classes}
}
@InProceedings{fleischer_et_al:LIPIcs.STACS.2018.30,
author = {Fleischer, Lukas and Kufleitner, Manfred},
title = {{The Intersection Problem for Finite Monoids}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.30},
URN = {urn:nbn:de:0030-drops-85079},
doi = {10.4230/LIPIcs.STACS.2018.30},
annote = {Keywords: intersection problem, finite monoid, recognizing morphism, complexity}
}
@InProceedings{ganardi_et_al:LIPIcs.STACS.2018.31,
author = {Ganardi, Moses and Hucke, Danny and K\"{o}nig, Daniel and Lohrey, Markus and Mamouras, Konstantinos},
title = {{Automata Theory on Sliding Windows}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.31},
URN = {urn:nbn:de:0030-drops-84851},
doi = {10.4230/LIPIcs.STACS.2018.31},
annote = {Keywords: regular languages, sliding window algorithms}
}
@InProceedings{ganardi_et_al:LIPIcs.STACS.2018.32,
author = {Ganardi, Moses and K\"{o}nig, Daniel and Lohrey, Markus and Zetzsche, Georg},
title = {{Knapsack Problems for Wreath Products}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {32:1--32:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.32},
URN = {urn:nbn:de:0030-drops-85201},
doi = {10.4230/LIPIcs.STACS.2018.32},
annote = {Keywords: knapsack, wreath products, decision problems in group theory}
}
@InProceedings{ganian_et_al:LIPIcs.STACS.2018.33,
author = {Ganian, Robert and Klute, Fabian and Ordyniak, Sebastian},
title = {{On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.33},
URN = {urn:nbn:de:0030-drops-85140},
doi = {10.4230/LIPIcs.STACS.2018.33},
annote = {Keywords: bounded-degree vertex deletion, feedback vertex set, parameterized algorithms, treecut width}
}
@InProceedings{gardy_et_al:LIPIcs.STACS.2018.34,
author = {Gardy, Patrick and Bouyer, Patricia and Markey, Nicolas},
title = {{Dependences in Strategy Logic}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.34},
URN = {urn:nbn:de:0030-drops-85320},
doi = {10.4230/LIPIcs.STACS.2018.34},
annote = {Keywords: strategic reasoning, strategy logic, dependences, behavioural strategies.}
}
@InProceedings{gaspers_et_al:LIPIcs.STACS.2018.35,
author = {Gaspers, Serge and Huang, Shenwei and Paulusma, Daniel},
title = {{Colouring Square-Free Graphs without Long Induced Paths}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.35},
URN = {urn:nbn:de:0030-drops-84922},
doi = {10.4230/LIPIcs.STACS.2018.35},
annote = {Keywords: graph colouring, hereditary graph class, clique-width, cycle, path}
}
@InProceedings{geissmann_et_al:LIPIcs.STACS.2018.36,
author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo},
title = {{Optimal Dislocation with Persistent Errors in Subquadratic Time}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {36:1--36:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.36},
URN = {urn:nbn:de:0030-drops-85266},
doi = {10.4230/LIPIcs.STACS.2018.36},
annote = {Keywords: sorting, recurrent comparison errors, maximum dislocation}
}
@InProceedings{giakkoupis_et_al:LIPIcs.STACS.2018.37,
author = {Giakkoupis, George and Woelfel, Philipp},
title = {{An Improved Bound for Random Binary Search Trees with Concurrent Insertions}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {37:1--37:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.37},
URN = {urn:nbn:de:0030-drops-85108},
doi = {10.4230/LIPIcs.STACS.2018.37},
annote = {Keywords: random binary search tree, buffer, average depth, concurrent data structures}
}
@InProceedings{gourdel_et_al:LIPIcs.STACS.2018.38,
author = {Gourdel, Garance and Kociumaka, Tomasz and Radoszewski, Jakub and Rytter, Wojciech and Shur, Arseny and Walen, Tomasz},
title = {{String Periods in the Order-Preserving Model}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.38},
URN = {urn:nbn:de:0030-drops-85064},
doi = {10.4230/LIPIcs.STACS.2018.38},
annote = {Keywords: order-preserving pattern matching, period, efficient algorithm}
}
@InProceedings{hirai_et_al:LIPIcs.STACS.2018.39,
author = {Hirai, Hiroshi and Iwamasa, Yuni and Murota, Kazuo and Zivny, Stanislav},
title = {{Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {39:1--39:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.39},
URN = {urn:nbn:de:0030-drops-85042},
doi = {10.4230/LIPIcs.STACS.2018.39},
annote = {Keywords: valued constraint satisfaction problems, discrete convex analysis, M-convexity}
}
@InProceedings{hitchcock_et_al:LIPIcs.STACS.2018.40,
author = {Hitchcock, John M. and Shafei, Hadi},
title = {{Nonuniform Reductions and NP-Completeness}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {40:1--40:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.40},
URN = {urn:nbn:de:0030-drops-85217},
doi = {10.4230/LIPIcs.STACS.2018.40},
annote = {Keywords: computational complexity, NP-completeness, reducibility, nonuniform complexity}
}
@InProceedings{iwata_et_al:LIPIcs.STACS.2018.41,
author = {Iwata, Yoichi and Ogasawara, Tomoaki and Ohsaka, Naoto},
title = {{On the Power of Tree-Depth for Fully Polynomial FPT Algorithms}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.41},
URN = {urn:nbn:de:0030-drops-85255},
doi = {10.4230/LIPIcs.STACS.2018.41},
annote = {Keywords: Fully Polynomial FPT Algorithm, Tree-Depth, Divide-and-Conquer}
}
@InProceedings{jaffke_et_al:LIPIcs.STACS.2018.42,
author = {Jaffke, Lars and Kwon, O-joung and Telle, Jan Arne},
title = {{A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {42:1--42:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.42},
URN = {urn:nbn:de:0030-drops-85348},
doi = {10.4230/LIPIcs.STACS.2018.42},
annote = {Keywords: graph width parameters, graph classes, feedback vertex set, leaf powers}
}
@InProceedings{jager_et_al:LIPIcs.STACS.2018.43,
author = {J\"{a}ger, Sven and Skutella, Martin},
title = {{Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.43},
URN = {urn:nbn:de:0030-drops-85034},
doi = {10.4230/LIPIcs.STACS.2018.43},
annote = {Keywords: Stochastic Scheduling, Parallel Machines, Approximation Algorithm, List Scheduling, Weighted Shortest (Expected) Processing Time Rule}
}
@InProceedings{kiyomi_et_al:LIPIcs.STACS.2018.44,
author = {Kiyomi, Masashi and Ono, Hirotaka and Otachi, Yota and Schweitzer, Pascal and Tarui, Jun},
title = {{Space-Efficient Algorithms for Longest Increasing Subsequence}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.44},
URN = {urn:nbn:de:0030-drops-84911},
doi = {10.4230/LIPIcs.STACS.2018.44},
annote = {Keywords: longest increasing subsequence, patience sorting, space-efficient algorithm}
}
@InProceedings{kocher:LIPIcs.STACS.2018.45,
author = {K\"{o}cher, Chris},
title = {{Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.45},
URN = {urn:nbn:de:0030-drops-84839},
doi = {10.4230/LIPIcs.STACS.2018.45},
annote = {Keywords: Partially Lossy Queues, Transformation Monoid, Rational Sets, Recognizable Sets, Aperiodic Sets, MSO logic}
}
@InProceedings{kosolobov:LIPIcs.STACS.2018.46,
author = {Kosolobov, Dmitry},
title = {{Relations Between Greedy and Bit-Optimal LZ77 Encodings}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.46},
URN = {urn:nbn:de:0030-drops-84894},
doi = {10.4230/LIPIcs.STACS.2018.46},
annote = {Keywords: Lempel-Ziv, LZ77 encoding, greedy LZ77, bit optimal LZ77}
}
@InProceedings{kuperberg_et_al:LIPIcs.STACS.2018.47,
author = {Kuperberg, Denis and Majumdar, Anirban},
title = {{Width of Non-deterministic Automata}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.47},
URN = {urn:nbn:de:0030-drops-84963},
doi = {10.4230/LIPIcs.STACS.2018.47},
annote = {Keywords: width, non-deterministic automata, determinisation, good-for-games, complexity}
}
@InProceedings{luttenberger_et_al:LIPIcs.STACS.2018.48,
author = {Luttenberger, Michael and Palenta, Raphaela and Seidl, Helmut},
title = {{Computing the Longest Common Prefix of a Context-free Language in Polynomial Time}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {48:1--48:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.48},
URN = {urn:nbn:de:0030-drops-84828},
doi = {10.4230/LIPIcs.STACS.2018.48},
annote = {Keywords: longest common prefix, context-free languages, combinatorics on words}
}
@InProceedings{larose_et_al:LIPIcs.STACS.2018.49,
author = {Larose, Benoit and Martin, Barnaby and Paulusma, Daniel},
title = {{Surjective H-Colouring over Reflexive Digraphs}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.49},
URN = {urn:nbn:de:0030-drops-84882},
doi = {10.4230/LIPIcs.STACS.2018.49},
annote = {Keywords: Surjective H-Coloring, Computational Complexity, Algorithmic Graph Theory, Universal Algebra, Constraint Satisfaction}
}
@InProceedings{mazowiecki_et_al:LIPIcs.STACS.2018.50,
author = {Mazowiecki, Filip and Riveros, Cristian},
title = {{Pumping Lemmas for Weighted Automata}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {50:1--50:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.50},
URN = {urn:nbn:de:0030-drops-84984},
doi = {10.4230/LIPIcs.STACS.2018.50},
annote = {Keywords: Weighted automata, regular functions over words, pumping lemmas}
}
@InProceedings{nies_et_al:LIPIcs.STACS.2018.51,
author = {Nies, Andr\'{e} and Stephan, Frank},
title = {{Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {51:1--51:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.51},
URN = {urn:nbn:de:0030-drops-84938},
doi = {10.4230/LIPIcs.STACS.2018.51},
annote = {Keywords: Computational complexity, Randomness via resource-bounded betting strategies, Martingales, Closure under permutations}
}
@InProceedings{onodera_et_al:LIPIcs.STACS.2018.52,
author = {Onodera, Taku and Shibuya, Tetsuo},
title = {{Succinct Oblivious RAM}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {52:1--52:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.52},
URN = {urn:nbn:de:0030-drops-85014},
doi = {10.4230/LIPIcs.STACS.2018.52},
annote = {Keywords: Oblivious RAM, Succinct data structure, Balls-into-bins}
}
@InProceedings{parys:LIPIcs.STACS.2018.53,
author = {Parys, Pawel},
title = {{Recursion Schemes and the WMSO+U Logic}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.53},
URN = {urn:nbn:de:0030-drops-85122},
doi = {10.4230/LIPIcs.STACS.2018.53},
annote = {Keywords: higher-order recursion schemes, intersection types, WMSO+U logic, boundedness}
}
@InProceedings{rajasekaran_et_al:LIPIcs.STACS.2018.54,
author = {Rajasekaran, Aayush and Shallit, Jeffrey and Smith, Tim},
title = {{Sums of Palindromes: an Approach via Automata}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {54:1--54:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.54},
URN = {urn:nbn:de:0030-drops-84976},
doi = {10.4230/LIPIcs.STACS.2018.54},
annote = {Keywords: finite automaton, nested-word automaton, decision procedure, palindrome, additive number theory}
}
@InProceedings{simon:LIPIcs.STACS.2018.55,
author = {Simon, Hans U.},
title = {{On the Containment Problem for Linear Sets}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {55:1--55:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.55},
URN = {urn:nbn:de:0030-drops-84842},
doi = {10.4230/LIPIcs.STACS.2018.55},
annote = {Keywords: polynomial hierarchy, completeness, containment problem, linear sets}
}
@InProceedings{szykula:LIPIcs.STACS.2018.56,
author = {Szykula, Marek},
title = {{Improving the Upper Bound on the Length of the Shortest Reset Word}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {56:1--56:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.56},
URN = {urn:nbn:de:0030-drops-85160},
doi = {10.4230/LIPIcs.STACS.2018.56},
annote = {Keywords: avoiding word, Cerny conjecture, reset length, reset threshold, reset word, synchronizing automaton, synchronizing word}
}
@InProceedings{takahashi_et_al:LIPIcs.STACS.2018.57,
author = {Takahashi, Yasuhiro and Tani, Seiichiro},
title = {{Power of Uninitialized Qubits in Shallow Quantum Circuits}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {57:1--57:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.57},
URN = {urn:nbn:de:0030-drops-84907},
doi = {10.4230/LIPIcs.STACS.2018.57},
annote = {Keywords: quantum circuit complexity, shallow quantum circuit, uninitialized qubit}
}
@InProceedings{tell:LIPIcs.STACS.2018.58,
author = {Tell, Roei},
title = {{Lower Bounds on Black-Box Reductions of Hitting to Density Estimation}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {58:1--58:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.58},
URN = {urn:nbn:de:0030-drops-85005},
doi = {10.4230/LIPIcs.STACS.2018.58},
annote = {Keywords: Approximate Counting, Lower Bounds, Derandomization, Parallel Algorithms, Query Complexity}
}
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