◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Charis Papadopoulos

13 papers hereh-index 15554 citations56 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • middle author4
  • last author5

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • cs.DS12
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20052026
most citedPolynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs

4 citations · 7 across the 9 of their papers we have counts for

collaborators
Showing 2025 · cs.DSShow all

1 paper · 2 filters

cs.DS2025

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.