| On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004 | 121 | 2004 |
| NOTE–On the membership problem for the elementary closure of a polyhedron F Eisenbrand Combinatorica 19 (2), 297-300, 1999 | 117 | 1999 |
| Carathéodory bounds for integer cones F Eisenbrand, G Shmonin Operations Research Letters 34 (5), 564-568, 2006 | 104 | 2006 |
| Bounds on the Chvátal rank of polytopes in the 0/1-cube F Eisenbrand, AS Schulz Combinatorica 23 (2), 245-261, 2003 | 103* | 2003 |
| Static-priority real-time scheduling: Response time computation is NP-hard F Eisenbrand, T Rothvoß 2008 Real-Time Systems Symposium, 397-406, 2008 | 82 | 2008 |
| Fast integer programming in fixed dimension F Eisenbrand European Symposium on Algorithms, 196-207, 2003 | 74 | 2003 |
| EDF-schedulability of synchronous periodic task systems is coNP-hard F Eisenbrand, T Rothvoß Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 72 | 2010 |
| The stable set polytope of quasi-line graphs F Eisenbrand, G Oriolo, G Stauffer, P Ventura Combinatorica 28 (1), 45-67, 2008 | 67 | 2008 |
| Approximating connected facility location problems via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer Proceeding of Nineteenth annual ACM-SIAM Symposium (SODA'08), 1174-1183, 2008 | 61 | 2008 |
| New approaches for virtual private network design F Eisenbrand, F Grandoni, G Oriolo, M Skutella SIAM Journal on Computing 37 (3), 706-721, 2007 | 53 | 2007 |
| Parametric integer programming in fixed dimension F Eisenbrand, G Shmonin Mathematics of Operations Research 33 (4), 839-850, 2008 | 52 | 2008 |
| Proximity results and faster algorithms for integer programming using the Steinitz lemma F Eisenbrand, R Weismantel ACM Transactions on Algorithms (TALG) 16 (1), 1-14, 2019 | 51 | 2019 |
| Connected facility location via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer Journal of Computer and System Sciences 76 (8), 709-726, 2010 | 51 | 2010 |
| On sub-determinants and the diameter of polyhedra N Bonifas, M Di Summa, F Eisenbrand, N Hähnle, M Niemeier Discrete & Computational Geometry 52 (1), 102-115, 2014 | 49 | 2014 |
| Scheduling periodic tasks in a hard real-time environment F Eisenbrand, N Hähnle, M Niemeier, M Skutella, J Verschae, A Wiese International colloquium on automata, languages, and programming, 299-311, 2010 | 49 | 2010 |
| On the Chvátal rank of polytopes in the 0/1 cube A Bockmayr, F Eisenbrand, M Hartmann, AS Schulz Discrete Applied Mathematics 98 (1-2), 21-27, 1999 | 49 | 1999 |
| Flow faster: Efficient decision algorithms for probabilistic simulations L Zhang, H Hermanns, F Eisenbrand, DN Jansen International Conference on Tools and Algorithms for the Construction and …, 2007 | 48 | 2007 |
| Diameter of polyhedra: limits of abstraction F Eisenbrand, N Hähnle, T Rothvoß Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 41 | 2009 |
| BDDs in a branch and cut framework B Becker, M Behle, F Eisenbrand, R Wimmer International Workshop on Experimental and Efficient Algorithms, 452-463, 2005 | 41 | 2005 |
| Network formulations of mixed-integer programs M Conforti, M Di Summa, F Eisenbrand, LA Wolsey Mathematics of Operations Research 34 (1), 194-209, 2009 | 40 | 2009 |
Holger HermannsProfessor of Computer Science, Saarland University, Saarland Informatics CampusAdresse e-mail validée de cs.uni-saarland.de
