Conflict-free colorings of graphs and hypergraphs (with G. Tardos), Combinatorics, Probability and Computing 18 (2009), 819-834.
 On grids in topological graphs (with E. Ackerman, J. Fox, and A. Suk), in: Proceedings 24th annual Symposium on Computational Geometry, ACM Press, 2009, 403-412.
 Cubic graphs have bounded slope parameter (with B. Keszegh, D. Pálvölgyi, and G. Toth), in: Graph Drawing 2008 (I. G. Tollis and M. Patrignani, eds.), Lecture Notes in Computer Science 5417, Springer-Verlag, Berlin, 2009, 50-60. Also in: J. Graph Algorithms and Applications 14 (2010), 5-17.
 Combinatorial Geometry and its Algorithmic Applications: The Alcala Lectures (with M. Sharir), Mathematical Surveys and Monographs, Vol. 152, AMS, Providence, 2009.
 A separator theorem for string graphs and its applications (with J. Fox). In: WALCOM: Algorithms and Computation, Lecture Notes in Computer Science 5431, Springer-Verlag, Berlin, 2009, 1-14. Also in: Combinatorics, Probability and Computing 19 (2010), 371-390.
 Drawing Hamiltonian cycles with no large angles (with A. Dumitrescu and G. Tóth), Graph Drawing 2009, Lecture Notes in Computer Science 5849, Springer-Verlag, Berlin, 2010, 3-14.
 Minimum clique partition in unit disk graphs (with A. Dumitrescu), Graphs and Combinatorics 27 (2011), 399-411.
 A computational approach to Conway's thrackle conjecture (with R. Fulek). in: Graph Drawing 2010, Lecture Notes in Computer Science 6502, Springer-Verlag, Berlin, 2011, 226-237. Also in: Computat. Geom.: Theory and Appls., submitted.
 String graphs and incomparability graphs (with J. Fox), Advances in Mathematics, accepted.
 A note on blocking visibility between points (with A. Dumitrescu and G. Tóth), Geombinatorics, 19(1), 2009, 67-73.
 Crossings between curves with many tangencies (with J. Fox, F. Frati, and R. Pinchasi), in: Proc. WALCOM: Workshop on Algorithms and Computation, Lecture Notes in Computer Science 5942, Springer-Verlag, 2010, 1-8. Also in: An Irregular Mind (I. Bárány, L. Solymosi, eds.), Bolyai Society Mathematical Studies, Vol. 21, 2010, 251-260.
 Conway's conjecture for monotone thrackles (with E. Sterling), American Mathematical Monthly 118, June/July 2011, 544-548.
 On the structure of graphs with low obstacle number (with D. Sarioz), Graphs and Combinatorics 27 (2011), 465-473.
 Graphs with large obstacle numbers (with P. Mukkamala, D. Sarioz), Proc. WG 2010: 36th Intern. Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 6410, Springer-Verlag, Berlin, 2010, 292-303.
 Overlap properties of geometric expanders (with J. Fox, M. Gromov, V. Lafforgue, A. Naor), Journal fur die reine und angewandte Mathematik (Crelle), 2011, accepted.
 Drawing planar graphs of bounded degree with few slopes (with B. Keszegh and D. Pálvölgyi), in: Graph Drawing 2010, Lecture Notes in Computer Science 6502, Springer-Verlag, 2011, 293-304. Also in: SIAM J. Discrete Math., submitted.
 Opaque sets (with A. Dumitrescu and M. Jiang), manuscript.
 Remarks on a Ramsey theory for trees (with J. Solymosi and G. Tardos), submitted.
 Computing the independence number of intersection graphs (with J. Fox), Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, California, accepted.
 On the queue-number of planar graphs (with G. Di Battista, F. Frati), in: Proc. 51st Annual IEEE Symposium on Foundations of Computer Science, (FOCS 2010), Las Vegas, Nevada, 2010, 365-374.
 Tangencies between families of disjoint regions in the plane (with A. Suk and M. Treml), in: Proc. 26th Annual Symposium on Computational Geometry, Snowbird, Utah, 2010, 423-428. Also in: Computational Geometry: Theory and Appls. 45 (2012), 131--138.
 Tight lower bounds for the size of epsilon-nets (with G. Tardos), in: Proc. 27th Annual Symposium on Computational Geometry (SoCG 2011), Paris, France, 2011, accepted.
 Lower bounds on the obstacle number of graphs (with P. Mukkamala, D. Pálvölgyi).
 Monotone crossing number (with G. Tóth), submitted.
 Disjoint homometric sets in graphs (with M. O. Albertson, M. E. Young), Ars Math. Contemp. 4 (2011), 1-4.