On the complexity of fixed parameter clique and dominating set F Eisenbrand, F Grandoni Theoretical Computer Science 326 (1-3), 57-67, 2004 | 173 | 2004 |

Carathéodory bounds for integer cones F Eisenbrand, G Shmonin Operations Research Letters 34 (5), 564-568, 2006 | 134 | 2006 |

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 | 128 | 2019 |

NOTE–On the membership problem for the elementary closure of a polyhedron F Eisenbrand Combinatorica 19 (2), 297-300, 1999 | 128 | 1999 |

Bounds on the Chvátal rank of polytopes in the 0/1-cube F Eisenbrand, AS Schulz Combinatorica 23, 245-261, 2003 | 115* | 2003 |

Static-priority real-time scheduling: Response time computation is NP-hard F Eisenbrand, T Rothvoß 2008 Real-Time Systems Symposium, 397-406, 2008 | 101 | 2008 |

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 | 91 | 2010 |

Fast integer programming in fixed dimension F Eisenbrand European symposium on algorithms, 196-207, 2003 | 86 | 2003 |

On sub-determinants and the diameter of polyhedra N Bonifas, M Di Summa, F Eisenbrand, N Hähnle, M Niemeier Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 82 | 2012 |

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 | 80 | 2019 |

The stable set polytope of quasi-line graphs F Eisenbrand, G Oriolo, G Stauffer, P Ventura Combinatorica 28, 45-67, 2008 | 78 | 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 | 68 | 2008 |

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 | 67 | 2014 |

Faster algorithms for integer programs with block structure F Eisenbrand, C Hunkenschröder, KM Klein arXiv preprint arXiv:1802.06289, 2018 | 62 | 2018 |

Parametric integer programming in fixed dimension F Eisenbrand, G Shmonin Mathematics of Operations Research 33 (4), 839-850, 2008 | 60 | 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 | 58 | 2010 |

Scheduling periodic tasks in a hard real-time environment F Eisenbrand, N Hähnle, M Niemeier, M Skutella, J Verschae, A Wiese Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 57 | 2010 |

New approaches for virtual private network design F Eisenbrand, F Grandoni, G Oriolo, M Skutella SIAM Journal on Computing 37 (3), 706-721, 2007 | 57 | 2007 |

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 | 55 | 1999 |

Flow faster: Efficient decision algorithms for probabilistic simulations L Zhang, H Hermanns, F Eisenbrand, DN Jansen Logical Methods in Computer Science 4, 2008 | 51 | 2008 |