MFCS B

91 papers

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