×

Prömel, Hans Jürgen

Author ID: promel.hans-jurgen Recent zbMATH articles by "Prömel, Hans Jürgen"
Published as: Prömel, Hans Jürgen; Prömel, H. J.; Prömel, H.-J.; Proemel, H. J.; Prömel, Hans-Jürgen; Proemel, Hans Juergen; Prömel, Hans J.
External Links: MGP · Wikidata · dblp · GND · IdRef

Publications by Year

Citations contained in zbMATH Open

68 Publications have been cited 606 times in 403 Documents Cited by Year
\(K_{\ell +1}\)-free graphs: Asymptotic structure and a 0-1 law. Zbl 0641.05025
Kolaitis, Ph. G.; Prömel, H. J.; Rothschild, B. L.
51
1987
Excluding induced subgraphs. III: A general asymptotic. Zbl 0751.05041
Prömel, H. J.; Steger, A.
47
1992
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. Zbl 0959.68101
Prömel, Hans Jürgen; Steger, Angelika
30
2000
Excluding induced subgraphs. II: Extremal graphs. Zbl 0783.05064
Prömel, H. J.; Steger, A.
30
1993
Excluding induced subgraphs: Quadrilaterals. Zbl 0763.05046
Prömel, Hans Jürgen; Steger, Angelika
26
1991
The Steiner tree problem. A tour through graphs, algorithms, and complexity. Zbl 0992.68156
Prömel, Hans-Jürgen; Steger, Angelika
24
2002
The asymptotic number of graphs not containing a fixed color-critical subgraph. Zbl 0770.05063
Prömel, H. J.; Steger, A.
23
1992
Non-Ramsey graphs are \(c\log n\)-universal. Zbl 0934.05090
Prömel, Hans Jürgen; Rödl, Vojtěch
22
1999
Almost all Berge graphs are perfect. Zbl 0793.05063
Prömel, Hans Jürgen; Steger, Angelika
20
1992
A 1. 598 approximation algorithm for the Steiner problem in graphs. Zbl 0946.68107
Hougardy, Stefan; Prömel, Hans Jürgen
19
1999
Steiner trees in VLSI-layout. Zbl 0722.68088
Korte, Bernhard; Prömel, Hans Jürgen; Steger, Angelika
19
1990
The average number of linear extensions of a partial order. Zbl 0842.05004
Brightwell, Graham; Prömel, Hans Jürgen; Steger, Angelika
17
1996
For which densities are random triangle-free graphs almost surely bipartite? Zbl 1047.05040
Osthus, D.; Prömel, H. J.; Taraz, A.
14
2003
On random planar graphs, the number of planar graphs and their triangulations. Zbl 1030.05108
Osthus, Deryk; Prömel, Hans Jürgen; Taraz, Anusch
14
2003
Induced Ramsey numbers. Zbl 0913.05074
Kohayakawa, Yoshiharu; Prömel, Hans Jürgen; Rödl, Vojtěch
13
1998
Ramsey theory for discrete structures. Zbl 1290.05001
Prömel, Hans Jürgen
13
2013
Induced partition properties of combinatorial cubes. Zbl 0638.05005
Prömel, Hans Jürgen
11
1985
Canonical partition theorems for parameter sets. Zbl 0547.05008
Prömel, H. J.; Voigt, B.
11
1983
Counting unlabeled structures. Zbl 0618.05029
Prömel, Hans Jürgen
11
1987
Baire sets of k-parameter words are Ramsey. Zbl 0577.05008
Prömel, Hans Jürgen; Voigt, Bernd
9
1985
Graham-Rothschild parameter sets. Zbl 0741.05075
Prömel, Hans J.; Voigt, Bernd
9
1990
Canonizing ordering theorems for Hales Jewett structures. Zbl 0582.06001
Nešetřil, Jaroslav; Prömel, Hans Jürgen; Rödl, Vojtěch; Voigt, B.
8
1985
Hereditary attributes of surjections and parameter sets. Zbl 0606.05002
Prömel, Hans Jürgen; Voigt, Bernd
8
1986
Extremal graph problems for graphs with a color-critical vertex. Zbl 0793.05087
Hundack, Christoph; Prömel, Hans Jürgen; Steger, Angelika
8
1993
A canonical partition theorem for equivalence relations on \(Z^ n\). Zbl 0514.05002
Deuber, W.; Graham, R. L.; Proemel, H. J.; Voigt, B.
7
1983
Lectures on proof verification and approximation algorithms. Zbl 1043.68579
7
1998
On the asymptotic structure of sparse triangle free graphs. Zbl 0856.05037
Prömel, Hans Jürgen; Steger, Angelika
7
1996
Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany. Zbl 0719.00011
7
1990
\(K_4\)-free subgraphs of random graphs revisited. Zbl 1136.05067
Gerke, S; Prömel, H. J.; Schickinger, T.; Steger, A.; Taraz, A.
6
2007
Counting \(H\)-free graphs. Zbl 0851.05057
Prömel, Hans Jürgen; Steger, Angelika
6
1996
Asymptotic enumeration, global structure, and constrained evolution. Zbl 0965.05016
Prömel, Hans Jürgen; Steger, Angelika; Taraz, Anusch
6
2001
Recent results in partition (Ramsey) theory for finite lattices. Zbl 0464.05005
Prömel, Hans Jürgen; Voigt, Bernd
6
1981
A note on triangle-free and bipartite graphs. Zbl 1008.05077
Prömel, Hans Jürgen; Schickinger, Thomas; Steger, Angelika
6
2002
Canonical forms of Borel-measurable mappings \(\Delta: [\omega]^{\omega}\to {\mathbb{R}}\). Zbl 0645.05013
Prömel, Hans Jürgen; Voigt, Bernd
5
1985
Canonical ordering theorems, a first attempt. Zbl 0521.06003
Nešetřil, Jaroslav; Prömel, H. J.; Rödl, Vojtěch; Voigt, B.
5
1982
Phase transitions in the evolution of partial orders. Zbl 0986.06004
Prömel, Hans Jürgen; Steger, Angelika; Taraz, Anusch
5
2001
Random \(\l\)-colorable graphs. Zbl 0817.05052
Prömel, Hans Jürgen; Steger, Angelika
5
1995
Forbidden induced partial orders. Zbl 0940.06003
Brightwell, Graham; Grable, David A.; Prömel, Hans Jürgen
4
1999
Lower bounds for approximation algorithms for the Steiner tree problem. Zbl 1042.68635
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen
4
2001
Asymptotic enumeration and a 0-1 law for m-clique free graphs. Zbl 0584.05041
Kolaitis, Ph. G.; Prömel, H.-J.; Rothschild, B. L.
4
1985
RNC-approximation algorithms for the Steiner problem. Zbl 1498.68213
Prömel, Hans Jürgen; Steger, Angelika
4
1997
A restricted version of Hales-Jewett’s theorem. Zbl 0628.05003
Deuber, W.; Prömel, H. J.; Rothschild, B. L.; Voigt, B.
3
1984
A sparse Graham-Rothschild theorem. Zbl 0662.05006
Prömel, Hans Jürgen; Voigt, Bernd
3
1988
Independent arithmetic progressions in clique-free graphs on the natural numbers. Zbl 0977.05137
Gunderson, David S.; Leader, Imre; Prömel, Hans Jürgen; Rödl, Vojtěch
3
2001
Counting partial orders with a fixed number of comparable pairs. Zbl 0976.06001
Prömel, Hans Jürgen; Steger, Angelika; Taraz, Anusch
3
2001
An elementary proof of the canonizing version of Gallai-Witt’s theorem. Zbl 0589.05010
Prömel, Hans Jürgen; Rödl, Vojtěch
3
1986
Combinatorics. Zbl 1077.05500
3
2004
A partition theorem for [0,1]. Zbl 0726.05011
Prömel, H. J.; Voigt, B.
3
1990
Fast growing functions based on Ramsey theorems. Zbl 0758.03019
Prömel, H. J.; Thumser, W.; Voigt, B.
3
1991
Coloring clique-free graphs in linear expected time. Zbl 0759.05039
Prömel, Hans Jürgen; Steger, Angelika
3
1992
From wqo to bqo, via Ellentuck’s theorem. Zbl 0765.04001
Prömel, Hans Jürgen; Voigt, Bernd
3
1992
The asymptotic structure of \(H\)-free graphs. Zbl 0838.05070
Prömel, Hans Jürgen; Steger, Angelika
3
1993
Canonical partition theorems for finite distributive lattices. Zbl 0521.06006
Proemel, H. J.; Voigt, B.
2
1982
Erdős-Szekeres’ monotone subsequence theorem for projective points and q-graphs. Zbl 0542.05010
Prömel, Hans Jürgen
2
1983
Ordered binary decision diagrams and the Shannon effect. Zbl 1062.94075
Gröpl, Clemens; Prömel, Hans Jürgen; Srivastav, Anand
2
2004
A short proof of the restricted Ramsey theorem for finite set systems. Zbl 0695.05051
Prömel, H. J.; Voigt, B.
2
1989
Partition theorems for parameter systems and graphs. Zbl 0462.05049
Prömel, H. J.; Voigt, B.
2
1981
On the evolution of the worst-case OBDD size. Zbl 1003.68050
Gröpl, Clemens; Prömel, Hans Jürgen; Srivastav, Anand
2
2001
Some remarks on natural orders for combinatorial cubes. Zbl 0666.06001
Prömel, Hans Jürgen
1
1989
Trends in discrete mathematics. Based on a symposium, held at the Zentrum für Interdisziplinäre Forschung, Bielefeld, Germany, October 29-31, 1992. Reprinted from the journal Discrete Mathematics 136, No. 1-3 (1994). Zbl 0814.05001
1
1995
On the structure of clique-free graphs. Zbl 0989.05107
Prömel, Hans Jürgen; Schickinger, Thomas; Steger, Angelika
1
2001
Canonizing Ramsey theorems for finite graphs and hypergraphs. Zbl 0571.05036
Prömel, Hans Jürgen; Voigt, Bernd
1
1985
On the sum of the reciprocals of cycle lengths in sparse graphs. Zbl 0582.05039
Gyárfás, A.; Prömel, H. J.; Szemerédi, E.; Voigt, B.
1
1985
A sparse Gallai-Witt theorem. Zbl 0737.05010
Prömel, H.-J.; Voigt, B.
1
1990
Routing in VLSI-layout. Zbl 0793.68108
Froleyks, B.; Korte, B.; Prömel, H. J.
1
1991
On hypergraphic networks. Zbl 0398.90040
Abel, U.; Carstens, H. G.; Deuber, W.; Prömel, H. J.
1
1979
Independent Deuber sets in graphs on the natural numbers. Zbl 1028.05114
Gunderson, David S.; Leader, Imre; Prömel, Hans Jürgen; Rödl, Vojtěch
1
2003
Steiner trees in uniformly quasi-bipartite graphs. Zbl 1043.68063
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen
1
2002
Ramsey theory for discrete structures. Zbl 1290.05001
Prömel, Hans Jürgen
13
2013
\(K_4\)-free subgraphs of random graphs revisited. Zbl 1136.05067
Gerke, S; Prömel, H. J.; Schickinger, T.; Steger, A.; Taraz, A.
6
2007
Combinatorics. Zbl 1077.05500
3
2004
Ordered binary decision diagrams and the Shannon effect. Zbl 1062.94075
Gröpl, Clemens; Prömel, Hans Jürgen; Srivastav, Anand
2
2004
For which densities are random triangle-free graphs almost surely bipartite? Zbl 1047.05040
Osthus, D.; Prömel, H. J.; Taraz, A.
14
2003
On random planar graphs, the number of planar graphs and their triangulations. Zbl 1030.05108
Osthus, Deryk; Prömel, Hans Jürgen; Taraz, Anusch
14
2003
Independent Deuber sets in graphs on the natural numbers. Zbl 1028.05114
Gunderson, David S.; Leader, Imre; Prömel, Hans Jürgen; Rödl, Vojtěch
1
2003
The Steiner tree problem. A tour through graphs, algorithms, and complexity. Zbl 0992.68156
Prömel, Hans-Jürgen; Steger, Angelika
24
2002
A note on triangle-free and bipartite graphs. Zbl 1008.05077
Prömel, Hans Jürgen; Schickinger, Thomas; Steger, Angelika
6
2002
Steiner trees in uniformly quasi-bipartite graphs. Zbl 1043.68063
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen
1
2002
Asymptotic enumeration, global structure, and constrained evolution. Zbl 0965.05016
Prömel, Hans Jürgen; Steger, Angelika; Taraz, Anusch
6
2001
Phase transitions in the evolution of partial orders. Zbl 0986.06004
Prömel, Hans Jürgen; Steger, Angelika; Taraz, Anusch
5
2001
Lower bounds for approximation algorithms for the Steiner tree problem. Zbl 1042.68635
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen
4
2001
Independent arithmetic progressions in clique-free graphs on the natural numbers. Zbl 0977.05137
Gunderson, David S.; Leader, Imre; Prömel, Hans Jürgen; Rödl, Vojtěch
3
2001
Counting partial orders with a fixed number of comparable pairs. Zbl 0976.06001
Prömel, Hans Jürgen; Steger, Angelika; Taraz, Anusch
3
2001
On the evolution of the worst-case OBDD size. Zbl 1003.68050
Gröpl, Clemens; Prömel, Hans Jürgen; Srivastav, Anand
2
2001
On the structure of clique-free graphs. Zbl 0989.05107
Prömel, Hans Jürgen; Schickinger, Thomas; Steger, Angelika
1
2001
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. Zbl 0959.68101
Prömel, Hans Jürgen; Steger, Angelika
30
2000
Non-Ramsey graphs are \(c\log n\)-universal. Zbl 0934.05090
Prömel, Hans Jürgen; Rödl, Vojtěch
22
1999
A 1. 598 approximation algorithm for the Steiner problem in graphs. Zbl 0946.68107
Hougardy, Stefan; Prömel, Hans Jürgen
19
1999
Forbidden induced partial orders. Zbl 0940.06003
Brightwell, Graham; Grable, David A.; Prömel, Hans Jürgen
4
1999
Induced Ramsey numbers. Zbl 0913.05074
Kohayakawa, Yoshiharu; Prömel, Hans Jürgen; Rödl, Vojtěch
13
1998
Lectures on proof verification and approximation algorithms. Zbl 1043.68579
7
1998
RNC-approximation algorithms for the Steiner problem. Zbl 1498.68213
Prömel, Hans Jürgen; Steger, Angelika
4
1997
The average number of linear extensions of a partial order. Zbl 0842.05004
Brightwell, Graham; Prömel, Hans Jürgen; Steger, Angelika
17
1996
On the asymptotic structure of sparse triangle free graphs. Zbl 0856.05037
Prömel, Hans Jürgen; Steger, Angelika
7
1996
Counting \(H\)-free graphs. Zbl 0851.05057
Prömel, Hans Jürgen; Steger, Angelika
6
1996
Random \(\l\)-colorable graphs. Zbl 0817.05052
Prömel, Hans Jürgen; Steger, Angelika
5
1995
Trends in discrete mathematics. Based on a symposium, held at the Zentrum für Interdisziplinäre Forschung, Bielefeld, Germany, October 29-31, 1992. Reprinted from the journal Discrete Mathematics 136, No. 1-3 (1994). Zbl 0814.05001
1
1995
Excluding induced subgraphs. II: Extremal graphs. Zbl 0783.05064
Prömel, H. J.; Steger, A.
30
1993
Extremal graph problems for graphs with a color-critical vertex. Zbl 0793.05087
Hundack, Christoph; Prömel, Hans Jürgen; Steger, Angelika
8
1993
The asymptotic structure of \(H\)-free graphs. Zbl 0838.05070
Prömel, Hans Jürgen; Steger, Angelika
3
1993
Excluding induced subgraphs. III: A general asymptotic. Zbl 0751.05041
Prömel, H. J.; Steger, A.
47
1992
The asymptotic number of graphs not containing a fixed color-critical subgraph. Zbl 0770.05063
Prömel, H. J.; Steger, A.
23
1992
Almost all Berge graphs are perfect. Zbl 0793.05063
Prömel, Hans Jürgen; Steger, Angelika
20
1992
Coloring clique-free graphs in linear expected time. Zbl 0759.05039
Prömel, Hans Jürgen; Steger, Angelika
3
1992
From wqo to bqo, via Ellentuck’s theorem. Zbl 0765.04001
Prömel, Hans Jürgen; Voigt, Bernd
3
1992
Excluding induced subgraphs: Quadrilaterals. Zbl 0763.05046
Prömel, Hans Jürgen; Steger, Angelika
26
1991
Fast growing functions based on Ramsey theorems. Zbl 0758.03019
Prömel, H. J.; Thumser, W.; Voigt, B.
3
1991
Routing in VLSI-layout. Zbl 0793.68108
Froleyks, B.; Korte, B.; Prömel, H. J.
1
1991
Steiner trees in VLSI-layout. Zbl 0722.68088
Korte, Bernhard; Prömel, Hans Jürgen; Steger, Angelika
19
1990
Graham-Rothschild parameter sets. Zbl 0741.05075
Prömel, Hans J.; Voigt, Bernd
9
1990
Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany. Zbl 0719.00011
7
1990
A partition theorem for [0,1]. Zbl 0726.05011
Prömel, H. J.; Voigt, B.
3
1990
A sparse Gallai-Witt theorem. Zbl 0737.05010
Prömel, H.-J.; Voigt, B.
1
1990
A short proof of the restricted Ramsey theorem for finite set systems. Zbl 0695.05051
Prömel, H. J.; Voigt, B.
2
1989
Some remarks on natural orders for combinatorial cubes. Zbl 0666.06001
Prömel, Hans Jürgen
1
1989
A sparse Graham-Rothschild theorem. Zbl 0662.05006
Prömel, Hans Jürgen; Voigt, Bernd
3
1988
\(K_{\ell +1}\)-free graphs: Asymptotic structure and a 0-1 law. Zbl 0641.05025
Kolaitis, Ph. G.; Prömel, H. J.; Rothschild, B. L.
51
1987
Counting unlabeled structures. Zbl 0618.05029
Prömel, Hans Jürgen
11
1987
Hereditary attributes of surjections and parameter sets. Zbl 0606.05002
Prömel, Hans Jürgen; Voigt, Bernd
8
1986
An elementary proof of the canonizing version of Gallai-Witt’s theorem. Zbl 0589.05010
Prömel, Hans Jürgen; Rödl, Vojtěch
3
1986
Induced partition properties of combinatorial cubes. Zbl 0638.05005
Prömel, Hans Jürgen
11
1985
Baire sets of k-parameter words are Ramsey. Zbl 0577.05008
Prömel, Hans Jürgen; Voigt, Bernd
9
1985
Canonizing ordering theorems for Hales Jewett structures. Zbl 0582.06001
Nešetřil, Jaroslav; Prömel, Hans Jürgen; Rödl, Vojtěch; Voigt, B.
8
1985
Canonical forms of Borel-measurable mappings \(\Delta: [\omega]^{\omega}\to {\mathbb{R}}\). Zbl 0645.05013
Prömel, Hans Jürgen; Voigt, Bernd
5
1985
Asymptotic enumeration and a 0-1 law for m-clique free graphs. Zbl 0584.05041
Kolaitis, Ph. G.; Prömel, H.-J.; Rothschild, B. L.
4
1985
Canonizing Ramsey theorems for finite graphs and hypergraphs. Zbl 0571.05036
Prömel, Hans Jürgen; Voigt, Bernd
1
1985
On the sum of the reciprocals of cycle lengths in sparse graphs. Zbl 0582.05039
Gyárfás, A.; Prömel, H. J.; Szemerédi, E.; Voigt, B.
1
1985
A restricted version of Hales-Jewett’s theorem. Zbl 0628.05003
Deuber, W.; Prömel, H. J.; Rothschild, B. L.; Voigt, B.
3
1984
Canonical partition theorems for parameter sets. Zbl 0547.05008
Prömel, H. J.; Voigt, B.
11
1983
A canonical partition theorem for equivalence relations on \(Z^ n\). Zbl 0514.05002
Deuber, W.; Graham, R. L.; Proemel, H. J.; Voigt, B.
7
1983
Erdős-Szekeres’ monotone subsequence theorem for projective points and q-graphs. Zbl 0542.05010
Prömel, Hans Jürgen
2
1983
Canonical ordering theorems, a first attempt. Zbl 0521.06003
Nešetřil, Jaroslav; Prömel, H. J.; Rödl, Vojtěch; Voigt, B.
5
1982
Canonical partition theorems for finite distributive lattices. Zbl 0521.06006
Proemel, H. J.; Voigt, B.
2
1982
Recent results in partition (Ramsey) theory for finite lattices. Zbl 0464.05005
Prömel, Hans Jürgen; Voigt, Bernd
6
1981
Partition theorems for parameter systems and graphs. Zbl 0462.05049
Prömel, H. J.; Voigt, B.
2
1981
On hypergraphic networks. Zbl 0398.90040
Abel, U.; Carstens, H. G.; Deuber, W.; Prömel, H. J.
1
1979
all top 5

Cited by 591 Authors

23 Prömel, Hans Jürgen
22 Balogh, József
21 Rodl, Vojtech
12 Mašulović, Dragan
12 Sudakov, Benny
10 Bollobás, Béla
10 Samotij, Wojciech
10 Steger, Angelika
10 Voigt, Bernd
9 Conlon, David
9 Morris, Robert D.
7 Fox, Jacob
7 McDiarmid, Colin J. H.
6 Alon, Noga
6 Böckenhauer, Hans-Joachim
6 Brightwell, Graham R.
6 Kohayakawa, Yoshiharu
6 Leader, Imre
6 Lefmann, Hanno
6 Lozin, Vadim Vladislavovich
6 Noy, Marc
5 Fomin, Fedor V.
5 Graham, Ronald Lewis
5 Hromkovič, Juraj
5 Kang, Mihyun
5 Koponen, Vera
5 Lokshtanov, Daniel
5 Nešetřil, Jaroslav
5 Saurabh, Saket
5 Schacht, Mathias
5 Simonovits, Miklós
5 Taraz, Anusch
4 Ahlman, Ove
4 Bentz, Cédric
4 Fouché, Willem Louw
4 Frankl, Péter
4 Hindman, Neil
4 Hsieh, Sun-Yuan
4 Kwan, Matthew
4 Pach, János
4 Saxton, David
4 Zamaraev, Victor A.
3 Abu-Affash, A. Karim
3 Carmi, Paz
3 Dobrinen, Natasha L.
3 Epple, Dennis D. A.
3 Feldmann, Andreas Emil
3 Giménez, Omer
3 Gröpl, Clemens
3 Huang, Jing
3 Kaski, Petteri
3 Keevash, Peter
3 Kim, Donghyun
3 Könemann, Jochen
3 Li, Xianyue
3 Long, Eoin
3 Mömke, Tobias
3 Mosca, Raffaele
3 Mubayi, Dhruv
3 Narayanan, Bhargav P.
3 Nutov, Zeev
3 Osthus, Deryk
3 Panagiotou, Konstantinos D.
3 Panolan, Fahad
3 Person, Yury Aleksandrovic
3 Seibert, Sebastian
3 Skokan, Jozef
3 Solecki, Sławomir
3 Sprussel, Philipp
3 Surya, Sumati
3 Thomason, Andrew G.
3 Westrick, Linda Brown
3 Wu, Weili
3 Zaguia, Nejib
3 Zou, Feng
2 Athanassopoulos, Stavros
2 Atminas, Aistis
2 Bergelson, Vitaly
2 Bhore, Sujoy Kumar
2 Bodirsky, Manuel
2 Böttcher, Julia
2 Brandstädt, Andreas
2 Bucić, Matija
2 Calinescu, Gruia
2 Caragiannis, Ioannis
2 Carlson, Timothy J.
2 Catanzaro, Daniele
2 Chen, Chi-Yeh
2 Cheriyan, Joseph
2 de Figueiredo, Celina M. Herrera
2 Dellamonica, Domingos jun.
2 Deuber, Walter A.
2 Drmota, Michael
2 Du, Donglei
2 Dudek, Andrzej
2 Dzhafarov, Damir D.
2 Frohn, Martin
2 Furedi, Zoltan
2 Gascuel, Olivier
2 Gowers, William Timothy
...and 491 more Authors
all top 5

Cited in 100 Serials

30 Journal of Combinatorial Theory. Series A
23 European Journal of Combinatorics
20 Discrete Mathematics
20 Journal of Combinatorial Theory. Series B
18 Theoretical Computer Science
15 Combinatorics, Probability and Computing
13 Journal of Graph Theory
12 Discrete Applied Mathematics
11 Order
11 Algorithmica
10 Random Structures & Algorithms
9 Information Processing Letters
9 Combinatorica
9 Graphs and Combinatorics
8 Transactions of the American Mathematical Society
6 Advances in Mathematics
6 Mathematical Programming. Series A. Series B
6 The Electronic Journal of Combinatorics
5 Israel Journal of Mathematics
5 The Journal of Symbolic Logic
5 Annals of Pure and Applied Logic
5 SIAM Journal on Discrete Mathematics
4 Bulletin of the London Mathematical Society
4 Networks
3 Journal of Computer and System Sciences
3 Proceedings of the American Mathematical Society
3 European Journal of Operational Research
2 Classical and Quantum Gravity
2 Algebra Universalis
2 Inventiones Mathematicae
2 Journal of the London Mathematical Society. Second Series
2 Mathematika
2 Discrete & Computational Geometry
2 Information and Computation
2 Computers & Operations Research
2 Journal of the American Mathematical Society
2 Annals of Operations Research
2 Archive for Mathematical Logic
2 Applied Categorical Structures
2 Theory of Computing Systems
2 Mathematical Methods of Operations Research
2 Journal of the European Mathematical Society (JEMS)
2 Journal of Mathematical Logic
2 Journal of Systems Science and Complexity
2 ACM Journal of Experimental Algorithmics
2 Journal of Discrete Algorithms
2 Oberwolfach Reports
2 Discrete Analysis
1 American Mathematical Monthly
1 Artificial Intelligence
1 Mathematical Notes
1 Mathematical Proceedings of the Cambridge Philosophical Society
1 Physics Reports
1 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
1 Annali di Matematica Pura ed Applicata. Serie Quarta
1 The Annals of Probability
1 Czechoslovak Mathematical Journal
1 Fundamenta Mathematicae
1 Information Sciences
1 Journal of Environmental Economics and Management
1 Journal of Optimization Theory and Applications
1 Notre Dame Journal of Formal Logic
1 Proceedings of the London Mathematical Society. Third Series
1 SIAM Journal on Computing
1 Advances in Applied Mathematics
1 International Journal of Approximate Reasoning
1 The Annals of Applied Probability
1 Computational Geometry
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 Annals of Physics
1 Linear Algebra and its Applications
1 The Australasian Journal of Combinatorics
1 Experimental Mathematics
1 Computational Optimization and Applications
1 Journal of Mathematical Sciences (New York)
1 Mathematical Logic Quarterly (MLQ)
1 Journal of Combinatorial Optimization
1 Annals of Combinatorics
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Annals of Mathematics. Second Series
1 RAIRO. Theoretical Informatics and Applications
1 Living Reviews in Relativity
1 Integers
1 Portugaliae Mathematica. Nova Série
1 ACM Transactions on Computational Logic
1 4OR
1 Discrete Optimization
1 Journal of Industrial and Management Optimization
1 Optimization Letters
1 Journal of Physics A: Mathematical and Theoretical
1 Discrete Mathematics, Algorithms and Applications
1 Journal of Logic and Analysis
1 Algorithms
1 Forum of Mathematics, Pi
1 Forum of Mathematics, Sigma
1 Journal of the Operations Research Society of China
1 Computer Science Review
1 Advances in Combinatorics
1 Combinatorial Theory

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.