article

• Counting the number of crossings in geometric graphs.  Information Processing Letters.  165:-. 2021-01-01
• Counting Hamiltonian Cycles in the Matroid Basis Graph.  Graphs and Combinatorics.  35:539-550. 2019-01-01
• The complexity of computing the cylindrical and the t-circle crossing number of a graph.  Electronic Journal of Combinatorics.  25:-. 2018-01-01
• On the Pseudolinear Crossing Number.  Journal of Graph Theory.  84:297-310. 2017-01-01
• Spanning trees with nonseparating paths.  Discrete Mathematics.  339:365-374. 2016-01-01
• The optimal drawings of K5,n.  Electronic Journal of Combinatorics.  21:-. 2014-01-01
• Making a graph crossing-critical by multiplying its edges.  Electronic Journal of Combinatorics.  20:-. 2013-01-01
• Nested cycles in large triangulations and crossing-critical graphs.  Journal of Combinatorial Theory. Series B.  102:86-92. 2012-01-01
• Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30.  Discrete Mathematics.  311:1646-1657. 2011-01-01