default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Jürgen Prömel
Person information
- affiliation: Präsident der Technischen Universität Darmstadt
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j55]Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz:
K 4-free subgraphs of random graphs revisited. Comb. 27(3): 329-365 (2007)- 2005
- [j54]Hans Jürgen Prömel:
Special Issue in Memory of Walter Deuber. Comb. Probab. Comput. 14(1-2): 1 (2005) - [j53]Hans Jürgen Prömel:
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber. Comb. Probab. Comput. 14(1-2): 3-16 (2005) - 2004
- [j52]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. 142(1-3): 67-85 (2004) - 2003
- [j51]Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? Comb. 23(1): 105-150 (2003) - [j50]Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
On random planar graphs, the number of planar graphs and their triangulations. J. Comb. Theory B 88(1): 119-134 (2003) - [j49]David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl:
Independent Deuber sets in graphs on the natural numbers. J. Comb. Theory A 103(2): 305-322 (2003) - 2002
- [j48]Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:
A note on triangle-free and bipartite graphs. Discret. Math. 257(2-3): 531-540 (2002) - [j47]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83(4): 195-200 (2002) - [j46]Hans Jürgen Prömel:
Large numbers, Knuth's arrow notation, and Ramsey theory. Synth. 133(1-2): 87-105 (2002) - 2001
- [j45]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs. Comb. Probab. Comput. 10(2): 159-177 (2001) - [j44]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution. Discret. Math. 229(1-3): 213-233 (2001) - [j43]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
On the evolution of the worst-case OBDD size. Inf. Process. Lett. 77(1): 1-7 (2001) - [j42]David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl:
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers. J. Comb. Theory A 93(1): 1-17 (2001) - [j41]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Phase Transitions in the Evolution of Partial Orders. J. Comb. Theory A 94(2): 230-275 (2001) - [j40]Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
Almost all graphs with high girth and suitable density have high chromatic number. J. Graph Theory 37(4): 220-226 (2001) - [j39]Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:
On the structure of clique-free graphs. Random Struct. Algorithms 19(1): 37-53 (2001) - [c9]Hans Jürgen Prömel, Anusch Taraz:
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. Computational Discrete Mathematics 2001: 98-118 - [c8]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG 2001: 217-228 - 2000
- [j38]Hans Jürgen Prömel:
Obituary Walter Deuber (1942-1999). Eur. J. Comb. 21(6): 697-699 (2000) - [j37]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)
1990 – 1999
- 1999
- [j36]Graham R. Brightwell, David A. Grable, Hans Jürgen Prömel:
Forbidden induced partial orders. Discret. Math. 201(1-3): 53-80 (1999) - [j35]Hans Jürgen Prömel, Vojtech Rödl:
Non-Ramsey Graphs Are c log n-Universal. J. Comb. Theory A 88(2): 379-384 (1999) - [c7]Stefan Hougardy, Hans Jürgen Prömel:
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. SODA 1999: 448-453 - 1998
- [j34]Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl:
Induced Ramsey Numbers. Comb. 18(3): 373-404 (1998) - [c6]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). STACS 1998: 238-248 - [e1]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). Lecture Notes in Computer Science 1367, Springer 1998, ISBN 3-540-64201-3 [contents] - 1997
- [c5]Hans Jürgen Prömel, Angelika Steger:
RNC-Approximation Algorithms for the Steiner Problem. STACS 1997: 559-570 - 1996
- [j33]Hans Jürgen Prömel, Angelika Steger:
Counting H-free graphs. Discret. Math. 154(1-3): 311-315 (1996) - [j32]Graham R. Brightwell, Hans Jürgen Prömel, Angelika Steger:
The Average Number of Linear Extensions of a Partial Order. J. Comb. Theory A 73(2): 193-206 (1996) - [j31]Hans Jürgen Prömel, Angelika Steger:
On the asymptotic structure of sparse triangle free graphs. J. Graph Theory 21(2): 137-151 (1996) - 1995
- [j30]Hans Jürgen Prömel, Angelika Steger:
Random I-Cororable Graphs. Random Struct. Algorithms 6(1): 21-38 (1995) - 1994
- [j29]Walter A. Deuber, Hans Jürgen Prömel, Bernd Voigt:
Preface. Discret. Math. 136(1-3): 1 (1994) - [j28]Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger:
Probabilistically checkable proofs and their consequences for approximation algorithms. Discret. Math. 136(1-3): 175-223 (1994) - 1993
- [j27]Christoph Hundack, Hans Jürgen Prömel, Angelika Steger:
Extremal Graph Problems for Graphs with a Color-Critical Vertex. Comb. Probab. Comput. 2: 465-477 (1993) - [j26]Hans Jürgen Prömel, Angelika Steger:
Excluding Induced Subgraphs II: Extremal Graphs. Discret. Appl. Math. 44(1-3): 283-294 (1993) - 1992
- [j25]Hans Jürgen Prömel, Angelika Steger:
The asymptotic number of graphs not containing a fixed color-critical subgraph. Comb. 12(4): 463-473 (1992) - [j24]Hans Jürgen Prömel, Angelika Steger:
Almost all Berge Graphs are Perfect. Comb. Probab. Comput. 1: 53-79 (1992) - [j23]Hans Jürgen Prömel, Bernd Voigt:
From wqo to bqo, via Ellentuck's theorem. Discret. Math. 108(1-3): 83-106 (1992) - [j22]Hans Jürgen Prömel, Angelika Steger:
Coloring Clique-free Graphs in Linear Expected Time. Random Struct. Algorithms 3(4): 375-402 (1992) - 1991
- [j21]Hans Jürgen Prömel, Bernd Voigt:
Graham-Rothschild parameter words and measurable partitions. Comb. 11(3): 253-260 (1991) - [j20]Hans Jürgen Prömel, Wolfgang Thumser:
Fast growing functions based on Ramsey theorems. Discret. Math. 95(1-3): 341-358 (1991) - [j19]Hans Jürgen Prömel, Angelika Steger:
Excluding Induced Subgraphs: Quadrilaterals. Random Struct. Algorithms 2(1): 55-72 (1991) - [c4]Hans Jürgen Prömel, Angelika Steger:
The asymptotic structure of H-free graphs. Graph Structure Theory 1991: 167-178 - 1990
- [j18]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) - [c3]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 - [c2]Jörn Garbers, Hans Jürgen Prömel, Angelika Steger:
Finding Clusters in VLSI Circuits. ICCAD 1990: 520-523
1980 – 1989
- 1989
- [j17]Hans Jürgen Prömel:
Some remarks on natural orders for combinatorial cubes. Discret. Math. 73(1-2): 189-198 (1989) - [j16]Hans Jürgen Prömel, Bernd Voigt:
A short proof of the restricted Ramsey theorem for finite set systems. J. Comb. Theory A 52(2): 313-320 (1989) - [c1]Bernhard Korte, Hans Jürgen Prömel, Angelika Steger:
Combining partitioning and global routing in sea-of-cells design. ICCAD 1989: 98-101 - 1987
- [j15]Hans Jürgen Prömel, B. L. Rothschild:
A canonical restricted version of van der Waerden's theorem. Comb. 7(1): 115-119 (1987) - [j14]Hans Jürgen Prömel:
Counting unlabeled structures. J. Comb. Theory A 44(1): 83-93 (1987) - 1986
- [j13]Hans Jürgen Prömel, Bernd Voigt:
Hereditary attributes of surjections and parameter sets. Eur. J. Comb. 7(2): 161-170 (1986) - [j12]Hans Jürgen Prömel:
Partition properties of q-hypergraphs. J. Comb. Theory B 41(3): 356-385 (1986) - [j11]Hans Jürgen Prömel, Vojtech Rödl:
An elementary proof of the canonizing version of Gallai-Witt's theorem. J. Comb. Theory A 42(1): 144-149 (1986) - [j10]Hans Jürgen Prömel, Stephen G. Simpson
, Bernd Voigt:
A dual form of Erdös-Rado's canonization theorem. J. Comb. Theory A 42(2): 159-178 (1986) - 1985
- [j9]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. Comb. 5(1): 41-52 (1985) - [j8]Hans Jürgen Prömel, Bernd Voigt:
Canonizing Ramsey theorems for finite graphs and hypergraphs. Discret. Math. 54(1): 49-59 (1985) - [j7]Hans Jürgen Prömel:
Induced Partition Properties of Combinatorial Cubes. J. Comb. Theory A 39(2): 177-208 (1985) - [j6]Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt:
Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory A 40(2): 394-408 (1985) - [j5]Hans Jürgen Prömel, Bernd Voigt:
Canonical Forms of Borel-Measurable Mappings Delta: [omega]omega -> R. J. Comb. Theory A 40(2): 409-417 (1985) - 1983
- [j4]Walter A. Deuber, Ronald L. Graham, Hans Jürgen Prömel, Bernd Voigt:
A Canonical Partition Theorem for Equivalence Relations on Zt. J. Comb. Theory A 34(3): 331-339 (1983) - [j3]Hans Jürgen Prömel, Bernd Voigt:
Canonical Partition Theorems for Parameter Sets. J. Comb. Theory A 35(3): 309-327 (1983) - 1981
- [j2]Hans Jürgen Prömel, Bernd Voigt:
Recent results in partition (Ramsey) theory for finite lattices. Discret. Math. 35(1-3): 185-198 (1981) - [j1]Hans Jürgen Prömel, Bernd Voigt:
Partition theorems for parameter systems and graphs. Discret. Math. 36(1): 83-96 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
