The following pages link to Angelika Steger (Q173496):
Displaying 50 items.
- Connectivity thresholds for bounded size rules (Q350719) (← links)
- General deletion lemmas via the Harris inequality (Q376551) (← links)
- The game chromatic number of dense random graphs (Q490261) (← links)
- On properties of random dissections and triangulations (Q653837) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- On induced matchings (Q687143) (← links)
- Optimal algorithms for \(k\)-search with application in option pricing (Q834594) (← links)
- Small subsets inherit sparse \(\varepsilon\)-regularity (Q858679) (← links)
- A characterization for sparse \(\varepsilon\)-regular pairs (Q870053) (← links)
- On the chromatic number of random graphs (Q947725) (← links)
- A tight bound on the collection of edges in MSTs of induced subgraphs (Q1003845) (← links)
- On the resilience of long cycles in random graphs (Q1010740) (← links)
- A note on the chromatic number of a dense random graph (Q1025972) (← links)
- (Q1204521) (redirect page) (← links)
- The asymptotic number of graphs not containing a fixed color-critical subgraph (Q1204522) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Even flying cops should think ahead (Q1661906) (← links)
- Random planar graphs (Q1767669) (← links)
- A note on triangle-free and bipartite graphs (Q1850031) (← links)
- The average number of linear extensions of a partial order (Q1906134) (← links)
- Tidier examples for lower bounds on diagonal Ramsey numbers (Q1914003) (← links)
- Counting \(H\)-free graphs (Q1918567) (← links)
- Approximability of scheduling with fixed jobs (Q1964484) (← links)
- An algorithmic framework for obtaining lower bounds for random Ramsey problems (Q1989950) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates (Q2315023) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- Note on the coefficient of variations of neuronal spike trains (Q2403822) (← links)
- Local resilience for squares of almost spanning cycles in sparse random graphs (Q2409840) (← links)
- The expected competitive ratio for weighted completion time scheduling (Q2432529) (← links)
- \(K_4\)-free subgraphs of random graphs revisited (Q2460631) (← links)
- Triangle resilience of the square of a Hamilton cycle in random graphs (Q2664554) (← links)
- Counting Partial Orders with a Fixed Number of Comparable Pairs (Q2726711) (← links)
- On the structure of clique-free graphs (Q2748425) (← links)
- Random directed graphs are robustly Hamiltonian (Q2820274) (← links)
- On the threshold for the Maker-Breaker<i>H</i>-game (Q2830239) (← links)
- (Q2857383) (← links)
- (Q2857430) (← links)
- (Q2921770) (← links)
- The maximum degree of random planar graphs (Q2930131) (← links)
- Maximal biconnected subgraphs of random planar graphs (Q2930307) (← links)
- (Q2934629) (← links)
- Asymmetric Ramsey properties of random graphs involving cliques (Q3055757) (← links)
- Offline thresholds for Ramsey-type games on random graphs (Q3055878) (← links)
- Pegging Graphs Yields a Small Diameter (Q3081329) (← links)
- A randomized version of Ramsey's theorem (Q3145839) (← links)
- Extremal subgraphs of random graphs (Q3165456) (← links)
- Drift Analysis and Evolutionary Algorithms Revisited (Q3177365) (← links)
- Balanced allocations (Q3192049) (← links)
