Miki Hermann

According to our database, Miki Hermann authored at least 45 papers between 1986 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

How to Find the Exit from a 3-Dimensional Maze.

Miki Hermann

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

MCP: Capturing Big Data by Satisfiability (Tool Description).

Miki Hermann, Gernot Salzer

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2019

Minimal Distance of Propositional Models.

Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer

Theory Comput. Syst., 2019

2018

On the complexity of generalized chromatic polynomials.

Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble

Adv. Appl. Math., 2018

2016

As Close as It Gets.

Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

The Next Whisky Bar.

Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer

Proceedings of the Computer Science - Theory and Applications, 2016

2015

Give Me Another One!

Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2013

Complexity of existential positive first-order logic.

Manuel Bodirsky, Miki Hermann, Florian Richoux

J. Log. Comput., 2013

2012

Trichotomies in the Complexity of Minimal Inference.

Arnaud Durand, Miki Hermann, Gustav Nordh

Theory Comput. Syst., 2012

Counting Partitions of Graphs.

Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2010

Counting complexity of propositional abduction.

Miki Hermann, Reinhard Pichler

J. Comput. Syst. Sci., 2010

The Helly property and satisfiability of Boolean formulas defined on set families.

Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer

Eur. J. Comb., 2010

2009

Complexity of counting the optimal solutions.

Miki Hermann, Reinhard Pichler

Theor. Comput. Sci., 2009

On the Computational Complexity of Monotone Constraint Satisfaction Problems.

Miki Hermann, Florian Richoux

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Trichotomy in the Complexity of Minimal Inference.

Arnaud Durand, Miki Hermann, Gustav Nordh

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

Efficient Algorithms for Description Problems over Finite Totally Ordered Domains.

Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini

SIAM J. Comput., 2008

Complexity of Clausal Constraints Over Chains.

Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer

Theory Comput. Syst., 2008

On the counting complexity of propositional circumscription.

Arnaud Durand, Miki Hermann

Inf. Process. Lett., 2008

On Boolean primitive positive clones.

Miki Hermann

Discret. Math., 2008

Counting Complexity of Minimal Cardinality and Minimal Weight Abduction.

Miki Hermann, Reinhard Pichler

Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.

Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer

Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

On the Complexity of Computing Generators of Closed Sets.

Miki Hermann, Baris Sertkaya

Proceedings of the Formal Concept Analysis, 6th International Conference, 2008

2007

Complexity of Default Logic on Generalized Conjunctive Queries.

Philippe Chapdelaine, Miki Hermann, Ilka Schnoor

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

2005

Subtractive reductions and complete problems for counting complexity classes.

Arnaud Durand, Miki Hermann, Phokion G. Kolaitis

Theor. Comput. Sci., 2005

2004

2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.

Georg Gottlob, Miki Hermann, Michaël Rusinowitch

Theory Comput. Syst., 2004

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.

Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.

Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003

The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.

Arnaud Durand, Miki Hermann

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

On the complexity of recognizing the Hilbert basis of a linear diophantine system.

Arnaud Durand, Miki Hermann, Laurent Juban

Theor. Comput. Sci., 2002

2000

Unification Algorithms Cannot Be Combined in Polynomial Time.

Miki Hermann, Phokion G. Kolaitis

Inf. Comput., 2000

1999

Computational Complexity of Simultaneous Elementary Matching Problems.

Miki Hermann, Phokion G. Kolaitis

J. Autom. Reason., 1999

On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System.

Miki Hermann, Laurent Juban, Phokion G. Kolaitis

Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

1998

On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations.

Miki Hermann, Gernot Salzer

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Unification of Infinite Sets of Terms Schematized by Primal Grammars.

Miki Hermann, Roman Galbavý

Theor. Comput. Sci., 1997

Set Operations for Recurrent Term Schematizations.

Ali Amaniss, Miki Hermann, Denis Lugiez

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups.

Miki Hermann, Phokion G. Kolaitis

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996

Complexity of Generalized Satisfiability Counting Problems.

Nadia Creignou, Miki Hermann

Inf. Comput., 1996

1995

The Complexity of Counting Problems in Equational Matching.

Miki Hermann, Phokion G. Kolaitis

J. Symb. Comput., 1995

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract).

Miki Hermann, Phokion G. Kolaitis

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1992

On the Relation Between Primitive Recursion, Schematization and Divergence.

Miki Hermann

Proceedings of the Algebraic and Logic Programming, 1992

1991

Implementations of Term Rewriting Systems.

Miki Hermann, Claude Kirchner, Hélène Kirchner

Comput. J., 1991

On Proving Properties of Completion Strategies.

Miki Hermann

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990

Chain Properties of Rule Closures.

Miki Hermann

Formal Aspects Comput., 1990

Meta-rule Synthesis from Crossed Rewrite Systems.

Hélène Kirchner, Miki Hermann

Proceedings of the Conditional and Typed Rewriting Systems, 1990

1986

On Nontermination of Knuth-Bendix Algorithm.

Miki Hermann, Igor Prívara

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986