|
F. Eisenbrand and M. Niemeier.
Coloring fuzzy circular interval graphs.
European Journal of Combinatorics, 2011.
[ DOI |
Details |
Full Text ]
F. Eisenbrand, N. Hähnle, and M. Niemeier.
Covering Cubes and the Closest Vector Problem.
In Computational Geometry (Scg 11), pages 417-423. Acm
Order Department, P O Box 64145, Baltimore, Md 21264 Usa, 2011.
[ Details |
Full Text ]
F. Eisenbrand, D. Palvoelgyi, and T. Rothvoss.
Bin Packing via Discrepancy of Permutations.
In Symposium on Discrete Algorithms (SODA 2011). Siam,
3600 Univ City Science Center, Philadelphia, Pa 19104-2688 Usa, 2011.
[ Details |
Full Text ]
F. Eisenbrand, F. Grandoni, T. Rothvoss, and G. Schafer.
Connected facility location via random facility sampling and core
detouring.
Journal Of Computer And System Sciences, 76:709-726,
2010.
[ DOI |
Details ]
F. Eisenbrand, N. Hähnle, A. Razborov, and T. Rothvoss.
Diameter of Polyhedra: Limits of Abstraction.
Mathematics of Operations Research, 35(4):786-794, 2010.
[ DOI |
Details |
Full Text ]
J. Clivaz and F. Eisenbrand.
Single Sink with non-simultaneous Demand.
2010.
[ Details |
Full Text ]
L. Furrer and F. Eisenbrand.
An Maxflow Algorithm for Directed Planar Graphs.
2010.
[ Details |
Full Text ]
L. Furrer and F. Eisenbrand.
An Maxflow Algorithm for Directed Planar Graphs.
2010.
[ Details |
Full Text ]
J. Clivaz and F. Eisenbrand.
Single Sink with non-simultaneous Demand.
2010.
[ Details |
Full Text ]
F. Eisenbrand, F. B. Shepherd, D. Chakrabarty, J. Könemann, and D. Pritchard.
Hypergraphic LP Relaxations for Steiner Trees.
In Proc. 14th Conference on Integer Programming and
Combinatorial Optimization (IPCO), Lecture Notes in Computer Science,
pages 383-396. Springer, 2010.
[ DOI |
Details |
Link ]
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P. Spirakis,
F. Grandoni, and T. Rothvoss.
Network Design via Core Detouring for Problems Without a
Core.
In Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I, Lecture Notes in Computer Science, pages
490-502. Springer, 2010.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, K. Kesavan, R. Mattikalli, M. Niemeier, A. Nordsieck,
M. Skutella, J. Verschae, and A. Wiese.
Solving an Avionics Real-Time Scheduling Problem by
Advanced IP-Methods.
In 18th Annual European Symposium on Algorithms
(ESA2010), Lecture Notes in Computer Science. Springer-Verlag New York, Ms
Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa, 2010.
[ Details |
Full Text ]
F. Eisenbrand, N. Hähnle, M. Niemeier, M. Skutella, J. Verschae, and A. Wiese.
Scheduling periodic tasks in a hard real-time environment.
In 37th International Colloquium on Automata,
Languages and Programming (ICALP2010), volume 37 of Lecture Notes
in Computer Science, pages 299-311. Springer-Verlag, 2010.
[ Details |
Full Text ]
F. Eisenbrand and T. Rothvoß.
EDF-schedulability of synchronous periodic task systems is
coNP-hard.
In ACM-SIAM Symposium on Discrete Algorithms
(SODA10), 2010.
[ Details |
Full Text |
Link ]
F. Eisenbrand, N. Hähnle, D. Pálvölgyi, and G. Shmonin.
Testing additive integrality gaps.
In 21st ACM-SIAM Symposium on Discrete Algorithms
(SODA10), pages 1227-1234, 2010.
[ Details |
Full Text |
Link ]
F. Eisenbrand, A. Karrenbauer, M. Skutella, and C. Xu.
Multiline Addressing by Network Flow.
In Algorithmica, volume 53, pages 583-596, 2009.
[ DOI |
Details ]
M. Conforti, M. Di Summa, F. Eisenbrand, and L. A. Wolsey.
Network Formulations of Mixed-Integer Programs.
Mathematics Of Operations Research, 34:194-209, 2009.
[ DOI |
Details ]
T. Bernholt, F. Eisenbrand, and T. Hofmeister.
Constrained Minkowski Sums: A Geometric Framework for
Solving Interval Problems in Computational Biology Efficiently.
In Discrete & Computational Geometry, volume 42, pages
22-36, 2009.
[ DOI |
Details ]
F. Eisenbrand and M. Niemeier.
Coloring Fuzzy Circular Interval Graphs.
In European Conference on Combinatorics, Graph Theory
and Applications (EuroComb2009) in Electronic Notes in Discrete
Mathematics, volume 34, pages 543-548. Elsevier, 2009.
[ DOI |
Details |
Full Text ]
T. Rothvoss and F. Eisenbrand.
On the computational complexity of periodic scheduling.
PhD thesis, Lausanne, 2009.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand and T. Rothvoß.
New Hardness Results for Diophantine Approximation.
In 12th Intl. Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX '09), Lecture Notes in
Computer Science, pages 98-110, Berlin, 2009. Springer.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, N. Hähnle, and T. Rothvoß.
Diameter of Polyhedra: Limits of Abstraction.
In 25th Annual ACM Symposium on Computational
Geometry (SoCG'09), pages 386-392, 2009.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, J. Pach, T. Rothvoß, and N. B. Sopher.
Convexly independent subsets of the Minkowski sum of planar point
sets.
Electronic Journal of Combinatorics, 15(1):Note 8, 4, 2008.
Professor Pach's number: [224].
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand and T. Rothvoß.
Static-priority Real-time Scheduling: Response Time
Computation is NP-hard.
In Real-Time Systems Symposium, pages 397-406, Los
Alamitos, CA, USA, 2008. IEEE Computer Society.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand and T. Rothvoß.
A PTAS for Static Priority Real-Time Scheduling with
Resource Augmentation.
In Automata, Languages and Programming (ICALP'08),
Lecture Notes in Computer Science. Springer, 2008.
[ Details |
Full Text |
Link ]
F. Eisenbrand, F. Grandoni, T. Rothvoß, and G. Schäfer.
Approximating connected facility location problems via Random
facility sampling and core detouring.
In Proceeding of Nineteenth annual ACM-SIAM Symposium
(SODA '08), pages 1174-1183, 2008.
[ Details |
Full Text |
Link ]
F. Eisenbrand and G. Shmonin.
Parametric integer programming in fixed dimension.
Mathematics of Operations Research, 33(4):839-850, 2008.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura.
The stable set polytope of quasi-line graphs.
Combinatorica, 28(1):45-67, 2008.
[ DOI |
Details |
Full Text |
Link ]
G. Shmonin and F. Eisenbrand.
Parameterised integer programming, integer cones, and related
problems.
PhD thesis, 2007.
[ Details |
Full Text |
Link ]
L. Zhang, H. Hermanns, F. Eisenbrand, and D. N. Jansen.
Flow faster: efficient decision algorithms for probabilistic
simulations.
In Tools and Algorithms for the Construction and Analysis
of Systems. 13th International Conference, TACAS 2007. Held as
Part of the Joint European Conferences on Theory and Practice of
Software, ETAPS 2007. Proceedings (Lecture Notes in Computer
Science Vol. 4424), pages 155 - 69, 2007.
[ Details |
Link ]
F. Eisenbrand, A. Karrenbauer, and C. Xu.
Algorithms for longer OLED lifetime.
In Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in
Bioinformatics), volume 4525 NCS, pages 338 - 351, 2007.
[ Details |
Full Text ]
F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella.
New approaches for virtual private network design.
SIAM J. Comput., 37(3):706-721 (electronic), 2007.
[ DOI |
Details |
Full Text ]
T. Bernholt, F. Eisenbrand, and T. Hofmeister.
A geometric framework for solving subsequence problems in
computational biology efficiently.
In Symposium on Computational Geometry, pages 310-318.
ACM, 2007.
[ DOI |
Details |
Link ]
M. Behle and F. Eisenbrand.
0/1 vertex and facet enumeration with BDDs.
In Proceedings of the 9th Workshop on Algorithm
Engineering and Experiments and the 4th Workshop on Analytic
Algorithms and Combinatorics, pages 158 - 165, 2007.
[ Details ]
T. Rothvoß and F. Eisenbrand.
Algorithms for Virtual Private Networks.
2006.
[ Details |
Full Text ]
T. Rothvoß and F. Eisenbrand.
Algorithmen für Virtuelle Private Netzwerke.
2006.
[ Details |
Full Text ]
M. Conforti, M. di Summa, F. Eisenbrand, and L. Wolsey.
Network formulations of mixed-integer programs.
Technical report, 2006.
[ DOI |
Details ]
F. Eisenbrand and G. Shmonin.
Caratheodory bounds for integer cones.
Operations Research Letters, 34(5):564 - 568, 2006.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, A. Karrenbauer, M. Skutella, and C. Xu.
Multiline addressing by network flow.
In Proceedings of the 14th Annual European Symposium on
Algorithms (ESA 2006), volume 53 of Lecture Notes in Computer
Science, pages 744-766, 2006.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand and E. Happ.
Provisioning a virtual private network under the presence of
non-communicating groups.
In Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in
Bioinformatics), volume 3998 NCS, pages 105 - 114, 2006.
[ Details |
Full Text ]
W. Damm, A. Metzner, F. Eisenbrand, G. Shmonin, R. Wilhelm, and S. Winkel.
Mapping task-graphs on distributed ECU networks: Efficient
algorithms for feasibility and optimality.
In Proceedings - 12th IEEE International Conference on
Embedded and Real-Time Computing Systems and Applications,
RTCSA 2006, pages 87 - 90, 2006.
[ DOI |
Details ]
F. Eisenbrand and S. Laue.
A linear algorithm for integer programming in the plane.
Mathematical Programming, 102(2):249 - 259, 2005.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, A. Karrenbauer, S. Funke, and D. Matijevic.
Energy-aware stage illumination.
In Proceedings of the Annual Symposium on Computational
Geometry, pages 336 - 345, 2005.
[ Details |
Full Text ]
F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella.
New approaches for virtual private network design.
In Lecture Notes in Computer Science, volume 3580, pages
1151 - 1162, 2005.
[ Details |
Full Text ]
F. Eisenbrand and F. Grandoni.
An improved approximation algorithm for virtual private network
design.
In Proceedings of the Annual ACM-SIAM Symposium on
Discrete Algorithms, pages 928 - 932, 2005.
[ Details |
Full Text ]
F. Eisenbrand, S. Funke, A. Karrenbauer, J. Reichel, and E. Schomer.
Packing a trunk - Now with a twist!
In ACM Symposium on Solid Modeling and Applications,
SM, pages 197 - 206, 2005.
[ Details |
Full Text ]
F. Eisenbrand.
On the complexity of integer programming in fixed dimension.
In Proceedings of the 10th International Conference on
Operational Research-KOI 2004, pages 1 -, 2005.
[ Details |
Link ]
B. Becker, M. Behle, F. Eisenbrand, and R. Wimmer.
BDDs in a branch and cut framework.
In Experimental and Efficient Algorithms. 4th
International Workshop, WEA 2005. Proceedings (Lecture Notes in
Computer Science Vol. 3503), pages 452 - 63, 2005.
[ Details |
Full Text |
Link ]
F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura.
Circular Ones Matrices and the Stable set Polytopes of
Quasi-Line Graphs.
Lectures notes in Computer Science, 3509 / 2005:291-305,
2005.
[ DOI |
Details |
Full Text ]
F. Eisenbrand and F. Grandoni.
On the complexity of fixed parameter clique and dominating set.
Theoretical Computer Science, 326(1-3):57 - 67, 2004.
[ DOI |
Details |
Link ]
E. Althaus, F. Eisenbrand, S. Funke, and K. Mehlhorn.
Point containment in the integer hull of a polyhedron.
In Proceedings of the Fifteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, pages 929-933 (electronic). ACM,
2004.
[ Details |
Full Text ]
F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura.
Circular Ones Matrices and the Stable Set Polytope of
Quasi-Line Graphs.
Technical report, 2004.
RO 2004.1116.
[ Details ]
P. Ventura and F. Eisenbrand.
A compact linear program for testing optimality of perfect matchings.
Oper. Res. Lett., 31(6):429-434, 2003.
[ DOI |
Details |
Link ]
F. Eisenbrand and A. S. Schulz.
Bounds on the Chvátal rank of polytopes in the 0/1-cube.
Combinatorica, 23(2):245-261, 2003.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand, G. Rinaldi, and P. Ventura.
Primal separation for 0/1 polytopes.
Math. Program., 95(3, Ser. A):475-491, 2003.
[ DOI |
Details |
Full Text |
Link ]
F. Eisenbrand and S. Laue.
A faster algorithm for two-variable integer programming.
In Algorithms and computation, Lecture Notes in Comput. Sci.,
pages 290-299. Springer, 2003.
[ Details ]
F. Eisenbrand and F. Grandoni.
Detecting directed 4-cycles still faster.
Inform. Process. Lett., 87(1):13-15, 2003.
[ DOI |
Details |
Link ]
F. Eisenbrand, S. Funke, N. Garg, and J. Könemann.
A combinatorial algorithm for computing a maximum independent set in
a t-perfect graph.
In Proceedings of the Fourteenth Annual ACM-SIAM
Symposium on Discrete Algorithms (Baltimore, MD, 2003), pages
517-522. ACM, 2003.
[ Details ]
F. Eisenbrand.
Fast integer programming in fixed dimension.
Lecture Notes in Comput. Sci. Springer, 2003.
[ Details |
Full Text |
Link ]
M. O. Amara, J. F. Franetich, N. Bouladoux, D. Mazier, G. Eisenbrand, D. Marko,
L. Meijer, C. Doerig, and I. Desportes-Livage.
In vitro activity of antimitotic compounds against the microsporidium
Encephalitozoon intestinalis.
The Journal of eukaryotic microbiology, Suppl.:99S-100S,
2001.
[ DOI |
Details ]
F. Eisenbrand and G. Rote.
Fast 2-variable integer programming.
In Integer programming and combinatorial optimization
(Utrecht, 2001), Lecture Notes in Comput. Sci., pages 78-89. Springer,
2001.
[ Details |
Full Text ]
F. Eisenbrand and G. Rote.
Fast reduction of ternary quadratic forms.
In Cryptography and lattices (Providence, RI, 2001),
Lecture Notes in Comput. Sci., pages 32-44. Springer, 2001.
[ Details |
Full Text ]
F. Eisenbrand.
Short vectors of planar lattices via continued fractions.
Inform. Process. Lett., 79(3):121-126, 2001.
[ DOI |
Details |
Full Text |
Link ]
A. Bockmayr and F. Eisenbrand.
Cutting planes and the elementary closure in fixed dimension.
Math. Oper. Res., 26(2):304-312, 2001.
[ DOI |
Details |
Link ]
F. Eisenbrand and .
Gomory-chvatal cutting planes and the elementary closure of
polyhedra.
PhD thesis, 2000.
[ Details |
Link ]
A. Bockmayr and F. Eisenbrand.
Combining logic and optimization in cutting plane theory.
In Frontiers of combining systems (Nancy, 2000), Lecture
Notes in Comput. Sci., pages 1-17. Springer, 2000.
[ Details ]
F. Eisenbrand and A. S. Schulz.
Bounds on the Chvátal rank of polytopes in the 0/1-cube.
In Integer programming and combinatorial optimization (Graz,
1999), Lecture Notes in Comput. Sci., pages 137-150. Springer, 1999.
[ Details ]
F. Eisenbrand.
On the membership problem for the elementary closure of a polyhedron.
Combinatorica, 19(2):297-300, 1999.
[ DOI |
Details |
Full Text |
Link ]
J. Buchmann and F. Eisenbrand.
On factor refinement in number fields.
Mathematics of computation, 68(225):345-350, 1999.
[ DOI |
Details |
Link ]
A. Bockmayr, F. Eisenbrand, M. Hartmann, and A. S. Schulz.
On the Chvátal rank of polytopes in the 0/1 cube.
Discrete Appl. Math., 98(1-2):21-27, 1999.
[ DOI |
Details |
Link ]
F. Eisenbrand, J. Buchmann, and J. Buchmann.
On factor refinement in quadratic number fields.
PhD thesis, 1997.
[ Details |
Link ]
|
