( en | de | ru )

 

Disambiguation of "Eisenbrand, Friedrich"

Author of the publication

copydeleteadd this publication to your clipboard
N-fold integer programming via LP rounding.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Friedrich Eisenbrand

Erich Eisenbrand

Gerhard Eisenbrand

Fabian Eisenbrand

Gudrun Eisenbrand

 

Other publications of authors with the same name

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 137-150. Springer, (1999)A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 246-257. Springer, (2008)Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods., , , , , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 11-22. Springer, (2010)A Faster Algorithm for Two-Variable Integer Programming., and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 290-299. Springer, (2003)Minimizing the number of lattice points in a translated polygon., and . SODA, page 1123-1130. SIAM, (2013)Diversity Maximization in Doubling Metrics., , and . ISAAC, volume 123 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time., , , , and . SODA, page 1666-1681. SIAM, (2021)Diameter of polyhedra: limits of abstraction., , and . SCG, page 386-392. ACM, (2009)A compact linear program for testing optimality of perfect matchings., and . Oper. Res. Lett., 31 (3): 429-434 (2003)Der Euklidische Algorithmus.. Taschenbuch der Algorithmen, Springer, (2008)