Abstract is missing.
- Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness ResultsGeorgios Amanatidis, Evangelos Markakis, Krzysztof Sornat. [doi]
- A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex DeletionEduard Eiben, Robert Ganian, O-joung Kwon. [doi]
- On the Limits of Gate EliminationAlexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov. [doi]
- Piecewise Testable Languages and Nondeterministic AutomataTomás Masopust. [doi]
- Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal ActionsMatias David Lee, Erik P. de Vink. [doi]
- An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length TwoMingyu Xiao, Shaowei Kou. [doi]
- Shattered Sets and the Hilbert FunctionShay Moran, Cyrus Rashtchian. [doi]
- Circuit Size Lower Bounds and #SAT Upper Bounds Through a General FrameworkAlexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki. [doi]
- How Far Are We From Having a Satisfactory Theory of Clustering?Shai Ben-David. [doi]
- FPT Algorithms for Plane Completion ProblemsDimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. [doi]
- On the Voting Time of the Deterministic Majority ProcessDominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale. [doi]
- On the Implicit Graph ConjectureMaurice Chandoo. [doi]
- Minimal Phylogenetic Supertrees and Local Consensus TreesJesper Jansson, Wing-Kin Sung. [doi]
- Real Interactive Proofs for VPSPACEMartijn Baartse, Klaus Meer. [doi]
- Nested Weighted Limit-Average Automata of Bounded WidthKrishnendu Chatterjee, Thomas A. Henzinger, Jan Otop. [doi]
- Decidable Extensions of MSOMikolaj Bojanczyk. [doi]
- Symbolic Lookaheads for Bottom-up ParsingPaola Quaglia. [doi]
- Eulerian Paths with Regular ConstraintsOrna Kupferman, Gal Vardi. [doi]
- Quantum Communication Complexity of Distributed Set JoinsStacey Jeffery, François Le Gall. [doi]
- Determining Sets of Quasiperiods of Infinite WordsGuilhem Gamard, Gwénaël Richomme. [doi]
- Supplementarity is Necessary for Quantum Diagram ReasoningSimon Perdrix, Quanlong Wang. [doi]
- Scale-Free Networks, Hyperbolic Geometry, and Efficient AlgorithmsTobias Friedrich. [doi]
- Competitive Packet Routing with Priority ListsTobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch. [doi]
- On the Exact Learnability of Graph Parameters: The Case of Partition FunctionsNadia Labai, Johann A. Makowsky. [doi]
- Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside GroupsThibault Godin, Ines Klimann. [doi]
- On Planar Valued CSPsPeter Fulla, Stanislav Zivny. [doi]
- The Generalised Colouring Numbers on Classes of Bounded ExpansionStephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz. [doi]
- Multi-Party Protocols, Information Complexity and PrivacyIordanis Kerenidis, Adi Rosén, Florent Urrutia. [doi]
- Families of DFAs as Acceptors of omega-Regular LanguagesDana Angluin, Udi Boker, Dana Fisman. [doi]
- Every Binary Pattern of Length Greater Than 14 Is Abelian-2-AvoidableMatthieu Rosenfeld. [doi]
- Structural Control in Weighted Voting GamesAnja Rey, Jörg Rothe. [doi]
- Using Contracted Solution Graphs for Solving Reconfiguration ProblemsPaul Bonsma, Daniël Paulusma. [doi]
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation EquivalencePetr Jancar. [doi]
- The Ground-Set-Cost Budgeted Maximum Coverage ProblemIrving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer. [doi]
- Ride Sharing with a Vehicle of Unlimited CapacityAngelo Fanelli, Gianluigi Greco. [doi]
- Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite GraphsKenjiro Takazawa. [doi]
- RNA-Folding - From Hardness to AlgorithmsVirginia Vassilevska Williams. [doi]
- Ackermannian Integer Compression and the Word Problem for Hydra GroupsWill Dison, Eduard Einstein, Timothy R. Riley. [doi]
- On the Complexity of Probabilistic Trials for Hidden Satisfiability ProblemsItai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang. [doi]
- Preprocessing Under Uncertainty: Matroid IntersectionStefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, Vuong Anh Quyen. [doi]
- A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SATVictor Lagerkvist, Biman Roy. [doi]
- Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-GraphsSudeshna Kolay, Fahad Panolan, Venkatesh Raman 0001, Saket Saurabh. [doi]
- On the General Chain Pair Simplification ProblemChenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu. [doi]
- On Existential MSO and its Relation to ETHRobert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider. [doi]
- A Formal Exploration of Nominal Kleene AlgebraPaul Brunet, Damien Pous. [doi]
- Computing DAWGs and Minimal Absent Words in Linear Time for Integer AlphabetsYuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
- Vector Reachability Problem in SL(2, Z)Igor Potapov, Pavel Semukhin. [doi]
- Stochastic Timed Games RevisitedS. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi. [doi]
- Computational and Proof Complexity of Partial String AvoidabilityDmitry Itsykson, Alexander Okhotin, Vsevolod Oparin. [doi]
- A Note on the Advice Complexity of Multipass Randomized LogspacePeter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran. [doi]
- Undecidability of Two-dimensional Robot GamesReino Niskanen, Igor Potapov, Julien Reichert. [doi]
- Space-Efficient Biconnected Components and Recognition of Outerplanar GraphsFrank Kammer, Dieter Kratsch, Moritz Laudahn. [doi]
- On Degeneration of Tensors and AlgebrasMarkus Bläser, Vladimir Lysikov. [doi]
- Space-Efficient Approximation Scheme for Maximum Matching in Sparse GraphsSamir Datta, Raghav Kulkarni, Anish Mukherjee 0001. [doi]
- Advice Complexity of the Online Induced Subgraph ProblemDennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl. [doi]
- Polynomial Space Randomness in AnalysisXiang Huang, Donald M. Stull. [doi]
- Trading Determinism for Time in Space Bounded ComputationsVivek Anand T. Kallampally, Raghunath Tewari. [doi]
- The Covering Problem: A Unified Approach for Investigating the Expressive Power of LogicsThomas Place, Marc Zeitoun. [doi]
- Uniformization Problems for Tree-Automatic Relations and Top-Down Tree TransducersChristof Löding, Sarah Winter. [doi]
- Synchronizing Data Words for Register AutomataParvaneh Babari, Karin Quaas, Mahsa Shirmohammadi. [doi]
- Some Lower Bounds in Parameterized AC^0Yijia Chen, Jörg Flum. [doi]
- On the Complexity of Branching Games with Regular ConditionsMarcin Przybylko, Michal Skrzypczak. [doi]
- Stably Computing Order Statistics with Arithmetic Population ProtocolsGeorge B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. [doi]
- Routing with Congestion in Acyclic DigraphsSaeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich. [doi]
- Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural NumbersTitus Dose. [doi]
- Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite FieldsZeyu Guo, Anand Kumar Narayanan, Chris Umans. [doi]
- Pointer Quantum PCPs and Multi-Prover GamesAlex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi. [doi]
- The Parameterized Complexity of Fixing Number and Vertex Individualization in GraphsVikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan. [doi]
- Graph Properties in Node-Query Setting: Effect of Breaking SymmetryNikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder. [doi]
- Stable States of Perturbed Markov ChainsVolker Betz, Stéphane Le Roux 0001. [doi]
- Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and CompressionTakayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama. [doi]
- Dividing by Zero - How Bad Is It, Really?Takayuki Kihara, Arno Pauly. [doi]
- Fully Dynamic Data Structure for LCE Queries in Compressed SpaceTakaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
- Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank CircuitsAnurag Pandey, Nitin Saxena, Amit Sinhababu. [doi]
- Transducer-Based Rewriting Games for Active XMLMartin Schuster. [doi]
- Optimal Sparsification for Some Binary CSPs Using Low-Degree PolynomialsBart M. P. Jansen, Astrid Pieterse. [doi]
- Two-Variable Logic over Countable Linear OrderingsAmaldev Manuel, A. V. Sreejith. [doi]
- Transformation Between Regular Expressions and omega-AutomataChristof Löding, Andreas Tollkötter. [doi]
- On Synchronizing Colorings and the Eigenvectors of DigraphsVladimir V. Gusev, Elena V. Pribavkina. [doi]
- On the Complexity Landscape of Connected f-Factor ProblemsRobert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan. [doi]
- Shortest Unique Substring Queries on Run-Length Encoded StringsTakuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
- Conditionally Optimal Algorithms for Generalized Büchi GamesKrishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer. [doi]
- Faster Algorithms for the Maximum Common Subtree Isomorphism ProblemAndre Droschinsky, Nils M. Kriege, Petra Mutzel. [doi]
- Integer Factoring Using Small Algebraic DependenciesManindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava. [doi]
- On the Complexity of Universality for Partially Ordered NFAsMarkus Krötzsch, Tomás Masopust, Michaël Thomazo. [doi]
- Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents [doi]
- Optimal Reachability in Weighted Timed Automata and GamesPatricia Bouyer-Decitre. [doi]
- Programming Biomolecules That Fold Greedily During TranscriptionCody W. Geary, Pierre-Etienne Meunier, Nicolas Schabanel, Shinnosuke Seki. [doi]
- Decidability of Predicate Logics with Team SemanticsJuha Kontinen, Antti Kuusisto, Jonni Virtema. [doi]
- On the Sensitivity Conjecture for Read-k FormulasMitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker. [doi]