4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2019
Cluster Deletion on Interval Graphs and Split Related Graphs
Athanasios L. Konstantinidis, Charis Papadopoulos
In the {\sc Cluster Deletion} problem the goal is to remove the minimum number of edges of a given graph, such that every connected component of the resulting graph constitutes a c…
cs.DS2017★ 4 cited
Polynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs
Charis Papadopoulos, Spyridon Tzimas
Given a vertex-weighted graph and a set , a subset feedback vertex set is a set of the vertices of such that the graph induced by h…
cs.DM2005
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs
Stavros D. Nikolopoulos, Charis Papadopoulos
In this paper we examine the classes of graphs whose -complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $…