Friedrich Eisenbrand

From MaRDI portal
Person:378117

Available identifiers

zbMath Open eisenbrand.friedrichWikidataQ1458947 ScholiaQ1458947MaRDI QIDQ378117

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61473562024-01-15Paper
Forall-exist statements in pseudopolynomial time2023-11-13Paper
From approximate to exact integer programming2023-11-09Paper
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity2023-09-20Paper
Approximate CVP_p in Time 2^{0.802 n}2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q50910242022-07-21Paper
Approximate CVP\(_p\) in time \(2^{0.802n}\)2021-11-25Paper
Faster Algorithms for Integer Programs with Block Structure2021-07-28Paper
An Improved Analysis of Local Search for Max-Sum Diversification2020-04-30Paper
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma2019-12-02Paper
0/1 vertex and facet enumeration with BDDs2019-09-11Paper
Minimizing the number of lattice points in a translated polygon2019-05-15Paper
A note on non-degenerate integer programs with small sub-determinants2019-01-11Paper
The Support of Integer Optimal Solutions2018-08-03Paper
Local Search for Max-Sum Diversification2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46079342018-03-15Paper
Max-sum diversity via convex programming2018-01-30Paper
https://portal.mardi4nfdi.de/entity/Q45890312017-11-06Paper
Energy-aware stage illumination2017-10-20Paper
Diameter of polyhedra2017-10-20Paper
On largest volume simplices and sub-determinants2017-10-05Paper
Bin Packing via Discrepancy of Permutations2017-09-29Paper
Geometric random edge2017-07-21Paper
Node-Balancing by Edge-Increments2015-11-19Paper
https://portal.mardi4nfdi.de/entity/Q55013552015-08-03Paper
Bin Packing via Discrepancy of Permutations2014-12-05Paper
https://portal.mardi4nfdi.de/entity/Q29217602014-10-13Paper
On sub-determinants and the diameter of polyhedra2014-09-19Paper
On sub-determinants and the diameter of polyhedra2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q54176862014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54177022014-05-22Paper
Algorithms for longer OLED lifetime2014-04-01Paper
Covering cubes and the closest vector problem2014-03-24Paper
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes2013-11-28Paper
Testing additive integrality gaps2013-11-11Paper
Coloring Fuzzy Circular Interval Graphs2013-10-10Paper
Pope Gregory, the calendar, and continued fractions2013-04-17Paper
Coloring fuzzy circular interval graphs2012-05-04Paper
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps2011-06-24Paper
Parametric Integer Programming in Fixed Dimension2011-04-27Paper
Network Formulations of Mixed-Integer Programs2011-04-27Paper
Diameter of Polyhedra: Limits of Abstraction2011-04-27Paper
Connected facility location via random facility sampling and core detouring2010-10-07Paper
Scheduling Periodic Tasks in a Hard Real-Time Environment2010-09-07Paper
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods2010-09-06Paper
https://portal.mardi4nfdi.de/entity/Q35794592010-08-06Paper
Integer Programming and Algorithmic Geometry of Numbers2010-06-03Paper
The LLL Algorithm and Integer Programming2010-03-05Paper
Algorithms - ESA 20032010-03-03Paper
Algorithms - ESA 20032010-03-03Paper
New Hardness Results for Diophantine Approximation2009-10-28Paper
Algorithms and Computation2009-08-07Paper
Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently2009-07-06Paper
Multiline addressing by network flow2009-05-06Paper
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations2009-04-29Paper
Detecting directed 4-cycles still faster2009-04-28Paper
Convexly independent subsets of the Minkowski sum of planar point sets2009-04-07Paper
https://portal.mardi4nfdi.de/entity/Q36028892009-02-12Paper
The stable set polytope of quasi-line graphs2008-10-21Paper
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation2008-08-28Paper
ENERGY-AWARE STAGE ILLUMINATION2008-08-26Paper
New Approaches for Virtual Private Network Design2008-06-19Paper
PACKING A TRUCK — NOW WITH A TWIST!2008-05-20Paper
Carathéodory bounds for integer cones2008-03-28Paper
Multiline Addressing by Network Flow2008-03-11Paper
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations2007-09-03Paper
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs2007-08-30Paper
https://portal.mardi4nfdi.de/entity/Q52920862007-06-19Paper
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups2007-05-02Paper
Automata, Languages and Programming2006-01-10Paper
Experimental and Efficient Algorithms2005-11-30Paper
Cutting Planes and the Elementary Closure in Fixed Dimension2005-11-11Paper
A linear algorithm for integer programming in the plane2005-04-19Paper
On the complexity of fixed parameter clique and dominating set2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48290312004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q44713382004-07-28Paper
Bounds on the Chvatal rank of polytopes in the 0/1-cube2003-12-14Paper
A compact linear program for testing optimality of perfect matchings.2003-11-25Paper
Primal separation for 0/1 polytopes2003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q47871972003-01-09Paper
Short vectors of planar lattices via continued fractions2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q45377372002-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42637082001-06-26Paper
On the Chvátal rank of polytopes in the 0/1 cube2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q45188602000-12-03Paper
On the membership problem for the elementary closure of a polyhedron1999-12-08Paper
On factor refinement in number fields1998-12-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Friedrich Eisenbrand