Concepedia

Hanno Lefmann

HL

35

Publications

1.2K

Citations

19

H-Index

1986

Active since

Affiliations

TU Dortmund University(Current)

Chemnitz University of Technology

Universidade Federal do Rio Grande do Sul

Emory University

Bielefeld University

Hanno Lefmann is an author at TU Dortmund University specializing in discrete mathematics, graph theory, and combinatorial optimization.

Top concepts

Discrete MathematicsGraph TheoryCombinatorial OptimizationEngineeringMathematical ProgrammingComputational ComplexityComputational GeometryGeometryEducationComputer Science

Publications per year

1986–2017

35

Publications

35

The Algorithmic Aspects of the Regularity Lemma

Noga Alon, Richard A. Duke, Hanno Lefmann et al. · Journal of Algorithms · 1994 · 319 citations

Mathematical Programming, Engineering, Variational Analysis +4

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph

Richard A. Duke, Hanno Lefmann, V. Rödl · SIAM Journal on Computing · 1995 · 112 citations

Graph Sparsity, Engineering, Network Analysis +20

On uncrowded hypergraphs

Richard A. Duke, Hanno Lefmann, Vojtěch Rödl · Random Structures and Algorithms · 1995 · 84 citations

N Vertices, Geometric Graph Theory, Uncrowded Hypergraphs +12

Some typical properties of large AND/OR Boolean formulas

Hanno Lefmann, Petr Savick� · Random Structures and Algorithms · 1997 · 45 citations

Circuit Complexity, Theory Of Computing, Binary Trees +13

Infinite partition regular matrices

Walter Deuber, Neil Hindman, Imre Leader et al. · COMBINATORICA · 1995 · 30 citations

Random Matrix, Representation Theory, Matrix Theory +1

Rows per page

1–5 of 35