◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniel Štefankovič

50 papers hereh-index 312.8k citations120 works total

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

author position
  • first author5
  • middle author28
  • last author17

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

fields
  • cs.CC13
  • cs.DS11
  • cs.DM10
  • cs.LG5
  • math.PR5
  • q-bio.PE2

identity via Semantic Scholar / OpenAlex

activity
20062026
most citedInapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

124 citations · 275 across the 42 of their papers we have counts for

collaborators
Showing 2010 · cs.CCShow all

1 paper · 2 filters

cs.CC2010

The Complexity of Counting Eulerian Tours in 4-Regular Graphs

Qi Ge, Daniel Stefankovic

We investigate the complexity of counting Eulerian tours ({\sc #ET}) and its variations from two perspectives---the complexity of exact counting and the complexity w.r.t. approxima…

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