Nicolas Ollinger and Heribert Vollmer. LIPIcs, Volume 47, STACS'16, Complete Volume. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Proceedings{ollinger_et_al:LIPIcs.STACS.2016, title = {{LIPIcs, Volume 47, STACS'16, Complete Volume}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016}, URN = {urn:nbn:de:0030-drops-57682}, doi = {10.4230/LIPIcs.STACS.2016}, annote = {Keywords: Software/Program Verification, Models of Computation, Modes of Computation, Complexity Measures and Classes, Nonnumerical Algorithms and Problems, Specifying and Verifying and Reasoning about Programs, Mathematical Logic, Formal Languages} }
Nicolas Ollinger and Heribert Vollmer. Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 0:i-0:xvi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{ollinger_et_al:LIPIcs.STACS.2016.0, author = {Ollinger, Nicolas and Vollmer, Heribert}, title = {{Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.0}, URN = {urn:nbn:de:0030-drops-57015}, doi = {10.4230/LIPIcs.STACS.2016.0}, annote = {Keywords: Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents} }
Jérôme Leroux and Sylvain Schmitz. Ideal Decompositions for Vector Addition Systems (Invited Talk). In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 1:1-1:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{leroux_et_al:LIPIcs.STACS.2016.1, author = {Leroux, J\'{e}r\^{o}me and Schmitz, Sylvain}, title = {{Ideal Decompositions for Vector Addition Systems}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {1:1--1:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.1}, URN = {urn:nbn:de:0030-drops-57024}, doi = {10.4230/LIPIcs.STACS.2016.1}, annote = {Keywords: Petri net, ideal, well-quasi-order, reachability, verification} }
Carsten Lutz. Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk). In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 2:1-2:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{lutz:LIPIcs.STACS.2016.2, author = {Lutz, Carsten}, title = {{Complexity and Expressive Power of Ontology-Mediated Queries}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {2:1--2:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.2}, URN = {urn:nbn:de:0030-drops-57034}, doi = {10.4230/LIPIcs.STACS.2016.2}, annote = {Keywords: Ontology-Mediated Queries, Description Logic, Constraint Satisfaction} }
Virginia Vassilevska Williams. Fine-Grained Algorithms and Complexity (Invited Talk). In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, p. 3:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{vassilevskawilliams:LIPIcs.STACS.2016.3, author = {Vassilevska Williams, Virginia}, title = {{Fine-Grained Algorithms and Complexity}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.3}, URN = {urn:nbn:de:0030-drops-57044}, doi = {10.4230/LIPIcs.STACS.2016.3}, annote = {Keywords: algorithms, complexity, polynomial time problems} }
Jarkko Kari. Tutorial on Cellular Automata and Tilings (Tutorial). In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, p. 4:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kari:LIPIcs.STACS.2016.4, author = {Kari, Jarkko}, title = {{Tutorial on Cellular Automata and Tilings}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {4:1--4:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.4}, URN = {urn:nbn:de:0030-drops-57054}, doi = {10.4230/LIPIcs.STACS.2016.4}, annote = {Keywords: cellular automata, wang tiles, decision problems, dynamics} }
Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, and Morten Stöckel. Graph Reconstruction with a Betweenness Oracle. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 5:1-5:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{abrahamsen_et_al:LIPIcs.STACS.2016.5, author = {Abrahamsen, Mikkel and Bodwin, Greg and Rotenberg, Eva and St\"{o}ckel, Morten}, title = {{Graph Reconstruction with a Betweenness Oracle}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.5}, URN = {urn:nbn:de:0030-drops-57068}, doi = {10.4230/LIPIcs.STACS.2016.5}, annote = {Keywords: graph reconstruction, bounded degree graphs, query complexity} }
Anna Adamaszek, Antonios Antoniadis, and Tobias Mömke. Airports and Railways: Facility Location Meets Network Design. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 6:1-6:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{adamaszek_et_al:LIPIcs.STACS.2016.6, author = {Adamaszek, Anna and Antoniadis, Antonios and M\"{o}mke, Tobias}, title = {{Airports and Railways: Facility Location Meets Network Design}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.6}, URN = {urn:nbn:de:0030-drops-57074}, doi = {10.4230/LIPIcs.STACS.2016.6}, annote = {Keywords: approximation algorithms, geometric approximation, facility location, network design, PTAS} }
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, and Saket Saurabh. Simultaneous Feedback Vertex Set: A Parameterized Perspective. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 7:1-7:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{agrawal_et_al:LIPIcs.STACS.2016.7, author = {Agrawal, Akanksha and Lokshtanov, Daniel and Mouawad, Amer E. and Saurabh, Saket}, title = {{Simultaneous Feedback Vertex Set: A Parameterized Perspective}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.7}, URN = {urn:nbn:de:0030-drops-57084}, doi = {10.4230/LIPIcs.STACS.2016.7}, annote = {Keywords: parameterized complexity ,feedback vertex set, kernel, edge-colored graphs} }
S. Akshay, Blaise Genest, Bruno Karelovic, and Nikhil Vyas. On Regularity of Unary Probabilistic Automata. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 8:1-8:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{akshay_et_al:LIPIcs.STACS.2016.8, author = {Akshay, S. and Genest, Blaise and Karelovic, Bruno and Vyas, Nikhil}, title = {{On Regularity of Unary Probabilistic Automata}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.8}, URN = {urn:nbn:de:0030-drops-57093}, doi = {10.4230/LIPIcs.STACS.2016.8}, annote = {Keywords: Probabilistic automata, Symbolic dynamics, Markov chains, Skolem problem, Regularity} }
Spyros Angelopoulos, Christoph Dürr, and Thomas Lidbetter. The Expanding Search Ratio of a Graph. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{angelopoulos_et_al:LIPIcs.STACS.2016.9, author = {Angelopoulos, Spyros and D\"{u}rr, Christoph and Lidbetter, Thomas}, title = {{The Expanding Search Ratio of a Graph}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.9}, URN = {urn:nbn:de:0030-drops-57109}, doi = {10.4230/LIPIcs.STACS.2016.9}, annote = {Keywords: Search games, randomized algorithms, competitive analysis, game theory} }
Rahul Arora, Ashu Gupta, Rohit Gurjar, and Raghunath Tewari. Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 10:1-10:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{arora_et_al:LIPIcs.STACS.2016.10, author = {Arora, Rahul and Gupta, Ashu and Gurjar, Rohit and Tewari, Raghunath}, title = {{Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.10}, URN = {urn:nbn:de:0030-drops-57116}, doi = {10.4230/LIPIcs.STACS.2016.10}, annote = {Keywords: bipartite matching, derandomization, isolation lemma, SPL, minor-free graph} }
Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, and Victor Kozyakin. Entropy Games and Matrix Multiplication Games. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{asarin_et_al:LIPIcs.STACS.2016.11, author = {Asarin, Eugene and Cervelle, Julien and Degorre, Aldric and Dima, Catalin and Horn, Florian and Kozyakin, Victor}, title = {{Entropy Games and Matrix Multiplication Games}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.11}, URN = {urn:nbn:de:0030-drops-57129}, doi = {10.4230/LIPIcs.STACS.2016.11}, annote = {Keywords: game theory, entropy, joint spectral radius} }
Nicolas Auger, Cyril Nicaud, and Carine Pivoteau. Good Predictions Are Worth a Few Comparisons. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 12:1-12:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{auger_et_al:LIPIcs.STACS.2016.12, author = {Auger, Nicolas and Nicaud, Cyril and Pivoteau, Carine}, title = {{Good Predictions Are Worth a Few Comparisons}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.12}, URN = {urn:nbn:de:0030-drops-57135}, doi = {10.4230/LIPIcs.STACS.2016.12}, annote = {Keywords: branch misses, binary search, exponentiation by squaring, Markov chains} }
Per Austrin, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof. Dense Subset Sum May Be the Hardest. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 13:1-13:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{austrin_et_al:LIPIcs.STACS.2016.13, author = {Austrin, Per and Kaski, Petteri and Koivisto, Mikko and Nederlof, Jesper}, title = {{Dense Subset Sum May Be the Hardest}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.13}, URN = {urn:nbn:de:0030-drops-57143}, doi = {10.4230/LIPIcs.STACS.2016.13}, annote = {Keywords: subset sum, additive combinatorics, exponential-time algorithm, homo-morphic hashing, littlewood–offord problem} }
Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang. Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 14:1-14:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{wonbae_et_al:LIPIcs.STACS.2016.14, author = {Won Bae, Sang and Korman, Matias and Mitchell, Joseph S. B. and Okamoto, Yoshio and Polishchuk, Valentin and Wang, Haitao}, title = {{Computing the L1 Geodesic Diameter and Center of a Polygonal Domain}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.14}, URN = {urn:nbn:de:0030-drops-57151}, doi = {10.4230/LIPIcs.STACS.2016.14}, annote = {Keywords: geodesic diameter, geodesic center, shortest paths, polygonal domains, L1 metric} }
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla. Are Short Proofs Narrow? QBF Resolution is not Simple. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 15:1-15:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{beyersdorff_et_al:LIPIcs.STACS.2016.15, author = {Beyersdorff, Olaf and Chew, Leroy and Mahajan, Meena and Shukla, Anil}, title = {{Are Short Proofs Narrow? QBF Resolution is not Simple}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.15}, URN = {urn:nbn:de:0030-drops-57164}, doi = {10.4230/LIPIcs.STACS.2016.15}, annote = {Keywords: proof complexity, QBF, resolution, lower bound techniques, simulations} }
Anup Bhattacharya, Ragesh Jaiswal, and Amit Kumar. Faster Algorithms for the Constrained k-Means Problem. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 16:1-16:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bhattacharya_et_al:LIPIcs.STACS.2016.16, author = {Bhattacharya, Anup and Jaiswal, Ragesh and Kumar, Amit}, title = {{Faster Algorithms for the Constrained k-Means Problem}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {16:1--16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.16}, URN = {urn:nbn:de:0030-drops-57179}, doi = {10.4230/LIPIcs.STACS.2016.16}, annote = {Keywords: k-means, k-median, approximation algorithm, sampling} }
Vittorio Bilò and Marios Mavronicolas. A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 17:1-17:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bilo_et_al:LIPIcs.STACS.2016.17, author = {Bil\`{o}, Vittorio and Mavronicolas, Marios}, title = {{A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {17:1--17:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.17}, URN = {urn:nbn:de:0030-drops-57189}, doi = {10.4230/LIPIcs.STACS.2016.17}, annote = {Keywords: Nash equilibrium, complexity of equilibria, EXISTS-R-completeness} }
Davide Bilò, Luciano Gualà, Stefano Leucci, and Guido Proietti. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 18:1-18:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bilo_et_al:LIPIcs.STACS.2016.18, author = {Bil\`{o}, Davide and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido}, title = {{Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.18}, URN = {urn:nbn:de:0030-drops-57196}, doi = {10.4230/LIPIcs.STACS.2016.18}, annote = {Keywords: fault-tolerant shortest-path tree, distance oracle, minimum spanning tree} }
Achim Blumensath, Thomas Colcombet, and Pawel Parys. On a Fragment of AMSO and Tiling Systems. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{blumensath_et_al:LIPIcs.STACS.2016.19, author = {Blumensath, Achim and Colcombet, Thomas and Parys, Pawel}, title = {{On a Fragment of AMSO and Tiling Systems}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.19}, URN = {urn:nbn:de:0030-drops-57202}, doi = {10.4230/LIPIcs.STACS.2016.19}, annote = {Keywords: monadic second-order logic, boundedness, tiling problems} }
Manuel Bodirsky, Peter Jonsson, and Trung Van Pham. The Complexity of Phylogeny Constraint Satisfaction. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 20:1-20:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bodirsky_et_al:LIPIcs.STACS.2016.20, author = {Bodirsky, Manuel and Jonsson, Peter and Van Pham, Trung}, title = {{The Complexity of Phylogeny Constraint Satisfaction}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.20}, URN = {urn:nbn:de:0030-drops-57218}, doi = {10.4230/LIPIcs.STACS.2016.20}, annote = {Keywords: constraint satisfaction problems, computational complexity, phylogenetic reconstruction, ramsey theory, model theory} }
Mikolaj Bojanczyk, Pawel Parys, and Szymon Torunczyk. The MSO+U Theory of (N,<) Is Undecidable. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 21:1-21:8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2016.21, author = {Bojanczyk, Mikolaj and Parys, Pawel and Torunczyk, Szymon}, title = {{The MSO+U Theory of (N,\langle) Is Undecidable}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {21:1--21:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.21}, URN = {urn:nbn:de:0030-drops-57223}, doi = {10.4230/LIPIcs.STACS.2016.21}, annote = {Keywords: automata, logic, unbounding quantifier, bounds, undecidability} }
Édouard Bonnet, Michael Lampis, and Vangelis Th. Paschos. Time-Approximation Trade-offs for Inapproximable Problems. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 22:1-22:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bonnet_et_al:LIPIcs.STACS.2016.22, author = {Bonnet, \'{E}douard and Lampis, Michael and Paschos, Vangelis Th.}, title = {{Time-Approximation Trade-offs for Inapproximable Problems}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {22:1--22:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.22}, URN = {urn:nbn:de:0030-drops-57236}, doi = {10.4230/LIPIcs.STACS.2016.22}, annote = {Keywords: Algorithm, Complexity, Polynomial and Subexponential Approximation, Reduction, Inapproximability} }
Gerth Stølting Brodal. External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 23:1-23:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{brodal:LIPIcs.STACS.2016.23, author = {Brodal, Gerth St{\o}lting}, title = {{External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {23:1--23:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.23}, URN = {urn:nbn:de:0030-drops-57241}, doi = {10.4230/LIPIcs.STACS.2016.23}, annote = {Keywords: External memory, priority search tree, 3-sided range reporting, top-k queries} }
Harry Buhrman, Michal Koucký, Bruno Loff, and Florian Speelman. Catalytic Space: Non-determinism and Hierarchy. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 24:1-24:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{buhrman_et_al:LIPIcs.STACS.2016.24, author = {Buhrman, Harry and Kouck\'{y}, Michal and Loff, Bruno and Speelman, Florian}, title = {{Catalytic Space: Non-determinism and Hierarchy}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.24}, URN = {urn:nbn:de:0030-drops-57258}, doi = {10.4230/LIPIcs.STACS.2016.24}, annote = {Keywords: catalytic computation, Immerman–Szelepcs\'{e}nyi theorem, space hierarchy} }
Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, and Ronitt Rubinfeld. Testing Shape Restrictions of Discrete Distributions. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 25:1-25:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{canonne_et_al:LIPIcs.STACS.2016.25, author = {Canonne, Cl\'{e}ment L. and Diakonikolas, Ilias and Gouleakis, Themis and Rubinfeld, Ronitt}, title = {{Testing Shape Restrictions of Discrete Distributions}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.25}, URN = {urn:nbn:de:0030-drops-57260}, doi = {10.4230/LIPIcs.STACS.2016.25}, annote = {Keywords: property testing, probability distributions, statistics, lower bounds} }
Maurice Chandoo. Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 26:1-26:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chandoo:LIPIcs.STACS.2016.26, author = {Chandoo, Maurice}, title = {{Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.26}, URN = {urn:nbn:de:0030-drops-57275}, doi = {10.4230/LIPIcs.STACS.2016.26}, annote = {Keywords: graph isomorphism, canonical representation, parameterized algorithm} }
Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, and Uri Zwick. Bottleneck Paths and Trees and Deterministic Graphical Games. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 27:1-27:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chechik_et_al:LIPIcs.STACS.2016.27, author = {Chechik, Shiri and Kaplan, Haim and Thorup, Mikkel and Zamir, Or and Zwick, Uri}, title = {{Bottleneck Paths and Trees and Deterministic Graphical Games}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {27:1--27:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.27}, URN = {urn:nbn:de:0030-drops-57283}, doi = {10.4230/LIPIcs.STACS.2016.27}, annote = {Keywords: bottleneck paths, comparison model, deterministic graphical games} }
Lin Chen and Guochuan Zhang. Packing Groups of Items into Multiple Knapsacks. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 28:1-28:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chen_et_al:LIPIcs.STACS.2016.28, author = {Chen, Lin and Zhang, Guochuan}, title = {{Packing Groups of Items into Multiple Knapsacks}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.28}, URN = {urn:nbn:de:0030-drops-57299}, doi = {10.4230/LIPIcs.STACS.2016.28}, annote = {Keywords: approximation algorithms, lower bound, multiple knapsack, bin packing} }
Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, and Szymon Torunczyk. Cost Functions Definable by Min/Max Automata. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 29:1-29:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{colcombet_et_al:LIPIcs.STACS.2016.29, author = {Colcombet, Thomas and Kuperberg, Denis and Manuel, Amaldev and Torunczyk, Szymon}, title = {{Cost Functions Definable by Min/Max Automata}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.29}, URN = {urn:nbn:de:0030-drops-57305}, doi = {10.4230/LIPIcs.STACS.2016.29}, annote = {Keywords: distance automata, B-automata, regular cost functions, stabilisation monoids, decidability, min-automata, max-automata} }
Laure Daviaud, Denis Kuperberg, and Jean-Éric Pin. Varieties of Cost Functions. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 30:1-30:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{daviaud_et_al:LIPIcs.STACS.2016.30, author = {Daviaud, Laure and Kuperberg, Denis and Pin, Jean-\'{E}ric}, title = {{Varieties of Cost Functions}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.30}, URN = {urn:nbn:de:0030-drops-57319}, doi = {10.4230/LIPIcs.STACS.2016.30}, annote = {Keywords: Cost functions, regular language, varieties, syntactic algebra} }
Pål Grønås Drange, Markus Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, and Somnath Sikdar. Kernelization and Sparseness: the Case of Dominating Set. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{drange_et_al:LIPIcs.STACS.2016.31, author = {Drange, P\r{a}l Gr{\o}n\r{a}s and Dregi, Markus and Fomin, Fedor V. and Kreutzer, Stephan and Lokshtanov, Daniel and Pilipczuk, Marcin and Pilipczuk, Michal and Reidl, Felix and S\'{a}nchez Villaamil, Fernando and Saurabh, Saket and Siebertz, Sebastian and Sikdar, Somnath}, title = {{Kernelization and Sparseness: the Case of Dominating Set}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.31}, URN = {urn:nbn:de:0030-drops-57327}, doi = {10.4230/LIPIcs.STACS.2016.31}, annote = {Keywords: kernelization, dominating set, bounded expansion, nowhere dense} }
Michael Elberfeld and Pascal Schweitzer. Canonizing Graphs of Bounded Tree Width in Logspace. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 32:1-32:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{elberfeld_et_al:LIPIcs.STACS.2016.32, author = {Elberfeld, Michael and Schweitzer, Pascal}, title = {{Canonizing Graphs of Bounded Tree Width in Logspace}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.32}, URN = {urn:nbn:de:0030-drops-57336}, doi = {10.4230/LIPIcs.STACS.2016.32}, annote = {Keywords: algorithmic graph theory, computational complexity, graph isomorphism, logspace, tree width} }
Stefan Fafianie, Stefan Kratsch, and Vuong Anh Quyen. Preprocessing Under Uncertainty. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 33:1-33:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fafianie_et_al:LIPIcs.STACS.2016.33, author = {Fafianie, Stefan and Kratsch, Stefan and Anh Quyen, Vuong}, title = {{Preprocessing Under Uncertainty}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {33:1--33:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.33}, URN = {urn:nbn:de:0030-drops-57340}, doi = {10.4230/LIPIcs.STACS.2016.33}, annote = {Keywords: preprocessing, uncertainty, spanning trees, matroids, matchings} }
Nathanaël Fijalkow. Characterisation of an Algebraic Algorithm for Probabilistic Automata. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 34:1-34:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fijalkow:LIPIcs.STACS.2016.34, author = {Fijalkow, Nathana\"{e}l}, title = {{Characterisation of an Algebraic Algorithm for Probabilistic Automata}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {34:1--34:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.34}, URN = {urn:nbn:de:0030-drops-57355}, doi = {10.4230/LIPIcs.STACS.2016.34}, annote = {Keywords: Probabilistic Automata, Value 1 Problem, Markov Monoid Algorithm, Algebraic Algorithm, Profinite Theory, Topology in Computer Science} }
Yuval Filmus, Pavel Hrubeš, and Massimo Lauria. Semantic Versus Syntactic Cutting Planes. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 35:1-35:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{filmus_et_al:LIPIcs.STACS.2016.35, author = {Filmus, Yuval and Hrube\v{s}, Pavel and Lauria, Massimo}, title = {{Semantic Versus Syntactic Cutting Planes}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {35:1--35:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.35}, URN = {urn:nbn:de:0030-drops-57367}, doi = {10.4230/LIPIcs.STACS.2016.35}, annote = {Keywords: proof complexity, cutting planes, lower bounds} }
Fedor V. Fomin, Petr Golovach, Fahad Panolan, and Saket Saurabh. Editing to Connected f-Degree Graph. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 36:1-36:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fomin_et_al:LIPIcs.STACS.2016.36, author = {Fomin, Fedor V. and Golovach, Petr and Panolan, Fahad and Saurabh, Saket}, title = {{Editing to Connected f-Degree Graph}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.36}, URN = {urn:nbn:de:0030-drops-57370}, doi = {10.4230/LIPIcs.STACS.2016.36}, annote = {Keywords: Connected f-factor, FPT, Representative Family, Color Coding} }
Dimitris Fotakis, Michael Lampis, and Vangelis Th. Paschos. Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 37:1-37:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fotakis_et_al:LIPIcs.STACS.2016.37, author = {Fotakis, Dimitris and Lampis, Michael and Paschos, Vangelis Th.}, title = {{Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {37:1--37:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.37}, URN = {urn:nbn:de:0030-drops-57388}, doi = {10.4230/LIPIcs.STACS.2016.37}, annote = {Keywords: polynomial and subexponential approximation, sampling, randomized rounding} }
Frederik Garbe and Richard Mycroft. The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 38:1-38:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{garbe_et_al:LIPIcs.STACS.2016.38, author = {Garbe, Frederik and Mycroft, Richard}, title = {{The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {38:1--38:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.38}, URN = {urn:nbn:de:0030-drops-57392}, doi = {10.4230/LIPIcs.STACS.2016.38}, annote = {Keywords: Hamilton cycles, hypergraphs, graph algorithms} }
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, and Florin Manea. Efficiently Finding All Maximal alpha-gapped Repeats. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 39:1-39:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2016.39, author = {Gawrychowski, Pawel and I, Tomohiro and Inenaga, Shunsuke and K\"{o}ppl, Dominik and Manea, Florin}, title = {{Efficiently Finding All Maximal alpha-gapped Repeats}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.39}, URN = {urn:nbn:de:0030-drops-57408}, doi = {10.4230/LIPIcs.STACS.2016.39}, annote = {Keywords: combinatorics on words, counting algorithms} }
Bernhard Gittenberger and Zbigniew Golebiewski. On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 40:1-40:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gittenberger_et_al:LIPIcs.STACS.2016.40, author = {Gittenberger, Bernhard and Golebiewski, Zbigniew}, title = {{On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.40}, URN = {urn:nbn:de:0030-drops-57411}, doi = {10.4230/LIPIcs.STACS.2016.40}, annote = {Keywords: lambda calculus, terms enumeration, analytic combinatorics} }
Christoph Haase and Piotr Hofman. Tightening the Complexity of Equivalence Problems for Commutative Grammars. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 41:1-41:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{haase_et_al:LIPIcs.STACS.2016.41, author = {Haase, Christoph and Hofman, Piotr}, title = {{Tightening the Complexity of Equivalence Problems for Commutative Grammars}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.41}, URN = {urn:nbn:de:0030-drops-57422}, doi = {10.4230/LIPIcs.STACS.2016.41}, annote = {Keywords: language equivalence, commutative grammars, presburger arithmetic, semi-linear sets, petri nets} }
John M. Hitchcock and Hadi Shafei. Autoreducibility of NP-Complete Sets. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 42:1-42:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hitchcock_et_al:LIPIcs.STACS.2016.42, author = {Hitchcock, John M. and Shafei, Hadi}, title = {{Autoreducibility of NP-Complete Sets}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {42:1--42:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.42}, URN = {urn:nbn:de:0030-drops-57437}, doi = {10.4230/LIPIcs.STACS.2016.42}, annote = {Keywords: computational complexity, NP-completeness, autoreducibility, genericity} }
Eva-Maria C. Hols and Stefan Kratsch. A Randomized Polynomial Kernel for Subset Feedback Vertex Set. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 43:1-43:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hols_et_al:LIPIcs.STACS.2016.43, author = {Hols, Eva-Maria C. and Kratsch, Stefan}, title = {{A Randomized Polynomial Kernel for Subset Feedback Vertex Set}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {43:1--43:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.43}, URN = {urn:nbn:de:0030-drops-57448}, doi = {10.4230/LIPIcs.STACS.2016.43}, annote = {Keywords: parameterized complexity, kernelization, subset feedback vertex set} }
Štepán Holub and Jeffrey Shallit. Periods and Borders of Random Words. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 44:1-44:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{holub_et_al:LIPIcs.STACS.2016.44, author = {Holub, \v{S}tep\'{a}n and Shallit, Jeffrey}, title = {{Periods and Borders of Random Words}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {44:1--44:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.44}, URN = {urn:nbn:de:0030-drops-57453}, doi = {10.4230/LIPIcs.STACS.2016.44}, annote = {Keywords: random word, period, word border} }
Bart M. P. Jansen. Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 45:1-45:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{jansen:LIPIcs.STACS.2016.45, author = {Jansen, Bart M. P.}, title = {{Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {45:1--45:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.45}, URN = {urn:nbn:de:0030-drops-57463}, doi = {10.4230/LIPIcs.STACS.2016.45}, annote = {Keywords: kernel lower bounds, constrained bipartite vertex cover} }
Neeraj Kayal, Vineet Nair, and Chandan Saha. Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 46:1-46:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kayal_et_al:LIPIcs.STACS.2016.46, author = {Kayal, Neeraj and Nair, Vineet and Saha, Chandan}, title = {{Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {46:1--46:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.46}, URN = {urn:nbn:de:0030-drops-57475}, doi = {10.4230/LIPIcs.STACS.2016.46}, annote = {Keywords: multilinear depth three circuits, read-once oblivious algebraic branching programs, evaluation dimension, skewed partial derivatives, expander graphs,} }
Timo Kötzing and Martin Schirneck. Towards an Atlas of Computational Learning Theory. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 47:1-47:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kotzing_et_al:LIPIcs.STACS.2016.47, author = {K\"{o}tzing, Timo and Schirneck, Martin}, title = {{Towards an Atlas of Computational Learning Theory}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {47:1--47:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.47}, URN = {urn:nbn:de:0030-drops-57483}, doi = {10.4230/LIPIcs.STACS.2016.47}, annote = {Keywords: computational learning, language learning, partially set-driven learning, strongly monotone learning} }
Raghav Kulkarni and Supartha Podder. Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 48:1-48:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kulkarni_et_al:LIPIcs.STACS.2016.48, author = {Kulkarni, Raghav and Podder, Supartha}, title = {{Quantum Query Complexity of Subgraph Isomorphism and Homomorphism}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.48}, URN = {urn:nbn:de:0030-drops-57495}, doi = {10.4230/LIPIcs.STACS.2016.48}, annote = {Keywords: quantum query complexity, subgraph isomorphism, monotone graph properties} }
Mithilesh Kumar and Daniel Lokshtanov. Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 49:1-49:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kumar_et_al:LIPIcs.STACS.2016.49, author = {Kumar, Mithilesh and Lokshtanov, Daniel}, title = {{Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {49:1--49:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.49}, URN = {urn:nbn:de:0030-drops-57501}, doi = {10.4230/LIPIcs.STACS.2016.49}, annote = {Keywords: Parameterized algorithms, Exact algorithms, Feedback vertex set, Tour- naments, Graph partitions} }
Markus Lohrey and Georg Zetzsche. Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 50:1-50:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{lohrey_et_al:LIPIcs.STACS.2016.50, author = {Lohrey, Markus and Zetzsche, Georg}, title = {{Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.50}, URN = {urn:nbn:de:0030-drops-57512}, doi = {10.4230/LIPIcs.STACS.2016.50}, annote = {Keywords: Graph groups, HNN-extensions, amalgamated products, knapsack} }
Pinyan Lu, Kuan Yang, and Chihao Zhang. FPTAS for Hardcore and Ising Models on Hypergraphs. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 51:1-51:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{lu_et_al:LIPIcs.STACS.2016.51, author = {Lu, Pinyan and Yang, Kuan and Zhang, Chihao}, title = {{FPTAS for Hardcore and Ising Models on Hypergraphs}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.51}, URN = {urn:nbn:de:0030-drops-57526}, doi = {10.4230/LIPIcs.STACS.2016.51}, annote = {Keywords: hard-core model, ising model, hypergraph, spatial mixing, correlation decay} }
Arnaud Mary and Yann Strozecki. Efficient Enumeration of Solutions Produced by Closure Operations. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 52:1-52:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{mary_et_al:LIPIcs.STACS.2016.52, author = {Mary, Arnaud and Strozecki, Yann}, title = {{Efficient Enumeration of Solutions Produced by Closure Operations}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {52:1--52:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.52}, URN = {urn:nbn:de:0030-drops-57538}, doi = {10.4230/LIPIcs.STACS.2016.52}, annote = {Keywords: enumeration, set saturation, polynomial delay, Post’s lattice} }
Filip Mazowiecki and Cristian Riveros. Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 53:1-53:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{mazowiecki_et_al:LIPIcs.STACS.2016.53, author = {Mazowiecki, Filip and Riveros, Cristian}, title = {{Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {53:1--53:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.53}, URN = {urn:nbn:de:0030-drops-57547}, doi = {10.4230/LIPIcs.STACS.2016.53}, annote = {Keywords: Cost Register Automata, Weighted Automata, Semirings} }
Alexey Milovanov. Algorithmic Statistics, Prediction and Machine Learning. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 54:1-54:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{milovanov:LIPIcs.STACS.2016.54, author = {Milovanov, Alexey}, title = {{Algorithmic Statistics, Prediction and Machine Learning}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {54:1--54:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.54}, URN = {urn:nbn:de:0030-drops-57550}, doi = {10.4230/LIPIcs.STACS.2016.54}, annote = {Keywords: algorithmic information theory, minimal description length, prediction, kolmogorov complexity, learning} }
Matthias Mnich and Erik Jan van Leeuwen. Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 55:1-55:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{mnich_et_al:LIPIcs.STACS.2016.55, author = {Mnich, Matthias and van Leeuwen, Erik Jan}, title = {{Polynomial Kernels for Deletion to Classes of Acyclic Digraphs}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {55:1--55:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.55}, URN = {urn:nbn:de:0030-drops-57569}, doi = {10.4230/LIPIcs.STACS.2016.55}, annote = {Keywords: directed feedback vertex/arc set, parameterized algorithms, kernels} }
Mateus de Oliveira Oliveira. Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 56:1-56:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{deoliveiraoliveira:LIPIcs.STACS.2016.56, author = {de Oliveira Oliveira, Mateus}, title = {{Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.56}, URN = {urn:nbn:de:0030-drops-57571}, doi = {10.4230/LIPIcs.STACS.2016.56}, annote = {Keywords: non-linear lower bounds, treewidth, element distinctness} }
Michal Pilipczuk and Marcin Wrochna. On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 57:1-57:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{pilipczuk_et_al:LIPIcs.STACS.2016.57, author = {Pilipczuk, Michal and Wrochna, Marcin}, title = {{On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.57}, URN = {urn:nbn:de:0030-drops-57588}, doi = {10.4230/LIPIcs.STACS.2016.57}, annote = {Keywords: tree decomposition, LCS, tree-depth, NAuxSA, Savitch’s theorem} }
Harald Räcke and Richard Stotz. Improved Approximation Algorithms for Balanced Partitioning Problems. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 58:1-58:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{racke_et_al:LIPIcs.STACS.2016.58, author = {R\"{a}cke, Harald and Stotz, Richard}, title = {{Improved Approximation Algorithms for Balanced Partitioning Problems}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.58}, URN = {urn:nbn:de:0030-drops-57598}, doi = {10.4230/LIPIcs.STACS.2016.58}, annote = {Keywords: graph partitioning, dynamic programming, scheduling} }
Feedback for Dagstuhl Publishing