4 citations · 7 across the 9 of their papers we have counts for
13 papers
Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas +2
Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2…
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…
Computing and Listing Avoidable Vertices and Paths
Charis Papadopoulos, Athanasios Zisis
A simplicial vertex of a graph is a vertex whose neighborhood is a clique. It is known that listing all simplicial vertices can be done in time or time, where $O(n…
Computing Subset Feedback Vertex Set via Leafage
Charis Papadopoulos, Spyridon Tzimas
A typical example that behaves computationally different in subclasses of chordal graphs is the \textsc{Subset Feedback Vertex Set} (SFVS) problem: given a vertex-weighted graph $G…
Graph Square Roots of Small Distance from Degree One Graphs
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Given a graph class , the task of the -Square Root problem is to decide, whether an input graph has a square root from . We are inter…
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given se…