LIPIcs, Volume 58, MFCS 2016
-
Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier
LIPIcs, Volume 58, MFCS'16, Complete Volume
10.4230/LIPIcs.MFCS.2016
-
Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents
10.4230/LIPIcs.MFCS.2016.0
-
Shai Ben-David
How Far Are We From Having a Satisfactory Theory of Clustering? (Invited Talk)
10.4230/LIPIcs.MFCS.2016.1
-
Mikolaj Bojanczyk
Decidable Extensions of MSO (Invited Talk)
10.4230/LIPIcs.MFCS.2016.2
-
Patricia Bouyer-Decitre
Optimal Reachability in Weighted Timed Automata and Games (Invited Talk)
10.4230/LIPIcs.MFCS.2016.3
-
Tobias Friedrich
Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk)
10.4230/LIPIcs.MFCS.2016.4
-
Virginia Vassilevska Williams
RNA-Folding - From Hardness to Algorithms (Invited Talk)
10.4230/LIPIcs.MFCS.2016.5
-
Manindra Agrawal, Nitin Saxena, and Shubham Sahai Srivastava
Integer Factoring Using Small Algebraic Dependencies
10.4230/LIPIcs.MFCS.2016.6
-
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, and Roman Rabinovich
Routing with Congestion in Acyclic Digraphs
10.4230/LIPIcs.MFCS.2016.7
-
S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, and Ashutosh Trivedi
Stochastic Timed Games Revisited
10.4230/LIPIcs.MFCS.2016.8
-
Georgios Amanatidis, Evangelos Markakis, and Krzysztof Sornat
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results
10.4230/LIPIcs.MFCS.2016.9
-
Vivek Anand T Kallampally and Raghunath Tewari
Trading Determinism for Time in Space Bounded Computations
10.4230/LIPIcs.MFCS.2016.10
-
Dana Angluin, Udi Boker, and Dana Fisman
Families of DFAs as Acceptors of omega-Regular Languages
10.4230/LIPIcs.MFCS.2016.11
-
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems
10.4230/LIPIcs.MFCS.2016.12
-
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, and Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
10.4230/LIPIcs.MFCS.2016.13
-
Martijn Baartse and Klaus Meer
Real Interactive Proofs for VPSPACE
10.4230/LIPIcs.MFCS.2016.14
-
Parvaneh Babari, Karin Quaas, and Mahsa Shirmohammadi
Synchronizing Data Words for Register Automata
10.4230/LIPIcs.MFCS.2016.15
-
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, and Ameya Velingker
On the Sensitivity Conjecture for Read-k Formulas
10.4230/LIPIcs.MFCS.2016.16
-
Nikhil Balaji, Samir Datta, Raghav Kulkarni, and Supartha Podder
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry
10.4230/LIPIcs.MFCS.2016.17
-
Volker Betz and Stéphane Le Roux
Stable States of Perturbed Markov Chains
10.4230/LIPIcs.MFCS.2016.18
-
Markus Bläser and Vladimir Lysikov
On Degeneration of Tensors and Algebras
10.4230/LIPIcs.MFCS.2016.19
-
Paul Bonsma and Daniël Paulusma
Using Contracted Solution Graphs for Solving Reconfiguration Problems
10.4230/LIPIcs.MFCS.2016.20
-
Alex B. Grilo, Iordanis Kerenidis, and Attila Pereszlényi
Pointer Quantum PCPs and Multi-Prover Games
10.4230/LIPIcs.MFCS.2016.21
-
Paul Brunet and Damien Pous
A Formal Exploration of Nominal Kleene Algebra
10.4230/LIPIcs.MFCS.2016.22
-
Maurice Chandoo
On the Implicit Graph Conjecture
10.4230/LIPIcs.MFCS.2016.23
-
Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop
Nested Weighted Limit-Average Automata of Bounded Width
10.4230/LIPIcs.MFCS.2016.24
-
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer
Conditionally Optimal Algorithms for Generalized Büchi Games
10.4230/LIPIcs.MFCS.2016.25
-
Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, and Dimitris Zoros
FPT Algorithms for Plane Completion Problems
10.4230/LIPIcs.MFCS.2016.26
-
Yijia Chen and Jörg Flum
Some Lower Bounds in Parameterized AC^0
10.4230/LIPIcs.MFCS.2016.27
-
Samir Datta, Raghav Kulkarni, and Anish Mukherjee
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs
10.4230/LIPIcs.MFCS.2016.28
-
Matias David Lee and Erik P. de Vink
Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions
10.4230/LIPIcs.MFCS.2016.29
-
Will Dison, Eduard Einstein, and Timothy R. Riley
Ackermannian Integer Compression and the Word Problem for Hydra Groups
10.4230/LIPIcs.MFCS.2016.30
-
Peter Dixon, Debasis Mandal, A. Pavan, and N. V. Vinodchandran
A Note on the Advice Complexity of Multipass Randomized Logspace
10.4230/LIPIcs.MFCS.2016.31
-
Titus Dose
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
10.4230/LIPIcs.MFCS.2016.32
-
Andre Droschinsky, Nils M. Kriege, and Petra Mutzel
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
10.4230/LIPIcs.MFCS.2016.33
-
Eduard Eiben, Robert Ganian, and O-joung Kwon
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
10.4230/LIPIcs.MFCS.2016.34
-
Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, and Vuong Anh Quyen
Preprocessing Under Uncertainty: Matroid Intersection
10.4230/LIPIcs.MFCS.2016.35
-
Angelo Fanelli and Greco Gianluigi
Ride Sharing with a Vehicle of Unlimited Capacity
10.4230/LIPIcs.MFCS.2016.36
-
Chenglin Fan, Omrit Filtser, Matthew J. Katz, and Binhai Zhu
On the General Chain Pair Simplification Problem
10.4230/LIPIcs.MFCS.2016.37
-
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets
10.4230/LIPIcs.MFCS.2016.38
-
Peter Fulla and Stanislav Zivny
On Planar Valued CSPs
10.4230/LIPIcs.MFCS.2016.39
-
Guilhem Gamard and Gwenaël Richomme
Determining Sets of Quasiperiods of Infinite Words
10.4230/LIPIcs.MFCS.2016.40
-
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, and M. S. Ramanujan
On the Complexity Landscape of Connected f-Factor Problems
10.4230/LIPIcs.MFCS.2016.41
-
Robert Ganian, Ronald de Haan, Iyad Kanj, and Stefan Szeider
On Existential MSO and its Relation to ETH
10.4230/LIPIcs.MFCS.2016.42
-
Cody Geary, Pierre-Etienne Meunier, Nicolas Schabanel, and Shinnosuke Seki
Programming Biomolecules That Fold Greedily During Transcription
10.4230/LIPIcs.MFCS.2016.43
-
Thibault Godin and Ines Klimann
Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups
10.4230/LIPIcs.MFCS.2016.44
-
Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, and Suguru Tamaki
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework
10.4230/LIPIcs.MFCS.2016.45
-
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, and Alexander S. Kulikov
On the Limits of Gate Elimination
10.4230/LIPIcs.MFCS.2016.46
-
Zeyu Guo, Anand Kumar Narayanan, and Chris Umans
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
10.4230/LIPIcs.MFCS.2016.47
-
Vladimir V. Gusev and Elena V. Pribavkina
On Synchronizing Colorings and the Eigenvectors of Digraphs
10.4230/LIPIcs.MFCS.2016.48
-
Tobias Harks, Britta Peis, Daniel Schmand, and Laura Vargas Koch
Competitive Packet Routing with Priority Lists
10.4230/LIPIcs.MFCS.2016.49
-
Irving van Heuven van Staereling, Bart de Keijzer, and Guido Schäfer
The Ground-Set-Cost Budgeted Maximum Coverage Problem
10.4230/LIPIcs.MFCS.2016.50
-
Dmitry Itsykson, Alexander Okhotin, and Vsevolod Oparin
Computational and Proof Complexity of Partial String Avoidability
10.4230/LIPIcs.MFCS.2016.51
-
Petr Jancar
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence
10.4230/LIPIcs.MFCS.2016.52
-
Jesper Jansson and Wing-Kin Sung
Minimal Phylogenetic Supertrees and Local Consensus Trees
10.4230/LIPIcs.MFCS.2016.53
-
Stacey Jeffery and François Le Gall
Quantum Communication Complexity of Distributed Set Joins
10.4230/LIPIcs.MFCS.2016.54
-
Dominik Kaaser, Frederik Mallmann-Trenn, and Emanuele Natale
On the Voting Time of the Deterministic Majority Process
10.4230/LIPIcs.MFCS.2016.55
-
Frank Kammer, Dieter Kratsch, and Moritz Laudahn
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
10.4230/LIPIcs.MFCS.2016.56
-
Iordanis Kerenidis, Adi Rosén, and Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy
10.4230/LIPIcs.MFCS.2016.57
-
Takayuki Kihara and Arno Pauly
Dividing by Zero - How Bad Is It, Really?
10.4230/LIPIcs.MFCS.2016.58
-
Dennis Komm, Rastislav Královic, Richard Královic, and Christian Kudahl
Advice Complexity of the Online Induced Subgraph Problem
10.4230/LIPIcs.MFCS.2016.59
-
Juha Kontinen, Antti Kuusisto, and Jonni Virtema
Decidability of Predicate Logics with Team Semantics
10.4230/LIPIcs.MFCS.2016.60
-
Markus Krötzsch, Tomás Masopust, and Michaël Thomazo
On the Complexity of Universality for Partially Ordered NFAs
10.4230/LIPIcs.MFCS.2016.61
-
Orna Kupferman and Gal Vardi
Eulerian Paths with Regular Constraints
10.4230/LIPIcs.MFCS.2016.62
-
Nadia Labai and Johann A. Makowsky
On the Exact Learnability of Graph Parameters: The Case of Partition Functions
10.4230/LIPIcs.MFCS.2016.63
-
Victor Lagerkvist and Biman Roy
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT
10.4230/LIPIcs.MFCS.2016.64
-
Christof Löding and Sarah Winter
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers
10.4230/LIPIcs.MFCS.2016.65
-
Amaldev Manuel and A. V. Sreejith
Two-Variable Logic over Countable Linear Orderings
10.4230/LIPIcs.MFCS.2016.66
-
Tomás Masopust
Piecewise Testable Languages and Nondeterministic Automata
10.4230/LIPIcs.MFCS.2016.67
-
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, and Paul G. Spirakis
Stably Computing Order Statistics with Arithmetic Population Protocols
10.4230/LIPIcs.MFCS.2016.68
-
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
Shortest Unique Substring Queries on Run-Length Encoded Strings
10.4230/LIPIcs.MFCS.2016.69
-
Shay Moran and Cyrus Rashtchian
Shattered Sets and the Hilbert Function
10.4230/LIPIcs.MFCS.2016.70
-
Bart M. P. Jansen and Astrid Pieterse
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
10.4230/LIPIcs.MFCS.2016.71
-
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
Fully Dynamic Data Structure for LCE Queries in Compressed Space
10.4230/LIPIcs.MFCS.2016.72
-
Reino Niskanen, Igor Potapov, and Julien Reichert
Undecidability of Two-dimensional Robot Games
10.4230/LIPIcs.MFCS.2016.73
-
Anurag Pandey, Nitin Saxena, and Amit Sinhababu
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits
10.4230/LIPIcs.MFCS.2016.74
-
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, and Saket Saurabh
Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
10.4230/LIPIcs.MFCS.2016.75
-
Simon Perdrix and Quanlong Wang
Supplementarity is Necessary for Quantum Diagram Reasoning
10.4230/LIPIcs.MFCS.2016.76
-
Thomas Place and Marc Zeitoun
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics
10.4230/LIPIcs.MFCS.2016.77
-
Marcin Przybylko and Michal Skrzypczak
On the Complexity of Branching Games with Regular Conditions
10.4230/LIPIcs.MFCS.2016.78
-
Paola Quaglia
Symbolic Lookaheads for Bottom-up Parsing
10.4230/LIPIcs.MFCS.2016.79
-
Anja Rey and Jörg Rothe
Structural Control in Weighted Voting Games
10.4230/LIPIcs.MFCS.2016.80
-
Matthieu Rosenfeld
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable
10.4230/LIPIcs.MFCS.2016.81
-
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
10.4230/LIPIcs.MFCS.2016.82
-
Martin Schuster
Transducer-Based Rewriting Games for Active XML
10.4230/LIPIcs.MFCS.2016.83
-
Igor Potapov and Pavel Semukhin
Vector Reachability Problem in SL(2, Z)
10.4230/LIPIcs.MFCS.2016.84
-
Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebertz
The Generalised Colouring Numbers on Classes of Bounded Expansion
10.4230/LIPIcs.MFCS.2016.85
-
Xiang Huang and Donald M. Stull
Polynomial Space Randomness in Analysis
10.4230/LIPIcs.MFCS.2016.86
-
Kenjiro Takazawa
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
10.4230/LIPIcs.MFCS.2016.87
-
Christof Löding and Andreas Tollkötter
Transformation Between Regular Expressions and omega-Automata
10.4230/LIPIcs.MFCS.2016.88
-
Mingyu Xiao and Shaowei Kou
An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two
10.4230/LIPIcs.MFCS.2016.89