default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd STACS 2015: Garching, Germany
- Ernst W. Mayr, Nicolas Ollinger:
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. LIPIcs 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-78-1 - Ernst W. Mayr, Nicolas Ollinger:
Front Matter, Table of Contents, Preface, Conference Organization. - Sanjeev Arora:
Overcoming Intractability in Unsupervised Learning (Invited Talk). 1-1 - Manuel Bodirsky
:
The Complexity of Constraint Satisfaction Problems (Invited Talk). 2-9 - Peter Sanders:
Parallel Algorithms Reconsidered (Invited Talk). 10-18 - Felix Brandt:
Computational Social Choice (Tutorial). 19-19 - Paul W. Goldberg:
Algorithmic Game Theory (Tutorial). 20-20 - Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. 21-33 - Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Graph Searching Games and Width Measures for Directed Graphs. 34-47 - Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Subset Sum in the Absence of Concentration. 48-61 - Martin Avanzini, Ugo Dal Lago:
On Sharing, Memoization, and Polynomial Time. 62-75 - Olaf Beyersdorff, Leroy Chew, Mikolás Janota:
Proof Complexity of Resolution-based QBF Calculi. 76-89 - Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger:
Welfare Maximization with Friends-of-Friends Network Externalities. 90-102 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Markov Decision Processes and Stochastic Games with Total Effective Payoff. 103-115 - Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Advice Complexity for a Class of Online Problems. 116-129 - Vasco Brattka, Guido Gherardi, Rupert Hölzl:
Las Vegas Computability and Algorithmic Randomness. 130-142 - Johann Brault-Baron, Florent Capelli, Stefan Mengel:
Understanding Model Counting for beta-acyclic CNF-formulas. 143-156 - Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. 157-170 - Tobias Brunsch, Anna Großwendt, Heiko Röglin:
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. 171-183 - Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Improved Local Search for Geometric Hitting Set. 184-196 - Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. 197-210 - Pablo F. Castro, Cecilia Kilmurray, Nir Piterman:
Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics. 211-223 - Arkadev Chattopadhyay, Sagnik Mukhopadhyay:
Tribes Is Hard in the Message Passing Model. 224-237 - Markus Chimani, Joachim Spoerhase:
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. 238-248 - Thomas Colcombet, Amaldev Manuel:
Combinatorial Expressions and Lower Bounds. 249-261 - Martin Delacourt, Benjamin Hellouin de Menibus:
Construction of mu-Limit Sets of Two-dimensional Cellular Automata. 262-274 - Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma:
Derandomized Graph Product Results Using the Low Degree Long Code. 275-287 - Amr Elmasry, Torben Hagerup, Frank Kammer:
Space-efficient Basic Graph Algorithms. 288-301 - Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. 302-315 - Takuro Fukunaga:
Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation. 316-328 - Esther Galby, Joël Ouaknine, James Worrell:
On Matrix Powering in Low Dimensions. 329-340 - Bernd Gärtner, Antonis Thomas:
The Complexity of Recognizing Unique Sink Orientations. 341-353 - Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. 354-366 - Anaël Grandjean, Victor Poupet:
Comparing 1D and 2D Real Time on Cellular Automata. 367-378 - Dima Grigoriev, Vladimir V. Podolskii:
Tropical Effective Primary and Dual Nullstellens"atze. 379-391 - Jan Hazla, Thomas Holenstein:
Upper Tail Estimates with Combinatorial Proofs. 392-405 - Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan:
Minimum Cost Flows in Graphs with Unit Capacities. 406-419 - Rupert Hölzl, Sanjay Jain, Frank Stephan:
Inductive Inference and Reverse Mathematics. 420-433 - Jacob Holm, Eva Rotenberg:
Dynamic Planar Embeddings of Dynamic Graphs. 434-446 - Mathieu Hoyrup, Cristobal Rojas:
On the Information Carried by Programs about the Objects They Compute. 447-459 - Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang:
Communication Complexity of Approximate Matching in Distributed Graphs. 460-473 - Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Stochastic Scheduling of Heavy-tailed Jobs. 474-486 - Jesper Jansson, Zhaoxian Li, Wing-Kin Sung:
On Finding the Adams Consensus Tree. 487-499 - Iyad A. Kanj, Ge Xia:
Flip Distance Is in FPT Time O(n+ k * c^k). 500-512 - Telikepalli Kavitha:
New Pairwise Spanners. 513-526 - Neeraj Kayal, Chandan Saha:
Multi-k-ic Depth Three Circuit Lower Bound. 527-539 - Pavel Klavík, Peter Zeman:
Automorphism Groups of Geometrically Represented Graphs. 540-553 - Philip N. Klein, Claire Mathieu, Hang Zhou:
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs. 554-567 - Stavros G. Kolliopoulos, Yannis Moysoglou:
Extended Formulation Lower Bounds via Hypergraph Coloring?. 568-581 - Dmitry Kosolobov:
Lempel-Ziv Factorization May Be Harder Than Computing All Runs. 582-593 - Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and Constant Depth Circuits. 594-607 - Jakub Lacki, Piotr Sankowski:
Optimal Decremental Connectivity in Planar Graphs. 608-621 - Angsheng Li, Pan Peng:
Testing Small Set Expansion in General Graphs. 622-635 - Alejandro López-Ortiz, Marc P. Renault, Adi Rosén:
Paid Exchanges are Worth the Price. 636-648 - Turlough Neary:
Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words. 649-661 - Thomas Place, Marc Zeitoun:
Separation and the Successor Relation. 662-675 - Andreas Schmid, Jens M. Schmidt:
Computing 2-Walks in Polynomial Time. 676-688 - Pascal Schweitzer:
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. 689-702 - Till Tantau:
Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification. 703-715 - Shai Vardi:
The Returning Secretary. 716-729 - Marcin Wrochna:
Homomorphism Reconfiguration via Homotopy. 730-742 - Georg Zetzsche:
Computing Downward Closures for Stacked Counter Automata. 743-756
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-23 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
