2007 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
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 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.
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.
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.
Balls into Bins - A Simple and Tight Analysis
Martin Raab;Angelika Steger.
randomization and approximation techniques in computer science (1998)
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity
H. J. Prömel;Angelika Steger.
Generating Random Regular Graphs Quickly
A. Steger;N. C. Wormald.
Combinatorics, Probability & Computing (1999)
Random planar graphs
Colin McDiarmid;Angelika Steger;Dominic J. A. Welsh.
Journal of Combinatorial Theory, Series B (2005)
Finding clusters in VLSI circuits
J. Garbers;H.J. Promel;A. Steger.
international conference on computer aided design (1990)
The Steiner Tree Problem
Hans Jürgen Prömel;Angelika Steger.
Excluding Induced Subgraphs III: A General Asymptotic
H. J. Prömel;A. Steger.
Random Structures and Algorithms (1992)
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)
Balanced allocations: the heavily loaded case
Petra Berenbrink;Artur Czumaj;Angelika Steger;Berthold Vöcking.
symposium on the theory of computing (2000)
The sparse regularity lemma and its applications
Stefanie Gerke;Angelika Steger.
Surveys in combinatorics 2005 (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: