| 2017 | 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, August 21-25, 2017 Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin |
| 2017 | A Characterisation of Pi^0_2 Regular Tree Languages. Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak |
| 2017 | A Formal Semantics of Influence in Bayesian Reasoning. Bart Jacobs, Fabio Zanasi |
| 2017 | An Improved FPT Algorithm for the Flip Distance Problem. Shaohua Li, Qilong Feng, Xiangzhong Meng, Jianxin Wang |
| 2017 | Another Characterization of the Higher K-Trivials. Paul-Elliot Anglès d'Auriac, Benoît Monin |
| 2017 | Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2017 | Attainable Values of Reset Thresholds. Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula |
| 2017 | Automata in the Category of Glued Vector Spaces. Thomas Colcombet, Daniela Petrisan |
| 2017 | Being Even Slightly Shallow Makes Life Hard. Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan |
| 2017 | Better Complexity Bounds for Cost Register Automata. Eric Allender, Andreas Krebs, Pierre McKenzie |
| 2017 | Binary Search in Graphs Revisited. Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
| 2017 | Clique-Width for Graph Classes Closed under Complementation. Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev |
| 2017 | Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides |
| 2017 | Communication Complexity of Pairs of Graph Families with Applications. Sudeshna Kolay, Fahad Panolan, Saket Saurabh |
| 2017 | Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. Laure Daviaud, Pierre Guillon, Glenn Merlet |
| 2017 | Complexity of Restricted Variants of Skolem and Related Problems. S. Akshay, Nikhil Balaji, Nikhil Vyas |
| 2017 | Compositional Weak Metrics for Group Key Update. Ruggero Lanotte, Massimo Merro, Simone Tini |
| 2017 | Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon. Narayan Vikas |
| 2017 | Computing the Maximum using (min, +) Formulas. Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari |
| 2017 | Counting Problems for Parikh Images. Christoph Haase, Stefan Kiefer, Markus Lohrey |
| 2017 | Distributed Strategies Made Easy. Simon Castellan, Pierre Clairambault, Glynn Winskel |
| 2017 | Dividing Splittable Goods Evenly and With Limited Fragmentation. Peter Damaschke |
| 2017 | Does Looking Inside a Circuit Help?. Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani |
| 2017 | Domains for Higher-Order Games. Matthew Hague, Roland Meyer, Sebastian Muskalla |
| 2017 | Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja |
| 2017 | Eilenberg Theorems for Free. Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius |
| 2017 | Emptiness Problems for Integer Circuits. Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau |
| 2017 | Faster Algorithms for Mean-Payoff Parity Games. Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil |
| 2017 | Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak |
| 2017 | Fine-Grained Complexity of Rainbow Coloring and its Variants. Akanksha Agrawal |
| 2017 | Fractal Intersections and Products via Algorithmic Dimension. Neil Lutz |
| 2017 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2017 | Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa |
| 2017 | Grammars for Indentation-Sensitive Parsing. Härmel Nestra |
| 2017 | Hardness and Approximation of High-Dimensional Search Problems (Invited Talk). Rasmus Pagh |
| 2017 | Hypercube LSH for Approximate near Neighbors. Thijs Laarhoven |
| 2017 | Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). Philippe Schnoebelen |
| 2017 | Induced Embeddings into Hamming Graphs. Martin Milanic, Peter Mursic, Marcelo Mydlarz |
| 2017 | K4-free Graphs as a Free Algebra. Enric Cosme-Llópez, Damien Pous |
| 2017 | Kernelization of the Subset General Position Problem in Geometry. Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay |
| 2017 | Lossy Kernels for Hitting Subgraphs. Eduard Eiben, Danny Hermelin, M. S. Ramanujan |
| 2017 | Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan |
| 2017 | Making Metric Temporal Logic Rational. Shankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya |
| 2017 | Membership Problem in GL(2, Z) Extended by Singular Matrices. Igor Potapov, Pavel Semukhin |
| 2017 | Model Checking and Validity in Propositional and Modal Inclusion Logics. Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema |
| 2017 | Monitor Logics for Quantitative Monitor Automata. Erik Paul |
| 2017 | New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. Eric Allender, Shuichi Hirahara |
| 2017 | On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). Michal Pilipczuk |
| 2017 | On Multidimensional and Monotone k-SUM. Chloe Ching-Yun Hsu, Chris Umans |
| 2017 | On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. Palash Dey, Neeldhara Misra |
| 2017 | On the Expressive Power of Quasiperiodic SFT. Bruno Durand, Andrei Romashchenko |
| 2017 | On the Upward/Downward Closures of Petri Nets. Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan |
| 2017 | One-Dimensional Logic over Trees. Emanuel Kieronski, Antti Kuusisto |
| 2017 | Parameterized Algorithms and Kernels for Rainbow Matching. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2017 | Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. Ivan Bliznets, Nikolay Karpov |
| 2017 | Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou |
| 2017 | Recognizing Graphs Close to Bipartite Graphs. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma |
| 2017 | Regular Language Distance and Entropy. Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey |
| 2017 | Reversible Kleene lattices. Paul Brunet |
| 2017 | Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. Ludmila Glinskih, Dmitry Itsykson |
| 2017 | Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj |
| 2017 | Small-Space LCE Data Structure with Constant-Time Queries. Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2017 | Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis. Xiaotie Deng, Yansong Gao, Jie Zhang |
| 2017 | Strategy Complexity of Concurrent Safety Games. Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen |
| 2017 | Structured Connectivity Augmentation. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2017 | TC Alexei G. Myasnikov, Armin Weiß |
| 2017 | Temporal Logics for Multi-Agent Systems (Invited Talk). Nicolas Markey |
| 2017 | The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis. Tomoyuki Yamakami |
| 2017 | The Complexity of Boolean Surjective General-Valued CSPs. Peter Fulla, Stanislav Zivný |
| 2017 | The Complexity of Quantified Constraints Using the Algebraic Formulation. Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk |
| 2017 | The Complexity of Quantum Disjointness. Hartmut Klauck |
| 2017 | The Complexity of SORE-definability Problems. Ping Lu, Zhilin Wu, Haiming Chen |
| 2017 | The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable. Erik Paul |
| 2017 | The Hardness of Solving Simple Word Equations. Joel D. Day, Florin Manea, Dirk Nowotka |
| 2017 | The Power of Linear-Time Data Reduction for Maximum Matching. George B. Mertzios, André Nichterlein, Rolf Niedermeier |
| 2017 | The Power of Programs over Monoids in DA. Nathan Grosshans, Pierre McKenzie, Luc Segoufin |
| 2017 | The Quantum Monad on Relational Structures. Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata |
| 2017 | The Shortest Identities for Max-Plus Automata with Two States. Laure Daviaud, Marianne Johnson |
| 2017 | Time Complexity of Constraint Satisfaction via Universal Algebra. Peter Jonsson, Victor Lagerkvist, Biman Roy |
| 2017 | Timed Network Games. Guy Avni, Shibashis Guha, Orna Kupferman |
| 2017 | Towards a Polynomial Kernel for Directed Feedback Vertex Set. Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | Two-Planar Graphs Are Quasiplanar. Michael Hoffmann, Csaba D. Tóth |
| 2017 | Undecidable Problems for Probabilistic Network Programming. David M. Kahn |
| 2017 | Variations on Inductive-Recursive Definitions. Neil Ghani, Conor McBride, Fredrik Nordvall Forsberg, Stephan Spahn |
| 2017 | Walrasian Pricing in Multi-Unit Auctions. Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng |
| 2017 | Weighted Operator Precedence Languages. Manfred Droste, Stefan Dück, Dino Mandrioli, Matteo Pradella |
| 2017 | ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang |