| Disjointness Graphs of Short Polygonal Chains | 0 | 0.34 | 2022 |
| The number of crossings in multigraphs with no empty lens. | 0 | 0.34 | 2021 |
| Disjointness graphs of segments in the space | 0 | 0.34 | 2021 |
| Many touchings force many crossings | 0 | 0.34 | 2019 |
| An algorithm to find maximum area polygons circumscribed about a convex polygon | 0 | 0.34 | 2019 |
| Note on k-planar crossing numbers. | 1 | 0.37 | 2018 |
| The Number Of Crossings In Multigraphs With No Empty Lens | 1 | 0.40 | 2018 |
| A Crossing Lemma for Multigraphs. | 1 | 0.42 | 2018 |
| Many Touchings Force Many Crossings. | 0 | 0.34 | 2017 |
| Exploring the position of cities in global corporate research and development: A bibliometric analysis by two different geographical approaches. | 4 | 0.42 | 2017 |
| Disjointness Graphs of Segments. | 0 | 0.34 | 2017 |
| Erdős–Szekeres Theorem for Lines | 0 | 0.34 | 2015 |
| Saturated simple and k-simple topological graphs. | 1 | 0.48 | 2015 |
| Multiple Coverings with Closed Polygons. | 0 | 0.34 | 2014 |
| Separating families of convex sets | 2 | 0.46 | 2013 |
| Monochromatic empty triangles in two-colored point sets | 5 | 0.51 | 2013 |
| Erdős–Szekeres Theorem for Point Sets with Forbidden Subconfigurations | 1 | 0.34 | 2012 |
| Drawing Hamiltonian Cycles with No Large Angles | 3 | 0.43 | 2012 |
| Improvement on the Decay of Crossing Numbers | 4 | 0.52 | 2012 |
| Tangled Thrackles. | 0 | 0.34 | 2011 |
| Graph unique-maximum and conflict-free colorings | 4 | 0.43 | 2011 |
| Towards The Albertson Conjecture | 2 | 0.42 | 2010 |
| Convex Polygons are Cover-Decomposable | 14 | 1.29 | 2010 |
| Cubic Graphs Have Bounded Slope Parameter | 3 | 0.42 | 2010 |
| Decomposition of multiple coverings into many parts | 29 | 2.11 | 2009 |
| Degenerate Crossing Numbers | 2 | 0.43 | 2009 |
| Long alternating paths in bicolored point sets | 10 | 0.93 | 2008 |
| QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB | 4 | 0.84 | 2008 |
| Crossing Stars in Topological Graphs | 6 | 0.94 | 2007 |
| Note on the Pair-crossing Number and the Odd-crossing Number | 3 | 0.48 | 2007 |
| Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs | 36 | 1.92 | 2006 |
| Planar Crossing Numbers Of Graphs Embeddable In Another Surface | 13 | 0.67 | 2006 |
| Drawing cubic graphs with at most five slopes | 16 | 1.16 | 2006 |
| How Many Ways Can One Draw A Graph? | 11 | 0.81 | 2006 |
| Degenerate crossing numbers | 1 | 0.40 | 2006 |
| Crossing number of toroidal graphs | 11 | 1.18 | 2005 |
| Topological Graphs with No Large Grids | 13 | 1.33 | 2005 |
| Monotone drawings of planar graphs | 12 | 1.01 | 2004 |
| Geometric graphs with no self-intersecting path of length three | 10 | 1.43 | 2004 |
| Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract] | 6 | 0.62 | 2004 |
| Monotone paths in line arrangements | 2 | 0.56 | 2003 |
| Disjoint edges in topological graphs | 13 | 0.85 | 2003 |
| Unavoidable Configurations in Complete Topological Graphs | 7 | 0.62 | 2003 |
| Ramsey-Type Results for Unions of Comparability Graphs | 3 | 0.43 | 2002 |
| Crossing numbers of random graphs | 9 | 0.76 | 2002 |
| Recognizing String Graphs Is Decidable | 20 | 1.18 | 2001 |
| Point Sets with Many k-Sets | 53 | 3.26 | 2001 |
| Convex Sets in the Plane with Three of Every Four Meeting | 12 | 1.69 | 2001 |
| Note on geometric graphs | 17 | 1.18 | 2000 |
| New Bounds on Crossing Numbers | 24 | 1.60 | 1999 |
