◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

René van Bevern

Novosibirsk State University

34 papers hereh-index 191k citations75 works total

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

author position
  • sole author1
  • first author25
  • middle author6
  • last author1

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

fields
  • cs.DS15
  • cs.DM13
  • cs.DL2
  • math.OC2
  • cs.CC1
  • cs.DC1
affiliations
  • Novosibirsk State University
Homepage

identity via Semantic Scholar / OpenAlex

activity
20092026
most citedParameterized complexity of machine scheduling: 15 open problems

66 citations · 457 across the 33 of their papers we have counts for

collaborators
Showing 2013Show all

1 paper · 1 filter

cs.DM2013★ 14 cited

On the Parameterized Complexity of Computing Balanced Partitions in Graphs

René van Bevern, Andreas Emil Feldmann, Manuel Sorge +1

A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition t…

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