Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Efficiently enumerating hitting sets of hypergraphs arising in data profiling

Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks and Martin Schirneck
Journal of Computer and System Sciences 124 192 (2022)
https://doi.org/10.1016/j.jcss.2021.10.002

Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem

Victor Lagerkvist and Biman Roy
Journal of Computer and System Sciences 117 23 (2021)
https://doi.org/10.1016/j.jcss.2020.10.004

A complexity theory for hard enumeration problems

Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek and Heribert Vollmer
Discrete Applied Mathematics 268 191 (2019)
https://doi.org/10.1016/j.dam.2019.02.025

Parameterised Enumeration for Modification Problems

Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive and Heribert Vollmer
Algorithms 12 (9) 189 (2019)
https://doi.org/10.3390/a12090189

Language and Automata Theory and Applications

Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek and Heribert Vollmer
Lecture Notes in Computer Science, Language and Automata Theory and Applications 10168 183 (2017)
https://doi.org/10.1007/978-3-319-53733-7_13

Paradigms for Parameterized Enumeration

Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt and Heribert Vollmer
Theory of Computing Systems 60 (4) 737 (2017)
https://doi.org/10.1007/s00224-016-9702-4

Language and Automata Theory and Applications

Nadia Creignou, Raïda Ktari, Arne Meier, et al.
Lecture Notes in Computer Science, Language and Automata Theory and Applications 8977 524 (2015)
https://doi.org/10.1007/978-3-319-15579-1_41

Mathematical Foundations of Computer Science 2013

Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt and Heribert Vollmer
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2013 8087 290 (2013)
https://doi.org/10.1007/978-3-642-40313-2_27

Theory and Applications of Satisfiability Testing - SAT 2011

Nadia Creignou, Frédéric Olive and Johannes Schmidt
Lecture Notes in Computer Science, Theory and Applications of Satisfiability Testing - SAT 2011 6695 120 (2011)
https://doi.org/10.1007/978-3-642-21581-0_11

Computer Science Logic

Elmar Böhler, Edith Hemaspaandra, Steffen Reith and Heribert Vollmer
Lecture Notes in Computer Science, Computer Science Logic 2471 412 (2002)
https://doi.org/10.1007/3-540-45793-3_28

Logic Programming and Nonmotonic Reasoning

Leferis M. Kirousis and Phokion G. Kolaitis
Lecture Notes in Computer Science, Logic Programming and Nonmotonic Reasoning 2173 42 (2001)
https://doi.org/10.1007/3-540-45402-0_3

Mathematical Foundations of Computer Science 2000

Steffen Reith and Heribert Vollmer
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2000 1893 640 (2000)
https://doi.org/10.1007/3-540-44612-5_59