32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Proceedings{mayr_et_al:LIPIcs.STACS.2015, title = {{LIPIcs, Volume 30, STACS'15, Complete Volume}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015}, URN = {urn:nbn:de:0030-drops-49630}, doi = {10.4230/LIPIcs.STACS.2015}, annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory} }
32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. i-xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{mayr_et_al:LIPIcs.STACS.2015.i, author = {Mayr, Ernst W. and Ollinger, Nicolas}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {i--xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.i}, URN = {urn:nbn:de:0030-drops-49615}, doi = {10.4230/LIPIcs.STACS.2015.i}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Sanjeev Arora. Overcoming Intractability in Unsupervised Learning (Invited Talk). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{arora:LIPIcs.STACS.2015.1, author = {Arora, Sanjeev}, title = {{Overcoming Intractability in Unsupervised Learning}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {1--1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.1}, URN = {urn:nbn:de:0030-drops-49581}, doi = {10.4230/LIPIcs.STACS.2015.1}, annote = {Keywords: machine learning, unsupervised learning, intractability, NP-hardness} }
Manuel Bodirsky. The Complexity of Constraint Satisfaction Problems (Invited Talk). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 2-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bodirsky:LIPIcs.STACS.2015.2, author = {Bodirsky, Manuel}, title = {{The Complexity of Constraint Satisfaction Problems}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {2--9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.2}, URN = {urn:nbn:de:0030-drops-49567}, doi = {10.4230/LIPIcs.STACS.2015.2}, annote = {Keywords: constraint satisfaction, universal algebra, model theory, clones, temporal and spatial reasoning} }
Peter Sanders. Parallel Algorithms Reconsidered (Invited Talk). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 10-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{sanders:LIPIcs.STACS.2015.10, author = {Sanders, Peter}, title = {{Parallel Algorithms Reconsidered}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {10--18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.10}, URN = {urn:nbn:de:0030-drops-49572}, doi = {10.4230/LIPIcs.STACS.2015.10}, annote = {Keywords: parallel algorithm, algorithm engineering, communication efficient algorithm, polylogarithmic time algorithm, parallel machine model} }
Felix Brandt. Computational Social Choice (Tutorial). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, p. 19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{brandt:LIPIcs.STACS.2015.19, author = {Brandt, Felix}, title = {{Computational Social Choice}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {19--19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.19}, URN = {urn:nbn:de:0030-drops-49593}, doi = {10.4230/LIPIcs.STACS.2015.19}, annote = {Keywords: social choice theory, economics, algorithms, theory} }
Paul W. Goldberg. Algorithmic Game Theory (Tutorial). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, p. 20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{goldberg:LIPIcs.STACS.2015.20, author = {Goldberg, Paul W.}, title = {{Algorithmic Game Theory}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {20--20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.20}, URN = {urn:nbn:de:0030-drops-49606}, doi = {10.4230/LIPIcs.STACS.2015.20}, annote = {Keywords: equilibrium, non-cooperative games, computational complexity} }
Eric Allender, Dhiraj Holden, and Valentine Kabanets. The Minimum Oracle Circuit Size Problem. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 21-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{allender_et_al:LIPIcs.STACS.2015.21, author = {Allender, Eric and Holden, Dhiraj and Kabanets, Valentine}, title = {{The Minimum Oracle Circuit Size Problem}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {21--33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.21}, URN = {urn:nbn:de:0030-drops-49013}, doi = {10.4230/LIPIcs.STACS.2015.21}, annote = {Keywords: Kolmogorov complexity, minimum circuit size problem, PSPACE, NP-intermediate sets} }
Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, and Sebastian Siebertz. Graph Searching Games and Width Measures for Directed Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 34-47, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{akhoondianamiri_et_al:LIPIcs.STACS.2015.34, author = {Akhoondian Amiri, Saeed and Kaiser, Lukasz and Kreutzer, Stephan and Rabinovich, Roman and Siebertz, Sebastian}, title = {{Graph Searching Games and Width Measures for Directed Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {34--47}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.34}, URN = {urn:nbn:de:0030-drops-49020}, doi = {10.4230/LIPIcs.STACS.2015.34}, annote = {Keywords: cops and robber games, directed graphs, DAG-width} }
Per Austrin, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof. Subset Sum in the Absence of Concentration. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 48-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{austrin_et_al:LIPIcs.STACS.2015.48, author = {Austrin, Per and Kaski, Petteri and Koivisto, Mikko and Nederlof, Jesper}, title = {{Subset Sum in the Absence of Concentration}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {48--61}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.48}, URN = {urn:nbn:de:0030-drops-49034}, doi = {10.4230/LIPIcs.STACS.2015.48}, annote = {Keywords: subset sum, additive combinatorics, exponential-time algorithm, homomorphic hashing, Littlewood--Offord problem} }
Martin Avanzini and Ugo Dal Lago. On Sharing, Memoization, and Polynomial Time. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 62-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{avanzini_et_al:LIPIcs.STACS.2015.62, author = {Avanzini, Martin and Dal Lago, Ugo}, title = {{On Sharing, Memoization, and Polynomial Time}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {62--75}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.62}, URN = {urn:nbn:de:0030-drops-49042}, doi = {10.4230/LIPIcs.STACS.2015.62}, annote = {Keywords: implicit computational complexity, data-tiering, polynomial time} }
Olaf Beyersdorff, Leroy Chew, and Mikolás Janota. Proof Complexity of Resolution-based QBF Calculi. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 76-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{beyersdorff_et_al:LIPIcs.STACS.2015.76, author = {Beyersdorff, Olaf and Chew, Leroy and Janota, Mikol\'{a}s}, title = {{Proof Complexity of Resolution-based QBF Calculi}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {76--89}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.76}, URN = {urn:nbn:de:0030-drops-49057}, doi = {10.4230/LIPIcs.STACS.2015.76}, annote = {Keywords: proof complexity, QBF, lower bound techniques, separations} }
Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger. Welfare Maximization with Friends-of-Friends Network Externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 90-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bhattacharya_et_al:LIPIcs.STACS.2015.90, author = {Bhattacharya, Sayan and Dvor\'{a}k, Wolfgang and Henzinger, Monika and Starnberger, Martin}, title = {{Welfare Maximization with Friends-of-Friends Network Externalities}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {90--102}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.90}, URN = {urn:nbn:de:0030-drops-49066}, doi = {10.4230/LIPIcs.STACS.2015.90}, annote = {Keywords: network externalities, welfare maximization, approximation algorithms} }
Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino. Markov Decision Processes and Stochastic Games with Total Effective Payoff. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 103-115, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{boros_et_al:LIPIcs.STACS.2015.103, author = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa}, title = {{Markov Decision Processes and Stochastic Games with Total Effective Payoff}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {103--115}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.103}, URN = {urn:nbn:de:0030-drops-49074}, doi = {10.4230/LIPIcs.STACS.2015.103}, annote = {Keywords: Markov decision processes, undiscounted stochastic games, linear programming, mean payoff, total payoff} }
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, and Jesper W. Mikkelsen. Advice Complexity for a Class of Online Problems. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 116-129, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{boyar_et_al:LIPIcs.STACS.2015.116, author = {Boyar, Joan and Favrholdt, Lene M. and Kudahl, Christian and Mikkelsen, Jesper W.}, title = {{Advice Complexity for a Class of Online Problems}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {116--129}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.116}, URN = {urn:nbn:de:0030-drops-49086}, doi = {10.4230/LIPIcs.STACS.2015.116}, annote = {Keywords: online algorithms, advice complexity, asymmetric string guessing, advice complexity class AOC, covering designs} }
Vasco Brattka, Guido Gherardi, and Rupert Hölzl. Las Vegas Computability and Algorithmic Randomness. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 130-142, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{brattka_et_al:LIPIcs.STACS.2015.130, author = {Brattka, Vasco and Gherardi, Guido and H\"{o}lzl, Rupert}, title = {{Las Vegas Computability and Algorithmic Randomness}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {130--142}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.130}, URN = {urn:nbn:de:0030-drops-49093}, doi = {10.4230/LIPIcs.STACS.2015.130}, annote = {Keywords: Weihrauch degrees, weak weak K\"{o}nig's lemma, Las Vegas computability, algorithmic randomness, Nash equilibria} }
Johann Brault-Baron, Florent Capelli, and Stefan Mengel. Understanding Model Counting for beta-acyclic CNF-formulas. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 143-156, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{braultbaron_et_al:LIPIcs.STACS.2015.143, author = {Brault-Baron, Johann and Capelli, Florent and Mengel, Stefan}, title = {{Understanding Model Counting for beta-acyclic CNF-formulas}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {143--156}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.143}, URN = {urn:nbn:de:0030-drops-49106}, doi = {10.4230/LIPIcs.STACS.2015.143}, annote = {Keywords: model counting, hypergraph acyclicity, structural tractability} }
Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen. Parameterized Complexity Dichotomy for Steiner Multicut. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 157-170, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bringmann_et_al:LIPIcs.STACS.2015.157, author = {Bringmann, Karl and Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan}, title = {{Parameterized Complexity Dichotomy for Steiner Multicut}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {157--170}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.157}, URN = {urn:nbn:de:0030-drops-49115}, doi = {10.4230/LIPIcs.STACS.2015.157}, annote = {Keywords: graph cut problems, Steiner cut, fixed-parameter tractability} }
Tobias Brunsch, Anna Großwendt, and Heiko Röglin. Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 171-183, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{brunsch_et_al:LIPIcs.STACS.2015.171, author = {Brunsch, Tobias and Gro{\ss}wendt, Anna and R\"{o}glin, Heiko}, title = {{Solving Totally Unimodular LPs with the Shadow Vertex Algorithm}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {171--183}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.171}, URN = {urn:nbn:de:0030-drops-49125}, doi = {10.4230/LIPIcs.STACS.2015.171}, annote = {Keywords: linear optimization, simplex algorithm, shadow vertex method} }
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, and Saurabh Ray. Improved Local Search for Geometric Hitting Set. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 184-196, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bus_et_al:LIPIcs.STACS.2015.184, author = {Bus, Norbert and Garg, Shashwat and Mustafa, Nabil H. and Ray, Saurabh}, title = {{Improved Local Search for Geometric Hitting Set}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {184--196}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.184}, URN = {urn:nbn:de:0030-drops-49135}, doi = {10.4230/LIPIcs.STACS.2015.184}, annote = {Keywords: hitting sets, Delaunay triangulation, local search, disks, geometric algorithms} }
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein. Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 197-210, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{cardinal_et_al:LIPIcs.STACS.2015.197, author = {Cardinal, Jean and Hoffmann, Michael and Kusters, Vincent and T\'{o}th, Csaba D. and Wettstein, Manuel}, title = {{Arc Diagrams, Flip Distances, and Hamiltonian Triangulations}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {197--210}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.197}, URN = {urn:nbn:de:0030-drops-49141}, doi = {10.4230/LIPIcs.STACS.2015.197}, annote = {Keywords: graph embeddings, edge flips, flip graph, separating triangles} }
Pablo Castro, Cecilia Kilmurray, and Nir Piterman. Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 211-223, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{castro_et_al:LIPIcs.STACS.2015.211, author = {Castro, Pablo and Kilmurray, Cecilia and Piterman, Nir}, title = {{Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {211--223}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.211}, URN = {urn:nbn:de:0030-drops-49155}, doi = {10.4230/LIPIcs.STACS.2015.211}, annote = {Keywords: mu-calculus, probabilistic logics, model checking, game semantics} }
Arkadev Chattopadhyay and Sagnik Mukhopadhyay. Tribes Is Hard in the Message Passing Model. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 224-237, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{chattopadhyay_et_al:LIPIcs.STACS.2015.224, author = {Chattopadhyay, Arkadev and Mukhopadhyay, Sagnik}, title = {{Tribes Is Hard in the Message Passing Model}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {224--237}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.224}, URN = {urn:nbn:de:0030-drops-49162}, doi = {10.4230/LIPIcs.STACS.2015.224}, annote = {Keywords: communication complexity, Tribes, information complexity, direct-sum} }
Markus Chimani and Joachim Spoerhase. Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 238-248, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{chimani_et_al:LIPIcs.STACS.2015.238, author = {Chimani, Markus and Spoerhase, Joachim}, title = {{Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {238--248}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.238}, URN = {urn:nbn:de:0030-drops-49170}, doi = {10.4230/LIPIcs.STACS.2015.238}, annote = {Keywords: network design, approximation algorithm, shallow-light spanning trees, spanners} }
Thomas Colcombet and Amaldev Manuel. Combinatorial Expressions and Lower Bounds. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 249-261, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{colcombet_et_al:LIPIcs.STACS.2015.249, author = {Colcombet, Thomas and Manuel, Amaldev}, title = {{Combinatorial Expressions and Lower Bounds}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {249--261}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.249}, URN = {urn:nbn:de:0030-drops-49181}, doi = {10.4230/LIPIcs.STACS.2015.249}, annote = {Keywords: expressions, lower bound, indefinability} }
Martin Delacourt and Benjamin Hellouin de Ménibus. Construction of mu-Limit Sets of Two-dimensional Cellular Automata. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 262-274, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{delacourt_et_al:LIPIcs.STACS.2015.262, author = {Delacourt, Martin and Hellouin de M\'{e}nibus, Benjamin}, title = {{Construction of mu-Limit Sets of Two-dimensional Cellular Automata}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {262--274}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.262}, URN = {urn:nbn:de:0030-drops-49197}, doi = {10.4230/LIPIcs.STACS.2015.262}, annote = {Keywords: cellular automata, dynamical systems, mu-limit sets, subshifts, measures} }
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, and Girish Varma. Derandomized Graph Product Results Using the Low Degree Long Code. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 275-287, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dinur_et_al:LIPIcs.STACS.2015.275, author = {Dinur, Irit and Harsha, Prahladh and Srinivasan, Srikanth and Varma, Girish}, title = {{Derandomized Graph Product Results Using the Low Degree Long Code}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {275--287}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.275}, URN = {urn:nbn:de:0030-drops-49200}, doi = {10.4230/LIPIcs.STACS.2015.275}, annote = {Keywords: graph product, derandomization, low degree long code, graph coloring} }
Amr Elmasry, Torben Hagerup, and Frank Kammer. Space-efficient Basic Graph Algorithms. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 288-301, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{elmasry_et_al:LIPIcs.STACS.2015.288, author = {Elmasry, Amr and Hagerup, Torben and Kammer, Frank}, title = {{Space-efficient Basic Graph Algorithms}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {288--301}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.288}, URN = {urn:nbn:de:0030-drops-49217}, doi = {10.4230/LIPIcs.STACS.2015.288}, annote = {Keywords: graph algorithms, depth-first search, single-source shortest paths, register input model} }
Henning Fernau, Florin Manea, Robert Mercas, and Markus L. Schmid. Pattern Matching with Variables: Fast Algorithms and New Hardness Results. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 302-315, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{fernau_et_al:LIPIcs.STACS.2015.302, author = {Fernau, Henning and Manea, Florin and Mercas, Robert and Schmid, Markus L.}, title = {{Pattern Matching with Variables: Fast Algorithms and New Hardness Results}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {302--315}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.302}, URN = {urn:nbn:de:0030-drops-49220}, doi = {10.4230/LIPIcs.STACS.2015.302}, annote = {Keywords: combinatorial pattern matching, combinatorics on words, patterns with variables, \$\{cal NP\}\$-complete string problems} }
Takuro Fukunaga. Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 316-328, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{fukunaga:LIPIcs.STACS.2015.316, author = {Fukunaga, Takuro}, title = {{Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {316--328}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.316}, URN = {urn:nbn:de:0030-drops-49236}, doi = {10.4230/LIPIcs.STACS.2015.316}, annote = {Keywords: survivable network design, multiflow, LP rounding} }
Esther Galby, Joël Ouaknine, and James Worrell. On Matrix Powering in Low Dimensions. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 329-340, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{galby_et_al:LIPIcs.STACS.2015.329, author = {Galby, Esther and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On Matrix Powering in Low Dimensions}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {329--340}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.329}, URN = {urn:nbn:de:0030-drops-49240}, doi = {10.4230/LIPIcs.STACS.2015.329}, annote = {Keywords: matrix powering, complexity, Baker's theorem} }
Bernd Gärtner and Antonis Thomas. The Complexity of Recognizing Unique Sink Orientations. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 341-353, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{gartner_et_al:LIPIcs.STACS.2015.341, author = {G\"{a}rtner, Bernd and Thomas, Antonis}, title = {{The Complexity of Recognizing Unique Sink Orientations}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {341--353}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.341}, URN = {urn:nbn:de:0030-drops-49252}, doi = {10.4230/LIPIcs.STACS.2015.341}, annote = {Keywords: complexity, recognizing, unique sink orientations, coNP, PSPACE} }
Archontia C. Giannopoulou and George B. Mertzios. New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 354-366, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{giannopoulou_et_al:LIPIcs.STACS.2015.354, author = {Giannopoulou, Archontia C. and Mertzios, George B.}, title = {{New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {354--366}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.354}, URN = {urn:nbn:de:0030-drops-49268}, doi = {10.4230/LIPIcs.STACS.2015.354}, annote = {Keywords: tolerance graphs, multitolerance graphs, geometric representation, dominating set problem, polynomial time algorithm, APX-hard} }
Anaël Grandjean and Victor Poupet. Comparing 1D and 2D Real Time on Cellular Automata. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 367-378, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{grandjean_et_al:LIPIcs.STACS.2015.367, author = {Grandjean, Ana\"{e}l and Poupet, Victor}, title = {{Comparing 1D and 2D Real Time on Cellular Automata}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {367--378}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.367}, URN = {urn:nbn:de:0030-drops-49275}, doi = {10.4230/LIPIcs.STACS.2015.367}, annote = {Keywords: Cellular automata, real time, language recognition} }
Dima Grigoriev and Vladimir V. Podolskii. Tropical Effective Primary and Dual Nullstellens"atze. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 379-391, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{grigoriev_et_al:LIPIcs.STACS.2015.379, author = {Grigoriev, Dima and Podolskii, Vladimir V.}, title = {{Tropical Effective Primary and Dual Nullstellens"atze}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {379--391}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.379}, URN = {urn:nbn:de:0030-drops-49286}, doi = {10.4230/LIPIcs.STACS.2015.379}, annote = {Keywords: tropical algebra, tropical geometry, Nullstellensatz} }
Jan Hazla and Thomas Holenstein. Upper Tail Estimates with Combinatorial Proofs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 392-405, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hazla_et_al:LIPIcs.STACS.2015.392, author = {Hazla, Jan and Holenstein, Thomas}, title = {{Upper Tail Estimates with Combinatorial Proofs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {392--405}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.392}, URN = {urn:nbn:de:0030-drops-49291}, doi = {10.4230/LIPIcs.STACS.2015.392}, annote = {Keywords: concentration bounds, expander random walks, polynomial concentration} }
Andrew V. Goldberg, Haim Kaplan, Sagi Hed, and Robert E. Tarjan. Minimum Cost Flows in Graphs with Unit Capacities. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 406-419, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{goldberg_et_al:LIPIcs.STACS.2015.406, author = {Goldberg, Andrew V. and Kaplan, Haim and Hed, Sagi and Tarjan, Robert E.}, title = {{Minimum Cost Flows in Graphs with Unit Capacities}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {406--419}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.406}, URN = {urn:nbn:de:0030-drops-49304}, doi = {10.4230/LIPIcs.STACS.2015.406}, annote = {Keywords: minimum cost flow, bipartite matching, unit capacity, cost scaling} }
Rupert Hölzl, Sanjay Jain, and Frank Stephan. Inductive Inference and Reverse Mathematics. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 420-433, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{holzl_et_al:LIPIcs.STACS.2015.420, author = {H\"{o}lzl, Rupert and Jain, Sanjay and Stephan, Frank}, title = {{Inductive Inference and Reverse Mathematics}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {420--433}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.420}, URN = {urn:nbn:de:0030-drops-49324}, doi = {10.4230/LIPIcs.STACS.2015.420}, annote = {Keywords: reverse mathematics, recursion theory, inductive inference, learning from positive data} }
Jacob Holm and Eva Rotenberg. Dynamic Planar Embeddings of Dynamic Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 434-446, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{holm_et_al:LIPIcs.STACS.2015.434, author = {Holm, Jacob and Rotenberg, Eva}, title = {{Dynamic Planar Embeddings of Dynamic Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {434--446}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.434}, URN = {urn:nbn:de:0030-drops-49319}, doi = {10.4230/LIPIcs.STACS.2015.434}, annote = {Keywords: dynamic graphs, planar embeddings, data structures} }
Mathieu Hoyrup and Cristóbal Rojas. On the Information Carried by Programs about the Objects They Compute. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 447-459, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hoyrup_et_al:LIPIcs.STACS.2015.447, author = {Hoyrup, Mathieu and Rojas, Crist\'{o}bal}, title = {{On the Information Carried by Programs about the Objects They Compute}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {447--459}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.447}, URN = {urn:nbn:de:0030-drops-49337}, doi = {10.4230/LIPIcs.STACS.2015.447}, annote = {Keywords: Markov-computable, representation, Kolmogorov complexity, Ershov topology} }
Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, and Qin Zhang. Communication Complexity of Approximate Matching in Distributed Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 460-473, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{huang_et_al:LIPIcs.STACS.2015.460, author = {Huang, Zengfeng and Radunovic, Bozidar and Vojnovic, Milan and Zhang, Qin}, title = {{Communication Complexity of Approximate Matching in Distributed Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {460--473}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.460}, URN = {urn:nbn:de:0030-drops-49348}, doi = {10.4230/LIPIcs.STACS.2015.460}, annote = {Keywords: approximate maximum matching, distributed computation, communication complexity} }
Sungjin Im, Benjamin Moseley, and Kirk Pruhs. Stochastic Scheduling of Heavy-tailed Jobs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 474-486, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{im_et_al:LIPIcs.STACS.2015.474, author = {Im, Sungjin and Moseley, Benjamin and Pruhs, Kirk}, title = {{Stochastic Scheduling of Heavy-tailed Jobs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {474--486}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.474}, URN = {urn:nbn:de:0030-drops-49359}, doi = {10.4230/LIPIcs.STACS.2015.474}, annote = {Keywords: stochastic scheduling, completion time, approximation} }
Jesper Jansson, Zhaoxian Li, and Wing-Kin Sung. On Finding the Adams Consensus Tree. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 487-499, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{jansson_et_al:LIPIcs.STACS.2015.487, author = {Jansson, Jesper and Li, Zhaoxian and Sung, Wing-Kin}, title = {{On Finding the Adams Consensus Tree}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {487--499}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.487}, URN = {urn:nbn:de:0030-drops-49364}, doi = {10.4230/LIPIcs.STACS.2015.487}, annote = {Keywords: phylogenetic tree, Adams consensus, centroid path, wavelet tree} }
Iyad Kanj and Ge Xia. Flip Distance Is in FPT Time O(n+ k * c^k). In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 500-512, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kanj_et_al:LIPIcs.STACS.2015.500, author = {Kanj, Iyad and Xia, Ge}, title = {{Flip Distance Is in FPT Time O(n+ k * c^k)}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {500--512}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.500}, URN = {urn:nbn:de:0030-drops-49371}, doi = {10.4230/LIPIcs.STACS.2015.500}, annote = {Keywords: triangulations, flip distance, parameterized algorithms} }
Telikepalli Kavitha. New Pairwise Spanners. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 513-526, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kavitha:LIPIcs.STACS.2015.513, author = {Kavitha, Telikepalli}, title = {{New Pairwise Spanners}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {513--526}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.513}, URN = {urn:nbn:de:0030-drops-49381}, doi = {10.4230/LIPIcs.STACS.2015.513}, annote = {Keywords: undirected graphs, spanners, approximate distances, additive stretch} }
Neeraj Kayal and Chandan Saha. Multi-k-ic Depth Three Circuit Lower Bound. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 527-539, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kayal_et_al:LIPIcs.STACS.2015.527, author = {Kayal, Neeraj and Saha, Chandan}, title = {{Multi-k-ic Depth Three Circuit Lower Bound}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {527--539}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.527}, URN = {urn:nbn:de:0030-drops-49395}, doi = {10.4230/LIPIcs.STACS.2015.527}, annote = {Keywords: arithmetic circuits, multilinear circuits, depth three circuits, lower bound, individual degree} }
Pavel Klavík and Peter Zeman. Automorphism Groups of Geometrically Represented Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 540-553, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{klavik_et_al:LIPIcs.STACS.2015.540, author = {Klav{\'\i}k, Pavel and Zeman, Peter}, title = {{Automorphism Groups of Geometrically Represented Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {540--553}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.540}, URN = {urn:nbn:de:0030-drops-49408}, doi = {10.4230/LIPIcs.STACS.2015.540}, annote = {Keywords: automorphism group, geometric intersection graph, interval graph, circle graph} }
Philip N. Klein, Claire Mathieu, and Hang Zhou. Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 554-567, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{klein_et_al:LIPIcs.STACS.2015.554, author = {Klein, Philip N. and Mathieu, Claire and Zhou, Hang}, title = {{Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {554--567}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.554}, URN = {urn:nbn:de:0030-drops-49411}, doi = {10.4230/LIPIcs.STACS.2015.554}, annote = {Keywords: correlation clustering, two-edge-connected augmentation, polynomial-time approximation scheme, planar graphs} }
Stavros G. Kolliopoulos and Yannis Moysoglou. Extended Formulation Lower Bounds via Hypergraph Coloring?. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 568-581, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kolliopoulos_et_al:LIPIcs.STACS.2015.568, author = {Kolliopoulos, Stavros G. and Moysoglou, Yannis}, title = {{Extended Formulation Lower Bounds via Hypergraph Coloring?}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {568--581}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.568}, URN = {urn:nbn:de:0030-drops-49429}, doi = {10.4230/LIPIcs.STACS.2015.568}, annote = {Keywords: linear programming, extended formulations, inapproximability, facility location} }
Dmitry Kosolobov. Lempel-Ziv Factorization May Be Harder Than Computing All Runs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 582-593, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kosolobov:LIPIcs.STACS.2015.582, author = {Kosolobov, Dmitry}, title = {{Lempel-Ziv Factorization May Be Harder Than Computing All Runs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {582--593}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.582}, URN = {urn:nbn:de:0030-drops-49438}, doi = {10.4230/LIPIcs.STACS.2015.582}, annote = {Keywords: Lempel-Ziv factorization, runs, repetitions, decision tree, lower bounds} }
Andreas Krebs, Klaus-Jörn Lange, and Michael Ludwig. Visibly Counter Languages and Constant Depth Circuits. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 594-607, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{krebs_et_al:LIPIcs.STACS.2015.594, author = {Krebs, Andreas and Lange, Klaus-J\"{o}rn and Ludwig, Michael}, title = {{Visibly Counter Languages and Constant Depth Circuits}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {594--607}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.594}, URN = {urn:nbn:de:0030-drops-49447}, doi = {10.4230/LIPIcs.STACS.2015.594}, annote = {Keywords: visibly counter automata, constant depth circuits, AC0, FO\lbrack+\rbrack} }
Jakub Lacki and Piotr Sankowski. Optimal Decremental Connectivity in Planar Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 608-621, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{lacki_et_al:LIPIcs.STACS.2015.608, author = {Lacki, Jakub and Sankowski, Piotr}, title = {{Optimal Decremental Connectivity in Planar Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {608--621}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.608}, URN = {urn:nbn:de:0030-drops-49457}, doi = {10.4230/LIPIcs.STACS.2015.608}, annote = {Keywords: decremental connectivity, planar graphs, dynamic connectivity, algorithms} }
Angsheng Li and Pan Peng. Testing Small Set Expansion in General Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 622-635, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{li_et_al:LIPIcs.STACS.2015.622, author = {Li, Angsheng and Peng, Pan}, title = {{Testing Small Set Expansion in General Graphs}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {622--635}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.622}, URN = {urn:nbn:de:0030-drops-49461}, doi = {10.4230/LIPIcs.STACS.2015.622}, annote = {Keywords: graph property testing, small set expansion, random walks, spectral graph theory} }
Alejandro López-Ortiz, Marc P. Renault, and Adi Rosén. Paid Exchanges are Worth the Price. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 636-648, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{lopezortiz_et_al:LIPIcs.STACS.2015.636, author = {L\'{o}pez-Ortiz, Alejandro and Renault, Marc P. and Ros\'{e}n, Adi}, title = {{Paid Exchanges are Worth the Price}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {636--648}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.636}, URN = {urn:nbn:de:0030-drops-49476}, doi = {10.4230/LIPIcs.STACS.2015.636}, annote = {Keywords: list update problem, online computation, online algorithms, competitive analysis, lower bounds} }
Turlough Neary. Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 649-661, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{neary:LIPIcs.STACS.2015.649, author = {Neary, Turlough}, title = {{Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {649--661}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.649}, URN = {urn:nbn:de:0030-drops-49486}, doi = {10.4230/LIPIcs.STACS.2015.649}, annote = {Keywords: tag system, Post correspondence problem, undecidability} }
Thomas Place and Marc Zeitoun. Separation and the Successor Relation. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 662-675, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{place_et_al:LIPIcs.STACS.2015.662, author = {Place, Thomas and Zeitoun, Marc}, title = {{Separation and the Successor Relation}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {662--675}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.662}, URN = {urn:nbn:de:0030-drops-49499}, doi = {10.4230/LIPIcs.STACS.2015.662}, annote = {Keywords: separation problem, regular word languages, logics, decidable characterizations, semidirect product} }
Andreas Schmid and Jens M. Schmidt. Computing 2-Walks in Polynomial Time. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 676-688, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{schmid_et_al:LIPIcs.STACS.2015.676, author = {Schmid, Andreas and Schmidt, Jens M.}, title = {{Computing 2-Walks in Polynomial Time}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {676--688}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.676}, URN = {urn:nbn:de:0030-drops-49502}, doi = {10.4230/LIPIcs.STACS.2015.676}, annote = {Keywords: algorithms and data structures, 2-walks, 3-connected planar graphs, Tutte paths, 3-trees} }
Pascal Schweitzer. Towards an Isomorphism Dichotomy for Hereditary Graph Classes. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 689-702, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{schweitzer:LIPIcs.STACS.2015.689, author = {Schweitzer, Pascal}, title = {{Towards an Isomorphism Dichotomy for Hereditary Graph Classes}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {689--702}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.689}, URN = {urn:nbn:de:0030-drops-49513}, doi = {10.4230/LIPIcs.STACS.2015.689}, annote = {Keywords: graph isomorphism, modular decomposition, bounded color valence, reductions, forbidden induced subgraphs} }
Till Tantau. Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 703-715, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{tantau:LIPIcs.STACS.2015.703, author = {Tantau, Till}, title = {{Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {703--715}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.703}, URN = {urn:nbn:de:0030-drops-49524}, doi = {10.4230/LIPIcs.STACS.2015.703}, annote = {Keywords: existential second-order logic, descriptive complexity, logarithmic space} }
Shai Vardi. The Returning Secretary. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 716-729, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{vardi:LIPIcs.STACS.2015.716, author = {Vardi, Shai}, title = {{The Returning Secretary}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {716--729}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.716}, URN = {urn:nbn:de:0030-drops-49539}, doi = {10.4230/LIPIcs.STACS.2015.716}, annote = {Keywords: online algorithms, secretary problem, matroid secretary} }
Marcin Wrochna. Homomorphism Reconfiguration via Homotopy. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 730-742, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{wrochna:LIPIcs.STACS.2015.730, author = {Wrochna, Marcin}, title = {{Homomorphism Reconfiguration via Homotopy}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {730--742}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.730}, URN = {urn:nbn:de:0030-drops-49546}, doi = {10.4230/LIPIcs.STACS.2015.730}, annote = {Keywords: reconfiguration, recoloring, homomorphisms, homotopy, hom complex} }
Georg Zetzsche. Computing Downward Closures for Stacked Counter Automata. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 743-756, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{zetzsche:LIPIcs.STACS.2015.743, author = {Zetzsche, Georg}, title = {{Computing Downward Closures for Stacked Counter Automata}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {743--756}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.743}, URN = {urn:nbn:de:0030-drops-49554}, doi = {10.4230/LIPIcs.STACS.2015.743}, annote = {Keywords: abstraction, downward closure, obstruction set, computability} }
Feedback for Dagstuhl Publishing