The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Angelika Steger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:260-276 [Conf]
  2. Martin Marciniszyn, Reto Spöhel, Angelika Steger
    The Online Clique Avoidance Game on Random Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:390-401 [Conf]
  3. Jan Remy, Angelika Steger
    Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:221-232 [Conf]
  4. Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
    Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:462-474 [Conf]
  5. Stefanie Gerke, Angelika Steger
    The sparse regularity lemma and its applications. [Citation Graph (0, 0)][DBLP]
    Surveys in Combinatorics, 2005, pp:227-258 [Conf]
  6. Stefan Bischof, Thomas Schickinger, Angelika Steger
    Load Balancing Using Bisectors - A Tight Average-Case Analysis. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:172-183 [Conf]
  7. Hans Jürgen Prömel, Angelika Steger
    The asymptotic structure of H-free graphs. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:167-178 [Conf]
  8. Jörn Garbers, Hans Jürgen Prömel, Angelika Steger
    Finding Clusters in VLSI Circuits. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1990, pp:520-523 [Conf]
  9. Jens Gustedt, Angelika Steger
    Testing Hereditary Properties Efficiently on Average. [Citation Graph (0, 0)][DBLP]
    ORDAL, 1994, pp:100-116 [Conf]
  10. Martin Raab, Angelika Steger
    "Balls into Bins" - A Simple and Tight Analysis. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:159-170 [Conf]
  11. Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl
    Random planar graphs with n nodes and a fixed number of edges. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:999-1007 [Conf]
  12. Mark Scharbrodt, Angelika Steger, Horst Weisser
    Approximability of Scheduling with Fixed Jobs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:961-962 [Conf]
  13. Thomas Schickinger, Angelika Steger
    Simplified Witness Tree Arguments. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:71-87 [Conf]
  14. Petra Berenbrink, Tom Friedetzky, Angelika Steger
    Randomized and Adversarial Load Balancing. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:175-184 [Conf]
  15. Hans Jürgen Prömel, Angelika Steger
    RNC-Approximation Algorithms for the Steiner Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:559-570 [Conf]
  16. Alexander Souza, Angelika Steger
    The Expected Competitive Ratio for Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:620-631 [Conf]
  17. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
    Balanced allocations: the heavily loaded case. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:745-754 [Conf]
  18. Jan Remy, Angelika Steger
    A quasi-polynomial time approximation scheme for minimum weight triangulation. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:316-325 [Conf]
  19. Mark Scharbrodt, Thomas Schickinger, Angelika Steger
    A new average case analysis for completion time scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:170-178 [Conf]
  20. Justus Schwartz, Angelika Steger, Andreas Weißl
    Fast Algorithms for Weighted Bipartite Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:476-487 [Conf]
  21. Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger
    An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:101-120 [Journal]
  22. Hans Jürgen Prömel, Angelika Steger
    The asymptotic number of graphs not containing a fixed color-critical subgraph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:463-473 [Journal]
  23. Christofh Hundack, Hans Jürgen Prömel, Angelika Steger
    Extremal Graph Problems for Graphs with a Color-Critical Vertex. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:465-477 [Journal]
  24. Hans Jürgen Prömel, Angelika Steger
    Almost all Berge Graphs are Perfect. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:53-79 [Journal]
  25. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
    Counting Partial Orders With A Fixed Number Of Comparable Pairs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:2, pp:- [Journal]
  26. Angelika Steger
    On the Evolution of Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:211-224 [Journal]
  27. Angelika Steger, Nicholas C. Wormald
    Generating Random Regular Graphs Quickly. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
  28. Hans Jürgen Prömel, Angelika Steger
    Excluding Induced Subgraphs II: Extremal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:283-294 [Journal]
  29. Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger
    A note on triangle-free and bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:531-540 [Journal]
  30. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
    Asymptotic enumeration, global structure, and constrained evolution. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:213-233 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 1990, v:5, n:1, pp:2-19 [Journal]
  32. Martin Marciniszyn, Angelika Steger, Andreas Weißl
    E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2004, v:27, n:3, pp:248-254 [Journal]
  33. Mark Scharbrodt, Thomas Schickinger, Angelika Steger
    A new average case analysis for completion time scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:1, pp:121-146 [Journal]
  34. Hans Jürgen Prömel, Angelika Steger
    A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:1, pp:89-101 [Journal]
  35. Graham Brightwell, Hans Jürgen Prömel, Angelika Steger
    The Average Number of Linear Extensions of a Partial Order. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:193-206 [Journal]
  36. Colin McDiarmid, Angelika Steger
    Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:147-152 [Journal]
  37. Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh
    Random planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:187-205 [Journal]
  38. Hans Jürgen Prömel, Angelika Steger, Anusch Taraz
    Phase Transitions in the Evolution of Partial Orders. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:2, pp:230-275 [Journal]
  39. Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
    Small subsets inherit sparse epsilon-regularity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:34-56 [Journal]
  40. Alexander Souza, Angelika Steger
    The Expected Competitive Ratio for Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:121-136 [Journal]
  41. Stefanie Gerke, Thomas Schickinger, Angelika Steger
    K5-free subgraphs of random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:2, pp:194-232 [Journal]
  42. Hans Jürgen Prömel, Angelika Steger
    Excluding Induced Subgraphs: Quadrilaterals. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:1, pp:55-72 [Journal]
  43. Hans Jürgen Prömel, Angelika Steger
    Coloring Clique-free Graphs in Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:4, pp:375-402 [Journal]
  44. Hans Jürgen Prömel, Angelika Steger
    Random I-Cororable Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:21-38 [Journal]
  45. Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger
    On the structure of clique-free graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:1, pp:37-53 [Journal]
  46. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
    Balanced Allocations: The Heavily Loaded Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1350-1385 [Journal]
  47. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:119-156 [Journal]
  48. Julian Lorenz, Martin Marciniszyn, Angelika Steger
    Observational Learning in Random Networks. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:574-588 [Conf]
  49. Julian Lorenz, Konstantinos Panagiotou, Angelika Steger
    Optimal Algorithms for k -Search with Application in Option Pricing. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:275-286 [Conf]
  50. Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger
    On the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:777-788 [Conf]
  51. Graham Brightwell, Konstantinos Panagiotou, Angelika Steger
    On extremal subgraphs of random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:477-485 [Conf]
  52. Angelika Steger, Min-Li Yu
    On induced matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:291-295 [Journal]
  53. Hans Jürgen Prömel, Angelika Steger
    Counting H-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:311-315 [Journal]
  54. Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger
    Probabilistically checkable proofs and their consequences for approximation algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:175-223 [Journal]

  55. On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. [Citation Graph (, )][DBLP]


  56. VLSI: placement based on routing and timing information. [Citation Graph (, )][DBLP]


  57. Unsupervised Learning of Relations. [Citation Graph (, )][DBLP]


  58. On properties of random dissections and triangulations. [Citation Graph (, )][DBLP]


  59. Maximal biconnected subgraphs of random planar graphs. [Citation Graph (, )][DBLP]


  60. Synchrony and Asynchrony in Neural Networks. [Citation Graph (, )][DBLP]


  61. Optimal Algorithms for k-Search with Application in Option Pricing. [Citation Graph (, )][DBLP]


  62. Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. [Citation Graph (, )][DBLP]


  63. K 4-free subgraphs of random graphs revisited. [Citation Graph (, )][DBLP]


  64. A Characterization for Sparse epsilon-Regular Pairs. [Citation Graph (, )][DBLP]


  65. On the Insertion Time of Cuckoo Hashing [Citation Graph (, )][DBLP]


  66. On an Online Spanning Tree Problem in Randomly Weighted Graphs. [Citation Graph (, )][DBLP]


  67. Upper Bounds for Online Ramsey Games in Random Graphs. [Citation Graph (, )][DBLP]


  68. Online Ramsey Games in Random Graphs. [Citation Graph (, )][DBLP]


  69. The Degree Sequence of Random Graphs from Subcritical Classes. [Citation Graph (, )][DBLP]


  70. A note on the chromatic number of a dense random graph. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.487secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002