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:

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe, Holger Spakowski

RAIRO-Theor. Inf. Appl., 40 1 (2006) 75-91

Published online: 2005-10-15

DOI: https://doi.org/10.1051/ita:2005041

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

Stability, Vertex Stability, and Unfrozenness for Special Graph Classes

Frank Gurski, Jörg Rothe and Robin Weishaupt
Theory of Computing Systems 68 (1) 75 (2024)
https://doi.org/10.1007/s00224-023-10149-5

Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games

Anja Rey, Jörg Rothe, Hilmar Schadrack and Lena Schend
Annals of Mathematics and Artificial Intelligence 77 (3-4) 317 (2016)
https://doi.org/10.1007/s10472-015-9461-y

The Complexity of Computing Minimal Unidirectional Covering Sets

Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann and Jörg Rothe
Theory of Computing Systems 53 (3) 467 (2013)
https://doi.org/10.1007/s00224-012-9437-9