Angelika Steger

MaRDI QIDQ173496zbMATH OpenDBLPFactGridWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An $\mathcal{O}(N)$ time algorithm for finding Hamilton cycles with high probability	2026-04-15	Paper
A simple optimal algorithm for the 2-arm bandit problem	2024-05-14	Paper
The Maximum Label Propagation Algorithm on Sparse Random Graphs	2023-02-03	Paper
RNC-approximation algorithms for the steiner problem Lecture Notes in Computer Science	2022-11-09	Paper
Solving static permutation mastermind using $O(n \log n)$ queries The Electronic Journal of Combinatorics	2022-02-01	Paper
Triangle resilience of the square of a Hamilton cycle in random graphs Journal of Combinatorial Theory. Series B	2021-11-17	Paper
An O(n) time algorithm for finding Hamilton cycles with high probability	2020-12-04	Paper
Bootstrap percolation with inhibition Random Structures & Algorithms	2020-02-14	Paper
A general lower bound for collaborative tree exploration Theoretical Computer Science	2020-02-13	Paper
A general lower bound for collaborative tree exploration Theoretical Computer Science	2020-02-13	Paper
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (available as arXiv preprint)	2020-02-12	Paper
Mutual inhibition with few inhibitory cells via nonlinear inhibitory synaptic interaction Neural Computation	2020-02-07	Paper
When does hillclimbing fail on monotone functions: an entropy compression argument 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-18	Paper
Resilience of perfect matchings and Hamiltonicity in random graph processes Random Structures & Algorithms	2019-08-14	Paper
The linear hidden subset problem for the $(1 + 1)$ EA with scheduled and adaptive mutation rates Theoretical Computer Science	2019-07-31	Paper
Multiassociative memory: recurrent synapses increase storage capacity Neural Computation	2019-06-06	Paper
The maximum degree of random planar graphs	2019-05-10	Paper
Maximal biconnected subgraphs of random planar graphs	2019-05-06	Paper
Local resilience of an almost spanning <i>k</i>‐cycle in random graphs Random Structures & Algorithms	2019-02-20	Paper
Maximizing the minimum load for random processing times ACM Transactions on Algorithms	2018-10-30	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems Journal of Combinatorial Theory. Series B	2018-10-29	Paper
Even flying cops should think ahead (available as arXiv preprint)	2018-08-17	Paper
Polynomial lower bound for distributed graph coloring in a weak LOCAL model (available as arXiv preprint)	2018-08-16	Paper
Drift analysis and evolutionary algorithms revisited Combinatorics, Probability and Computing	2018-07-24	Paper
A general lower bound for collaborative tree exploration Structural Information and Communication Complexity	2018-04-12	Paper
Symmetric and asymmetric Ramsey properties in random hypergraphs Forum of Mathematics, Sigma	2017-12-06	Paper
The determinism of randomness and its use in combinatorics	2017-11-06	Paper
Local resilience for squares of almost spanning cycles in sparse random graphs The Electronic Journal of Combinatorics	2017-10-16	Paper
Local resilience for squares of almost spanning cycles in sparse random graphs The Electronic Journal of Combinatorics	2017-10-16	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems: extended abstract Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
A short proof of the random Ramsey theorem Combinatorics, Probability and Computing	2017-10-04	Paper
On the degree distribution of random planar graphs	2017-09-29	Paper
Unique reconstruction threshold for random jigsaw puzzles Chicago Journal of Theoretical Computer Science	2017-09-26	Paper
Note on the coefficient of variations of neuronal spike trains Biological Cybernetics	2017-09-12	Paper
Connectivity thresholds for bounded size rules The Annals of Applied Probability	2016-12-09	Paper
On the threshold for the maker-breaker H-game Random Structures & Algorithms	2016-11-09	Paper
Random directed graphs are robustly Hamiltonian Random Structures & Algorithms	2016-09-15	Paper
A quasi-polynomial time approximation scheme for minimum weight triangulation Journal of the ACM	2015-11-11	Paper
Normalization phenomena in asynchronous networks Automata, Languages, and Programming	2015-11-04	Paper
On the number of graphs without large cliques SIAM Journal on Discrete Mathematics	2015-04-17	Paper
The game chromatic number of dense random graphs The Electronic Journal of Combinatorics	2015-01-22	Paper
The game chromatic number of dense random graphs The Electronic Journal of Combinatorics	2015-01-22	Paper
On extremal subgraphs of random graphs	2014-12-18	Paper
A quasi-polynomial time approximation scheme for minimum weight triangulation Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing	2014-11-25	Paper
The maximum degree of random planar graphs Proceedings of the London Mathematical Society	2014-11-18	Paper
Maximal biconnected subgraphs of random planar graphs ACM Transactions on Algorithms	2014-11-18	Paper
Random planar graphs with n nodes and a fixed number of edges	2014-10-13	Paper
Balanced allocations: the heavily loaded case Proceedings of the thirty-second annual ACM symposium on Theory of computing	2014-09-26	Paper
Synchrony and asynchrony in neural networks	2014-05-22	Paper
On the insertion time of cuckoo hashing SIAM Journal on Computing	2014-04-11	Paper
General deletion lemmas via the Harris inequality Journal of Combinatorics	2013-11-05	Paper
A randomized version of Ramsey's theorem	2013-11-01	Paper
Explosive percolation in Erdős-Rényi-like random graph processes	2013-11-01	Paper
Coloring the edges of a random graph without a monochromatic giant component Electronic Notes in Discrete Mathematics	2013-10-10	Paper
Explosive percolation in Erdős-Rényi-like random graph processes Combinatorics, Probability and Computing	2013-01-21	Paper
A randomized version of Ramsey's theorem Random Structures & Algorithms	2012-12-14	Paper
Extremal subgraphs of random graphs Random Structures & Algorithms	2012-10-26	Paper
On properties of random dissections and triangulations Combinatorica	2011-12-19	Paper
Pegging graphs yields a small diameter Combinatorics, Probability and Computing	2011-03-07	Paper
Offline thresholds for Ramsey-type games on random graphs Random Structures & Algorithms	2010-11-10	Paper
Asymmetric Ramsey properties of random graphs involving cliques Random Structures & Algorithms	2010-11-09	Paper
Coloring the edges of a random graph without a monochromatic giant component The Electronic Journal of Combinatorics	2010-10-13	Paper
Coloring the edges of a random graph without a monochromatic giant component The Electronic Journal of Combinatorics	2010-10-13	Paper
scientific article; zbMATH DE number 5764875 (Why is no real title available?)	2010-08-06	Paper
A new average case analysis for completion time scheduling Proceedings of the thiry-fourth annual ACM symposium on Theory of computing	2010-08-05	Paper
A probabilistic counting Lemma for complete graphs	2010-07-30	Paper
Upper bounds for online Ramsey games in random graphs Combinatorics, Probability and Computing	2010-04-23	Paper
Online Ramsey games in random graphs Combinatorics, Probability and Computing	2010-04-23	Paper
The degree sequence of random graphs from subcritical classes Combinatorics, Probability and Computing	2010-04-22	Paper
Optimal algorithms for $k$-search with application in option pricing Algorithmica	2009-08-27	Paper
Approximation schemes for node-weighted geometric Steiner tree problems Algorithmica	2009-07-24	Paper
A note on the chromatic number of a dense random graph Discrete Mathematics	2009-06-23	Paper
On the resilience of long cycles in random graphs The Electronic Journal of Combinatorics	2009-04-07	Paper
On the resilience of long cycles in random graphs The Electronic Journal of Combinatorics	2009-04-07	Paper
A tight bound on the collection of edges in MSTs of induced subgraphs Journal of Combinatorial Theory. Series B	2009-03-04	Paper
A tight bound on the collection of edges in MSTs of induced subgraphs Journal of Combinatorial Theory. Series B	2009-03-04	Paper
A new average case analysis for completion time scheduling Journal of the ACM	2008-12-21	Paper
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs Lecture Notes in Computer Science	2008-11-27	Paper
On the chromatic number of random graphs Journal of Combinatorial Theory. Series B	2008-10-07	Paper
Optimal Algorithms for k-Search with Application in Option Pricing Algorithms – ESA 2007	2008-09-25	Paper
The random planar graph process Random Structures & Algorithms	2008-03-28	Paper
A probabilistic counting lemma for complete graphs Random Structures & Algorithms	2008-01-08	Paper
Observational Learning in Random Networks Learning Theory	2008-01-03	Paper
On the Chromatic Number of Random Graphs Automata, Languages and Programming	2007-11-28	Paper
$K_4$-free subgraphs of random graphs revisited Combinatorica	2007-11-12	Paper
STACS 2004 Lecture Notes in Computer Science	2007-10-01	Paper
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2007-08-28	Paper
Random planar graphs with given average degree	2007-06-28	Paper
On an Online Spanning Tree Problem in Randomly Weighted Graphs Combinatorics, Probability and Computing	2007-03-20	Paper
A characterization for sparse -regular pairs The Electronic Journal of Combinatorics	2007-03-12	Paper
A characterization for sparse -regular pairs The Electronic Journal of Combinatorics	2007-03-12	Paper
scientific article; zbMATH DE number 5130821 (Why is no real title available?)	2007-03-05	Paper
The sparse regularity lemma and its applications	2007-01-19	Paper
Small subsets inherit sparse $\varepsilon$-regularity Journal of Combinatorial Theory. Series B	2007-01-11	Paper
The expected competitive ratio for weighted completion time scheduling Theory of Computing Systems	2006-10-25	Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science	2006-07-07	Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques	2006-07-07	Paper
Balanced Allocations: The Heavily Loaded Case SIAM Journal on Computing	2006-06-01	Paper
Experimental and Efficient Algorithms Lecture Notes in Computer Science	2005-11-30	Paper
On the Evolution of Triangle-Free Graphs Combinatorics, Probability and Computing	2005-04-04	Paper
Random planar graphs Journal of Combinatorial Theory. Series B	2005-03-08	Paper
scientific article; zbMATH DE number 2079854 (Why is no real title available?)	2004-08-03	Paper
K<sub>5</sub>‐free subgraphs of random graphs Random Structures & Algorithms	2004-03-29	Paper
scientific article; zbMATH DE number 1944142 (Why is no real title available?)	2003-01-01	Paper
A note on triangle-free and bipartite graphs Discrete Mathematics	2002-12-02	Paper
Phase transitions in the evolution of partial orders Journal of Combinatorial Theory. Series A	2002-06-02	Paper
On the structure of clique-free graphs Random Structures & Algorithms	2001-10-14	Paper

Research outcomes over time

This page was built for person: Angelika Steger

Publication	Date of Publication	Type
An \(\mathcal{O}(N)\) time algorithm for finding Hamilton cycles with high probability	2026-04-15	Paper
A simple optimal algorithm for the 2-arm bandit problem	2024-05-14	Paper
The Maximum Label Propagation Algorithm on Sparse Random Graphs	2023-02-03	Paper
RNC-approximation algorithms for the steiner problem Lecture Notes in Computer Science	2022-11-09	Paper
Solving static permutation mastermind using \(O(n \log n)\) queries The Electronic Journal of Combinatorics	2022-02-01	Paper
Triangle resilience of the square of a Hamilton cycle in random graphs Journal of Combinatorial Theory. Series B	2021-11-17	Paper
An O(n) time algorithm for finding Hamilton cycles with high probability	2020-12-04	Paper
Bootstrap percolation with inhibition Random Structures & Algorithms	2020-02-14	Paper
A general lower bound for collaborative tree exploration Theoretical Computer Science	2020-02-13	Paper
A general lower bound for collaborative tree exploration Theoretical Computer Science	2020-02-13	Paper
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (available as arXiv preprint)	2020-02-12	Paper
Mutual inhibition with few inhibitory cells via nonlinear inhibitory synaptic interaction Neural Computation	2020-02-07	Paper
When does hillclimbing fail on monotone functions: an entropy compression argument 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-18	Paper
Resilience of perfect matchings and Hamiltonicity in random graph processes Random Structures & Algorithms	2019-08-14	Paper
The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates Theoretical Computer Science	2019-07-31	Paper
Multiassociative memory: recurrent synapses increase storage capacity Neural Computation	2019-06-06	Paper
The maximum degree of random planar graphs	2019-05-10	Paper
Maximal biconnected subgraphs of random planar graphs	2019-05-06	Paper
Local resilience of an almost spanning <i>k</i>‐cycle in random graphs Random Structures & Algorithms	2019-02-20	Paper
Maximizing the minimum load for random processing times ACM Transactions on Algorithms	2018-10-30	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems Journal of Combinatorial Theory. Series B	2018-10-29	Paper
Even flying cops should think ahead (available as arXiv preprint)	2018-08-17	Paper
Polynomial lower bound for distributed graph coloring in a weak LOCAL model (available as arXiv preprint)	2018-08-16	Paper
Drift analysis and evolutionary algorithms revisited Combinatorics, Probability and Computing	2018-07-24	Paper
A general lower bound for collaborative tree exploration Structural Information and Communication Complexity	2018-04-12	Paper
Symmetric and asymmetric Ramsey properties in random hypergraphs Forum of Mathematics, Sigma	2017-12-06	Paper
The determinism of randomness and its use in combinatorics	2017-11-06	Paper
Local resilience for squares of almost spanning cycles in sparse random graphs The Electronic Journal of Combinatorics	2017-10-16	Paper
Local resilience for squares of almost spanning cycles in sparse random graphs The Electronic Journal of Combinatorics	2017-10-16	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems: extended abstract Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
A short proof of the random Ramsey theorem Combinatorics, Probability and Computing	2017-10-04	Paper
On the degree distribution of random planar graphs	2017-09-29	Paper
Unique reconstruction threshold for random jigsaw puzzles Chicago Journal of Theoretical Computer Science	2017-09-26	Paper
Note on the coefficient of variations of neuronal spike trains Biological Cybernetics	2017-09-12	Paper
Connectivity thresholds for bounded size rules The Annals of Applied Probability	2016-12-09	Paper
On the threshold for the maker-breaker H-game Random Structures & Algorithms	2016-11-09	Paper
Random directed graphs are robustly Hamiltonian Random Structures & Algorithms	2016-09-15	Paper
A quasi-polynomial time approximation scheme for minimum weight triangulation Journal of the ACM	2015-11-11	Paper
Normalization phenomena in asynchronous networks Automata, Languages, and Programming	2015-11-04	Paper
On the number of graphs without large cliques SIAM Journal on Discrete Mathematics	2015-04-17	Paper
The game chromatic number of dense random graphs The Electronic Journal of Combinatorics	2015-01-22	Paper
The game chromatic number of dense random graphs The Electronic Journal of Combinatorics	2015-01-22	Paper
On extremal subgraphs of random graphs	2014-12-18	Paper
A quasi-polynomial time approximation scheme for minimum weight triangulation Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing	2014-11-25	Paper
The maximum degree of random planar graphs Proceedings of the London Mathematical Society	2014-11-18	Paper
Maximal biconnected subgraphs of random planar graphs ACM Transactions on Algorithms	2014-11-18	Paper
Random planar graphs with n nodes and a fixed number of edges	2014-10-13	Paper
Balanced allocations: the heavily loaded case Proceedings of the thirty-second annual ACM symposium on Theory of computing	2014-09-26	Paper
Synchrony and asynchrony in neural networks	2014-05-22	Paper
On the insertion time of cuckoo hashing SIAM Journal on Computing	2014-04-11	Paper
General deletion lemmas via the Harris inequality Journal of Combinatorics	2013-11-05	Paper
A randomized version of Ramsey's theorem	2013-11-01	Paper
Explosive percolation in Erdős-Rényi-like random graph processes	2013-11-01	Paper
Coloring the edges of a random graph without a monochromatic giant component Electronic Notes in Discrete Mathematics	2013-10-10	Paper
Explosive percolation in Erdős-Rényi-like random graph processes Combinatorics, Probability and Computing	2013-01-21	Paper
A randomized version of Ramsey's theorem Random Structures & Algorithms	2012-12-14	Paper
Extremal subgraphs of random graphs Random Structures & Algorithms	2012-10-26	Paper
On properties of random dissections and triangulations Combinatorica	2011-12-19	Paper
Pegging graphs yields a small diameter Combinatorics, Probability and Computing	2011-03-07	Paper
Offline thresholds for Ramsey-type games on random graphs Random Structures & Algorithms	2010-11-10	Paper
Asymmetric Ramsey properties of random graphs involving cliques Random Structures & Algorithms	2010-11-09	Paper
Coloring the edges of a random graph without a monochromatic giant component The Electronic Journal of Combinatorics	2010-10-13	Paper
Coloring the edges of a random graph without a monochromatic giant component The Electronic Journal of Combinatorics	2010-10-13	Paper
scientific article; zbMATH DE number 5764875 (Why is no real title available?)	2010-08-06	Paper
A new average case analysis for completion time scheduling Proceedings of the thiry-fourth annual ACM symposium on Theory of computing	2010-08-05	Paper
A probabilistic counting Lemma for complete graphs	2010-07-30	Paper
Upper bounds for online Ramsey games in random graphs Combinatorics, Probability and Computing	2010-04-23	Paper
Online Ramsey games in random graphs Combinatorics, Probability and Computing	2010-04-23	Paper
The degree sequence of random graphs from subcritical classes Combinatorics, Probability and Computing	2010-04-22	Paper
Optimal algorithms for \(k\)-search with application in option pricing Algorithmica	2009-08-27	Paper
Approximation schemes for node-weighted geometric Steiner tree problems Algorithmica	2009-07-24	Paper
A note on the chromatic number of a dense random graph Discrete Mathematics	2009-06-23	Paper
On the resilience of long cycles in random graphs The Electronic Journal of Combinatorics	2009-04-07	Paper
On the resilience of long cycles in random graphs The Electronic Journal of Combinatorics	2009-04-07	Paper
A tight bound on the collection of edges in MSTs of induced subgraphs Journal of Combinatorial Theory. Series B	2009-03-04	Paper
A tight bound on the collection of edges in MSTs of induced subgraphs Journal of Combinatorial Theory. Series B	2009-03-04	Paper
A new average case analysis for completion time scheduling Journal of the ACM	2008-12-21	Paper
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs Lecture Notes in Computer Science	2008-11-27	Paper
On the chromatic number of random graphs Journal of Combinatorial Theory. Series B	2008-10-07	Paper
Optimal Algorithms for k-Search with Application in Option Pricing Algorithms – ESA 2007	2008-09-25	Paper
The random planar graph process Random Structures & Algorithms	2008-03-28	Paper
A probabilistic counting lemma for complete graphs Random Structures & Algorithms	2008-01-08	Paper
Observational Learning in Random Networks Learning Theory	2008-01-03	Paper
On the Chromatic Number of Random Graphs Automata, Languages and Programming	2007-11-28	Paper
\(K_4\)-free subgraphs of random graphs revisited Combinatorica	2007-11-12	Paper
STACS 2004 Lecture Notes in Computer Science	2007-10-01	Paper
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2007-08-28	Paper
Random planar graphs with given average degree	2007-06-28	Paper
On an Online Spanning Tree Problem in Randomly Weighted Graphs Combinatorics, Probability and Computing	2007-03-20	Paper
A characterization for sparse -regular pairs The Electronic Journal of Combinatorics	2007-03-12	Paper
A characterization for sparse -regular pairs The Electronic Journal of Combinatorics	2007-03-12	Paper
scientific article; zbMATH DE number 5130821 (Why is no real title available?)	2007-03-05	Paper
The sparse regularity lemma and its applications	2007-01-19	Paper
Small subsets inherit sparse \(\varepsilon\)-regularity Journal of Combinatorial Theory. Series B	2007-01-11	Paper
The expected competitive ratio for weighted completion time scheduling Theory of Computing Systems	2006-10-25	Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science	2006-07-07	Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques	2006-07-07	Paper
Balanced Allocations: The Heavily Loaded Case SIAM Journal on Computing	2006-06-01	Paper
Experimental and Efficient Algorithms Lecture Notes in Computer Science	2005-11-30	Paper
On the Evolution of Triangle-Free Graphs Combinatorics, Probability and Computing	2005-04-04	Paper
Random planar graphs Journal of Combinatorial Theory. Series B	2005-03-08	Paper
scientific article; zbMATH DE number 2079854 (Why is no real title available?)	2004-08-03	Paper
K<sub>5</sub>‐free subgraphs of random graphs Random Structures & Algorithms	2004-03-29	Paper
scientific article; zbMATH DE number 1944142 (Why is no real title available?)	2003-01-01	Paper
A note on triangle-free and bipartite graphs Discrete Mathematics	2002-12-02	Paper
Phase transitions in the evolution of partial orders Journal of Combinatorial Theory. Series A	2002-06-02	Paper
On the structure of clique-free graphs Random Structures & Algorithms	2001-10-14	Paper