The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Friedrich Eisenbrand: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Friedrich Eisenbrand, Günter Rote
    Fast Reduction of Ternary Quadratic Forms. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:32-44 [Conf]
  2. Friedrich Eisenbrand, Edda Happ
    Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:105-114 [Conf]
  3. Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic
    Energy-aware stage illumination. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:336-345 [Conf]
  4. Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister
    A geometric framework for solving subsequence problems in computational biology efficiently. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:310-318 [Conf]
  5. Friedrich Eisenbrand
    Fast Integer Programming in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:196-207 [Conf]
  6. Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer
    Packing a Trunk. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:618-629 [Conf]
  7. Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
    Multiline Addressing by Network Flow. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:744-755 [Conf]
  8. Alexander Bockmayr, Friedrich Eisenbrand
    Combining Logic and Optimization in Cutting Plane Theory. [Citation Graph (0, 0)][DBLP]
    FroCos, 2000, pp:1-17 [Conf]
  9. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
    New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1151-1162 [Conf]
  10. Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
    Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:291-305 [Conf]
  11. Friedrich Eisenbrand, Günter Rote
    Fast 2-Variable Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:78-89 [Conf]
  12. Friedrich Eisenbrand, Andreas S. Schulz
    Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:137-150 [Conf]
  13. Friedrich Eisenbrand, Sören Laue
    A Faster Algorithm for Two-Variable Integer Programming. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:290-299 [Conf]
  14. Werner Damm, Alexander Metzner, Friedrich Eisenbrand, Gennady Shmonin, Reinhard Wilhelm, Sebastian Winkel
    Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality. [Citation Graph (0, 0)][DBLP]
    RTCSA, 2006, pp:87-90 [Conf]
  15. Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Joachim Reichel, Elmar Schömer
    Packing a trunk: now with a twist! [Citation Graph (0, 0)][DBLP]
    Symposium on Solid and Physical Modeling, 2005, pp:197-206 [Conf]
  16. Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn
    Point containment in the integer hull of a polyhedron. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:929-933 [Conf]
  17. Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann
    A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:517-522 [Conf]
  18. Friedrich Eisenbrand, Fabrizio Grandoni
    An improved approximation algorithm for virtual private network design. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:928-932 [Conf]
  19. Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura
    0/1 optimization and 0/1 primal separation are equivalent. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:920-926 [Conf]
  20. Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer
    BDDs in a Branch and Cut Framework. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:452-463 [Conf]
  21. Friedrich Eisenbrand
    On the Membership Problem for the Elementary Closure of a Polyhedron. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:297-300 [Journal]
  22. Friedrich Eisenbrand, Andreas S. Schulz
    Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:245-261 [Journal]
  23. Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz
    On the Chvátal Rank of Polytopes in the 0/1 Cube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:21-27 [Journal]
  24. Friedrich Eisenbrand
    Short vectors of planar lattices via continued fractions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:3, pp:121-126 [Journal]
  25. Friedrich Eisenbrand, Fabrizio Grandoni
    Detecting directed 4-cycles still faster. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:13-15 [Journal]
  26. Johannes Buchmann, Friedrich Eisenbrand
    On factor refinement in number fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1999, v:68, n:225, pp:345-350 [Journal]
  27. Alexander Bockmayr, Friedrich Eisenbrand
    Cutting Planes and the Elementary Closure in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2001, v:26, n:2, pp:304-312 [Journal]
  28. Friedrich Eisenbrand, Sören Laue
    A linear algorithm for integer programming in the plane. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:2, pp:249-259 [Journal]
  29. Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura
    Primal separation for 0/1 polytopes. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:95, n:3, pp:475-491 [Journal]
  30. Friedrich Eisenbrand, Gennady Shmonin
    Carathéodory bounds for integer cones. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:5, pp:564-568 [Journal]
  31. Paolo Ventura, Friedrich Eisenbrand
    A compact linear program for testing optimality of perfect matchings. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:429-434 [Journal]
  32. Friedrich Eisenbrand, Fabrizio Grandoni
    On the complexity of fixed parameter clique and dominating set. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:57-67 [Journal]
  33. Markus Behle, Friedrich Eisenbrand
    0/1 Vertex and Facet Enumeration with BDDs. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  34. Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
    Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:155-169 [Conf]
  35. Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu
    Algorithms for Longer OLED Lifetime. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:338-351 [Conf]
  36. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
    New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:706-721 [Journal]

  37. New Hardness Results for Diophantine Approximation. [Citation Graph (, )][DBLP]


  38. Diameter of polyhedra: limits of abstraction. [Citation Graph (, )][DBLP]


  39. Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. [Citation Graph (, )][DBLP]


  40. A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP]


  41. Scheduling Periodic Tasks in a Hard Real-Time Environment. [Citation Graph (, )][DBLP]


  42. Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. [Citation Graph (, )][DBLP]


  43. Approximating connected facility location problems via random facility sampling and core detouring. [Citation Graph (, )][DBLP]


  44. EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. [Citation Graph (, )][DBLP]


  45. Testing Additive Integrality Gaps. [Citation Graph (, )][DBLP]


  46. Multiline Addressing by Network Flow. [Citation Graph (, )][DBLP]


  47. The stable set polytope of quasi-line graphs. [Citation Graph (, )][DBLP]


  48. Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations [Citation Graph (, )][DBLP]


  49. Bin Packing via Discrepancy of Permutations [Citation Graph (, )][DBLP]


  50. Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002