Table of Contents

• Frontmatter, Table of Contents, Preface, Conference OrganizationThomas Schwentick, Christoph Dürr. [doi]
• Algorithms for Dynamic Speed ScalingSusanne Albers. 1-11 [doi]
• Structural Decomposition Methods and What They are Good ForMarkus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen. 12-28 [doi]
• How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational onesHubert Comon-Lundh, Véronique Cortier. 29-44 [doi]
• Local dependency dynamic programming in the presence of memory faultsSaverio Caminiti, Irene Finocchi, Emanuele G. Fusco. 45-56 [doi]
• Tight bounds for rumor spreading in graphs of a given conductanceGeorge Giakkoupis. 57-68 [doi]
• Tight Bounds For Distributed MST VerificationLiah Kor, Amos Korman, David Peleg. 69-80 [doi]
• Automata based verification over linearly ordered data domainsLuc Segoufin, Szymon Torunczyk. 81-92 [doi]
• Bottom-up automata on data trees and vertical XPathDiego Figueira, Luc Segoufin. 93-104 [doi]
• Data MonoidsMikolaj Bojanczyk. 105-116 [doi]
• Minimum s-t cut in undirected planar graphs when the source and the sink are closeHaim Kaplan, Yahav Nussbaum. 117-128 [doi]
• Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-GrowingPetr Kolman, Christian Scheideler. 129-140 [doi]
• Compact Visibility Representation of Plane GraphsJiun-Jie Wang, Xin He. 141-152 [doi]
• Telling convex from reflex allows to map a polygonJérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. 153-164 [doi]
• Cross-Composition: A New Technique for Kernelization Lower BoundsHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch. 165-176 [doi]
• Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined ParameterBart M. P. Jansen, Hans L. Bodlaender. 177-188 [doi]
• Hitting forbidden minors: Approximation and KernelizationFedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh. 189-200 [doi]
• Weakly Unambiguous MorphismsDominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach. 213-224 [doi]
• On Minimal Sturmian Partial WordsFrancine Blanchet-Sadri, John Lensmire. 225-236 [doi]
• Improving PPSZ for 3-SAT using Critical VariablesTimon Hertli, Robin A. Moser, Dominik Scheder. 237-248 [doi]
• The Complexity of Weighted Boolean #CSP Modulo kHeng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia. 249-260 [doi]
• A speed-up of oblivious multi-head finite automata by cellular automataAlex Borelllo, Gaétan Richard, Véronique Terrier. 273-283 [doi]
• Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary PrecisionNazim Fatès. 284-295 [doi]
• Probabilistic cellular automata, invariant measures, and perfect samplingAna Busic, Jean Mairesse, Irene Marcovici. 296-307 [doi]
• Analysis of Agglomerative ClusteringMarcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler. 308-319 [doi]
• Measuring Learning Complexity with Criteria EpitomizersJohn Case, Timo Kötzing. 320-331 [doi]
• On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered DataHoward J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani. 332-343 [doi]
• Unary negationBalder ten Cate, Luc Segoufin. 344-355 [doi]
• First-order Fragments with Successor over Infinite WordsJakub Kallas, Manfred Kufleitner, Alexander Lauser. 356-367 [doi]
• The model checking problem for propositional intuitionistic logic with one variable is AC^1-completeMartin Mundhenk, Felix Weiß. 368-379 [doi]
• A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing TimesAlejandro López-Ortiz, Claude-Guy Quimper. 380-391 [doi]
• Scheduling for Weighted Flow Time and Energy with Rejection PenaltySze-Hang Chan, Tak Wah Lam, Lap-Kei Lee. 392-403 [doi]
• Clique-width: When Hard Does Not Mean ImpossibleRobert Ganian, Petr Hlinený, Jan Obdrzálek. 404-415 [doi]
• From Pathwidth to Connected PathwidthDariusz Dereniowski. 416-427 [doi]
• Polynomial Fitting of Data Streams with Applications to Codeword TestingAndrew McGregor, Atri Rudra, Steve Uurtamo. 428-439 [doi]
• Spectral Sparsification in the Semi-Streaming SettingJonathan A. Kelner, Alex Levin. 440-451 [doi]
• Solovay functions and K-trivialityLaurent Bienvenu, Wolfgang Merkle, André Nies. 452-463 [doi]
• Everywhere complex sequences and the probabilistic methodAndrey Yu. Rumyantsev. 464-471 [doi]
• Online Scheduling with Interval ConflictsMagnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz. 472-483 [doi]
• Analysis of multi-stage open shop processing systemsChristian Eggermont, Alexander Schrijver, Gerhard J. Woeginger. 484-494 [doi]
• Graphs Encoded by Regular ExpressionsStefan Gulan. 495-506 [doi]
• Extended Regular Expressions: Succinctness and DecidabilityDominik D. Freydenberger. 507-518 [doi]
• New Exact and Approximation Algorithms for the Star Packing Problem in Undirected GraphsMaxim A. Babenko, Alexey Gusakov. 519-530 [doi]
• Balanced Interval ColoringAntonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza. 531-542 [doi]
• Symmetric Determinantal Representation of Weakly-Skew CircuitsBruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier. 543-554 [doi]
• Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the RealsMarkus Bläser, Christian Engels. 555-566 [doi]
• On Isomorphism Testing of Groups with Normal Hall SubgroupsYouming Qiao, Jayalal M. N. Sarma, Bangsheng Tang. 567-578 [doi]
• Space Complexity of Perfect Matching in Bounded Genus Bipartite GraphsSamir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran. 579-590 [doi]
• The Recognition of Triangle GraphsGeorge B. Mertzios. 591-602 [doi]
• Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown AutomataPawel Parys. 603-614 [doi]
• Temporal Synthesis for Bounded Systems and EnvironmentsOrna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis. 615-626 [doi]
• Linear temporal logic for regular cost functionsDenis Kuperberg. 627-636 [doi]
• Bounds on the maximum multiplicity of some common geometric graphsAdrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth. 637-648 [doi]
• On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problemsChristian Knauer, Hans Raj Tiwary, Daniel Werner. 649-660 [doi]
• Quantum query complexity of minor-closed graph propertiesAndrew M. Childs, Robin Kothari. 661-672 [doi]
• Three Query Locally Decodable Codes with Higher Correctness Require Exponential LengthAnna Gál, Andrew Mills. 673-684 [doi]