◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Stefan Weltge

34 papers hereh-index 11404 citations44 works total

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

author position
  • first author1
  • middle author4
  • last author27

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

fields
  • math.CO13
  • cs.DM11
  • math.OC9
  • cs.DS1
same name
  • Stefan Weltge — 4 papers, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20132026
most citedA Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially

31 citations · 56 across the 21 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

math.OC2016

Characterizing Polytopes Contained in the 0/1-Cube with Bounded Chvátal-Gomory Rank

Yohann Benchetrit, Samuel Fiorini, Tony Huynh +1

Let S⊆{0,1}n and R be any polytope contained in [0,1]n with R∩{0,1}n=S. We prove that R has bounded Chvátal-Gomory rank (CG-rank) provided that $S…

math.OC2016

Optimality certificates for convex minimization and Helly numbers

Amitabh Basu, Michele Conforti, Gérard Cornuéjols +2

We consider the problem of minimizing a convex function over a subset of R^n that is not necessarily convex (minimization of a convex function over the integer points in a polytope…

math.OC2016

Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes

Gennadiy Averkov, Volker Kaibel, Stefan Weltge

We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its mem…

math.CO2016

Tight bounds on discrete quantitative Helly numbers

Gennadiy Averkov, Bernardo González Merino, Matthias Henze +2

Given a subset S of R^n, let c(S,k) be the smallest number t such that whenever finitely many convex sets have exactly k common points in S, there exist at most t of these sets tha…

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