- Argyrios Deligkas, Reshef Meir:
Directed Graph Minors and Serial-Parallel Width. MFCS 2018: 44:1-44:14 - Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer:
A Subquadratic Algorithm for 3XOR. MFCS 2018: 59:1-59:15 - Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
On Pseudodeterministic Approximation Algorithms. MFCS 2018: 61:1-61:11 - Christian Doczkal, Damien Pous:
Treewidth-Two Graphs as a Free Algebra. MFCS 2018: 60:1-60:15 - Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick:
Pairing heaps: the forward variant. MFCS 2018: 13:1-13:14 - Titus Dose:
Balance Problems for Integer Circuits. MFCS 2018: 5:1-5:16 - Mareike Dressler, Adam Kurpisz, Timo de Wolff:
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. MFCS 2018: 82:1-82:17 - Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Largest Weight Common Subtree Embeddings with Distance Penalties. MFCS 2018: 54:1-54:15 - Manfred Droste, Erik Paul:
A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. MFCS 2018: 76:1-76:15 - Thomas Erlebach, Jakob T. Spooner:
Faster Exploration of Degree-Bounded Temporal Graphs. MFCS 2018: 36:1-36:13 - Léo Exibard, Emmanuel Filiot, Ismaël Jecker:
The Complexity of Transducer Synthesis from Multi-Sequential Specifications. MFCS 2018: 46:1-46:16 - Bill Fefferman, Shelby Kimmel:
Quantum vs. Classical Proofs and Subset Verification. MFCS 2018: 22:1-22:23 - Hendrik Fichtenberger, Yadu Vasudev:
A Two-Sided Error Distributed Property Tester For Conductance. MFCS 2018: 19:1-19:15 - Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang:
Hardness Results for Consensus-Halving. MFCS 2018: 24:1-24:16 - Lukas Fleischer, Manfred Kufleitner:
Testing Simon's congruence. MFCS 2018: 62:1-62:13 - Jakub Gajarský, Daniel Král:
Recovering Sparse Graphs. MFCS 2018: 29:1-29:15 - François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi:
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. MFCS 2018: 26:1-26:13 - Moses Ganardi, Artur Jez, Markus Lohrey:
Sliding Windows over Context-Free Languages. MFCS 2018: 15:1-15:15 - Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya:
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. MFCS 2018: 66:1-66:15 - Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka:
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). MFCS 2018: 58:1-58:16 - Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler:
Shape Recognition by a Finite Automaton Robot. MFCS 2018: 52:1-52:15 - Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. MFCS 2018: 20:1-20:16 - Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS 2018: 57:1-57:15 - Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu:
Double Threshold Digraphs. MFCS 2018: 69:1-69:12 - Yassine Hamoudi:
Simultaneous Multiparty Communication Protocols for Composed Functions. MFCS 2018: 14:1-14:15 - Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi:
Spanning-Tree Games. MFCS 2018: 35:1-35:16 - Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen:
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS 2018: 83:1-83:13 - Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. MFCS 2018: 68:1-68:13 - Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe:
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. MFCS 2018: 51:1-51:14 - Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. MFCS 2018: 17:1-17:15