Publications

2019

The covering radius and a discrete surface area for non-hollow simplices

G. Codenotti; F. Santos; M. Schymura

2019-03-07.

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

I. Malinovic / F. Eisenbrand; Y. Faenza (Dir.)

Lausanne, EPFL, 2019.

DOI : 10.5075/epfl-thesis-9277.

2018

On some problems related to 2-level polytopes

M. F. Aprile / F. Eisenbrand; Y. Faenza (Dir.)

EPFL, 2018-11-23.

On compact representations of Voronoi cells of lattices

C. Hunkenschröder; G. Reuland; M. Schymura

2018-11-20.

Lonely Runner Polyhedra

M. Beck; S. Hosten; M. Schymura

Integers. 2018-09-04.

A PTAS for the Time-Invariant Incremental Knapsack Problem, Combinatorial Optimization

Y. Faenza; I. Malinovic

Lecture Notes in Computer Science. 2018-07-18.

DOI : 10.1007/978-3-319-96151-4_14.

On Bounded Pitch Inequalities for the Min-Knapsack Polytope, Combinatorial Optimization

Y. Faenza; I. Malinović; M. Mastrolilli; O. Svensson

Lecture Notes in Computer Science. 2018-07-18.

DOI : 10.1007/978-3-319-96151-4_15.

Der einsame Läufer

M. Schymura; J. M. Wills

Mitteilungen der Deutschen Mathematiker-Vereinigung. 2018-06-08.

DOI : 10.1515/dmvm-2018-0007.

On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds

B. González Merino; M. Schymura

2018-04-16.

Matching fields and lattice points of simplices

G. P. Loho; B. Smith

2018-04-04.

Graph fragmentation problem: analysis and synthesis

M. F. Aprile; N. Castro; G. Ferreira; J. Piccini; F. Robledo et al.

International Transactions in Operational Research. 2018.

On 2-level polytopes arising in combinatorial settings

M. F. Aprile; A. B. Cevallos Manzano; Y. Faenza

SIAM Journal on Discrete Mathematics. 2018.

The Support Of Integer Optimal Solutions

I. Aliev; J. A. De Loera; F. Eisenbrand; T. Oertel; R. Weismantel

Siam Journal On Optimization. 2018-01-01.

DOI : 10.1137/17M1162792.

On 2-Level Polytopes Arising In Combinatorial Settings

M. Aprile; A. Cevallos; Y. Faenza

Siam Journal On Discrete Mathematics. 2018-01-01.

DOI : 10.1137/17M1116684.

Faster Algorithms for Integer Programs with Block Structure

F. Eisenbrand; C. Hunkenschröder; K.-M. Klein

2018. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) , Prague, Czech Rupublic . p. 49:1--49:13.

DOI : 10.4230/LIPICS.ICALP.2018.49.

On some problems related to 2-level polytopes

M. F. Aprile / F. Eisenbrand; Y. Faenza (Dir.)

Lausanne, EPFL, 2018.

DOI : 10.5075/epfl-thesis-9025.

2017

Extension complexity of stable set polytopes of bipartite graphs

M. F. Aprile; Y. Faenza; S. Fiorini; T. Huynh; M. Macchia

2017-11-02. WG 2017: Graph-Theoretic Concepts in Computer Science , Eindhoven, The Netherlands , June 21-23 2017. p. 75-87.

DOI : 10.1007/978-3-319-68705-6_6.

Analysis of Node-Resilience Strategies under Natural Disasters

M. F. Aprile; N. Castro; F. Robledo; P. Romero

2017. nternational Conference on Design of Reliable Communication Networks , Munich, Germany , March 8-10, 2017 .

The weighted stable matching problem

L. Farczadi; N. Guričanová

2017. MATCH-UP 2017 , Cambridge, Massachusetts, USA , April 20, 2017 - April 21, 2017.

2016

Approximation algorithms for geometric dispersion

A. B. Cevallos Manzano / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2016.

DOI : 10.5075/epfl-thesis-7291.

On vertices and facets of combinatorial 2-level polytopes

M. F. Aprile; A. B. Cevallos Manzano; Y. Faenza

2016. ISCO 2016 , Vietri sul mare, Italy , May 16-18, 2016. p. 177-188.

DOI : 10.1007/978-3-319-45587-7_16.

2015

Clustered planarity testing revisited

R. Fulek; J. Kynčl; I. Malinović; D. Pálvölgyi

The Electronic Journal of Combinatorics. 2015.

On largest volume simplices and sub-determinants

M. Di Summa; F. Eisenbrand; Y. Faenza; C. Moldenhauer

2015. ACM-SIAM Symposium on Discrete Algorithms , San Diego, California, USA , January 4-6, 2015.

2014

Node-weighted network design and maximum sub-determinants

C. Moldenhauer / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2014.

DOI : 10.5075/epfl-thesis-6450.

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Y. Faenza; G. Oriolo; G. Stauffer

Journal Of The Acm. 2014.

DOI : 10.1145/2629600.

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

C. Annamalai; C. Kalaitzis; O. N. A. Svensson

2014. Symposium on Discrete Algorithms 2015 , San Diego, California, USA , January 4-6, 2015.

Solving the stable set problem in terms of the odd cycle packing number

A. A. Bock; Y. Faenza; C. Moldenhauer; A. J. Ruiz Vargas

2014. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science , India International Centre, New Delhi , December 15–17, 2014.

On Sub-determinants and the Diameter of Polyhedra

N. Bonifas; M. Di Summa; F. Eisenbrand; N. Haehnle; M. Niemeier

Discrete & Computational Geometry. 2014.

DOI : 10.1007/s00454-014-9601-x.

Approximation algorithms for regret minimization in vehicle routing problems

A. A. Bock / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2014.

DOI : 10.5075/epfl-thesis-6163.

Finding small stabilizers for unstable graphs

A. A. Bock; K. Chandrasekaran; J. Könemann; B. Peis; L. Sanità

2014. Integer Programming and Combinatorial Optimization (IPCO) , Bonn, Germany , June 2014.

2013

On The Convergence Of The Affine Hull Of The Chvatal-Gomory Closures

G. Averkov; M. Conforti; A. Del Pia; M. Di Summa; Y. Faenza

Siam Journal On Discrete Mathematics. 2013.

DOI : 10.1137/120898371.

Testing additive integrality gaps

F. Eisenbrand; N. Haehnle; D. Palvolgyi; G. Shmonin

Mathematical Programming. 2013.

DOI : 10.1007/s10107-012-0518-y.

Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

F. Eisenbrand

Top. 2013.

DOI : 10.1007/s11750-013-0292-x.

Bin Packing via Discrepancy of Permutations

F. Eisenbrand; D. Palvoelgyi; T. Rothvoss

Acm Transactions On Algorithms. 2013.

DOI : 10.1145/2483699.2483704.

On the approximability of two capacitated vehicle routing problems

A. A. Bock; L. Sanità

2013. International Network Optimization Conference (INOC) , Tenerife, Spain , May 20-22, 2013. p. 519 - 526.

DOI : 10.1016/j.endm.2013.05.133.

The School Bus Problem on Trees

A. A. Bock; E. Grant; J. Könemann; L. Sanità

Algorithmica. 2013.

DOI : 10.1007/s00453-012-9711-x.

Stable Routing And Unique-Max Coloring On Trees

N. Haehnle; L. Sanita; R. Zenklusen

Siam Journal On Discrete Mathematics. 2013.

DOI : 10.1137/100817565.

Steiner Tree Approximation via Iterative Randomized Rounding

J. Byrka; F. Grandoni; T. Rothvoss; L. Sanità

Journal of the ACM. 2013.

DOI : 10.1145/2432622.2432628.

2012

New Results in the Theory of Linear and Integer Programming

N. Hähnle / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2012.

DOI : 10.5075/epfl-thesis-5613.

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

M. Niemeier / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2012.

DOI : 10.5075/epfl-thesis-5561.

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

Y. Faenza; S. Fiorini; R. Grappe; H. R. Tiwary

2012. 2nd International Symposium on Combinatorial Optimization (ISCO 2012) . p. 129-140.

DOI : 10.1007/978-3-642-32147-4_13.

On coloring problems with local constraints

F. Bonomo; Y. Faenza; G. Oriolo

Discrete Mathematics. 2012.

DOI : 10.1016/j.disc.2012.03.019.

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Y. Faenza; G. Oriolo; G. Stauffer

2012. 2012 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) . p. 1298-1308.

Scheduling with an Orthogonal Resource Constraint

M. Niemeier; A. Wiese

2012. 10th Workshop on Approximation and Online Algorithms (WAOA2012) , Ljubljana, Slovenia , September 13-14, 2012.

On sub-determinants and the diameter of polyhedra

N. Bonifas; M. Di Summa; F. Eisenbrand; N. Hähnle; M. Niemeier

2012. 28th Symposium on Computational Geometry (SoCG 2012) , Chapel Hill, North Carolina, USA , June 17-20, 2012.

Coloring fuzzy circular interval graphs

F. Eisenbrand; M. Niemeier

European Journal of Combinatorics. 2012.

DOI : 10.1016/j.ejc.2011.09.016.

2011

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

C. Moldenhauer

2011. 38th International Colloquium on Automata, Languages and Programming (ICALP) / Annual Meeting of the European-Association-for-Theoretical-Computer-Science (EATCS)', u'38th International Colloquium on Automata, Languages and Programming (ICALP) , Zürich , July 2011. p. 293-306.

DOI : 10.1016/j.ic.2012.10.017.

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Y. Faenza; G. Oriolo; G. Stauffer

2011. Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011) . p. 630-646.

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)

Y. Faenza; G. Oriolo; C. Snels

Operations Research Letters. 2011.

DOI : 10.1016/j.orl.2011.04.002.

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

F. Grandoni; T. Rothvoss; L. Sanita

Mathematics Of Operations Research. 2011.

DOI : 10.1287/moor.1110.0490.

Complexity of the critical node problem over trees

M. Di Summa; A. Grosso; M. Locatelli

Computers & Operations Research. 2011.

DOI : 10.1016/j.cor.2011.02.016.

Approximation Algorithms for the Interval Constrained Coloring Problem

E. Althaus; S. Canzar; K. Elbassioni; A. Karrenbauer; J. Mestre

Algorithmica. 2011.

DOI : 10.1007/s00453-010-9406-0.

Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

C. Moldenhauer

2011. Automata, Languages and Programming - 38th International Colloquium , Zürich, Switzerland , July 4-8, 2011. p. 748-759.

DOI : 10.1007/978-3-642-22006-7_63.

Balanced Interval Coloring

A. Antoniadis; F. Hüffner; P. Lenzner; C. Moldenhauer; A. Souza

2011. 28th International Symposium on Theoretical Aspects of Computer Science , Dortmund, Germany , March 10-12, 2011. p. 531-542.

DOI : 10.4230/LIPIcs.STACS.2011.531.

The School Bus Problem on Trees

A. A. Bock; E. Grant; J. Könemann; L. Sanità

2011. 22nd International Symposium on Algorithms and Computation (ISAAC 2011) , Yokohama, Japan , December 5-8, 2011. p. 10-19.

Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

S. Baruah; M. Niemeier; A. Wiese

2011. 23rd Euromicro Conference on Real-Time Systems (ECRTS2011) , Porto, Portugal , July 6th - 8th, 2011.

Covering Cubes and the Closest Vector Problem

F. Eisenbrand; N. Hähnle; M. Niemeier

2011. 27th Annual Symposium on Computational Geometry (SoCG 2011) , Paris, France , June 13-15, 2011. p. 417-423.

Diameter Bounds for Planar Graphs

R. Fulek; F. Moric; D. Pritchard

Discrete Mathematics. 2011.

DOI : 10.1016/j.disc.2010.11.006.

A PTAS for the Highway Problem

F. Grandoni; T. Rothvoss

2011. Symposium on Discrete Algorithms (SODA 2011) , San Francisco, USA , January 22-25, 2011.

Bin Packing via Discrepancy of Permutations

F. Eisenbrand; D. Palvoelgyi; T. Rothvoss

2011. Symposium on Discrete Algorithms (SODA 2011) , San Francisco, USA , January 22-25, 2011.

Fast Computation of Small Cuts via Cycle Space Sampling

D. Pritchard; R. Thurimella

Acm Transactions On Algorithms. 2011.

DOI : 10.1145/2000807.2000814.

Approximability of Sparse Integer Programs

D. Pritchard; D. Chakrabarty

Algorithmica. 2011.

DOI : 10.1007/s00453-010-9431-z.

2010

Optimal Selection of Customers for a Last-Minute Offer

R. Cominetti; J. R. Correa; T. Rothvoss; J. San Martin

Operations Research. 2010.

DOI : 10.1287/opre.1090.0787.

Connected facility location via random facility sampling and core detouring

F. Eisenbrand; F. Grandoni; T. Rothvoss; G. Schafer

Journal Of Computer And System Sciences. 2010.

DOI : 10.1016/j.jcss.2010.02.001.

Sorted Sector Covering Combined with Image Condensation - An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs

M. Albrecht; A. Karrenbauer; T. Jung; C. Xu

2010. 16th International Display Workshop (IDW 09) , Miyazaki, JAPAN , Dec 09-11, 2009. p. 1556-1563.

DOI : 10.1587/transele.E93.C.1556.

Single-Frontier Bidirectional Search

A. Felner; C. Moldenhauer; N. Sturtevant; J. Schaeffer

2010. Twenty-Fourth AAAI Conference on Artificial Intelligence , Atlanta, Georgia, USA , July 11-15, 2010.

Diameter of Polyhedra: Limits of Abstraction

F. Eisenbrand; N. Hähnle; A. Razborov; T. Rothvoss

Mathematics of Operations Research. 2010.

DOI : 10.1287/moor.1100.0470.

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks

A. Karrenbauer; T. Rothvoss

2010. Approximation and Online Algorithms, 8th International Workshop (WAOA 2010) , Liverpool, UK , September 9-10, 2010.

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound

D. Chakrabarty; J. Könemann; D. Pritchard

Operations Research Letters. 2010.

DOI : 10.1016/j.orl.2010.09.004.

Stable routing under the Spanning Tree Protocol

F. Grandoni; G. Nicosia; G. Oriolo; L. Sanità

Operations Research Letters. 2010.

DOI : 10.1016/j.orl.2010.05.001.

k-Edge-Connectivity: Approximation and LP Relaxation

D. Pritchard

2010. ALGO 2010: 8th Workshop on Approximation and Online Algorithms (WAOA) , University of Liverpool, UK , September 9-10, 2010.

Hypergraphic LP Relaxations for Steiner Trees

D. Chakrabarty; J. Könemann; D. Pritchard

2010. 14th Conference on Integer Programming and Combinatorial Optimization (IPCO) , Lausanne, Switzerland , June 9-11, 2010. p. 383-396.

DOI : 10.1007/978-3-642-13036-6_29.

Network Design via Core Detouring for Problems Without a Core

F. Grandoni; T. Rothvoss

2010. 37th International Colloquium on Automata, Languages and Programming (ICALP'10) , Bordeaux, France , July 5-10, 2010. p. 490-502.

DOI : 10.1007/978-3-642-14165-2_42.

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

F. Eisenbrand; K. Kesavan; R. Mattikalli; M. Niemeier; A. Nordsieck et al.

2010. 18th Annual European Symposium on Algorithms (ESA2010) , Liverpool, United Kingdom , September 6-8, 2010.

Scheduling periodic tasks in a hard real-time environment

F. Eisenbrand; N. Hähnle; M. Niemeier; M. Skutella; J. Verschae et al.

2010. 37th International Colloquium on Automata, Languages and Programming (ICALP2010) , Bordeaux, France , July 5-10, 2010. p. 299-311.

An Improved LP-based Approximation for Steiner Tree

J. Byrka; F. Grandoni; T. Rothvoß; L. Sanità

2010. 42th ACM Symposium on Theory of Computing (STOC 2010) , Cambridge, Massachusetts, USA , June 6-8, 2010.

On finding another room-partitioning of the vertices

J. Edmonds; L. Sanità

2010. International Symposium on Combinatorial Optimization (ISCO) , Hammamet , March 24-26, 2010. p. 1257-1264.

The VPN problem with concave costs

S. Fiorini; G. Oriolo; L. Sanità; D. O. Theis

Siam Journal of Discrete Mathematics. 2010.

DOI : 10.1137/090749700.

The interval constrained 3-coloring problem

J. Byrka; A. Karrenbauer; L. Sanità

2010. 9th Latin American Theoretical Informatics Symposium (LATIN) , Oaxaca, Mexico , April 19-23, 2010. p. 591-602.

Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm

J. Byrka; A. Srinivasan; C. Swamy

2010. 14th Conference on Integer Programming and Combinatorial Optimization , Lausanne , June 9-11, 2010.

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

J. Byrka; K. Aardal

SIAM Journal on Computing. 2010.

DOI : 10.1137/070708901.

EDF-schedulability of synchronous periodic task systems is coNP-hard

F. Eisenbrand; T. Rothvoß

2010. ACM-SIAM Symposium on Discrete Algorithms (SODA10) , Austin, Texas , January 17-19, 2010.

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

H. Bosse; J. Byrka; E. Markakis

Theoretical Computer Science. 2010.

DOI : 10.1016/j.tcs.2009.09.023.

Testing additive integrality gaps

F. Eisenbrand; N. Hähnle; D. Pálvölgyi; G. Shmonin

2010. 21st ACM-SIAM Symposium on Discrete Algorithms , Austin, Texas , January 17-19, 2010. p. 1227-1234.

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

J. Byrka; P. Gawrychowski; K. T. Huber; S. Kelk

Journal of Discrete Algorithms. 2010.

DOI : 10.1016/j.jda.2009.01.004.

Optimal selection of customers for a last-minute offer

R. Cominetti; J. R. Correa; T. Rothvoß; J. San Martín

2010.

2009

Extended Formulations for Packing and Partitioning Orbitopes

Y. Faenza; V. Kaibel

Mathematics of Operations Research. 2009.

DOI : 10.1287/moor.1090.0392.

Multiline Addressing by Network Flow

F. Eisenbrand; A. Karrenbauer; M. Skutella; C. Xu

2009. 14th Annual European Symposium on Algorithms (ESA 2006) , Zurich, SWITZERLAND , Sep 11-13, 2006. p. 583-596.

DOI : 10.1007/s00453-008-9252-5.

Evaluating Strategies for Running from the Cops

C. Moldenhauer; N. Sturtevant

2009. 21st International Joint Conference on Artificial Intelligence , Pasadena, California, USA , July 11-17, 2009.

Optimal solutions for moving target search

C. Moldenhauer; N. Sturtevant

2009. 8th International Joint Conference on Autonomous Agents and Multiagent Systems , Budapest, Hungary , May 10-15, 2009. p. 1249-1250.

DOI : 10.1145/1558109.1558236.

Network Formulations of Mixed-Integer Programs

M. Conforti; M. Di Summa; F. Eisenbrand; L. A. Wolsey

Mathematics Of Operations Research. 2009.

DOI : 10.1287/moor.1080.0354.

Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently

T. Bernholt; F. Eisenbrand; T. Hofmeister

2009. 23rd Annual Symposium on Computational Geometry , Gyeongju, SOUTH KOREA , Jun 06-08, 2007. p. 22-36.

DOI : 10.1007/s00454-009-9178-y.

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

R. Davis; T. Rothvoß; S. Baruah; A. Burns

Real-Time Systems. 2009.

DOI : 10.1007/s11241-009-9079-4.

Coloring Fuzzy Circular Interval Graphs

F. Eisenbrand; M. Niemeier

2009. European Conference on Combinatorics, Graph Theory and Applications (EuroComb2009) , Bordeaux, France , September 7-11, 2009. p. 543-548.

DOI : 10.1016/j.endm.2009.07.090.

Robust Network Design

L. Sanità / G. Oriolo (Dir.)

Università Sapienza di Roma, 2009.

Local restoration for trees and arborescences

P. Iovanna; G. Oriolo; G. Nicosia; L. Sanità; E. Sperduto

2009. International Workshop on Traffic Management and Traffic Engineering for the Future Internet , Porto, Portugal , December 11-12, 2008. p. 130-140.

On the computational complexity of periodic scheduling

T. Rothvoss / F. Eisenbrand (Dir.)

Lausanne, EPFL, 2009.

DOI : 10.5075/epfl-thesis-4513.

Domain walls and chaos in the disordered SOS model

K. Schwarz; A. Karrenbauer; G. Schehr; H. Rieger

J. Stat. Mech.. 2009.

DOI : 10.1088/1742-5468/2009/08/P08022.

Optimal Algorithms for Page Migration in Dynamic Networks

M. Bienkowski; J. Byrka; M. Korzeniowski; F. Meyer auf der Heide

Journal of Discrete Algorithms. 2009.

DOI : 10.1016/j.jda.2008.07.006.

Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability

K. Buchin; M. Buchin; J. Byrka; M. Nullenburg; Y. Okamoto et al.

2009. 16th International Symposium on Graph Drawing , Heraklion , September 21-24, 2008. p. 324-335.

Matching techniques ride to rescue OLED displays

A. Karrenbauer

2009. 3rd Annual International Conference on Combinatorial Optimization and Applications , Huangshan , June 10-12, 2009. p. 110-122.

On the Complexity of the Asymmetric VPN Problem

T. Rothvoß; L. Sanità

2009. 12th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX '09) , UC Berkeley, USA , August 21-23, 2009. p. 326-338.

DOI : 10.1007/978-3-642-03685-9_25.

New Hardness Results for Diophantine Approximation

F. Eisenbrand; T. Rothvoß

2009. 12th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX '09) , UC Berkeley, USA , August 21-23, 2009. p. 98--110.

DOI : 10.1007/978-3-642-03685-9.

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

A. Karrenbauer; T. Rothvoß

2009. 17th Annual European Symposium on Algorithms (ESA'09) , Copenhagen , September 7–9, 2009. p. 432-443.

DOI : 10.1007/978-3-642-04128-0_39.

Diameter of Polyhedra: Limits of Abstraction

F. Eisenbrand; N. Hähnle; T. Rothvoß

2009. 25th Annual ACM Symposium on Computational Geometry (SoCG'09) , Aarhus, Denmark , June 8-10, 2009. p. 386-392.

DOI : 10.1145/1542362.1542428.

2008

New Results on Optimizing Rooted Triplets Consistency

J. Byrka; S. Guillemot; J. Jansson

2008. 19th International Symposium on Algorithms and Computation , Gold Coast, Australia , December 15-17, 2008. p. 484-495.

Convexly independent subsets of the Minkowski sum of planar point sets

F. Eisenbrand; J. Pach; T. Rothvoß; N. B. Sopher

Electronic Journal of Combinatorics. 2008.

Static-priority Real-time Scheduling: Response Time Computation is NP-hard

F. Eisenbrand; T. Rothvoß

2008. IEEE Real-Time Systems Symposium (RTSS) , Barcelona , Nov. 30-3 Dec., 2008. p. 397-406.

DOI : 10.1109/RTSS.2008.25.

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

F. Eisenbrand; T. Rothvoß

2008. Automata, Languages and Programming, 35th International Colloquium (ICALP 2008) , Reykjavik, Iceland , July 7-11, 2008.

Approximating connected facility location problems via Random facility sampling and core detouring

F. Eisenbrand; F. Grandoni; T. Rothvoß; G. Schäfer

2008. ACM-SIAM Symposium on Discrete Algorithms (SODA '08) , San Francisco, California , 20-22.01.2008. p. 1174-1183.

Parametric integer programming in fixed dimension

F. Eisenbrand; G. Shmonin

Mathematics of Operations Research. 2008.

DOI : 10.1287/moor.1080.0320.

The stable set polytope of quasi-line graphs

F. Eisenbrand; G. Oriolo; G. Stauffer; P. Ventura

Combinatorica. 2008.

DOI : 10.1007/s00493-008-2244-x.

2007

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

H. Bosse; J. Byrka; E. Markakis

2007. 3rd International Workshop on Internet and Network Economics (WINE) , San Diego , December 12-14, 2007. p. 17-29.

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

J. Byrka

2007. 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems , Princeton, NJ, USA , August 20-22, 2007. p. 29-43.

Parameterised integer programming, integer cones, and related problems

G. Shmonin / F. Eisenbrand (Dir.)

University of Paderborn, Germany, 2007.

Flow faster: efficient decision algorithms for probabilistic simulations

L. Zhang; H. Hermanns; F. Eisenbrand; D. N. Jansen

2007. Braga, Portugal . p. 155 - 69.

Algorithms for longer OLED lifetime

F. Eisenbrand; A. Karrenbauer; C. Xu

2007. p. 338 - 351.

New approaches for virtual private network design

F. Eisenbrand; F. Grandoni; G. Oriolo; M. Skutella

SIAM J. Comput.. 2007.

DOI : 10.1137/060654827.

A geometric framework for solving subsequence problems in computational biology efficiently

T. Bernholt; F. Eisenbrand; T. Hofmeister

2007. Symposium on Computational Geometry 2007 , Gyeongju, South Korea . p. 310-318.

DOI : 10.1145/1247069.1247125.

0/1 vertex and facet enumeration with BDDs

M. Behle; F. Eisenbrand

2007. p. 158 - 165.

2006

Algorithms for Virtual Private Networks

T. Rothvoß

2006.

Algorithmen für Virtuelle Private Netzwerke

T. Rothvoß

2006.

Network formulations of mixed-integer programs

M. Conforti; M. di Summa; F. Eisenbrand; L. Wolsey

2006.

Caratheodory bounds for integer cones

F. Eisenbrand; G. Shmonin

Operations Research Letters. 2006.

DOI : 10.1016/j.orl.2005.09.008.

Multiline addressing by network flow

F. Eisenbrand; A. Karrenbauer; M. Skutella; C. Xu

2006. 14th Annual European Symposium on Algorithms (ESA 2006) , Zurich, Switzerland , December 11-13, 2006. p. 744-766.

DOI : 10.1007/s00453-008-9252-5.

Provisioning a virtual private network under the presence of non-communicating groups

F. Eisenbrand; E. Happ

2006. p. 105 - 114.

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

W. Damm; A. Metzner; F. Eisenbrand; G. Shmonin; R. Wilhelm et al.

2006. p. 87 - 90.

DOI : 10.1109/RTCSA.2006.42|.

2005

A linear algorithm for integer programming in the plane

F. Eisenbrand; S. Laue

Mathematical Programming. 2005.

DOI : 10.1007/s10107-004-0520-0.

Energy-aware stage illumination

F. Eisenbrand; A. Karrenbauer; S. Funke; D. Matijevic

2005. p. 336 - 345.

New approaches for virtual private network design

F. Eisenbrand; F. Grandoni; G. Oriolo; M. Skutella

2005. p. 1151 - 1162.

An improved approximation algorithm for virtual private network design

F. Eisenbrand; F. Grandoni

2005. p. 928 - 932.

Packing a trunk - Now with a twist!

F. Eisenbrand; S. Funke; A. Karrenbauer; J. Reichel; E. Schomer

2005. p. 197 - 206.

On the complexity of integer programming in fixed dimension

F. Eisenbrand

2005. 10th International Conference on Operational Research-KOI 2004 , Trogir, Croatia . p. 1 -.

BDDs in a branch and cut framework

B. Becker; M. Behle; F. Eisenbrand; R. Wimmer

2005. Santorini Island, Greece . p. 452 - 63.

Circular Ones Matrices and the Stable set Polytopes of Quasi-Line Graphs

F. Eisenbrand; G. Oriolo; G. Stauffer; P. Ventura

Lectures notes in Computer Science. 2005.

2004

On the complexity of fixed parameter clique and dominating set

F. Eisenbrand; F. Grandoni

Theoretical Computer Science. 2004.

DOI : 10.1016/j.tcs.2004.05.009.

Point containment in the integer hull of a polyhedron

E. Althaus; F. Eisenbrand; S. Funke; K. Mehlhorn

2004. p. 929-933 (electronic).

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs

F. Eisenbrand; G. Oriolo; G. Stauffer; P. Ventura

2004.

2003

A compact linear program for testing optimality of perfect matchings

P. Ventura; F. Eisenbrand

Oper. Res. Lett.. 2003.

DOI : 10.1016/S0167-6377(03)00052-X.

Bounds on the Chvátal rank of polytopes in the $0/1$-cube

F. Eisenbrand; A. S. Schulz

Combinatorica. 2003.

DOI : 10.1007/s00493-003-0020-5.

Primal separation for $0/1$ polytopes

F. Eisenbrand; G. Rinaldi; P. Ventura

Math. Program.. 2003.

DOI : 10.1007/s10107-002-0309-y.

A faster algorithm for two-variable integer programming

F. Eisenbrand; S. Laue

2003. p. 290-299.

Detecting directed 4-cycles still faster

F. Eisenbrand; F. Grandoni

Inform. Process. Lett.. 2003.

DOI : 10.1016/S0020-0190(03)00252-7.

A combinatorial algorithm for computing a maximum independent set in a $t$-perfect graph

F. Eisenbrand; S. Funke; N. Garg; J. Könemann

2003. p. 517-522.

Fast integer programming in fixed dimension

F. Eisenbrand

2003.

2001

Fast 2-variable integer programming

F. Eisenbrand; G. Rote

2001. p. 78-89.

Fast reduction of ternary quadratic forms

F. Eisenbrand; G. Rote

2001. p. 32-44.

Short vectors of planar lattices via continued fractions

F. Eisenbrand

Inform. Process. Lett.. 2001.

DOI : 10.1016/S0020-0190(00)00186-1.

Cutting planes and the elementary closure in fixed dimension

A. Bockmayr; F. Eisenbrand

Math. Oper. Res.. 2001.

DOI : 10.1287/moor.26.2.304.10555.

2000

Gomory-chvatal cutting planes and the elementary closure of polyhedra

F. Eisenbrand / A. Bockmayr (Dir.)

Universität des Saarlandes, 2000.

DOI : 10.22028/D291-25909.

Combining logic and optimization in cutting plane theory

A. Bockmayr; F. Eisenbrand

2000. p. 1-17.

1999

Bounds on the Chvátal rank of polytopes in the $0/1$-cube

F. Eisenbrand; A. S. Schulz

1999. p. 137-150.

On the membership problem for the elementary closure of a polyhedron

F. Eisenbrand

Combinatorica. 1999.

DOI : 10.1007/s004930050057.

On factor refinement in number fields

J. Buchmann; F. Eisenbrand

Mathematics of computation. 1999.

DOI : 10.1090/S0025-5718-99-01023-6.

On the Chvátal rank of polytopes in the $0/1$ cube

A. Bockmayr; F. Eisenbrand; M. Hartmann; A. S. Schulz

Discrete Appl. Math.. 1999.

DOI : 10.1016/S0166-218X(99)00156-0.

1997

On factor refinement in quadratic number fields

F. Eisenbrand; J. Buchmann / J. Buchmann (Dir.)

Universität des Saarlandes, 1997.