The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans Jürgen Prömel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans Jürgen Prömel, Anusch Taraz
    Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:98-118 [Conf]
  2. 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]
  3. 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]
  4. Stefan Hougardy, Hans Jürgen Prömel
    A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:448-453 [Conf]
  5. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
    Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:238-248 [Conf]
  6. 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]
  7. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
    Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:217-228 [Conf]
  8. András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt
    On the sum of the reciprocals of cycle lengths in sparse graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:1, pp:41-52 [Journal]
  9. Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl
    Induced Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:3, pp:373-404 [Journal]
  10. Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
    For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:1, pp:105-150 [Journal]
  11. Hans Jürgen Prömel, B. L. Rothschild
    A canonical restricted version of van der Waerden's theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:115-119 [Journal]
  12. 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]
  13. Hans Jürgen Prömel, Bernd Voigt
    Graham-Rothschild parameter words and measurable partitions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:3, pp:253-260 [Journal]
  14. 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]
  15. Hans Jürgen Prömel
    Special Issue in Memory of Walter Deuber. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:1- [Journal]
  16. Hans Jürgen Prömel
    Complete Disorder is Impossible: The Mathematical Work of Walter Deuber. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:3-16 [Journal]
  17. 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]
  18. 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]
  19. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
    Ordered binary decision diagrams and the Shannon effect. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:67-85 [Journal]
  20. 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]
  21. 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]
  22. 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]
  23. Hans Jürgen Prömel
    Obituary Walter Deuber (1942-1999). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:697-699 [Journal]
  24. 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]
  25. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
    Steiner trees in uniformly quasi-bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:4, pp:195-200 [Journal]
  26. Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
    On the evolution of the worst-case OBDD size. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:1-7 [Journal]
  27. 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]
  28. 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]
  29. Walter A. Deuber, Ronald L. Graham, Hans Jürgen Prömel, Bernd Voigt
    A Canonical Partition Theorem for Equivalence Relations on Zt. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:3, pp:331-339 [Journal]
  30. David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl
    Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:1, pp:1-17 [Journal]
  31. David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl
    Independent Deuber sets in graphs on the natural numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:103, n:2, pp:305-322 [Journal]
  32. Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt
    Canonizing Ordering Theorems for Hales Jewett Structures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:2, pp:394-408 [Journal]
  33. Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
    On random planar graphs, the number of planar graphs and their triangulations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:119-134 [Journal]
  34. Hans Jürgen Prömel
    Induced Partition Properties of Combinatorial Cubes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:39, n:2, pp:177-208 [Journal]
  35. Hans Jürgen Prömel
    Partition properties of q-hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:3, pp:356-385 [Journal]
  36. Hans Jürgen Prömel
    Counting unlabeled structures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:44, n:1, pp:83-93 [Journal]
  37. Hans Jürgen Prömel, Vojtech Rödl
    An elementary proof of the canonizing version of Gallai-Witt's theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:144-149 [Journal]
  38. Hans Jürgen Prömel, Vojtech Rödl
    Non-Ramsey Graphs Are c log n-Universal. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:2, pp:379-384 [Journal]
  39. 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]
  40. Hans Jürgen Prömel, S. G. Simpson, Bernd Voigt
    A dual form of Erdös-Rado's canonization theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:2, pp:159-178 [Journal]
  41. Hans Jürgen Prömel, Bernd Voigt
    Canonical Partition Theorems for Parameter Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:35, n:3, pp:309-327 [Journal]
  42. Hans Jürgen Prömel, Bernd Voigt
    Canonical Forms of Borel-Measurable Mappings Delta: [omega]omega -> R. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:2, pp:409-417 [Journal]
  43. Hans Jürgen Prömel, Bernd Voigt
    A short proof of the restricted Ramsey theorem for finite set systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:313-320 [Journal]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. Hans Jürgen Prömel, Bernd Voigt
    Recent results in partition (Ramsey) theory for finite lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:185-198 [Journal]
  49. Hans Jürgen Prömel, Bernd Voigt
    Partition theorems for parameter systems and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:36, n:1, pp:83-96 [Journal]
  50. Hans Jürgen Prömel, Bernd Voigt
    Canonizing Ramsey theorems for finite graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:49-59 [Journal]
  51. Hans Jürgen Prömel
    Some remarks on natural orders for combinatorial cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:189-198 [Journal]
  52. Graham Brightwell, David A. Grable, Hans Jürgen Prömel
    Forbidden induced partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:53-80 [Journal]
  53. Hans Jürgen Prömel, Wolfgang Thumser
    Fast growing functions based on Ramsey theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:341-358 [Journal]
  54. Hans Jürgen Prömel, Bernd Voigt
    From wqo to bqo, via Ellentuck's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:83-106 [Journal]
  55. 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]
  56. Walter A. Deuber, Hans Jürgen Prömel, Bernd Voigt
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:1- [Journal]
  57. 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]

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


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


Search in 0.053secs, Finished in 0.056secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002