1 citations · 1 across the 3 of their papers we have counts for
5 papers
Algorithms and Complexity of Hedge Cluster Deletion Problems
Athanasios L. Konstantinidis, Charis Papadopoulos, Georgios Velissaris
A hedge graph is a graph whose edge set has been partitioned into groups called hedges. Here we consider a generalization of the well-known \textsc{Cluster Deletion} problem, named…
Inferring Tie Strength in Temporal Networks
Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano
Inferring tie strengths in social networks is an essential task in social network analysis. Common approaches classify the ties as wea} and strong ties based on the strong triadic…
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…
Parameterized Aspects of Strong Subgraph Closure
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis +2
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized…
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
Athanasios Konstantinidis, Charis Papadopoulos
In social networks the {\sc Strong Triadic Closure} is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong ed…