| The maximum number of paths of length three in a planar graph | 0 | 0.34 | 2022 |
| The Turan number of the triangular pyramid of 3-layers | 0 | 0.34 | 2022 |
| Connected hypergraphs without long Berge-paths | 0 | 0.34 | 2021 |
| Edge Colorings Of Graphs Without Monochromatic Stars | 0 | 0.34 | 2020 |
| Mobile versus Point Guards. | 0 | 0.34 | 2019 |
| Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. | 0 | 0.34 | 2019 |
| Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. | 0 | 0.34 | 2019 |
| The maximum number of P copies in P-free graphs. | 0 | 0.34 | 2019 |
| A note on the maximum number of triangles in a C5-free graph. | 0 | 0.34 | 2019 |
| On the Turán number of some ordered even cycles. | 0 | 0.34 | 2018 |
| An Erdős-Gallai type theorem for uniform hypergraphs. | 3 | 0.83 | 2018 |
| A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. | 0 | 0.34 | 2018 |
| On the maximum size of connected hypergraphs without a path of given length. | 0 | 0.34 | 2018 |
| Note on terminal-pairability in complete grid graphs. | 2 | 0.47 | 2017 |
| On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. | 0 | 0.34 | 2017 |
| On the number of edge-disjoint triangles in K4-free graphs | 0 | 0.34 | 2017 |
| Mobile vs. point guards. | 0 | 0.34 | 2017 |
| Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem. | 0 | 0.34 | 2016 |
| Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem. | 0 | 0.34 | 2015 |
| Optimal pebbling of grids. | 0 | 0.34 | 2015 |
| Preface. | 0 | 0.34 | 2014 |
| Hypergraphs with no cycle of length 4 | 0 | 0.34 | 2012 |
| Triangle-Free Hypergraphs | 5 | 1.02 | 2006 |
| Longest Paths in Circular Arc Graphs | 4 | 0.70 | 2004 |
| Two-edge colorings of graphs with bounded degree in both colors | 0 | 0.34 | 2002 |
| On the Strong Product of a k-Extendable and an l-Extendable Graph | 3 | 0.58 | 2001 |
| Vertex-Disjoint Cycles Containing Specified Edges | 26 | 2.38 | 2000 |
| C6-free bipartite graphs and product representation of squares | 8 | 1.43 | 1997 |
| Graphs without short odd cycles are nearly bipartite | 5 | 0.80 | 1997 |
| Generalized guarding and partitioning for rectilinear polygons | 8 | 1.06 | 1994 |
| On The Number Of Edge Disjoint Cliques In Graphs Of Given Size | 6 | 0.69 | 1991 |
| On the maximal number of certain subgraphs inKr-free graphs | 4 | 0.72 | 1991 |
| On the number of C5's in a triangle-free graph | 0 | 0.34 | 1989 |
| Covering simply connected regions by rectangles | 0 | 0.34 | 1985 |
| A minimax theorem on intervals | 12 | 2.42 | 1984 |
| An n-dimensional search problem with restricted questions | 1 | 0.40 | 1981 |
| Partition conditions and vertex-connectivity of graphs | 1 | 0.36 | 1981 |
