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:

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

Sounaka Mishra, Kripasindhu Sikdar

RAIRO-Theor. Inf. Appl., 35 3 (2001) 287-309

Published online: 2002-04-15

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

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

(In)approximability of maximum minimal FVS

Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis and Nikolaos Melissinos
Journal of Computer and System Sciences 124 26 (2022)
https://doi.org/10.1016/j.jcss.2021.09.001

Upper paired domination in graphs

Huiqin Jiang, Pu Wu, Jingzhong Zhang and Yongsheng Rao
AIMS Mathematics 7 (1) 1185 (2021)
https://doi.org/10.3934/math.2022069

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel and Henning Fernau
Discrete Applied Mathematics 280 23 (2020)
https://doi.org/10.1016/j.dam.2019.10.005

Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikoalei, Jérôme Monnot and Florian Sikora
11485 124 (2019)
https://doi.org/10.1007/978-3-030-17402-6_11

Algorithms and Discrete Applied Mathematics

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel and Henning Fernau
Lecture Notes in Computer Science, Algorithms and Discrete Applied Mathematics 9602 61 (2016)
https://doi.org/10.1007/978-3-319-29221-2_6