D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 34 Citations 4,488 124 World Ranking 6490 National Ranking 133
Mathematics D-index 33 Citations 4,217 115 World Ranking 1669 National Ranking 31

Research.com Recognitions

Awards & Achievements

2007 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics

Overview

What is she best known for?

The fields of study she is best known for:

  • Combinatorics
  • Artificial intelligence
  • Algorithm

Angelika Steger spends much of her time researching Combinatorics, Discrete mathematics, Random graph, Steiner tree problem and Upper and lower bounds. Her Combinatorics study frequently links to adjacent areas such as Probabilistic logic. Her study in Discrete mathematics focuses on Chordal graph, Induced subgraph, Planar graph, Bipartite graph and Universal graph.

Her study in Random graph is interdisciplinary in nature, drawing from both Almost surely and Random regular graph. Her Steiner tree problem research focuses on Minimum spanning tree and how it connects with Approximation algorithm, Spanning tree and Time complexity. Her research investigates the connection between Upper and lower bounds and topics such as Bin that intersect with problems in Majorization and Chernoff bound.

Her most cited work include:

  • Balls into Bins - A Simple and Tight Analysis (379 citations)
  • Generating Random Regular Graphs Quickly (183 citations)
  • Random planar graphs (152 citations)

What are the main themes of her work throughout her whole career to date?

Her main research concerns Combinatorics, Discrete mathematics, Random graph, Graph and Random regular graph. Her Combinatorics study frequently draws connections between related disciplines such as Upper and lower bounds. Her Discrete mathematics research is multidisciplinary, incorporating elements of Chromatic scale and Approximation algorithm.

Her studies in Approximation algorithm integrate themes in fields like Time complexity and Steiner tree problem. Her Random graph research incorporates themes from Type, Hamiltonian path, Planar graph, Bounded function and Almost surely. Her Random regular graph study integrates concerns from other disciplines, such as Complement graph, Outerplanar graph, Factor-critical graph and Book embedding.

She most often published in these fields:

  • Combinatorics (64.39%)
  • Discrete mathematics (43.90%)
  • Random graph (32.68%)

What were the highlights of her more recent work (between 2017-2021)?

  • Combinatorics (64.39%)
  • Random graph (32.68%)
  • Algorithm (12.20%)

In recent papers she was focusing on the following fields of study:

Combinatorics, Random graph, Algorithm, Discrete mathematics and Neuroscience are her primary areas of study. Angelika Steger focuses mostly in the field of Combinatorics, narrowing it down to topics relating to Evolutionary algorithm and, in certain cases, BETA. Her Random graph study incorporates themes from Bootstrap percolation, Hamiltonian path, Degree, Conjecture and Vertex.

Her work carried out in the field of Algorithm brings together such families of science as Gradient descent, Recurrent neural network, Backpropagation through time and String. Angelika Steger has researched Discrete mathematics in several fields, including Upper and lower bounds and Essentially unique. Her work in the fields of Neuroscience, such as Hippocampus, Disinhibition and Hippocampal formation, overlaps with other areas such as Mechanism.

Between 2017 and 2021, her most popular works were:

  • Drift Analysis and Evolutionary Algorithms Revisited (26 citations)
  • Approximating Real-Time Recurrent Learning with Random Kronecker Factors (19 citations)
  • Resilience of perfect matchings and Hamiltonicity in random graph processes (15 citations)

In her most recent research, the most cited papers focused on:

  • Combinatorics
  • Artificial intelligence
  • Algorithm

Angelika Steger mainly investigates Combinatorics, Monotone polygon, Kronecker delta, Backpropagation through time and Recurrent neural network. Her is doing research in Random graph, Degree and Hitting time, both of which are found in Combinatorics. The concepts of her Random graph study are interwoven with issues in Binary logarithm, Hamiltonian path and Conjecture.

She combines subjects such as Hamiltonian, Almost surely, Vertex, Sequence and Null graph with her study of Degree. Her Function research incorporates elements of Point and Random search. Her Evolutionary algorithm research includes themes of Asymptotically optimal algorithm and Discrete mathematics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Balls into Bins - A Simple and Tight Analysis

Martin Raab;Angelika Steger.
randomization and approximation techniques in computer science (1998)

416 Citations

The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity

H. J. Prömel;Angelika Steger.
(2002)

282 Citations

Generating Random Regular Graphs Quickly

A. Steger;N. C. Wormald.
Combinatorics, Probability & Computing (1999)

265 Citations

Random planar graphs

Colin McDiarmid;Angelika Steger;Dominic J. A. Welsh.
Journal of Combinatorial Theory, Series B (2005)

165 Citations

Finding clusters in VLSI circuits

J. Garbers;H.J. Promel;A. Steger.
international conference on computer aided design (1990)

140 Citations

The Steiner Tree Problem

Hans Jürgen Prömel;Angelika Steger.
(2002)

133 Citations

Excluding Induced Subgraphs III: A General Asymptotic

H. J. Prömel;A. Steger.
Random Structures and Algorithms (1992)

125 Citations

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

Hans Jürgen Prömel;Angelika Steger.
Journal of Algorithms (2000)

125 Citations

Balanced allocations: the heavily loaded case

Petra Berenbrink;Artur Czumaj;Angelika Steger;Berthold Vöcking.
symposium on the theory of computing (2000)

120 Citations

The sparse regularity lemma and its applications

Stefanie Gerke;Angelika Steger.
Surveys in combinatorics 2005 (2005)

90 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Angelika Steger

József Balogh

József Balogh

University of Illinois at Urbana-Champaign

Publications: 53

Colin McDiarmid

Colin McDiarmid

University of Oxford

Publications: 42

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 36

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 32

Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

Publications: 31

Béla Bollobás

Béla Bollobás

University of Memphis

Publications: 29

Vojtěch Rödl

Vojtěch Rödl

Emory University

Publications: 24

Nicholas C. Wormald

Nicholas C. Wormald

Monash University

Publications: 18

Benjamin Doerr

Benjamin Doerr

Max Planck Institute for Informatics

Publications: 17

Peter Sanders

Peter Sanders

Karlsruhe Institute of Technology

Publications: 17

Davide Scaramuzza

Davide Scaramuzza

University of Zurich

Publications: 16

Noga Alon

Noga Alon

Tel Aviv University

Publications: 14

Alan Frieze

Alan Frieze

Carnegie Mellon University

Publications: 13

Artur Czumaj

Artur Czumaj

University of Warwick

Publications: 11

Andrew B. Kahng

Andrew B. Kahng

University of California, San Diego

Publications: 9

Alexander Zelikovsky

Alexander Zelikovsky

Georgia State University

Publications: 9

Something went wrong. Please try again later.