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):

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Andreas Emil Feldmann, Karthik C. Karthik C. S., Euiwoong Lee and Pasin Manurangsi
Algorithms 13 (6) 146 (2020)
DOI: 10.3390/a13060146
See this article

Approximation and Online Algorithms

Vladimir Shenmaier
Lecture Notes in Computer Science, Approximation and Online Algorithms 10787 41 (2018)
DOI: 10.1007/978-3-319-89441-6_4
See this article

Algorithms and Complexity

René van Bevern, Oxana Yu. Tsidulko and Philipp Zschoche
Lecture Notes in Computer Science, Algorithms and Complexity 11485 62 (2019)
DOI: 10.1007/978-3-030-17402-6_6
See this article

Computing and Combinatorics

Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, et al.
Lecture Notes in Computer Science, Computing and Combinatorics 10976 751 (2018)
DOI: 10.1007/978-3-319-94776-1_62
See this article

NP-completeness of cell formation problem with grouping efficacy objective

Mikhail V. Batsyn, Ekaterina K. Batsyna and Ilya S. Bychkov
International Journal of Production Research 58 (20) 6159 (2020)
DOI: 10.1080/00207543.2019.1668072
See this article

Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron and Nimrod Talmon
Theoretical Computer Science 814 86 (2020)
DOI: 10.1016/j.tcs.2020.01.017
See this article

Voting on multi-issue domains with conditionally lexicographic preferences

Jérôme Lang, Jérôme Mengin and Lirong Xia
Artificial Intelligence 265 18 (2018)
DOI: 10.1016/j.artint.2018.05.004
See this article

Parameterized complexity of abduction in Schaefer’s framework

Yasir Mahmood, Arne Meier and Johannes Schmidt
Journal of Logic and Computation 31 (1) 266 (2021)
DOI: 10.1093/logcom/exaa079
See this article

Representative families for matroid intersections, with applications to location, packing, and covering problems

René van Bevern, Oxana Yu. Tsidulko and Philipp Zschoche
Discrete Applied Mathematics 298 110 (2021)
DOI: 10.1016/j.dam.2021.03.014
See this article