 | 2012 |
| 14 |  | Yijia Chen,
Jörg Flum,
Moritz Müller:
Hard Instances of Algorithms and Proof Systems.
CiE 2012: 118-128 |
| 13 |  | Jörg Flum,
Moritz Müller:
Some definitorial suggestions for parameterized proof complexity.
Electronic Colloquium on Computational Complexity (ECCC) 19: 18 (2012) |
| 2011 |
| 12 |  | Yijia Chen,
Jörg Flum,
Moritz Müller:
Consistency and Optimality.
CiE 2011: 61-70 |
| 11 |  | Yijia Chen,
Jörg Flum,
Moritz Müller:
Hard instances of algorithms and proof systems.
Electronic Colloquium on Computational Complexity (ECCC) 18: 85 (2011) |
| 10 |  | Sam Buss,
Yijia Chen,
Jörg Flum,
Sy-David Friedman,
Moritz Müller:
Strong isomorphism reductions in complexity theory.
J. Symb. Log. 76(4): 1381-1402 (2011) |
| 9 |  | Yijia Chen,
Jörg Flum,
Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures.
Theory Comput. Syst. 48(4): 803-839 (2011) |
| 2010 |
| 8 |  | Michael R. Fellows,
Jörg Flum,
Danny Hermelin,
Moritz Müller,
Frances A. Rosamond:
W-Hierarchies Defined by Symmetric Gates.
Theory Comput. Syst. 46(2): 311-339 (2010) |
| 2009 |
| 7 |  | Yijia Chen,
Jörg Flum,
Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures.
CiE 2009: 118-128 |
| 2008 |
| 6 |  | Michael R. Fellows,
Danny Hermelin,
Moritz Müller,
Frances A. Rosamond:
A Purely Democratic Characterization of W[1].
IWPEC 2008: 103-114 |
| 5 |  | Moritz Müller:
Parameterized Derandomization.
IWPEC 2008: 148-159 |
| 4 |  | Moritz Müller:
Valiant-Vazirani Lemmata for Various Logics.
Electronic Colloquium on Computational Complexity (ECCC) 15(063): (2008) |
| 2007 |
| 3 |  | Iris van Rooij,
Matthew Hamilton,
Moritz Müller,
Todd Wareham:
Approximating Solution Structure.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 2 |  | Yijia Chen,
Jörg Flum,
Moritz Müller:
Lower Bounds for Kernelizations.
Electronic Colloquium on Computational Complexity (ECCC) 14(137): (2007) |
| 2006 |
| 1 |  | Moritz Müller:
Randomized Approximations of Parameterized Counting Problems.
IWPEC 2006: 50-59 |