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:

This article has been cited by the following article(s):

The complexity of minimal satisfiability problems

Lefteris M. Kirousis and Phokion G. Kolaitis
Information and Computation 187 (1) 20 (2003)
DOI: 10.1016/S0890-5401(03)00037-3
See this article

Complexity of Constraints

Henning Schnoor and Ilka Schnoor
Lecture Notes in Computer Science, Complexity of Constraints 5250 229 (2008)
DOI: 10.1007/978-3-540-92800-3_9
See this article

Tractability in constraint satisfaction problems: a survey

Clément Carbonnel and Martin C. Cooper
Constraints 21 (2) 115 (2016)
DOI: 10.1007/s10601-015-9198-6
See this article

Optimal satisfiability for propositional calculi and constraint satisfaction problems

Steffen Reith and Heribert Vollmer
Information and Computation 186 (1) 1 (2003)
DOI: 10.1016/S0890-5401(03)00092-0
See this article

Gap theorems for robust satisfiability: Boolean CSPs and beyond

Lucy Ham
Theoretical Computer Science 676 69 (2017)
DOI: 10.1016/j.tcs.2017.03.006
See this article

The complexity of surjective homomorphism problems—a survey

Manuel Bodirsky, Jan Kára and Barnaby Martin
Discrete Applied Mathematics 160 (12) 1680 (2012)
DOI: 10.1016/j.dam.2012.03.029
See this article

On unique graph 3-colorability and parsimonious reductions in the plane

Régis Barbanchon
Theoretical Computer Science 319 (1-3) 455 (2004)
DOI: 10.1016/j.tcs.2004.02.003
See this article

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)
DOI: 10.1007/s00224-016-9702-4
See this article

Complexity of Constraints

Nadia Creignou and Heribert Vollmer
Lecture Notes in Computer Science, Complexity of Constraints 5250 3 (2008)
DOI: 10.1007/978-3-540-92800-3_2
See this article

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)
DOI: 10.1007/978-3-319-53733-7_13
See this article

Structural tractability of enumerating CSP solutions

Gianluigi Greco and Francesco Scarcello
Constraints 18 (1) 38 (2013)
DOI: 10.1007/s10601-012-9129-8
See this article

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)
DOI: 10.1007/978-3-642-21581-0_11
See this article

Hannes Uppman
7514 38 (2012)
DOI: 10.1007/978-3-642-33558-7_6
See this article

Incremental delay enumeration: Space and time

Florent Capelli and Yann Strozecki
Discrete Applied Mathematics 268 179 (2019)
DOI: 10.1016/j.dam.2018.06.038
See this article

SIGACT news complexity theory column 34

Lane A. Hemaspaandra
ACM SIGACT News 32 (4) 24 (2001)
DOI: 10.1145/568425.568432
See this article

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)
DOI: 10.1016/j.dam.2019.02.025
See this article

SIGACT news complexity theory column 43

Lane A. Hemaspaandra
ACM SIGACT News 35 (1) 22 (2004)
DOI: 10.1145/970831.970840
See this article

L.M. Kirousis and P.G. Lolaitis
71 (2001)
DOI: 10.1109/LICS.2001.932484
See this article

Steffen Reith and Heribert Vollmer
1893 640 (2000)
DOI: 10.1007/3-540-44612-5_59
See this article

Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt and Heribert Vollmer
8087 290 (2013)
DOI: 10.1007/978-3-642-40313-2_27
See this article

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)
DOI: 10.1016/j.jcss.2020.10.004
See this article

Henning Schnoor and Ilka Schnoor
4393 694 (2007)
DOI: 10.1007/978-3-540-70918-3_59
See this article

Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive and Heribert Vollmer
8977 524 (2015)
DOI: 10.1007/978-3-319-15579-1_41
See this article

Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs

Gregor Matl and Stanislav Živný
Algorithmica 82 (12) 3492 (2020)
DOI: 10.1007/s00453-020-00735-1
See this article

Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One

Marcel Wild
The Computer Journal (2021)
DOI: 10.1093/comjnl/bxaa142
See this article

Elmar Böhler, Edith Hemaspaandra, Steffen Reith and Heribert Vollmer
2471 412 (2002)
DOI: 10.1007/3-540-45793-3_28
See this article

Heribert Vollmer
4497 748 (2007)
DOI: 10.1007/978-3-540-73001-9_80
See this article

Incremental FPT Delay

Arne Meier
Algorithms 13 (5) 122 (2020)
DOI: 10.3390/a13050122
See this article

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)
DOI: 10.3390/a12090189
See this article

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt and Hannes Uppman
8635 408 (2014)
DOI: 10.1007/978-3-662-44465-8_35
See this article

Enumerating models of DNF faster: Breaking the dependency on the formula size

Florent Capelli and Yann Strozecki
Discrete Applied Mathematics (2020)
DOI: 10.1016/j.dam.2020.02.014
See this article

Elmar Böhler, Edith Hemaspaandra, Steffen Reith and Heribert Vollmer
2996 164 (2004)
DOI: 10.1007/978-3-540-24749-4_15
See this article

Leferis M. Kirousis and Phokion G. Kolaitis
2173 42 (2001)
DOI: 10.1007/3-540-45402-0_3
See this article