The following pages link to Angelika Steger (Q173496):
Displaying 50 items.
- (Q3210200) (← links)
- (Q3416250) (← links)
- (Q3424885) (← links)
- On an Online Spanning Tree Problem in Randomly Weighted Graphs (Q3429744) (← links)
- (Q3447281) (← links)
- Normalization Phenomena in Asynchronous Networks (Q3449516) (← links)
- Optimal Algorithms for k-Search with Application in Option Pricing (Q3527219) (← links)
- On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs (Q3541804) (← links)
- The Degree Sequence of Random Graphs from Subcritical Classes (Q3552496) (← links)
- Upper Bounds for Online Ramsey Games in Random Graphs (Q3557512) (← links)
- Online Ramsey Games in Random Graphs (Q3557513) (← links)
- (Q3576710) (← links)
- (Q3579468) (← links)
- Threshold Functions for Asymmetric Ramsey Properties Involving Cliques (Q3595379) (← links)
- Excluding induced subgraphs: quadrilaterals (Q3970902) (← links)
- Excluding Induced Subgraphs III: A General Asymptotic (Q3989739) (← links)
- (Q3998561) (← links)
- Coloring Clique-free Graphs in Linear Expected Time (Q4019373) (← links)
- (Q4247202) (← links)
- (Q4252431) (← links)
- (Q4273843) (← links)
- Extremal Graph Problems for Graphs with a Color-Critical Vertex (Q4290097) (← links)
- Almost all Berge Graphs are Perfect (Q4291185) (← links)
- Random I‐colorable graphs (Q4322472) (← links)
- (Q4347903) (← links)
- (Q4407450) (← links)
- K<sub>5</sub>‐free subgraphs of random graphs (Q4459590) (← links)
- (Q4471965) (← links)
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 (Q4500859) (← links)
- (Q4525263) (← links)
- (Q4589015) (← links)
- SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS (Q4595743) (← links)
- Local resilience of an almost spanning <i>k</i>‐cycle in random graphs (Q4625026) (← links)
- (Q4633852) (← links)
- On the Evolution of Triangle-Free Graphs (Q4660565) (← links)
- (Q4703851) (← links)
- (Q4718235) (← links)
- Generating Random Regular Graphs Quickly (Q4719436) (← links)
- On the asymptotic structure of sparse triangle free graphs (Q4865522) (← links)
- Explosive Percolation in Erdős–Rényi-Like Random Graph Processes (Q4903267) (← links)
- Maximizing the Minimum Load for Random Processing Times (Q4962175) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument (Q5195237) (← links)
- Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction (Q5214398) (← links)
- Bootstrap percolation with inhibition (Q5216182) (← links)
- Resilience of perfect matchings and Hamiltonicity in random graph processes (Q5229343) (← links)
- On the Number of Graphs Without Large Cliques (Q5246099) (← links)
- STACS 2004 (Q5309736) (← links)
- Unique reconstruction threshold for random jigsaw puzzles (Q5360828) (← links)
- An algorithmic framework for obtaining lower bounds for random Ramsey problems <i>extended abstract</i> (Q5363062) (← links)