| Asymmetry and structural information in preferential attachment graphs | 0 | 0.34 | 2019 |
| On the diameter of Kronecker graphs. | 0 | 0.34 | 2018 |
| Integral Homology of Random Simplicial Complexes. | 1 | 0.40 | 2018 |
| On multicolor Ramsey numbers for loose k-paths of length three. | 0 | 0.34 | 2018 |
| A tale of stars and cliques. | 0 | 0.34 | 2018 |
| Picker–Chooser fixed graph games | 2 | 0.41 | 2016 |
| Hamilton cycles in random lifts of graphs | 0 | 0.34 | 2015 |
| On Erdős' extremal problem on matchings in hypergraphs | 9 | 0.81 | 2014 |
| Limit measures of inhomogeneous discrete-time quantum walks in one dimension | 12 | 2.10 | 2013 |
| Investigation of rotation forest method applied to property price prediction | 2 | 0.37 | 2012 |
| Investigation of random subspace and random forest methods applied to property valuation data | 5 | 0.43 | 2011 |
| Experimental comparison of resampling methods in a multi-agent system to assist with property valuation | 0 | 0.34 | 2011 |
| Vicarious graphs | 0 | 0.34 | 2010 |
| First-Order Definability of Trees and Sparse Random Graphs | 2 | 0.39 | 2007 |
| Vertex Ramsey properties of families of graphs | 3 | 0.77 | 2002 |
| On the discrepancy of combinatorial rectangles | 5 | 1.00 | 2002 |
| On minimal Folkman graphs | 7 | 1.00 | 2001 |
| On triangle-free random graphs | 7 | 0.85 | 2000 |
| R(C n , C n , C n )<=(4+o(1)) n. | 3 | 0.47 | 1999 |
| R(C n , C n , C n )<=(4+o(1)) n. | 11 | 1.27 | 1999 |
| R(Cn, Cn,Cn) 0 (1)) n | 11 | 1.25 | 1999 |
| On the connectivity of random subsets of projective spaces | 3 | 0.79 | 1999 |
| Endomorphisms of Partially Ordered Sets | 0 | 0.34 | 1998 |
| Random trees and random graphs | 14 | 3.73 | 1998 |
| Graphs without short odd cycles are nearly bipartite | 5 | 0.80 | 1997 |
| The number of connected sparsely edged uniform hypergraphs | 7 | 0.65 | 1997 |
| A suboptimal lossy data compression based on approximate pattern matching | 52 | 4.27 | 1997 |
| On induced Ramsey numbers for graphs with bounded maximum degree | 6 | 0.68 | 1996 |
| Graphs in which each C4 spans K4 | 0 | 0.34 | 1996 |
| Ramsey-type results for oriented trees | 0 | 0.34 | 1996 |
| Sparse anti-Ramsey graphs | 1 | 0.45 | 1995 |
| A note on the density of sum-free sets | 0 | 0.34 | 1995 |
| On the k-diameter of k-regular k-connected graphs | 18 | 1.42 | 1994 |
| Ramsey properties of random graphs | 25 | 6.94 | 1992 |
| Holes in random graphs | 0 | 0.34 | 1991 |
| How to deal with unlabeled Random graphs | 0 | 0.34 | 1991 |
| Cycles in random graphs | 6 | 1.48 | 1991 |
| The phrase transition in the evolution of random digraphs | 3 | 0.45 | 1990 |
| Maximal induced trees in sparse random graphs | 5 | 2.69 | 1988 |
