Angelika Steger

From MaRDI portal
Person:173496

Available identifiers

zbMath Open steger.angelikaDBLPs/AngelikaStegerFactGridQ884974WikidataQ25345723 ScholiaQ25345723MaRDI QIDQ173496

List of research outcomes





PublicationDate of PublicationType
A simple optimal algorithm for the 2-arm bandit problem2024-05-14Paper
The Maximum Label Propagation Algorithm on Sparse Random Graphs2023-02-03Paper
RNC-approximation algorithms for the steiner problem2022-11-09Paper
Solving static permutation mastermind using \(O(n \log n)\) queries2022-02-01Paper
Triangle resilience of the square of a Hamilton cycle in random graphs2021-11-17Paper
An O(n) time algorithm for finding Hamilton cycles with high probability2020-12-04Paper
Bootstrap percolation with inhibition2020-02-14Paper
A general lower bound for collaborative tree exploration2020-02-13Paper
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm2020-02-12Paper
Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction2020-02-07Paper
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument2019-09-18Paper
Resilience of perfect matchings and Hamiltonicity in random graph processes2019-08-14Paper
The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates2019-07-31Paper
Multiassociative Memory: Recurrent Synapses Increase Storage Capacity2019-06-06Paper
https://portal.mardi4nfdi.de/entity/Q57433992019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338522019-05-06Paper
Local resilience of an almost spanning k‐cycle in random graphs2019-02-20Paper
Maximizing the Minimum Load for Random Processing Times2018-10-30Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems2018-10-29Paper
Even flying cops should think ahead2018-08-17Paper
Polynomial lower bound for distributed graph coloring in a weak LOCAL model2018-08-16Paper
Drift Analysis and Evolutionary Algorithms Revisited2018-07-24Paper
A general lower bound for collaborative tree exploration2018-04-12Paper
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS2017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45890152017-11-06Paper
Local resilience for squares of almost spanning cycles in sparse random graphs2017-10-16Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract2017-10-05Paper
A Short Proof of the Random Ramsey Theorem2017-10-04Paper
https://portal.mardi4nfdi.de/entity/Q53651102017-09-29Paper
Unique reconstruction threshold for random jigsaw puzzles2017-09-26Paper
Note on the coefficient of variations of neuronal spike trains2017-09-12Paper
Connectivity thresholds for bounded size rules2016-12-09Paper
On the threshold for the maker-breaker \(H\)-game2016-11-09Paper
Random directed graphs are robustly Hamiltonian2016-09-15Paper
A quasi-polynomial time approximation scheme for minimum weight triangulation2015-11-11Paper
Normalization Phenomena in Asynchronous Networks2015-11-04Paper
On the Number of Graphs Without Large Cliques2015-04-17Paper
The game chromatic number of dense random graphs2015-01-22Paper
https://portal.mardi4nfdi.de/entity/Q29346292014-12-18Paper
A quasi-polynomial time approximation scheme for minimum weight triangulation2014-11-25Paper
The maximum degree of random planar graphs2014-11-18Paper
Maximal biconnected subgraphs of random planar graphs2014-11-18Paper
Random planar graphs with \(n\) nodes and a fixed number of edges2014-10-13Paper
Balanced allocations2014-09-26Paper
https://portal.mardi4nfdi.de/entity/Q54176802014-05-22Paper
On the Insertion Time of Cuckoo Hashing2014-04-11Paper
General deletion lemmas via the Harris inequality2013-11-05Paper
Explosive percolation in Erdős-Rényi-like random graph processes2013-11-01Paper
A randomized version of Ramsey's theorem2013-11-01Paper
Coloring the edges of a random graph without a monochromatic giant component2013-10-10Paper
Explosive Percolation in Erdős–Rényi-Like Random Graph Processes2013-01-21Paper
A randomized version of Ramsey's theorem2012-12-14Paper
Extremal subgraphs of random graphs2012-10-26Paper
On properties of random dissections and triangulations2011-12-19Paper
Pegging Graphs Yields a Small Diameter2011-03-07Paper
Offline thresholds for Ramsey-type games on random graphs2010-11-10Paper
Asymmetric Ramsey properties of random graphs involving cliques2010-11-09Paper
Coloring the edges of a random graph without a monochromatic giant component2010-10-13Paper
https://portal.mardi4nfdi.de/entity/Q35794682010-08-06Paper
A new average case analysis for completion time scheduling2010-08-05Paper
https://portal.mardi4nfdi.de/entity/Q35767102010-07-30Paper
Upper Bounds for Online Ramsey Games in Random Graphs2010-04-23Paper
Online Ramsey Games in Random Graphs2010-04-23Paper
The Degree Sequence of Random Graphs from Subcritical Classes2010-04-22Paper
Optimal algorithms for \(k\)-search with application in option pricing2009-08-27Paper
Approximation schemes for node-weighted geometric Steiner tree problems2009-07-24Paper
A note on the chromatic number of a dense random graph2009-06-23Paper
On the resilience of long cycles in random graphs2009-04-07Paper
A tight bound on the collection of edges in MSTs of induced subgraphs2009-03-04Paper
A new average case analysis for completion time scheduling2008-12-21Paper
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs2008-11-27Paper
On the chromatic number of random graphs2008-10-07Paper
Optimal Algorithms for k-Search with Application in Option Pricing2008-09-25Paper
The random planar graph process2008-03-28Paper
A probabilistic counting lemma for complete graphs2008-01-08Paper
Observational Learning in Random Networks2008-01-03Paper
On the Chromatic Number of Random Graphs2007-11-28Paper
\(K_4\)-free subgraphs of random graphs revisited2007-11-12Paper
STACS 20042007-10-01Paper
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques2007-08-28Paper
https://portal.mardi4nfdi.de/entity/Q34472812007-06-28Paper
On an Online Spanning Tree Problem in Randomly Weighted Graphs2007-03-20Paper
A characterization for sparse \(\varepsilon\)-regular pairs2007-03-12Paper
https://portal.mardi4nfdi.de/entity/Q34248852007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34162502007-01-19Paper
Small subsets inherit sparse \(\varepsilon\)-regularity2007-01-11Paper
The expected competitive ratio for weighted completion time scheduling2006-10-25Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Balanced Allocations: The Heavily Loaded Case2006-06-01Paper
Experimental and Efficient Algorithms2005-11-30Paper
On the Evolution of Triangle-Free Graphs2005-04-04Paper
Random planar graphs2005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q44719652004-08-03Paper
K5‐free subgraphs of random graphs2004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44074502003-01-01Paper
A note on triangle-free and bipartite graphs2002-12-02Paper
Phase transitions in the evolution of partial orders2002-06-02Paper
On the structure of clique-free graphs2001-10-14Paper
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries2001-08-20Paper
Asymptotic enumeration, global structure, and constrained evolution2001-07-24Paper
Counting partial orders with a fixed number of comparable pairs2001-07-18Paper
Discrete structures 2. Probability theory and statistics2001-07-16Paper
Discrete structures 1. Combinatorics, graph theory, algebra2001-04-22Paper
Approximability of scheduling with fixed jobs2001-02-01Paper
https://portal.mardi4nfdi.de/entity/Q45252632001-01-21Paper
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/32000-08-27Paper
Generating Random Regular Graphs Quickly2000-05-14Paper
https://portal.mardi4nfdi.de/entity/Q42472022000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q47038511999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42524311999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q43479031997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47182351997-01-29Paper
https://portal.mardi4nfdi.de/entity/Q56890371997-01-23Paper
Counting \(H\)-free graphs1996-07-18Paper
Tidier examples for lower bounds on diagonal Ramsey numbers1996-07-09Paper
https://portal.mardi4nfdi.de/entity/Q42738431996-05-30Paper
The average number of linear extensions of a partial order1996-02-26Paper
On the asymptotic structure of sparse triangle free graphs1996-02-25Paper
Probabilistically checkable proofs and their consequences for approximation algorithms1995-11-06Paper
Random I‐colorable graphs1995-02-09Paper
Almost all Berge Graphs are Perfect1994-05-30Paper
On induced matchings1994-05-19Paper
Extremal Graph Problems for Graphs with a Color-Critical Vertex1994-04-28Paper
Excluding induced subgraphs. II: Extremal graphs1993-11-30Paper
The asymptotic number of graphs not containing a fixed color-critical subgraph1993-03-10Paper
Coloring Clique-free Graphs in Linear Expected Time1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39985611992-09-17Paper
Excluding Induced Subgraphs III: A General Asymptotic1992-06-28Paper
Excluding induced subgraphs: quadrilaterals1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q32102001990-01-01Paper

Research outcomes over time

This page was built for person: Angelika Steger