Search dblp for Publications

export results for "toc:db/conf/mfcs/mfcs2018.bht:"

 download as .bib file

@inproceedings{DBLP:conf/mfcs/0001DJ18,
  author    = {Spyros Angelopoulos and
               Christoph D{\"{u}}rr and
               Shendan Jin},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Online Maximum Matching with Recourse},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {8:1--8:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.8},
  doi       = {10.4230/LIPIcs.MFCS.2018.8},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/0001DJ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/0001L018,
  author    = {Andreas G{\"{o}}bel and
               J. A. Gregor Lagodzinski and
               Karen Seidel},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Counting Homomorphisms to Trees Modulo a Prime},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {49:1--49:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.49},
  doi       = {10.4230/LIPIcs.MFCS.2018.49},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/0001L018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Abasi18,
  author    = {Hasan Abasi},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {3:1--3:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.3},
  doi       = {10.4230/LIPIcs.MFCS.2018.3},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Abasi18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AgrawalJKL018,
  author    = {Akanksha Agrawal and
               Pallavi Jain and
               Lawqueen Kanesh and
               Daniel Lokshtanov and
               Saket Saurabh},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Conflict Free Feedback Vertex Set: {A} Parameterized Dichotomy},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {53:1--53:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.53},
  doi       = {10.4230/LIPIcs.MFCS.2018.53},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/AgrawalJKL018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AkitayaJST18,
  author    = {Hugo A. Akitaya and
               Matthew D. Jones and
               David Stalfa and
               Csaba D. T{\'{o}}th},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Maximum Area Axis-Aligned Square Packings},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {77:1--77:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.77},
  doi       = {10.4230/LIPIcs.MFCS.2018.77},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/AkitayaJST18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AldiBGS18,
  author    = {Marco Aldi and
               Niel de Beaudrap and
               Sevag Gharibian and
               Seyran Saeedi},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On Efficiently Solvable Cases of Quantum k-SAT},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {38:1--38:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.38},
  doi       = {10.4230/LIPIcs.MFCS.2018.38},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/AldiBGS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Amano18,
  author    = {Kazuyuki Amano},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Depth Two Majority Circuits for Majority and List Expanders},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {81:1--81:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.81},
  doi       = {10.4230/LIPIcs.MFCS.2018.81},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Amano18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AndreevPS18,
  author    = {Mikhail Andreev and
               Gleb Posobin and
               Alexander Shen},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Plain Stopping Time and Conditional Complexities Revisited},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {2:1--2:12},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.2},
  doi       = {10.4230/LIPIcs.MFCS.2018.2},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/AndreevPS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AvniGK18,
  author    = {Guy Avni and
               Shibashis Guha and
               Orna Kupferman},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Timed Network Games with Clocks},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {23:1--23:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.23},
  doi       = {10.4230/LIPIcs.MFCS.2018.23},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/AvniGK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BandyapadhyayM018,
  author    = {Sayan Bandyapadhyay and
               Anil Maheshwari and
               Saeed Mehrabi and
               Subhash Suri},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Approximating Dominating Set on Intersection Graphs of Rectangles
               and L-frames},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {37:1--37:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.37},
  doi       = {10.4230/LIPIcs.MFCS.2018.37},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BandyapadhyayM018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bartschi0M18,
  author    = {Andreas B{\"{a}}rtschi and
               Daniel Graf and
               Mat{\'{u}}s Mihal{\'{a}}k},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Collective Fast Delivery by Energy-Efficient Agents},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {56:1--56:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.56},
  doi       = {10.4230/LIPIcs.MFCS.2018.56},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Bartschi0M18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BelmonteHK0L18,
  author    = {R{\'{e}}my Belmonte and
               Tesshu Hanaka and
               Ioannis Katsikarelis and
               Eun Jung Kim and
               Michael Lampis},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {New Results on Directed Edge Dominating Set},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {67:1--67:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.67},
  doi       = {10.4230/LIPIcs.MFCS.2018.67},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BelmonteHK0L18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ben-BasatEF18,
  author    = {Ran Ben{-}Basat and
               Gil Einziger and
               Roy Friedman},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Give Me Some Slack: Efficient Network Measurements},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {34:1--34:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.34},
  doi       = {10.4230/LIPIcs.MFCS.2018.34},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Ben-BasatEF18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BenknerL18,
  author    = {Louisa Seelbach Benkner and
               Markus Lohrey},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Average Case Analysis of Leaf-Centric Binary Tree Sources},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {16:1--16:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.16},
  doi       = {10.4230/LIPIcs.MFCS.2018.16},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BenknerL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BerengerNP18,
  author    = {Cedric Berenger and
               Peter Niebert and
               K{\'{e}}vin Perrot},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Balanced Connected Partitioning of Unweighted Grid Graphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {39:1--39:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.39},
  doi       = {10.4230/LIPIcs.MFCS.2018.39},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BerengerNP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BerlinkovFS18,
  author    = {Mikhail V. Berlinkov and
               Robert Ferens and
               Marek Szykula},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Complexity of Preimage Problems for Deterministic Finite Automata},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {32:1--32:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.32},
  doi       = {10.4230/LIPIcs.MFCS.2018.32},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BerlinkovFS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BiloFMM18,
  author    = {Vittorio Bil{\`{o}} and
               Michele Flammini and
               Gianpiero Monaco and
               Luca Moscardelli},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Pricing Problems with Buyer Preselection},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {47:1--47:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.47},
  doi       = {10.4230/LIPIcs.MFCS.2018.47},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BiloFMM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodirskyMMM18,
  author    = {Manuel Bodirsky and
               Barnaby Martin and
               Marcello Mamino and
               Antoine Mottet},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {The Complexity of Disjunctive Linear Diophantine Constraints},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {33:1--33:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.33},
  doi       = {10.4230/LIPIcs.MFCS.2018.33},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BodirskyMMM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bottesch18,
  author    = {Ralph Christian Bottesch},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On W[1]-Hardness as Evidence for Intractability},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {73:1--73:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.73},
  doi       = {10.4230/LIPIcs.MFCS.2018.73},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Bottesch18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BulteauS18,
  author    = {Laurent Bulteau and
               Markus L. Schmid},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Consensus Strings with Small Maximum Distance and Small Distance Sum},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {1:1--1:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.1},
  doi       = {10.4230/LIPIcs.MFCS.2018.1},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BulteauS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Burel18,
  author    = {Guillaume Burel},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Linking Focusing and Resolution with Selection},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {9:1--9:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.9},
  doi       = {10.4230/LIPIcs.MFCS.2018.9},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Burel18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CarayolH18,
  author    = {Arnaud Carayol and
               Matthew Hague},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Optimal Strategies in Pushdown Reachability Games},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {42:1--42:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.42},
  doi       = {10.4230/LIPIcs.MFCS.2018.42},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/CarayolH18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CatalanoJ18,
  author    = {Costanza Catalano and
               Rapha{\"{e}}l M. Jungers},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On Randomized Generation of Slowly Synchronizing Automata},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {48:1--48:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.48},
  doi       = {10.4230/LIPIcs.MFCS.2018.48},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/CatalanoJ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CellineseDMV18,
  author    = {Francesco Cellinese and
               Gianlorenzo D'Angelo and
               Gianpiero Monaco and
               Yllka Velaj},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Generalized Budgeted Submodular Set Function Maximization},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {31:1--31:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.31},
  doi       = {10.4230/LIPIcs.MFCS.2018.31},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/CellineseDMV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ClementiGGNPS18,
  author    = {Andrea E. F. Clementi and
               Mohsen Ghaffari and
               Luciano Gual{\`{a}} and
               Emanuele Natale and
               Francesco Pasquale and
               Giacomo Scornavacca},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {A Tight Analysis of the Parallel Undecided-State Dynamics with Two
               Colors},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {28:1--28:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.28},
  doi       = {10.4230/LIPIcs.MFCS.2018.28},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/ClementiGGNPS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ConteGMRV18,
  author    = {Alessio Conte and
               Roberto Grossi and
               Andrea Marino and
               Romeo Rizzi and
               Luca Versari},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Listing Subgraphs by Cartesian Decomposition},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {84:1--84:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.84},
  doi       = {10.4230/LIPIcs.MFCS.2018.84},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/ConteGMRV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DArcoPSPV18,
  author    = {Paolo D'Arco and
               Roberto De Prisco and
               Alfredo De Santis and
               Angel L. P{\'{e}}rez del Pozo and
               Ugo Vaccaro},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Probabilistic Secret Sharing},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {64:1--64:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.64},
  doi       = {10.4230/LIPIcs.MFCS.2018.64},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DArcoPSPV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Dabrowski0PPZ18,
  author    = {Konrad K. Dabrowski and
               Matthew Johnson and
               Giacomo Paesani and
               Dani{\"{e}}l Paulusma and
               Viktor Zamaraev},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On the Price of Independence for Vertex Cover, Feedback Vertex Set
               and Odd Cycle Transversal},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {63:1--63:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.63},
  doi       = {10.4230/LIPIcs.MFCS.2018.63},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Dabrowski0PPZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DanHJ0Z18,
  author    = {Chen Dan and
               Kristoffer Arnsfelt Hansen and
               He Jiang and
               Liwei Wang and
               Yuchen Zhou},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Low Rank Approximation of Binary Matrices: Column Subset Selection
               and Generalizations},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {41:1--41:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.41},
  doi       = {10.4230/LIPIcs.MFCS.2018.41},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DanHJ0Z18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DandoL18,
  author    = {Louis{-}Marie Dando and
               Sylvain Lombardy},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On Hadamard Series and Rotating Q-Automata},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {6:1--6:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.6},
  doi       = {10.4230/LIPIcs.MFCS.2018.6},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DandoL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DeligkasM18,
  author    = {Argyrios Deligkas and
               Reshef Meir},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Directed Graph Minors and Serial-Parallel Width},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {44:1--44:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.44},
  doi       = {10.4230/LIPIcs.MFCS.2018.44},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DeligkasM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DietzfelbingerS18,
  author    = {Martin Dietzfelbinger and
               Philipp Schlag and
               Stefan Walzer},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {A Subquadratic Algorithm for 3XOR},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {59:1--59:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.59},
  doi       = {10.4230/LIPIcs.MFCS.2018.59},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DietzfelbingerS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DixonPV18,
  author    = {Peter Dixon and
               Aduri Pavan and
               N. V. Vinodchandran},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On Pseudodeterministic Approximation Algorithms},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {61:1--61:11},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.61},
  doi       = {10.4230/LIPIcs.MFCS.2018.61},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DixonPV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DoczkalP18,
  author    = {Christian Doczkal and
               Damien Pous},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Treewidth-Two Graphs as a Free Algebra},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {60:1--60:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.60},
  doi       = {10.4230/LIPIcs.MFCS.2018.60},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DoczkalP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DorfmanK0Z18,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Uri Zwick},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Pairing heaps: the forward variant},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {13:1--13:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.13},
  doi       = {10.4230/LIPIcs.MFCS.2018.13},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DorfmanK0Z18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Dose18,
  author    = {Titus Dose},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Balance Problems for Integer Circuits},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {5:1--5:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.5},
  doi       = {10.4230/LIPIcs.MFCS.2018.5},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Dose18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DresslerKW18,
  author    = {Mareike Dressler and
               Adam Kurpisz and
               Timo de Wolff},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit
               Polynomials},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {82:1--82:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.82},
  doi       = {10.4230/LIPIcs.MFCS.2018.82},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DresslerKW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DroschinskyKM18,
  author    = {Andre Droschinsky and
               Nils M. Kriege and
               Petra Mutzel},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Largest Weight Common Subtree Embeddings with Distance Penalties},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {54:1--54:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.54},
  doi       = {10.4230/LIPIcs.MFCS.2018.54},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DroschinskyKM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DrosteP18,
  author    = {Manfred Droste and
               Erik Paul},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {A Feferman-Vaught Decomposition Theorem for Weighted {MSO} Logic},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {76:1--76:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.76},
  doi       = {10.4230/LIPIcs.MFCS.2018.76},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DrosteP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ErlebachS18,
  author    = {Thomas Erlebach and
               Jakob T. Spooner},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Faster Exploration of Degree-Bounded Temporal Graphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {36:1--36:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.36},
  doi       = {10.4230/LIPIcs.MFCS.2018.36},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/ErlebachS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ExibardFJ18,
  author    = {L{\'{e}}o Exibard and
               Emmanuel Filiot and
               Isma{\"{e}}l Jecker},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {The Complexity of Transducer Synthesis from Multi-Sequential Specifications},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {46:1--46:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.46},
  doi       = {10.4230/LIPIcs.MFCS.2018.46},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/ExibardFJ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FeffermanK18,
  author    = {Bill Fefferman and
               Shelby Kimmel},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Quantum vs. Classical Proofs and Subset Verification},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {22:1--22:23},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.22},
  doi       = {10.4230/LIPIcs.MFCS.2018.22},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/FeffermanK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FichtenbergerV18,
  author    = {Hendrik Fichtenberger and
               Yadu Vasudev},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {A Two-Sided Error Distributed Property Tester For Conductance},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {19:1--19:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.19},
  doi       = {10.4230/LIPIcs.MFCS.2018.19},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/FichtenbergerV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Filos-RatsikasF18,
  author    = {Aris Filos{-}Ratsikas and
               S{\o}ren Kristoffer Stiil Frederiksen and
               Paul W. Goldberg and
               Jie Zhang},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Hardness Results for Consensus-Halving},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {24:1--24:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.24},
  doi       = {10.4230/LIPIcs.MFCS.2018.24},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Filos-RatsikasF18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FleischerK18,
  author    = {Lukas Fleischer and
               Manfred Kufleitner},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Testing Simon's congruence},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {62:1--62:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.62},
  doi       = {10.4230/LIPIcs.MFCS.2018.62},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/FleischerK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GajarskyK18,
  author    = {Jakub Gajarsk{\'{y}} and
               Daniel Kr{\'{a}}l},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Recovering Sparse Graphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {29:1--29:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.29},
  doi       = {10.4230/LIPIcs.MFCS.2018.29},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GajarskyK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GallMNT18,
  author    = {Fran{\c{c}}ois Le Gall and
               Tomoyuki Morimae and
               Harumichi Nishimura and
               Yuki Takeuchi},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Interactive Proofs with Polynomial-Time Quantum Prover for Computing
               the Order of Solvable Groups},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {26:1--26:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.26},
  doi       = {10.4230/LIPIcs.MFCS.2018.26},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GallMNT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GanardiJL18,
  author    = {Moses Ganardi and
               Artur Jez and
               Markus Lohrey},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Sliding Windows over Context-Free Languages},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {15:1--15:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.15},
  doi       = {10.4230/LIPIcs.MFCS.2018.15},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GanardiJL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiLS18,
  author    = {Pawel Gawrychowski and
               Gad M. Landau and
               Tatiana Starikovskaya},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Fast Entropy-Bounded String Dictionary Look-Up with Mismatches},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {66:1--66:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.66},
  doi       = {10.4230/LIPIcs.MFCS.2018.66},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GawrychowskiLS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GharibianSSSY18,
  author    = {Sevag Gharibian and
               Miklos Santha and
               Jamie Sikora and
               Aarthi Sundaram and
               Justin Yirka},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Quantum Generalizations of the Polynomial Hierarchy with Applications
               to {QMA(2)}},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {58:1--58:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.58},
  doi       = {10.4230/LIPIcs.MFCS.2018.58},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GharibianSSSY18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GmyrHKKRS18,
  author    = {Robert Gmyr and
               Kristian Hinnenthal and
               Irina Kostitsyna and
               Fabian Kuhn and
               Dorian Rudolph and
               Christian Scheideler},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Shape Recognition by a Finite Automaton Robot},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {52:1--52:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.52},
  doi       = {10.4230/LIPIcs.MFCS.2018.52},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GmyrHKKRS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GroheRW18,
  author    = {Martin Grohe and
               Gaurav Rattan and
               Gerhard J. Woeginger},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Graph Similarity and Approximate Isomorphism},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {20:1--20:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.20},
  doi       = {10.4230/LIPIcs.MFCS.2018.20},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/GroheRW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HagueMM018,
  author    = {Matthew Hague and
               Roland Meyer and
               Sebastian Muskalla and
               Martin Zimmermann},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown
               Systems},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {57:1--57:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.57},
  doi       = {10.4230/LIPIcs.MFCS.2018.57},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/HagueMM018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HamburgerMPSX18,
  author    = {Peter Hamburger and
               Ross M. McConnell and
               Attila P{\'{o}}r and
               Jeremy P. Spinrad and
               Zhisheng Xu},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Double Threshold Digraphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {69:1--69:12},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.69},
  doi       = {10.4230/LIPIcs.MFCS.2018.69},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/HamburgerMPSX18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hamoudi18,
  author    = {Yassine Hamoudi},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Simultaneous Multiparty Communication Protocols for Composed Functions},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {14:1--14:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.14},
  doi       = {10.4230/LIPIcs.MFCS.2018.14},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Hamoudi18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HefetzKLV18,
  author    = {Dan Hefetz and
               Orna Kupferman and
               Amir Lellouche and
               Gal Vardi},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Spanning-Tree Games},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {35:1--35:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.35},
  doi       = {10.4230/LIPIcs.MFCS.2018.35},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/HefetzKLV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HeggernesILLL18,
  author    = {Pinar Heggernes and
               Davis Issac and
               Juho Lauri and
               Paloma T. Lima and
               Erik Jan van Leeuwen},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {83:1--83:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.83},
  doi       = {10.4230/LIPIcs.MFCS.2018.83},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/HeggernesILLL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hell0MR18,
  author    = {Pavol Hell and
               Jing Huang and
               Ross M. McConnell and
               Arash Rafiey},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Interval-Like Graphs and Digraphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {68:1--68:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.68},
  doi       = {10.4230/LIPIcs.MFCS.2018.68},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Hell0MR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HemaspaandraHS018,
  author    = {Edith Hemaspaandra and
               Lane A. Hemaspaandra and
               Holger Spakowski and
               Osamu Watanabe},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {The Robustness of {LWPP} and WPP, with an Application to Graph Reconstruction},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {51:1--51:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.51},
  doi       = {10.4230/LIPIcs.MFCS.2018.51},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/HemaspaandraHS018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/IdziakKK18,
  author    = {Pawel M. Idziak and
               Piotr Kawalek and
               Jacek Krzaczkowski},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Expressive Power, Satisfiability and Equivalence of Circuits over
               Nilpotent Algebras},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {17:1--17:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.17},
  doi       = {10.4230/LIPIcs.MFCS.2018.17},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/IdziakKK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JonssonL18,
  author    = {Peter Jonsson and
               Victor Lagerkvist},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Why are CSPs Based on Partition Schemes Computationally Hard?},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {43:1--43:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.43},
  doi       = {10.4230/LIPIcs.MFCS.2018.43},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/JonssonL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KakimuraKT18,
  author    = {Naonori Kakimura and
               Naoyuki Kamiyama and
               Kenjiro Takazawa},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {The b-Branching Problem in Digraphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {12:1--12:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.12},
  doi       = {10.4230/LIPIcs.MFCS.2018.12},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/KakimuraKT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KammerS18,
  author    = {Frank Kammer and
               Andrej Sajenko},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Extra Space during Initialization of Succinct Data Structures and
               Dynamical Initializable Arrays},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {65:1--65:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.65},
  doi       = {10.4230/LIPIcs.MFCS.2018.65},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/KammerS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KanteKP18,
  author    = {Mamadou Moustapha Kant{\'{e}} and
               Kaveh Khoshkhah and
               Mozhgan Pourmoradnasseri},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Enumerating Minimal Transversals of Hypergraphs without Small Holes},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {55:1--55:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.55},
  doi       = {10.4230/LIPIcs.MFCS.2018.55},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/KanteKP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KawamuraT018,
  author    = {Akitoshi Kawamura and
               Holger Thies and
               Martin Ziegler},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Average-Case Polynomial-Time Computability of Hamiltonian Dynamics},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {30:1--30:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.30},
  doi       = {10.4230/LIPIcs.MFCS.2018.30},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/KawamuraT018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KleninK18,
  author    = {Egor Klenin and
               Alexander Kozachinskiy},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {One-Sided Error Communication Complexity of Gap Hamming Distance},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {7:1--7:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.7},
  doi       = {10.4230/LIPIcs.MFCS.2018.7},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/KleninK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Konrad18,
  author    = {Christian Konrad},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {A Simple Augmentation Method for Matchings with Applications to Streaming
               Algorithms},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {74:1--74:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.74},
  doi       = {10.4230/LIPIcs.MFCS.2018.74},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Konrad18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Kozachinskiy18,
  author    = {Alexander Kozachinskiy},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {From Expanders to Hitting Distributions and Simulation Theorems},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {4:1--4:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.4},
  doi       = {10.4230/LIPIcs.MFCS.2018.4},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Kozachinskiy18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrebsMV018,
  author    = {Andreas Krebs and
               Arne Meier and
               Jonni Virtema and
               Martin Zimmermann},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Team Semantics for the Specification and Verification of Hyperproperties},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {10:1--10:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.10},
  doi       = {10.4230/LIPIcs.MFCS.2018.10},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/KrebsMV018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LamprouMSSZ18,
  author    = {Ioannis Lamprou and
               Russell Martin and
               Sven Schewe and
               Ioannis Sigalas and
               Vassilis Zissimopoulos},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Maximum Rooted Connected Expansion},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {25:1--25:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.25},
  doi       = {10.4230/LIPIcs.MFCS.2018.25},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/LamprouMSSZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Luck18,
  author    = {Martin L{\"{u}}ck},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {On the Complexity of Team Logic and Its Two-Variable Fragment},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {27:1--27:22},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.27},
  doi       = {10.4230/LIPIcs.MFCS.2018.27},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Luck18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LuoEX18,
  author    = {Kelin Luo and
               Thomas Erlebach and
               Yinfeng Xu},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Car-Sharing between Two Locations: Online Scheduling with Two Servers},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {50:1--50:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.50},
  doi       = {10.4230/LIPIcs.MFCS.2018.50},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/LuoEX18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LutzS18,
  author    = {Neil Lutz and
               Donald M. Stull},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Projection Theorems Using Effective Dimension},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {71:1--71:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.71},
  doi       = {10.4230/LIPIcs.MFCS.2018.71},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/LutzS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MadelaineM18,
  author    = {Florent R. Madelaine and
               Barnaby Martin},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Consistency for Counting Quantifiers},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {11:1--11:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.11},
  doi       = {10.4230/LIPIcs.MFCS.2018.11},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/MadelaineM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MadhusudanNRS18,
  author    = {P. Madhusudan and
               Dirk Nowotka and
               Aayush Rajasekaran and
               Jeffrey Shallit},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Lagrange's Theorem for Binary Squares},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {18:1--18:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.18},
  doi       = {10.4230/LIPIcs.MFCS.2018.18},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/MadhusudanNRS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Mehta18,
  author    = {Jenish C. Mehta},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Tree Tribes and Lower Bounds for Switching Lemmas},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {70:1--70:11},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.70},
  doi       = {10.4230/LIPIcs.MFCS.2018.70},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Mehta18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MooreNS18,
  author    = {Benjamin Moore and
               Naomi Nishimura and
               Vijay Subramanya},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Reconfiguration of Graph Minors},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {75:1--75:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.75},
  doi       = {10.4230/LIPIcs.MFCS.2018.75},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/MooreNS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MurawskiRT18,
  author    = {Andrzej S. Murawski and
               Steven J. Ramsay and
               Nikos Tzevelekos},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Polynomial-Time Equivalence Testing for Deterministic Fresh-Register
               Automata},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {72:1--72:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.72},
  doi       = {10.4230/LIPIcs.MFCS.2018.72},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/MurawskiRT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PagourtzisR18,
  author    = {Aris Pagourtzis and
               Tomasz Radzik},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed
               Radio Networks},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {80:1--80:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.80},
  doi       = {10.4230/LIPIcs.MFCS.2018.80},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/PagourtzisR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RajgopalS018,
  author    = {Ninad Rajgopal and
               Rahul Santhanam and
               Srikanth Srinivasan},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Deterministically Counting Satisfying Assignments for Constant-Depth
               Circuits with Parity Gates, with Implications for Lower Bounds},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {78:1--78:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.78},
  doi       = {10.4230/LIPIcs.MFCS.2018.78},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/RajgopalS018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Roux18,
  author    = {St{\'{e}}phane Le Roux},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Concurrent Games and Semi-Random Determinacy},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {40:1--40:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.40},
  doi       = {10.4230/LIPIcs.MFCS.2018.40},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Roux18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RyzhikovS18,
  author    = {Andrew Ryzhikov and
               Marek Szykula},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Finding Short Synchronizing Words for Prefix Codes},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {21:1--21:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.21},
  doi       = {10.4230/LIPIcs.MFCS.2018.21},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/RyzhikovS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Stull18,
  author    = {Donald M. Stull},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Results on the Dimension Spectra of Planar Lines},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {79:1--79:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.79},
  doi       = {10.4230/LIPIcs.MFCS.2018.79},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/Stull18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/X18,
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Front Matter, Table of Contents, Preface, Conference Organization},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {0:i--0:xx},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.0},
  doi       = {10.4230/LIPIcs.MFCS.2018.0},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/X18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ZschocheFMN18,
  author    = {Philipp Zschoche and
               Till Fluschnik and
               Hendrik Molter and
               Rolf Niedermeier},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {The Complexity of Finding Small Separators in Temporal Graphs},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {45:1--45:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.45},
  doi       = {10.4230/LIPIcs.MFCS.2018.45},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/ZschocheFMN18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2018,
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-086-6},
  isbn      = {978-3-95977-086-6},
  timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/2018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics