“Balls into bins”—A simple and tight analysis M Raab, A Steger International Workshop on Randomization and Approximation Techniques in …, 1998 | 412 | 1998 |

The Steiner tree problem: a tour through graphs, algorithms, and complexity HJ Prömel, A Steger Springer Science & Business Media, 2012 | 268 | 2012 |

Generating random regular graphs quickly A Steger, NC Wormald Combinatorics, Probability and Computing 8 (04), 377-396, 1999 | 239 | 1999 |

Diskrete Strukturen: Band 1: Kombinatorik, Graphentheorie, Algebra A Steger Springer-Verlag, 2007 | 161 | 2007 |

Random planar graphs C McDiarmid, A Steger, DJA Welsh Journal of Combinatorial Theory Series B 93 (2), 2005 | 161 | 2005 |

Finding clusters in VLSI circuits J Garbers, HJ Promel, A Steger 1990 IEEE International Conference on Computer-Aided Design, 520,521,522,523 …, 1990 | 139 | 1990 |

A new approximation algorithm for the Steiner tree problem with performance ratio 5/3 HJ Prömel, A Steger Journal of Algorithms 36 (1), 89-101, 2000 | 121 | 2000 |

Excluding induced subgraphs III: a general asymptotic HJ Prömel, A Steger Random Structures & Algorithms 3 (1), 19-31, 1992 | 121 | 1992 |

Balanced allocations: the heavily loaded case P Berenbrink, A Czumaj, A Steger, B Vöcking Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 115 | 2000 |

Balanced allocations: The heavily loaded case P Berenbrink, A Czumaj, A Steger, B Vöcking SIAM Journal on Computing 35 (6), 1350-1385, 2006 | 106 | 2006 |

Steiner trees in VLSI-layout B Korte, HJ Prömel, A Steger Paths, Flows, and VLSI-layout 9, 185-214, 1990 | 97 | 1990 |

The sparse regularity lemma and its applications. S Gerke, A Steger Surveys in combinatorics 327, 227-258, 2005 | 85 | 2005 |

Excluding induced subgraphs: quadrilaterals HJ Prömel, A Steger Random Structures and Algorithms 2 (1), 55-71, 1991 | 78 | 1991 |

Interacting maps for fast visual interpretation M Cook, L Gugelmann, F Jug, C Krautz, A Steger The 2011 International Joint Conference on Neural Networks, 770-776, 2011 | 70 | 2011 |

Lectures on proof verification and approximation algorithms EW Mayr, HJ Prömel, A Steger Springer, 2006 | 69 | 2006 |

A new average case analysis for completion time scheduling M Scharbrodt, T Schickinger, A Steger Journal of the ACM (JACM) 53 (1), 121-146, 2006 | 67* | 2006 |

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries T Erlebach, P Rossmanith, H Stadtherr, A Steger, T Zeugmann Theoretical Computer Science 261 (1), 119-156, 2001 | 67* | 2001 |

Excluding induced subgraphs II: extremal graphs HJ Prömel, A Steger Discrete Applied Mathematics 44 (1-3), 283-294, 1993 | 66 | 1993 |

RNC-approximation algorithms for the Steiner problem HJ Prömel, A Steger Annual Symposium on Theoretical Aspects of Computer Science, 559-570, 1997 | 64 | 1997 |

Almost all Berge graphs are perfect HJ Prömel, A Steger Combinatorics, Probability and Computing 1 (1), 53-79, 1992 | 64 | 1992 |