Angelika Steger

	2012
88		Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger: The maximum degree of random planar graphs. SODA 2012: 281-287
	2011
87		Konstantinos Panagiotou, Angelika Steger: On the Degree Distribution of Random Planar Graphs. SODA 2011: 1198-1210
86		Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas: Explosive Percolation in Erdös-Rényi-Like Random Graph Processes CoRR abs/1104.1309: (2011)
85		Stefanie Gerke, Angelika Steger, Nicholas C. Wormald: Pegging Graphs Yields a Small Diameter. Combinatorics, Probability & Computing 20(2): 239-248 (2011)
	2010
84		Matthew Cook, Florian Jug, Christoph Krautz, Angelika Steger: Unsupervised Learning of Relations. ICANN (1) 2010: 164-173
83		Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger: Synchrony and Asynchrony in Neural Networks. SODA 2010: 949-964
82		Konstantinos Panagiotou, Angelika Steger: Maximal biconnected subgraphs of random planar graphs. ACM Transactions on Algorithms 6(2): (2010)
81		Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger: On the Insertion Time of Cuckoo Hashing CoRR abs/1006.1231: (2010)
80		Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger: On properties of random dissections and triangulations. Combinatorica 30(6): 627-654 (2010)
79		Reto Spöhel, Angelika Steger, Henning Thomas: Coloring the Edges of a Random Graph without a Monochromatic Giant Component. Electr. J. Comb. 17(1): (2010)
78		Michael Krivelevich, Reto Spöhel, Angelika Steger: Offline thresholds for Ramsey-type games on random graphs. Random Struct. Algorithms 36(1): 57-79 (2010)
	2009
77		Konstantinos Panagiotou, Angelika Steger: Maximal biconnected subgraphs of random planar graphs. SODA 2009: 432-440
76		Jan Remy, Angelika Steger: Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. Algorithmica 55(1): 240-267 (2009)
75		Julian Lorenz, Konstantinos Panagiotou, Angelika Steger: Optimal Algorithms for k-Search with Application in Option Pricing. Algorithmica 55(2): 311-328 (2009)
74		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)
73		Martin Marciniszyn, Reto Spöhel, Angelika Steger: Online Ramsey Games in Random Graphs. Combinatorics, Probability & Computing 18(1-2): 271-300 (2009)
72		Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger: The Degree Sequence of Random Graphs from Subcritical Classes. Combinatorics, Probability & Computing 18(5): 647-681 (2009)
71		Konstantinos Panagiotou, Angelika Steger: A note on the chromatic number of a dense random graph. Discrete Mathematics 309(10): 3420-3423 (2009)
70		Reto Spöhel, Angelika Steger, Henning Thomas: Coloring the edges of a random graph without a monochromatic giant component. Electronic Notes in Discrete Mathematics 34: 615-619 (2009)
69		Jan Remy, Angelika Steger: A quasi-polynomial time approximation scheme for minimum weight triangulation. J. ACM 56(3): (2009)
68		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)
67		Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger: Asymmetric Ramsey properties of random graphs involving cliques. Random Struct. Algorithms 34(4): 419-453 (2009)
	2008
66		Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger: On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. APPROX-RANDOM 2008: 303-316
65		Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger: On properties of random dissections and triangulations. SODA 2008: 132-141
64		Alexander Souza, Angelika Steger: Fehlererkennende Codes: Was ist eigentlich EAN?. Taschenbuch der Algorithmen 2008: 213-223
63		Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger: On the Resilience of Long Cycles in Random Graphs. Electr. J. Comb. 15(1): (2008)
62		Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger: On the chromatic number of random graphs. J. Comb. Theory, Ser. B 98(5): 980-993 (2008)
61		Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz: The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008)
	2007
60		Julian Lorenz, Martin Marciniszyn, Angelika Steger: Observational Learning in Random Networks. COLT 2007: 574-588
59		Julian Lorenz, Konstantinos Panagiotou, Angelika Steger: Optimal Algorithms for k -Search with Application in Option Pricing. ESA 2007: 275-286
58		Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger: On the Chromatic Number of Random Graphs. ICALP 2007: 777-788
57		Graham Brightwell, Konstantinos Panagiotou, Angelika Steger: On extremal subgraphs of random graphs. SODA 2007: 477-485
56		Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz: K 4-free subgraphs of random graphs revisited. Combinatorica 27(3): 329-365 (2007)
55		Jan Remy, Alexander Souza, Angelika Steger: On an Online Spanning Tree Problem in Randomly Weighted Graphs. Combinatorics, Probability & Computing 16(1): 127-144 (2007)
54		Stefanie Gerke, Angelika Steger: A Characterization for Sparse epsilon-Regular Pairs. Electr. J. Comb. 14(1): (2007)
53		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		Stefanie Gerke, Martin Marciniszyn, Angelika Steger: A probabilistic counting lemma for complete graphs. Random Struct. Algorithms 31(4): 517-534 (2007)
	2006
51		Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger: Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. APPROX-RANDOM 2006: 462-474
50		Jan Remy, Angelika Steger: A quasi-polynomial time approximation scheme for minimum weight triangulation. STOC 2006: 316-325
49		Mark Scharbrodt, Thomas Schickinger, Angelika Steger: A new average case analysis for completion time scheduling. J. ACM 53(1): 121-146 (2006)
48		Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006)
47		Alexander Souza, Angelika Steger: The Expected Competitive Ratio for Weighted Completion Time Scheduling. Theory Comput. Syst. 39(1): 121-136 (2006)
	2005
46		Jan Remy, Angelika Steger: Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. APPROX-RANDOM 2005: 221-232
45		Martin Marciniszyn, Reto Spöhel, Angelika Steger: The Online Clique Avoidance Game on Random Graphs. APPROX-RANDOM 2005: 390-401
44		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		Justus Schwartz, Angelika Steger, Andreas Weißl: Fast Algorithms for Weighted Bipartite Matching. WEA 2005: 476-487
41		Angelika Steger: On the Evolution of Triangle-Free Graphs. Combinatorics, Probability & Computing 14(1-2): 211-224 (2005)
40		Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh: Random planar graphs. J. Comb. Theory, Ser. B 93(2): 187-205 (2005)
	2004
39		Alexander Souza, Angelika Steger: The Expected Competitive Ratio for Weighted Completion Time Scheduling. STACS 2004: 620-631
38		Martin Marciniszyn, Angelika Steger, Andreas Weißl: E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen. Informatik Spektrum 27(3): 248-254 (2004)
37		Stefanie Gerke, Thomas Schickinger, Angelika Steger: K5-free subgraphs of random graphs. Random Struct. Algorithms 24(2): 194-232 (2004)
	2002
36		Mark Scharbrodt, Thomas Schickinger, Angelika Steger: A new average case analysis for completion time scheduling. STOC 2002: 170-178
35		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): 159-177 (2001)
33		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		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		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		Thomas Schickinger, Angelika Steger: Simplified Witness Tree Arguments. SOFSEM 2000: 71-87
28		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		Stefan Bischof, Thomas Schickinger, Angelika Steger: Load Balancing Using Bisectors - A Tight Average-Case Analysis. ESA 1999: 172-183
25		Mark Scharbrodt, Angelika Steger, Horst Weisser: Approximability of Scheduling with Fixed Jobs. SODA 1999: 961-962
24		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): 377-396 (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		Martin Raab, Angelika Steger: "Balls into Bins" - A Simple and Tight Analysis. RANDOM 1998: 159-170
20		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		Hans Jürgen Prömel, Angelika Steger: Counting H-free graphs. Discrete Mathematics 154(1-3): 311-315 (1996)
16		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		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		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		Christoph 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		Hans Jürgen Prömel, Angelika Steger: Excluding Induced Subgraphs II: Extremal Graphs. Discrete Applied Mathematics 44(1-3): 283-294 (1993)
9		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		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)

Coauthor Index

1	Petra Berenbrink	[24] [28] [48]
2	Nicla Bernasconi	[65] [66] [72] [80]
3	Stefan Bischof	[26]
4	Graham Brightwell	[16] [57]
5	Amin Coja-Oghlan	[58] [62]
6	Matthew Cook	[84]
7	Artur Czumaj	[28] [48]
8	Domingos Dellamonica Jr.	[63]
9	Michael Drmota	[88]
10	Thomas Erlebach	[19] [30]
11	Nikolaos Fountoulakis	[81]
12	Tom Friedetzky	[24]
13	Jörn Garbers	[2] [3]
14	Stefanie Gerke	[37] [43] [44] [52] [53] [54] [56] [61] [85]
15	Omer Giménez	[88]
16	Jens Gustedt	[13]
17	Asmus Hetzel	[1]
18	Stefan Hougardy	[12]
19	Christoph Hundack	[11]
20	Florian Jug	[84]
21	Yoshiharu Kohayakawa	[20] [53] [63]
22	Bernhard Korte	[1] [3]
23	Christoph Krautz	[84]
24	Bernd Kreuter	[20]
25	Roland Krieger	[1]
26	Michael Krivelevich	[78]
27	Fabian Kuhn	[83]
28	Julian Lorenz	[59] [60] [75]
29	Martin Marciniszyn	[38] [45] [51] [52] [60] [63] [67] [73] [74]
30	Ernst W. Mayr	[22]
31	Colin McDiarmid (Colin J. H. McDiarmid)	[15] [40] [44]
32	Marc Noy	[88]
33	Konstantinos Panagiotou	[57] [58] [59] [62] [65] [66] [71] [72] [75] [77] [80] [81] [82] [83] [86] [87] [88]
34	Hans Jürgen Prömel	[1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [14] [16] [17] [18] [22] [27] [31] [32] [33] [34] [35] [56]
35	Martin Raab	[21]
36	Ulf-Dietmar Radicke	[1]
37	Jan Remy	[46] [50] [55] [69] [76]
38	Vojtech Rödl	[53]
39	Peter Rossmanith	[19] [30]
40	Mark Scharbrodt	[25] [36] [49]
41	Thomas Schickinger	[26] [29] [31] [35] [36] [37] [49] [56]
42	Dirk Schlatter	[61]
43	Justus Schwartz	[42]
44	E. Schwietzke	[3]
45	Jozef Skokan	[51] [67]
46	Gregory B. Sorkin	[68]
47	Alexander Souza	[39] [47] [55] [64]
48	Joel H. Spencer (Joel Spencer)	[83]
49	Reto Spöhel	[45] [51] [67] [70] [73] [74] [78] [79] [86]
50	Hans Stadtherr	[19] [30]
51	Anusch Taraz	[32] [33] [34] [56] [61]
52	Henning Thomas	[70] [79] [86]
53	Berthold Vöcking	[28] [48]
54	Horst Weisser	[25]
55	Andreas Weißl	[38] [42] [44]
56	Dominic J. A. Welsh	[40]
57	Nicholas C. Wormald	[23] [85]
58	Min-Li Yu	[9]
59	Rico Zenklusen	[68]
60	Thomas Zeugmann	[19] [30]

Colors in the list of coauthors

Last update Tue Feb 14 23:09:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page