| 2009 |
|---|
| 68 | EE | Konstantinos Panagiotou,
Angelika Steger:
Maximal biconnected subgraphs of random planar graphs.
SODA 2009: 432-440 |
| 67 | EE | Martin Marciniszyn,
Reto Spöhel,
Angelika Steger:
Upper Bounds for Online Ramsey Games in Random Graphs.
Combinatorics, Probability & Computing 18(1-2): 259-270 (2009) |
| 66 | EE | Martin Marciniszyn,
Reto Spöhel,
Angelika Steger:
Online Ramsey Games in Random Graphs.
Combinatorics, Probability & Computing 18(1-2): 271-300 (2009) |
| 65 | EE | Gregory B. Sorkin,
Angelika Steger,
Rico Zenklusen:
A tight bound on the collection of edges in MSTs of induced subgraphs.
J. Comb. Theory, Ser. B 99(2): 428-435 (2009) |
| 2008 |
|---|
| 64 | EE | Nicla Bernasconi,
Konstantinos Panagiotou,
Angelika Steger:
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.
APPROX-RANDOM 2008: 303-316 |
| 63 | EE | Nicla Bernasconi,
Konstantinos Panagiotou,
Angelika Steger:
On properties of random dissections and triangulations.
SODA 2008: 132-141 |
| 62 | EE | Alexander Souza,
Angelika Steger:
Fehlererkennende Codes: Was ist eigentlich EAN?.
Taschenbuch der Algorithmen 2008: 213-223 |
| 61 | EE | Amin Coja-Oghlan,
Konstantinos Panagiotou,
Angelika Steger:
On the chromatic number of random graphs.
J. Comb. Theory, Ser. B 98(5): 980-993 (2008) |
| 60 | EE | Stefanie Gerke,
Dirk Schlatter,
Angelika Steger,
Anusch Taraz:
The random planar graph process.
Random Struct. Algorithms 32(2): 236-261 (2008) |
| 2007 |
|---|
| 59 | EE | Julian Lorenz,
Martin Marciniszyn,
Angelika Steger:
Observational Learning in Random Networks.
COLT 2007: 574-588 |
| 58 | EE | Julian Lorenz,
Konstantinos Panagiotou,
Angelika Steger:
Optimal Algorithms for k -Search with Application in Option Pricing.
ESA 2007: 275-286 |
| 57 | EE | Amin Coja-Oghlan,
Konstantinos Panagiotou,
Angelika Steger:
On the Chromatic Number of Random Graphs.
ICALP 2007: 777-788 |
| 56 | EE | Graham Brightwell,
Konstantinos Panagiotou,
Angelika Steger:
On extremal subgraphs of random graphs.
SODA 2007: 477-485 |
| 55 | EE | J. A. N. Remy,
Alexander Souza,
Angelika Steger:
On an Online Spanning Tree Problem in Randomly Weighted Graphs.
Combinatorics, Probability & Computing 16(1): 127-144 (2007) |
| 54 | EE | Stefanie Gerke,
Angelika Steger:
A Characterization for Sparse epsilon-Regular Pairs.
Electr. J. Comb. 14(1): (2007) |
| 53 | EE | Stefanie Gerke,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Angelika Steger:
Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory, Ser. B 97(1): 34-56 (2007) |
| 52 | EE | Stefanie Gerke,
Martin Marciniszyn,
Angelika Steger:
A probabilistic counting lemma for complete graphs.
Random Struct. Algorithms 31(4): 517-534 (2007) |
| 2006 |
|---|
| 51 | EE | Martin Marciniszyn,
Jozef Skokan,
Reto Spöhel,
Angelika Steger:
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.
APPROX-RANDOM 2006: 462-474 |
| 50 | EE | Jan Remy,
Angelika Steger:
A quasi-polynomial time approximation scheme for minimum weight triangulation.
STOC 2006: 316-325 |
| 49 | EE | Mark Scharbrodt,
Thomas Schickinger,
Angelika Steger:
A new average case analysis for completion time scheduling.
J. ACM 53(1): 121-146 (2006) |
| 48 | EE | Petra Berenbrink,
Artur Czumaj,
Angelika Steger,
Berthold Vöcking:
Balanced Allocations: The Heavily Loaded Case.
SIAM J. Comput. 35(6): 1350-1385 (2006) |
| 47 | EE | Alexander Souza,
Angelika Steger:
The Expected Competitive Ratio for Weighted Completion Time Scheduling.
Theory Comput. Syst. 39(1): 121-136 (2006) |
| 2005 |
|---|
| 46 | EE | Jan Remy,
Angelika Steger:
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.
APPROX-RANDOM 2005: 221-232 |
| 45 | EE | Martin Marciniszyn,
Reto Spöhel,
Angelika Steger:
The Online Clique Avoidance Game on Random Graphs.
APPROX-RANDOM 2005: 390-401 |
| 44 | EE | Stefanie Gerke,
Colin McDiarmid,
Angelika Steger,
Andreas Weißl:
Random planar graphs with n nodes and a fixed number of edges.
SODA 2005: 999-1007 |
| 43 | | Stefanie Gerke,
Angelika Steger:
The sparse regularity lemma and its applications.
Surveys in Combinatorics 2005: 227-258 |
| 42 | EE | Justus Schwartz,
Angelika Steger,
Andreas Weißl:
Fast Algorithms for Weighted Bipartite Matching.
WEA 2005: 476-487 |
| 41 | EE | Angelika Steger:
On the Evolution of Triangle-Free Graphs.
Combinatorics, Probability & Computing 14(1-2): 211-224 (2005) |
| 40 | EE | Colin McDiarmid,
Angelika Steger,
Dominic J. A. Welsh:
Random planar graphs.
J. Comb. Theory, Ser. B 93(2): 187-205 (2005) |
| 2004 |
|---|
| 39 | EE | Alexander Souza,
Angelika Steger:
The Expected Competitive Ratio for Weighted Completion Time Scheduling.
STACS 2004: 620-631 |
| 38 | EE | Martin Marciniszyn,
Angelika Steger,
Andreas Weißl:
E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen.
Informatik Spektrum 27(3): 248-254 (2004) |
| 37 | EE | Stefanie Gerke,
Thomas Schickinger,
Angelika Steger:
K5-free subgraphs of random graphs.
Random Struct. Algorithms 24(2): 194-232 (2004) |
| 2002 |
|---|
| 36 | EE | Mark Scharbrodt,
Thomas Schickinger,
Angelika Steger:
A new average case analysis for completion time scheduling.
STOC 2002: 170-178 |
| 35 | EE | Hans Jürgen Prömel,
Thomas Schickinger,
Angelika Steger:
A note on triangle-free and bipartite graphs.
Discrete Mathematics 257(2-3): 531-540 (2002) |
| 2001 |
|---|
| 34 | | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Combinatorics, Probability & Computing 10(2): (2001) |
| 33 | EE | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution.
Discrete Mathematics 229(1-3): 213-233 (2001) |
| 32 | EE | Hans Jürgen Prömel,
Angelika Steger,
Anusch Taraz:
Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory, Ser. A 94(2): 230-275 (2001) |
| 31 | | Hans Jürgen Prömel,
Thomas Schickinger,
Angelika Steger:
On the structure of clique-free graphs.
Random Struct. Algorithms 19(1): 37-53 (2001) |
| 30 | EE | Thomas Erlebach,
Peter Rossmanith,
Hans Stadtherr,
Angelika Steger,
Thomas Zeugmann:
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.
Theor. Comput. Sci. 261(1): 119-156 (2001) |
| 2000 |
|---|
| 29 | EE | Thomas Schickinger,
Angelika Steger:
Simplified Witness Tree Arguments.
SOFSEM 2000: 71-87 |
| 28 | EE | Petra Berenbrink,
Artur Czumaj,
Angelika Steger,
Berthold Vöcking:
Balanced allocations: the heavily loaded case.
STOC 2000: 745-754 |
| 27 | | Hans Jürgen Prömel,
Angelika Steger:
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3.
J. Algorithms 36(1): 89-101 (2000) |
| 1999 |
|---|
| 26 | EE | Stefan Bischof,
Thomas Schickinger,
Angelika Steger:
Load Balancing Using Bisectors - A Tight Average-Case Analysis.
ESA 1999: 172-183 |
| 25 | EE | Mark Scharbrodt,
Angelika Steger,
Horst Weisser:
Approximability of Scheduling with Fixed Jobs.
SODA 1999: 961-962 |
| 24 | EE | Petra Berenbrink,
Tom Friedetzky,
Angelika Steger:
Randomized and Adversarial Load Balancing.
SPAA 1999: 175-184 |
| 23 | | Angelika Steger,
Nicholas C. Wormald:
Generating Random Regular Graphs Quickly.
Combinatorics, Probability & Computing 8(4): (1999) |
| 1998 |
|---|
| 22 | | Ernst W. Mayr,
Hans Jürgen Prömel,
Angelika Steger:
Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)
Springer 1998 |
| 21 | EE | Martin Raab,
Angelika Steger:
"Balls into Bins" - A Simple and Tight Analysis.
RANDOM 1998: 159-170 |
| 20 | EE | Yoshiharu Kohayakawa,
Bernd Kreuter,
Angelika Steger:
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.
Combinatorica 18(1): 101-120 (1998) |
| 1997 |
|---|
| 19 | | Thomas Erlebach,
Peter Rossmanith,
Hans Stadtherr,
Angelika Steger,
Thomas Zeugmann:
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries.
ALT 1997: 260-276 |
| 18 | | Hans Jürgen Prömel,
Angelika Steger:
RNC-Approximation Algorithms for the Steiner Problem.
STACS 1997: 559-570 |
| 1996 |
|---|
| 17 | EE | Hans Jürgen Prömel,
Angelika Steger:
Counting H-free graphs.
Discrete Mathematics 154(1-3): 311-315 (1996) |
| 16 | EE | Graham Brightwell,
Hans Jürgen Prömel,
Angelika Steger:
The Average Number of Linear Extensions of a Partial Order.
J. Comb. Theory, Ser. A 73(2): 193-206 (1996) |
| 15 | EE | Colin McDiarmid,
Angelika Steger:
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers.
J. Comb. Theory, Ser. A 74(1): 147-152 (1996) |
| 1995 |
|---|
| 14 | | Hans Jürgen Prömel,
Angelika Steger:
Random I-Cororable Graphs.
Random Struct. Algorithms 6(1): 21-38 (1995) |
| 1994 |
|---|
| 13 | | Jens Gustedt,
Angelika Steger:
Testing Hereditary Properties Efficiently on Average.
ORDAL 1994: 100-116 |
| 12 | EE | Stefan Hougardy,
Hans Jürgen Prömel,
Angelika Steger:
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discrete Mathematics 136(1-3): 175-223 (1994) |
| 1993 |
|---|
| 11 | | Christofh Hundack,
Hans Jürgen Prömel,
Angelika Steger:
Extremal Graph Problems for Graphs with a Color-Critical Vertex.
Combinatorics, Probability & Computing 2: 465-477 (1993) |
| 10 | EE | Hans Jürgen Prömel,
Angelika Steger:
Excluding Induced Subgraphs II: Extremal Graphs.
Discrete Applied Mathematics 44(1-3): 283-294 (1993) |
| 9 | EE | Angelika Steger,
Min-Li Yu:
On induced matchings.
Discrete Mathematics 120(1-3): 291-295 (1993) |
| 1992 |
|---|
| 8 | | Hans Jürgen Prömel,
Angelika Steger:
The asymptotic number of graphs not containing a fixed color-critical subgraph.
Combinatorica 12(4): 463-473 (1992) |
| 7 | | Hans Jürgen Prömel,
Angelika Steger:
Almost all Berge Graphs are Perfect.
Combinatorics, Probability & Computing 1: 53-79 (1992) |
| 6 | | Hans Jürgen Prömel,
Angelika Steger:
Coloring Clique-free Graphs in Linear Expected Time.
Random Struct. Algorithms 3(4): 375-402 (1992) |
| 1991 |
|---|
| 5 | | Hans Jürgen Prömel,
Angelika Steger:
The asymptotic structure of H-free graphs.
Graph Structure Theory 1991: 167-178 |
| 4 | | Hans Jürgen Prömel,
Angelika Steger:
Excluding Induced Subgraphs: Quadrilaterals.
Random Struct. Algorithms 2(1): 55-72 (1991) |
| 1990 |
|---|
| 3 | EE | Jörn Garbers,
Bernhard Korte,
Hans Jürgen Prömel,
E. Schwietzke,
Angelika Steger:
VLSI: placement based on routing and timing information.
EURO-DAC 1990: 317-321 |
| 2 | | Jörn Garbers,
Hans Jürgen Prömel,
Angelika Steger:
Finding Clusters in VLSI Circuits.
ICCAD 1990: 520-523 |
| 1 | | Asmus Hetzel,
Bernhard Korte,
Roland Krieger,
Hans Jürgen Prömel,
Ulf-Dietmar Radicke,
Angelika Steger:
Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design.
Inform., Forsch. Entwickl. 5(1): 2-19 (1990) |
