Eisenbrand, Friedrich
- Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma
2017/07/03 by Eisenbrand, Friedrich, Weismantel, Robert · 3 citations
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Parametric Integer Programming in Fixed Dimension
2008/01/28 by Eisenbrand, Friedrich, Shmonin, Gennady · 2 citations
#90C10 #FOS: Mathematics #Optimization and Control (math.OC)
- On largest volume simplices and sub-determinants
2014/06/13 by Di Summa, Marco, Eisenbrand, Friedrich, Faenza, Yuri +1 · 2 citations
#Computational Geometry (cs.CG) #FOS: Computer and information sciences
- An Algorithmic Theory of Integer Programming
2019/04/02 by Friedrich Eisenbrand, Eisenbrand, Friedrich, Christoph Hunkenschröder +9 · 3 citations
Computer Science · Mathematics · #15A #52B #52C #68Q #68R #68W #90B #90C #Advanced Graph Theory Research #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.1.6 #Optimization and Control (math.OC)
- A Note on Non-Degenerate Integer Programs with Small Sub-Determinants
2016/03/31 by Stephan Artmann, Artmann, Stephan, Friedrich Eisenbrand +9 · 1 citation
Computer Science · Mathematics · #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods #Optimization and Control (math.OC) #Optimization and Search Problems
- Faster Algorithms for Integer Programs with Block Structure
2018/02/17 by Eisenbrand, Friedrich, Hunkenschröder, Christoph, Klein, Kim-Manuel · 1 citation
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- On sub-determinants and the diameter of polyhedra
2011/08/22 by Nicolas Bonifas, Bonifas, Nicolas, Marco Di Summa +7 · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Point processes and geometric inequalities
- Forall-exist statements in pseudopolynomial time
2023/11/13 by Eleonore Bach, Bach, Eleonore, Friedrich Eisenbrand +3 · 2 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Computational Geometry and Mesh Generation #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation
- A QPTAS for stabbing rectangles
2021/07/14 by Friedrich Eisenbrand, Eisenbrand, Friedrich, Martina Gallato +5 · 1 citation
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #Digital Image Processing Techniques #FOS: Computer and information sciences
- Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
2020/12/21 by Cslovjecsek, Jana, Eisenbrand, Friedrich, Pilipczuk, Michał +2 · 1 citation
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)