◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Polykarpos Meladianos

5 papers hereh-index 13825 citations21 works total

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

author position
  • middle author5

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

fields
  • cs.CL2
  • cs.CV1
  • cs.DS1
  • cs.LG1

identity via Semantic Scholar / OpenAlex

activity
20162018
most citedUnsupervised Abstractive Meeting Summarization with Multi-Sentence Compression and Budgeted Submodular Maximization

16 citations · 24 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2016

K-clique-graphs for Dense Subgraph Discovery

G. Nikolentzos, P. Meladianos, Y. Stavrakas +1

Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finan…

◍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.