Article references

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:

The disjoint cliques problem

Klaus Jansen, Petra Scheffler, Gerhard Woeginger

RAIRO-Oper. Res., 31 1 (1997) 45-66

Published online: 2017-02-10

DOI: https://doi.org/10.1051/ro/1997310100451

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

Maximum Coverage by k Lines

Chaeyoon Chung, Antoine Vigneron and Hee-Kap Ahn
Symmetry 16 (2) 206 (2024)
https://doi.org/10.3390/sym16020206

Polyhedral properties of the induced cluster subgraphs

Seyedmohammadhossein Hosseinian and Sergiy Butenko
Discrete Applied Mathematics 297 80 (2021)
https://doi.org/10.1016/j.dam.2021.02.040

The maximum independent union of cliques problem: complexity and exact approaches

Zeynep Ertem, Eugene Lykhovyd, Yiming Wang and Sergiy Butenko
Journal of Global Optimization 76 (3) 545 (2020)
https://doi.org/10.1007/s10898-018-0694-2

Graph-Theoretic Concepts in Computer Science

Ivan Bliznets and Danil Sagunov
Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 11789 148 (2019)
https://doi.org/10.1007/978-3-030-30786-8_12

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner, Christian Komusiewicz, Hannes Moser and Rolf Niedermeier
Theory of Computing Systems 47 (1) 196 (2010)
https://doi.org/10.1007/s00224-008-9150-x

Modelling, Computation and Optimization in Information Systems and Management Sciences

Deniss Kumlander
Communications in Computer and Information Science, Modelling, Computation and Optimization in Information Systems and Management Sciences 14 165 (2008)
https://doi.org/10.1007/978-3-540-87477-5_18

A branch-and-price approach for the maximum weight independent set problem

Deepak Warrier, Wilbert E. Wilhelm, Jeffrey S. Warren and Illya V. Hicks
Networks 46 (4) 198 (2005)
https://doi.org/10.1002/net.20088