Balázs Keszegh

 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    

    20. Octants are Cover Decomposable into Many Coverings (with D. Pálvölgyi), manuscript

    19. Online and quasi-online colorings of wedges and intervals (with N. Lemons and D. Pálvölgyi), manuscript

    18. Saturating Sperner families (with D. Gerbner, N. Lemons, C. Palmer, B. Patkós and D. Pálvölgyi), Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications Proceedings (2011), 341-350. arXiv

    17. Octants are Cover Decomposable (with D. Pálvölgyi), EuroComb 2011 Proceedings, Electronic Notes in Discrete Mathematics 38 (2011), 499–504.; Discrete and Computational Geometry, 47 (3), Springer (2012) 598-609. arXiv

    16. Path-search in a pyramid and in other graphs (with D. Gerbner), ZiF Workshop Search Methodologies II, Bielefeld (2010); Journal of Statistical Theory and Practice Volume 6, Issue 2, (2012), 303-314. arXiv

    15. Drawing planar graphs of bounded degree with few slopes (with J. Pach and D. Pálvölgyi), Graph Drawing, Konstanz (2010),  Lecture Notes in Computer Science, 6502, Springer (2011), 293-304. arXiv

    14. Density-based group testing (with D. Gerbner, D. Pálvölgyi and G. Wiener), arXiv
    Conference version: Search with density tests, Coimbra Meeting on 0-1 Matrix Theory and Related, Coimbra (2010); ZiF Workshop Search Methodologies II, Bielefeld (2010)

    13. Unique-maximum and conflict-free colorings for hypergraphs and tree graphs (with P. Cheilaris and D. Pálvölgyi), Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications Proceedings (2011), 207-216.; SOFSEM 2012, 190-201. arXiv

    12. Graphs that Admit Right Angle Crossing Drawings (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), Lecture Notes in Computer Science, 6410, Springer (2010), 135-146.; Computational Geometry: Theory and Applications (2012), 45 (4), 169-177. arXiv

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

    10. Generalizations of the Tree Packing Conjecture (with D. Gerbner and C. Palmer), 8th French Combinatorial Conference, Paris (2010), arXiv

    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. Box-respecting Colorings of n-dimensional Guillotine-Partitions, Discrete Mathematics, 311(8-9), Elsevier (2011), 756-760.
    Conference version: Polychromatic colorings of n-dimensional guillotine-partitions, The 14th Annual International Computing and Combinatorics Conference (COCOON08) Proceedings, 110-118.     pdf

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

    5. Coloring half-planes and bottomless rectangles; Computational Geometry: Theory and Applications (2012), http://dx.doi.org/10.1016/j.comgeo.2011.09.004
    Conference version: Weak conflict free colorings of point sets and simple regions, The 19th Canadian Conference on Computational Geometry (CCCG07), Proceedings (2007), 97-100. pdf

    4. Cubic graphs have bounded slope parameter (with J. Pach, D. Pálvölgyi, and G. Tóth), Graph Drawing 2008; Journal of Graph Algorithms and Applications 14(1), (2010) 5-17. 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