Table of Contents

• Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer ScienceSusanne Albers, Pascal Weil. [doi]
• Preface - 25th International Symposium on Theoretical Aspects of Computer ScienceSusanne Albers, Pascal Weil. 1-6 [doi]
• Understanding Maximal Repetitions in StringsMaxime Crochemore, Lucian Ilie. 11-16 [doi]
• A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract)Thomas Schwentick. 17-18 [doi]
• Equilibria, Fixed Points, and Complexity ClassesMihalis Yannakakis. 19-38 [doi]
• Pushdown CompressionPilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel. 39-48 [doi]
• Quantum search with variable timesAndris Ambainis. 49-61 [doi]
• Structural aspects of tilingsAlexis Ballier, Bruno Durand, Emmanuel Jeandel. 61-72 [doi]
• Limit complexities revisitedLaurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin. 73-84 [doi]
• Trimmed Moebius Inversion and Graphs of Bounded DegreeAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. 85-96 [doi]
• On the Complexity of the Interlace PolynomialMarkus Bläser, Christian Hoffmann. 97-108 [doi]
• Minimizing Flow Time in the Wireless Gathering ProblemVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela. 109-120 [doi]
• On Termination for Faulty Channel MachinesPatricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell. 121-132 [doi]
• Stackelberg Network Pricing GamesPatrick Briest, Martin Hoefer, Piotr Krysta. 133-142 [doi]
• Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower BoundJoshua Brody, Amit Chakrabarti. 145-156 [doi]
• Finding Irrefutable Certificates for S::2:::::p::: via Arthur and MerlinVenkatesan T. Chakaravarthy, Sambuddha Roy. 157-168 [doi]
• Quantifying Homology ClassesChao Chen, Daniel Freedman. 169-180 [doi]
• Shortest Vertex-Disjoint Two-Face Paths in Planar GraphsÉric Colin de Verdière, Alexander Schrijver. 181-192 [doi]
• Geodesic Fréchet Distance Inside a Simple PolygonAtlas F. Cook, Carola Wenk. 193-204 [doi]
• Improved Algorithms for the Range Next Value Problem and ApplicationsMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen. 205-216 [doi]
• Connecting Polygonizations via Stretches and TwangsMirela Damian, Robin Y. Flatland, Joseph O Rourke, Suneeta Ramaswami. 217-228 [doi]
• Deterministically Isolating a Perfect Matching in Bipartite Planar GraphsSamir Datta, Raghav Kulkarni, Sambuddha Roy. 229-240 [doi]
• Tight Bounds for Blind Search on the IntegersMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel. 241-252 [doi]
• Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermapsJean-François Dufourd. 253-264 [doi]
• Trimming of Graphs, with Application to Point LabelingThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff. 265-276 [doi]
• Computing Minimum Spanning Trees with UncertaintyMichael Hoffmann 0002, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman. 277-288 [doi]
• Convergence Thresholds of Newton s Method for Monotone Polynomial EquationsJavier Esparza, Stefan Kiefer, Michael Luttenberger. 289-300 [doi]
• Model Checking Games for the Quantitative µ-CalculusDiana Fischer, Erich Grädel, Lukasz Kaiser. 301-312 [doi]
• Order-Invariant MSO is Stronger than Counting MSO in the FiniteTobias Ganzow, Sasha Rubin. 313-324 [doi]
• Succinctness of the Complement and Intersection of Regular ExpressionsWouter Gelade, Frank Neven. 325-336 [doi]
• Efficient Algorithms for Membership in Boolean Hierarchies of Regular LanguagesChristian Glasser, Heinz Schmitz, Victor L. Selivanov. 337-348 [doi]
• On the Complexity of Elementary Modal LogicsEdith Hemaspaandra, Henning Schnoor. 349-360 [doi]
• Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible SupertreesViet Tung Hoang, Wing-Kin Sung. 361-372 [doi]
• Complexity of solutions of equations over sets of natural numbersAlexander Okhotin, Artur Jez. 373-384 [doi]
• Cardinality and counting quantifiers on omega-automatic structuresLukasz Kaiser, Sasha Rubin, Vince Bárány. 385-396 [doi]
• On the Induced Matching ProblemIyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer. 397-408 [doi]
• On Geometric Spanners of Euclidean and Unit Disk GraphsIyad A. Kanj, Ljubomir Perkovic. 409-420 [doi]
• The Frobenius Problem in a Free MonoidJui-Yi Kao, Jeffrey Shallit, Zhi Xu. 421-432 [doi]
• Space Hierarchy Results for Randomized ModelsJeff Kinne, Dieter van Melkebeek. 433-444 [doi]
• Ehrenfeucht-Fraïssé Goes Automatic for Real AdditionFelix Klaedtke. 445-456 [doi]
• New Combinatorial Complete One-Way FunctionsArist Kojevnikov, Sergey I. Nikolenko. 457-466 [doi]
• Compatibility of Shelah and Stupp s and Muchnik s iteration with fragments of monadic second order logicDietrich Kuske. 467-478 [doi]
• Geometric Set Cover and Hitting Sets for Polytopes in R³Sören Laue. 479-490 [doi]
• A Theory for Valiant s Matchcircuits (Extended Abstract)Angsheng Li, Mingji Xia. 491-502 [doi]
• Rent, Lease or Buy: Randomized Algorithms for Multislope Ski RentalZvi Lotker, Boaz Patt-Shamir, Dror Rawitz. 503-514 [doi]
• Lower bounds for adaptive linearity testsShachar Lovett. 515-526 [doi]
• An Improved Randomized Truthful Mechanism for Scheduling Unrelated MachinesPinyan Lu, Changyuan Yu. 527-538 [doi]
• Lagrangian Relaxation and Partial Cover (Extended Abstract)Julián Mestre. 539-550 [doi]
• On Dynamic Breadth-First Search in External-MemoryUlrich Meyer. 551-560 [doi]
• Analytic aspects of the shuffle productMarni Mishna, Mike Zabrocki. 561-572 [doi]
• Weak index versus Borel rankFilip Murlak. 573-584 [doi]
• A Mahler s theorem for functions from words to integersJean-Eric Pin, Pedro V. Silva. 585-596 [doi]
• Distinguishing Short Quantum ComputationsBill Rosgen. 597-608 [doi]
• Factoring Polynomials over Finite Fields using Balance TestChandan Saha. 609-620 [doi]
• On the decomposition of k-valued rational relationsJacques Sakarovitch, Rodrigo de Souza. 621-632 [doi]
• The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous LogspaceThomas Thierauf, Fabian Wagner. 633-644 [doi]
• Efficient Minimization of DFAs with Partial TransitionAntti Valmari, Petri Lehtinen. 645-656 [doi]
• Design by Measure and Conquer, A Faster Exact Algorithm for Dominating SetJohan M. M. van Rooij, Hans L. Bodlaender. 657-668 [doi]
• Weighted Matching in the Semi-Streaming ModelMariano Zelke. 669-680 [doi]