|
[226] Conflict-free colorings of graphs and hypergraphs
(with G. Tardos),
Combinatorics, Probability and Computing 18 (2009), 819-834.
[227] 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. [228] 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. [229] Combinatorial Geometry and its Algorithmic Applications: The Alcala Lectures (with M. Sharir), Mathematical Surveys and Monographs, Vol. 152, AMS, Providence, 2009. [230] 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. [231] 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. Also in: Electronic J. of Combinatorics 19 (2012), Issue 2, P31. [232] Minimum clique partition in unit disk graphs (with A. Dumitrescu), Graphs and Combinatorics 27 (2011), 399-411. [233] 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. 44 (2011), 345-355. [234] String graphs and incomparability graphs (with J. Fox), in: Proceedings 28th Annual Symposium on Computational Geometry (Chapel Hill, NC), ACM Press, New York, 2012, 405-414. Also in: Advances in Mathematics 230 (2012), 1381-1401. [235] A note on blocking visibility between points (with A. Dumitrescu and G. Tóth), Geombinatorics, 19(1), 2009, 67-73. [236] 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. [237] Conway's conjecture for monotone thrackles (with E. Sterling), American Mathematical Monthly 118, June/July 2011, 544-548. [238] On the structure of graphs with low obstacle number (with D. Sarioz), Graphs and Combinatorics 27 (2011), 465-473. [239] 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. [240] Overlap properties of geometric expanders (with J. Fox, M. Gromov, V. Lafforgue, A. Naor), Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, California, 2011, 1188-1197. Also in: Journal fur die reine und angewandte Mathematik (Crelle) 671 (2012), 49-83. [241] 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. 27 (2013), no. 2, 1171-1183. [242] Opaque sets (with A. Dumitrescu and M. Jiang), in: Approximation, Randomization, and Combinatorial Optimization (APPROX 2011), Lecture Notes in Computer Science Volume 6845 (2011), 194-205. Also in: Algorithmica, accepted. [243] Remarks on a Ramsey theory for trees (with J. Solymosi and G. Tardos), Combinatorica 32 (2012), 473-482. [244] Computing the independence number of intersection graphs (with J. Fox), Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, California, 1161-1165. [245] 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. Also: SIAM J. Computing, accepted. [246] 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. [247] 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, 458-463. Also in: J. American Mathematical Society 26 (2013), no. 3, 645-658. [248] Lower bounds on the obstacle number of graphs (with P. Mukkamala, D. Pálvölgyi), Electronic J. Combin. 19 (2012), P32. [249] Monotone crossing number (with G. Tóth), in: Graph Drawing 2011, Lecture Notes in Computer Science 7034, Springer-Verlag, Berlin, 2011, 278-289. Also in: Moscow Journal of Combinatorics and Number Theory 2 (2012), 216-231. [250] Disjoint homometric sets in graphs (with M. O. Albertson, M. E. Young), Ars Math. Contemp. 4 (2011), 1-4. |
|