| 2024 | IJCAI | Primal Grammars Driven Automated Induction. | Adel Bouhoula, Miki Hermann |
| 2021 | SAT | MCP: Capturing Big Data by Satisfiability (Tool Description). | Miki Hermann, Gernot Salzer |
| 2016 | CSR | The Next Whisky Bar. | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2016 | WALCOM | As Close as It Gets. | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2015 | ISAAC | Give Me Another One! | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2012 | ISAAC | Counting Partitions of Graphs. | Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi |
| 2009 | CiE | Complexity of Existential Positive First-Order Logic. | Manuel Bodirsky, Miki Hermann, Florian Richoux |
| 2009 | LICS | Trichotomy in the Complexity of Minimal Inference. | Arnaud Durand, Miki Hermann, Gustav Nordh |
| 2009 | WALCOM | On the Computational Complexity of Monotone Constraint Satisfaction Problems. | Miki Hermann, Florian Richoux |
| 2008 | COCOON | Complexity of Counting the Optimal Solutions. | Miki Hermann, Reinhard Pichler |
| 2008 | ICFCA | On the Complexity of Computing Generators of Closed Sets. | Miki Hermann, Baris Sertkaya |
| 2008 | JELIA | Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. | Miki Hermann, Reinhard Pichler |
| 2007 | IJCAI | Counting Complexity of Propositional Abduction. | Miki Hermann, Reinhard Pichler |
| 2007 | LPNMR | Complexity of Default Logic on Generalized Conjunctive Queries. | Philippe Chapdelaine, Miki Hermann, Ilka Schnoor |
| 2004 | CADE | Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. | ngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini |
| 2004 | SAT | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 2004 | SAT | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 2003 | STACS | The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. | Arnaud Durand, Miki Hermann |
| 2000 | MFCS | Subtractive Reductions and Complete Problems for Counting Complexity Classes. | Arnaud Durand, Miki Hermann, Phokion G. Kolaitis |
| 1999 | LPAR | On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. | Miki Hermann, Laurent Juban, Phokion G. Kolaitis |
| 1999 | MFCS | On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. | Arnaud Durand, Miki Hermann, Laurent Juban |
| 1998 | MFCS | On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. | Miki Hermann, Gernot Salzer |
| 1997 | CP | On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. | Miki Hermann, Phokion G. Kolaitis |
| 1996 | CADE | Unification Algorithms Cannot be Combined in Polynomial Time. | Miki Hermann, Phokion G. Kolaitis |
| 1995 | MFCS | Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). | Miki Hermann, Phokion G. Kolaitis |
| 1994 | CADE | The Complexity of Counting Problems in Equational Matching. | Miki Hermann, Phokion G. Kolaitis |
| 1989 | STACS | Chain Properties of Rule Closures. | Miki Hermann |
| 1986 | ICALP | On Nontermination of Knuth-Bendix Algorithm. | Miki Hermann, Igor Prvara |