Friedrich Eisenbrand

Friedrich Eisenbrand's AcademicInfluence.com Rankings

Mathematics

#4458

World Rank

#6329

Historical Rank

Operations Research

#101

World Rank

#103

Historical Rank

Measure Theory

#4117

World Rank

#4852

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Friedrich Eisenbrand Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Friedrich Eisenbrand is a German mathematician and computer scientist. He is a professor at EPFL Lausanne working in discrete mathematics, linear programming, combinatorial optimization and algorithmic geometry of numbers.

(See a Problem?)

Friedrich Eisenbrand's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

SIAM Journal on Optimization (2012) (152)
On the complexity of fixed parameter clique and dominating set (2004) (137)
Carathéodory bounds for integer cones (2006) (111)
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma (2017) (105)
NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron (1999) (101)
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard (2008) (74)
The stable set polytope of quasi-line graphs (2010) (73)
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube (1999) (72)
On Sub-determinants and the Diameter of Polyhedra (2011) (72)
EDF-schedulability of synchronous periodic task systems is coNP-hard (2010) (70)
An Algorithmic Theory of Integer Programming (2019) (65)
Fast Integer Programming in Fixed Dimension (2003) (62)
Approximating connected facility location problems via random facility sampling and core detouring (2008) (58)
Parametric Integer Programming in Fixed Dimension (2008) (56)
On largest volume simplices and sub-determinants (2014) (56)
On the Chvátal Rank of Polytopes in the 0/1 Cube (1999) (54)
Connected facility location via random facility sampling and core detouring (2010) (54)
Diameter of polyhedra: limits of abstraction (2009) (50)
New Approaches for Virtual Private Network Design (2005) (48)
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (2007) (47)
BDDs in a Branch and Cut Framework (2005) (46)
Network Formulations of Mixed-Integer Programs (2006) (44)
Faster Algorithms for Integer Programs with Block Structure (2018) (44)
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* (2003) (43)
Scheduling Periodic Tasks in a Hard Real-Time Environment (2010) (41)
0/1 Vertex and Facet Enumeration with BDDs (2007) (38)
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods (2010) (37)
Integer Programming and Algorithmic Geometry of Numbers - A tutorial (2010) (35)
Bin packing via discrepancy of permutations (2010) (33)
Covering cubes and the closest vector problem (2010) (31)
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs (2005) (30)
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph (2003) (30)
An improved approximation algorithm for virtual private network design (2005) (30)
Max-Sum Diversity Via Convex Programming (2015) (29)
Local Search for Max-Sum Diversification (2016) (28)
Packing a trunk: now with a twist! (2005) (27)
A note on non-degenerate integer programs with small sub-determinants (2016) (26)
The Support of Integer Optimal Solutions (2017) (24)
Cutting Planes and the Elementary Closure in Fixed Dimension (2001) (22)
A linear algorithm for integer programming in the plane (2005) (21)
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time (2020) (20)
Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets (2008) (19)
Integer Programming, Lattices, and Results in Fixed Dimension (2004) (18)
Fast Reduction of Ternary Quadratic Forms (2001) (17)
Fast 2-Variable Integer Programming (2001) (16)
A geometric framework for solving subsequence problems in computational biology efficiently (2007) (16)
Packing a Trunk (2003) (15)
Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality (2006) (15)
Short vectors of planar lattices via continued fractions (2001) (15)
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation (2008) (13)
Combining Logic and Optimization in Cutting Plane Theory (2000) (11)
Gomory-Chvátal cutting planes and the elementary closure of polyhedra (2000) (11)
Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems (2004) (11)
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups (2006) (11)
New Hardness Results for Diophantine Approximation (2009) (10)
Multiline Addressing by Network Flow (2006) (10)
Diversity maximization in doubling metrics (2018) (10)
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity (2020) (9)
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently (2009) (9)
Primal separation for 0/1 polytopes (2003) (9)
Testing additive integrality gaps (2010) (8)
Coloring fuzzy circular interval graphs (2009) (8)
Algorithms for longer OLED lifetime (2007) (8)
Energy-aware stage illumination (2005) (8)
Detecting directed 4-cycles still faster (2003) (7)
0/1 optimization and 0/1 primal separation are equivalent (2002) (7)
Minimizing the number of lattice points in a translated polygon (2012) (6)
A compact linear program for testing optimality of perfect matchings (2003) (6)
N-fold integer programming via LP rounding (2020) (6)
The LLL Algorithm and Integer Programming (2010) (5)
On Sub-determinants and the Diameter of Polyhedra (2014) (5)
Approximate CVPp in time 20.802n (2022) (4)
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (2010) (4)
An Improved Analysis of Local Search for Max-Sum Diversification (2019) (4)
On factor refinement in number fields (1999) (3)
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (2013) (3)
Point containment in the integer hull of a polyhedron (2004) (3)
Approximate CVPp in Time 20.802 n (2020) (3)
A QPTAS for stabbing rectangles (2021) (2)
Metric learning for kernel ridge regression: assessment of molecular similarity (2022) (2)
Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings (2010) (2)
On the complexity of computing Kronecker coecients and deciding positivity of Littlewood-Richardson coecients (2008) (2)
A Faster Algorithm for Two-Variable Integer Programming (2003) (2)
On the complexity of integer programming in fixed dimension (2005) (1)
Integer Points in a Parameterised Polyhedron (2007) (1)
From approximate to exact integer programming (2022) (1)
Algorithms for Integer Programming (2008) (1)
The Euclidean Algorithm (2011) (1)
Testing additive integrality gaps (2012) (0)
Approximate $\mathrm{CVP}_{p}$ in time $2^{0.802 \, n}$ (2020) (0)
Integer Programming and Combinatorial Optimization (2017) (0)
These are notes of my course Discrete Optimization. They are constantly updated. (2015) (0)
D M ] 2 J ul 2 01 5 Node-balancing by edge-increments (2015) (0)
Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization (2010) (0)
D M ] 2 F eb 2 01 2 Bin Packing via Discrepancy of Permutations ∗ (2021) (0)
A method of driving matrix displays (2005) (0)
Introduction to Discrete Optimization Spring 2009 Solutions 2 (2009) (0)
Approximate $\mathrm{CVP}_{\infty}$ in time $2^{0.802 \, n}$ (2020) (0)
BDDs in a Branch & Cut Framework ? (2005) (0)
INTERNATIONAL SCHOOL OF MATHEMATICS «GUIDO STAMPACCHIA» 56th Workshop: GRAPH THEORY, ALGORITHMS AND APPLICATIONS (2008) (0)
Pope Gregory , the Calendar , and Continued Fractions (2012) (0)
Node-Balancing by Edge-Increments (2015) (0)
Real-time Avionics Optimization (2011) (0)
Packing a Truck - Now with a Twist! (2007) (0)
Discrete Optimization Spring 2010 Solutions 4 (2010) (0)
Recent Hardness Results for Periodic Uni-processor Scheduling (2010) (0)
On factor refinement in quadratic number fields (1997) (0)
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (2013) (0)

This paper list is powered by the following services:

Other Resources About Friedrich Eisenbrand

en.wikipedia.org

What Schools Are Affiliated With Friedrich Eisenbrand?

Friedrich Eisenbrand is affiliated with the following schools:

Friedrich Eisenbrand's Academic­Influence.com Rankings

Why Is Friedrich Eisenbrand Influential?

Friedrich Eisenbrand's Published Works

Published Works

Other Resources About Friedrich Eisenbrand

What Schools Are Affiliated With Friedrich Eisenbrand?

Image Attributions

Friedrich Eisenbrand's AcademicInfluence.com Rankings