@inproceedings{bf5b0f117de5459f8d1e41847c1d9b32,

title = "Maximum covering with D-cliques",

abstract = "Given a graph G = (V, E), we consider the problem to find a set of D pairwise disjoint cliques in it with maximum overall number of vertices. We determine the computational complexity of this problem restricted to a variety of different graph classes. We give polynomial time algorithms for the problem restricted to interval graphs, bipartite graphs, cographs, directed path graphs and partial k-trees. In contrast, we show the NP-completeness for undirected path graphs.",

author = "K. Jansen and P. Scheffler and G.J. Woeginger",

year = "1993",

doi = "10.1007/3-540-57163-9_27",

language = "English",

isbn = "978-3-540-57163-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "319--328",

editor = "Z. {\'E}sik",

booktitle = "Fundamentals of Computation Theory : Proceedings 9th International Conference, FCT'93, Szeged, Hungary, August 23-27, 1993",

address = "Germany",

note = "9th International Conference Fundamentals of Computer Science (FCT'93), August 23-27, 1993, Szeged, Hungary, FCT'93 ; Conference date: 23-08-1993 Through 27-08-1993",

}