vix.ing · top · new · best · stats · spec

Weltge, Stefan

  1. The stable set problem in graphs with bounded genus and bounded odd cycle packing number
    2019/08/17 by Conforti, Michele, Fiorin, Samuel, Huynh, Tony +2 · 2 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  2. Lower Bounds on the Sizes of Integer Programs Without Additional Variables
    2013/11/13 by Kaibel, Volker, Weltge, Stefan · 1 citation
    #52Bxx #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Control (math.OC)
  3. Subgraph Polytopes and Independence Polytopes of Count Matroids
    2015/02/10 by Conforti, Michele, Kaibel, Volker, Walter, Matthias +1 · 1 citation
    #52B99 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  4. Notions of maximality for integral lattice-free polyhedra: the case of\n dimension three
    2015/09/17 by Gennadiy Averkov, Jan Krümpelmann, Averkov, Gennadiy +3 · 1 citation
    Computer Science · Engineering · #52B10 #52B20 #52C07 #90C11 #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems
  5. Characterizing Polytopes Contained in the 0/1-Cube with Bounded Chvátal-Gomory Rank
    2016/11/20 by Benchetrit, Yohann, Fiorini, Samuel, Huynh, Tony +1 · 1 citation
    #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  6. Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas
    2017/11/03 by Fiorini, Samuel, Huynh, Tony, Weltge, Stefan · 1 citation
    #90C25 #90C27 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  7. Lattice-free simplices with lattice width 2d - o(d)
    2021/11/16 by Lukas Mayrhofer, Jamico Schade, Mayrhofer, Lukas +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Control (math.OC) #Point processes and geometric inequalities
  8. Integer programs with nearly totally unimodular matrices: the cographic case
    2024/07/12 by Aprile, Manuel, Fiorini, Samuel, Joret, Gwenaël +4 · 2 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)