| 2018 | 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, August 27-31, 2018 Igor Potapov, Paul G. Spirakis, James Worrell |
| 2018 | A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. Manfred Droste, Erik Paul |
| 2018 | A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. Christian Konrad |
| 2018 | A Subquadratic Algorithm for 3XOR. Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer |
| 2018 | A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca |
| 2018 | A Two-Sided Error Distributed Property Tester For Conductance. Hendrik Fichtenberger, Yadu Vasudev |
| 2018 | Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri |
| 2018 | Average Case Analysis of Leaf-Centric Binary Tree Sources. Louisa Seelbach Benkner, Markus Lohrey |
| 2018 | Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. Akitoshi Kawamura, Holger Thies, Martin Ziegler |
| 2018 | Balance Problems for Integer Circuits. Titus Dose |
| 2018 | Balanced Connected Partitioning of Unweighted Grid Graphs. Cedric Berenger, Peter Niebert, Kévin Perrot |
| 2018 | Car-Sharing between Two Locations: Online Scheduling with Two Servers. Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2018 | Collective Fast Delivery by Energy-Efficient Agents. Andreas Bärtschi, Daniel Graf, Matús Mihalák |
| 2018 | Complexity of Preimage Problems for Deterministic Finite Automata. Mikhail V. Berlinkov, Robert Ferens, Marek Szykula |
| 2018 | Concurrent Games and Semi-Random Determinacy. Stéphane Le Roux |
| 2018 | Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh |
| 2018 | Consensus Strings with Small Maximum Distance and Small Distance Sum. Laurent Bulteau, Markus L. Schmid |
| 2018 | Consistency for Counting Quantifiers. Florent R. Madelaine, Barnaby Martin |
| 2018 | Counting Homomorphisms to Trees Modulo a Prime. Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel |
| 2018 | Depth Two Majority Circuits for Majority and List Expanders. Kazuyuki Amano |
| 2018 | Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan |
| 2018 | Directed Graph Minors and Serial-Parallel Width. Argyrios Deligkas, Reshef Meir |
| 2018 | Double Threshold Digraphs. Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu |
| 2018 | Enumerating Minimal Transversals of Hypergraphs without Small Holes. Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri |
| 2018 | Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph. Hasan Abasi |
| 2018 | Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
| 2018 | Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. Frank Kammer, Andrej Sajenko |
| 2018 | Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya |
| 2018 | Faster Exploration of Degree-Bounded Temporal Graphs. Thomas Erlebach, Jakob T. Spooner |
| 2018 | Finding Short Synchronizing Words for Prefix Codes. Andrew Ryzhikov, Marek Szykula |
| 2018 | From Expanders to Hitting Distributions and Simulation Theorems. Alexander Kozachinskiy |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2018 | Generalized Budgeted Submodular Set Function Maximization. Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj |
| 2018 | Give Me Some Slack: Efficient Network Measurements. Ran Ben-Basat, Gil Einziger, Roy Friedman |
| 2018 | Graph Similarity and Approximate Isomorphism. Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger |
| 2018 | Hardness Results for Consensus-Halving. Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang |
| 2018 | Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi |
| 2018 | Interval-Like Graphs and Digraphs. Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey |
| 2018 | Lagrange's Theorem for Binary Squares. P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit |
| 2018 | Largest Weight Common Subtree Embeddings with Distance Penalties. Andre Droschinsky, Nils M. Kriege, Petra Mutzel |
| 2018 | Linking Focusing and Resolution with Selection. Guillaume Burel |
| 2018 | Listing Subgraphs by Cartesian Decomposition. Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari |
| 2018 | Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou |
| 2018 | Maximum Area Axis-Aligned Square Packings. Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth |
| 2018 | Maximum Rooted Connected Expansion. Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos |
| 2018 | New Results on Directed Edge Dominating Set. Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis |
| 2018 | On Efficiently Solvable Cases of Quantum k-SAT. Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi |
| 2018 | On Hadamard Series and Rotating Q-Automata. Louis-Marie Dando, Sylvain Lombardy |
| 2018 | On Pseudodeterministic Approximation Algorithms. Peter Dixon, Aduri Pavan, N. V. Vinodchandran |
| 2018 | On Randomized Generation of Slowly Synchronizing Automata. Costanza Catalano, Raphaël M. Jungers |
| 2018 | On W[1]-Hardness as Evidence for Intractability. Ralph Christian Bottesch |
| 2018 | On the Complexity of Team Logic and Its Two-Variable Fragment. Martin Lück |
| 2018 | On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev |
| 2018 | One-Sided Error Communication Complexity of Gap Hamming Distance. Egor Klenin, Alexander Kozachinskiy |
| 2018 | Online Maximum Matching with Recourse. Spyros Angelopoulos, Christoph Dürr, Shendan Jin |
| 2018 | Optimal Strategies in Pushdown Reachability Games. Arnaud Carayol, Matthew Hague |
| 2018 | Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. Mareike Dressler, Adam Kurpisz, Timo de Wolff |
| 2018 | Pairing heaps: the forward variant. Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick |
| 2018 | Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann |
| 2018 | Plain Stopping Time and Conditional Complexities Revisited. Mikhail Andreev, Gleb Posobin, Alexander Shen |
| 2018 | Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
| 2018 | Pricing Problems with Buyer Preselection. Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli |
| 2018 | Probabilistic Secret Sharing. Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel L. Pérez del Pozo, Ugo Vaccaro |
| 2018 | Projection Theorems Using Effective Dimension. Neil Lutz, Donald M. Stull |
| 2018 | Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka |
| 2018 | Quantum vs. Classical Proofs and Subset Verification. Bill Fefferman, Shelby Kimmel |
| 2018 | Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen |
| 2018 | Reconfiguration of Graph Minors. Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya |
| 2018 | Recovering Sparse Graphs. Jakub Gajarský, Daniel Král |
| 2018 | Results on the Dimension Spectra of Planar Lines. Donald M. Stull |
| 2018 | Shape Recognition by a Finite Automaton Robot. Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler |
| 2018 | Simultaneous Multiparty Communication Protocols for Composed Functions. Yassine Hamoudi |
| 2018 | Sliding Windows over Context-Free Languages. Moses Ganardi, Artur Jez, Markus Lohrey |
| 2018 | Spanning-Tree Games. Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi |
| 2018 | Team Semantics for the Specification and Verification of Hyperproperties. Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann |
| 2018 | Testing Simon's congruence. Lukas Fleischer, Manfred Kufleitner |
| 2018 | The Complexity of Disjunctive Linear Diophantine Constraints. Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet |
| 2018 | The Complexity of Finding Small Separators in Temporal Graphs. Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier |
| 2018 | The Complexity of Transducer Synthesis from Multi-Sequential Specifications. Léo Exibard, Emmanuel Filiot, Ismaël Jecker |
| 2018 | The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe |
| 2018 | The b-Branching Problem in Digraphs. Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa |
| 2018 | Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. Aris Pagourtzis, Tomasz Radzik |
| 2018 | Timed Network Games with Clocks. Guy Avni, Shibashis Guha, Orna Kupferman |
| 2018 | Tree Tribes and Lower Bounds for Switching Lemmas. Jenish C. Mehta |
| 2018 | Treewidth-Two Graphs as a Free Algebra. Christian Doczkal, Damien Pous |
| 2018 | Why are CSPs Based on Partition Schemes Computationally Hard?. Peter Jonsson, Victor Lagerkvist |