Table of Contents

• Expected Window Mean-PayoffBenjamin Bordais, Shibashis Guha, Jean-François Raskin. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Parameterized Streaming Algorithms for Min-Ones d-SATAkanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman 0001, Saket Saurabh 0001. [doi]
• Sketching Graphs and Combinatorial Optimization (Invited Talk)Robert Krauthgamer. [doi]
• On the AC^0[oplus] Complexity of Andreev's ProblemAditya Potukuchi. [doi]
• Progress in Lifting and Applications in Lower Bounds (Invited Talk)Toniann Pitassi. [doi]
• The Tree-Generative Capacity of Combinatory Categorial GrammarsMarco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer. [doi]
• The Complexity of Finding S-Factors in Regular GraphsSanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis. [doi]
• Practical Formal Methods for Real World Cryptography (Invited Talk)Karthikeyan Bhargavan, Prasad Naldurg. [doi]
• Exact and Approximate Digraph BandwidthPallavi Jain 0001, Lawqueen Kanesh, William Lochet, Saket Saurabh 0001, Roohani Sharma. [doi]
• The Preemptive Resource Allocation ProblemKanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. [doi]
• How Computer Science Informs Modern Auction Design (Invited Talk)Tim Roughgarden. [doi]
• Cyclic Proofs and Jumping AutomataDenis Kuperberg, Laureline Pinault, Damien Pous. [doi]
• Complexity of Liveness in Parameterized SystemsPeter Chini, Roland Meyer 0001, Prakash Saivasan. [doi]
• Classification Among Hidden Markov ModelsS. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest. [doi]
• On the Probabilistic Degrees of Symmetric Boolean FunctionsSrikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh. [doi]
• An Algebraic Framework to Reason About Concurrency (Invited Talk)Alexandra Silva 0001. [doi]
• An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph ReachabilityRahul Jain, Raghunath Tewari. [doi]
• Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related MachinesGiorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram. [doi]
• Approximate Online Pattern Matching in Sublinear TimeDiptarka Chakraborty, Debarati Das 0001, Michal Koucký. [doi]
• Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown AutomataManfred Droste, Sven Dziadek, Werner Kuich. [doi]
• Fast Exact Algorithms Using Hadamard Product of PolynomialsVikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. [doi]
• Distance Between Mutually Reachable Petri Net ConfigurationsJérôme Leroux. [doi]
• New Results on Cutting Plane Proofs for Horn Constraint SystemsHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. [doi]
• Motif Counting in Preferential Attachment GraphsJan Dreier, Peter Rossmanith. [doi]
• Popular Roommates in Simply Exponential TimeTelikepalli Kavitha. [doi]
• Parameterized k-Clustering: Tractability IslandFedor V. Fomin, Petr A. Golovach, Kirill Simonov. [doi]
• Widths of Regular and Context-Free LanguagesDavid Mestel. [doi]
• Maximum-Area Rectangles in a Simple PolygonYujin Choi, Seungjun Lee, Hee-Kap Ahn. [doi]
• Interval Temporal Logic for Visibly Pushdown SystemsLaura Bozzelli, Angelo Montanari, Adriano Peron. [doi]
• Query Preserving Watermarking Schemes for Locally Treelike DatabasesAgnishom Chattopadhyay, M. Praveen. [doi]
• Minimisation of Event StructuresPaolo Baldan, Alessandra Raffaetà. [doi]
• Degrees of Ambiguity of Büchi Tree AutomataAlexander Rabinovich, Doron Tiferet. [doi]
• Online and Offline Algorithms for Circuit Switch SchedulingRoy Schwartz, Mohit Singh, Sina Yazdanbod. [doi]
• A Categorical Account of Replicated Data TypesFabio Gadducci, Hernán C. Melgratti, Christian Roldán, Matteo Sammartino. [doi]
• The Well Structured Problem for Presburger Counter MachinesAlain Finkel, Ekanshdeep Gupta. [doi]
• Nonnegative Rank Measures and Monotone Algebraic Branching ProgramsHervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas. [doi]
• Reachability in Concurrent Uninterpreted ProgramsSalvatore La Torre, Parthasarathy Madhusudan. [doi]
• Two-Way Parikh AutomataEmmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi. [doi]
• Transformations of Boolean FunctionsJeffrey M. Dudek, Dror Fried. [doi]
• A Fast Exponential Time Algorithm for Max Hamming Distance X3SATGordon Hoi, Sanjay Jain 0001, Frank Stephan 0001. [doi]
• Planted Models for k-Way Edge and Vertex ExpansionAnand Louis, Rakesh Venkat. [doi]
• Concurrent Parameterized GamesNathalie Bertrand 0001, Patricia Bouyer, Anirban Majumdar 0002. [doi]
• Unambiguous Catalytic ComputationChetan Gupta 0002, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari. [doi]
• More on AC^0[oplus] and Variants of the Majority FunctionNutan Limaye, Srikanth Srinivasan 0001, Utkarsh Tripathi. [doi]
• Dynamics on Games: Simulation-Based Techniques and Applications to RoutingThomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin. [doi]
• Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk)Ranko Lazic. [doi]
• Connected Search for a Lazy RobberIsolde Adler, Christophe Paul, Dimitrios M. Thilikos. [doi]
• Regular Separability and Intersection Emptiness Are Independent ProblemsRamanathan S. Thinniyam, Georg Zetzsche. [doi]
• Boolean Algebras from Trace AutomataAlexandre Mansard. [doi]
• Taming the Complexity of Timeline-Based Planning over Dense Temporal DomainsLaura Bozzelli, Angelo Montanari, Adriano Peron. [doi]
• Constructing Faithful Homomorphisms over Fields of Finite CharacteristicPrerona Chatterjee, Ramprasad Saptharishi. [doi]