Address

 Alfréd Rényi Institute of Mathematics

 Hungarian Academy of Sciences

 H-1053 Budapest, Reáltanoda u. 13-15.

 e-mail: keszegh@renyi.hu

Curriculum Vitae

cv

Publications    

15. Drawing planar graphs of bounded degree with few slopes (with J. Pach and D. Pálvölgyi), Graph Drawing, Konstanz (2010)

14. Search with density tests (with D. Gerbner, D. Pálvölgyi and G. Wiener), Coimbra Meeting on 0-1 Matrix Theory and Related, Coimbra (2010)

13. Unique-maximum and conflict-free colorings for hypergraphs and tree graphs (with P. Cheilaris and D. Pálvölgyi), arXiv,

12. Drawing Graphs with Orthogonal Crossings (with K. Arikushi, R. Fulek, F. Moric and Cs. D. Tóth), 36th International Workshop on Graph Theoretic Concepts in Computer Science, Zarós (2010)

11. On polygons excluding point sets (with R. Fulek, F. Moric and, The 22th Canadian Conference on Computational Geometry (CCCG10); I. Uljarevic), arXiv

10. Packing trees of different sizes into graphs (with D. Gerbner and C. Palmer), 8th French Combinatorial Conference, Paris (2010)

9. Combinatorial and computational problems about points in the plane (PhD Dissertation, supervisors: E. Győri and G. Tardos), 2009, Central European Univesity, Department of Mathematics and its Applications pdf

8. Polychromatic colorings of arbitrary rectangular partitions (with D. Gerbner, N. Lemons, C. Palmer, B. Patkós and D. Pálvölgyi), Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2009); Discrete Mathematics, 310(1), Elsevier (2010), 21-30., pdf

7. Polychromatic colorings of n-dimensional guillotine-partitions, The 14th Annual International Computing and Combinatorics Conference (COCOON08) Proceedings, 110-118. pdf

6. An improved upper bound on the reflexivity of point sets (with E. Ackerman and O. Aichholzer), The 19th Canadian Conference on Computational Geometry (CCCG07); Computational Geometry: Theory and Applications, 42(3), Elsevier (2009), 241-249. pdf

5. Weak conflict free colorings of point sets and simple regions, The 19th Canadian Conference on Computational Geometry (CCCG07); Computational Geometry: Theory and Applications, invited to the special issue of CCCG07 pdf

4. Cubic graphs have bounded slope parameter (with J. Pach, D. Pálvölgyi, and G. Tóth), Graph Drawing 2008 pdf

3. Drawing cubic graphs with at most five slopes (with J. Pach, D. Pálvölgyi, and G. Tóth), Graph Drawing 2006, Computational Geometry: Theory and Applications 40(2), Elsevier (2008), 138-147. pdf

2. On linear forbidden submatrices, Journal of Combinatorial Theory, Series A, 116, Elsevier (2009), 232-241. pdf

1. Forbidden submatrices in 0-1 matrices (Master's Thesis, supervisor: G. Tardos), 2005, Eötvös Loránd University, Budapest, Faculty of Science pdf