| On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004 | 143 | 2004 |
| NOTE–On the membership problem for the elementary closure of a polyhedron F Eisenbrand Combinatorica 19 (2), 297-300, 1999 | 118 | 1999 |
| Carathéodory bounds for integer cones F Eisenbrand, G Shmonin Operations Research Letters 34 (5), 564-568, 2006 | 113 | 2006 |
| Bounds on the Chvátal rank of polytopes in the 0/1-cube F Eisenbrand, AS Schulz Combinatorica 23 (2), 245-261, 2003 | 108* | 2003 |
| Static-priority real-time scheduling: Response time computation is NP-hard F Eisenbrand, T Rothvoß 2008 Real-Time Systems Symposium, 397-406, 2008 | 89 | 2008 |
| Fast integer programming in fixed dimension F Eisenbrand European symposium on algorithms, 196-207, 2003 | 79 | 2003 |
| 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 | 78 | 2019 |
| 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 | 77 | 2010 |
| The stable set polytope of quasi-line graphs F Eisenbrand, G Oriolo, G Stauffer, P Ventura Combinatorica 28 (1), 45-67, 2008 | 71 | 2008 |
| Combinatorial optimization GP Cornuéjols, F Eisenbrand, B Shepherd Oberwolfach Reports 11 (4), 2873-2932, 2015 | 69 | 2015 |
| 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 | 69 | 2014 |
| Approximating connected facility location problems via random facility sampling and core detouring F Eisenbrand, F Grandoni, T Rothvoß, G Schäfer | 63 | 2007 |
| An algorithmic theory of integer programming F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn arXiv preprint arXiv:1904.01361, 2019 | 56 | 2019 |
| New approaches for virtual private network design F Eisenbrand, F Grandoni, G Oriolo, M Skutella SIAM Journal on Computing 37 (3), 706-721, 2007 | 56 | 2007 |
| Parametric integer programming in fixed dimension F Eisenbrand, G Shmonin Mathematics of Operations Research 33 (4), 839-850, 2008 | 54 | 2008 |
| 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 | 52 | 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 | 52 | 1999 |
| On largest volume simplices and sub-determinants MD Summa, F Eisenbrand, Y Faenza, C Moldenhauer Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 51 | 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 | 51 | 2010 |
| Flow faster: Efficient decision algorithms for probabilistic simulations DN Jansen, F Eisenbrand, H Hermanns, L Zhang Logical Methods in Computer Science 4, 2008 | 51 | 2008 |
Holger HermannsProfessor of Computer Science, Saarland University, Saarland Informatics CampusVerified email at cs.uni-saarland.de
