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

arXiv

google scholar

Publications    

24. A. Dumitrescu, D. Gerbner, B. Keszegh, Cs. D. Tóth: Covering Paths for Planar Point Sets, arXiv

23. M. Henze,  R. Jaume,  B. Keszegh: On the complexity of the partial least-squares matching Voronoi diagram, EuroCG 2013 (2013), 193-196.

22. D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Wiener: Search for the end of a path in the d-dimensional grid and in other graphs, arXiv


21. B. Keszegh, B. Patkós and X. Zhu: Nonrepetitive colorings of blow-ups of graphs, arXiv


20. B. Keszegh, D. Pálvölgyi: Octants are Cover Decomposable into Many Coverings, arXiv


19. B. Keszegh, N. Lemons and D. Pálvölgyi: Online and quasi-online colorings of wedges and intervals, SOFSEM 2013: Theory and Practice of Computer Science, Lecture Notes in Computer Science 7741 (2013), 292-306. arXiv


18. D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, B. Patkós and D. Pálvölgyi: Saturating Sperner families, Graphs and Combinatorics (2012) DOI: 10.1007/s00373-012-1195-6; Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications Proceedings (2011), 341-350. arXiv


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


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


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


14. D. Gerbner, B. Keszegh, D. Pálvölgyi and G. Wiener: Density-based group testing, In: Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede, Lecture Notes in Computer Science 7777 (2013), 543-556. 
Conference version: Search with density tests, Coimbra Meeting on 0-1 Matrix Theory and Related, Coimbra (2010); ZiF Workshop Search Methodologies II, Bielefeld (2010), arXiv

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


12. K. Arikushi, R. Fulek, B. Keszegh, F. Moric and Cs. D. Tóth: Graphs that Admit Right Angle Crossing Drawings, Computational Geometry: Theory and Applications (2012), 45 (4), 169-177.; 36th International Workshop on Graph Theoretic Concepts in Computer Science, Zarós (2010), Lecture Notes in Computer Science, 6410, Springer (2010), 135-146. arXiv

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

10. D. Gerbner, B. Keszegh, and C. Palmer: Generalizations of the Tree Packing Conjecture, 8th French Combinatorial Conference, Paris (2010), Discussiones Mathematicae Graph Theory 32 (3) (2012), 569-582. arXiv

9. B. Keszegh: 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. D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, B. Patkós and D. Pálvölgyi: Polychromatic colorings of arbitrary rectangular partitions, Discrete Mathematics, 310(1), Elsevier (2010), 21-30.; Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2009) pdf

7. B. Keszegh: 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. E. Ackerman and O. Aichholzer, B. Keszegh: Improved upper bounds on the reflexivity of point sets, Computational Geometry: Theory and Applications, 42(3), Elsevier (2009), 241-249.; The 19th Canadian Conference on Computational Geometry (CCCG07) Proceedings, 29-32. pdf

5. B. Keszegh: Coloring half-planes and bottomless rectangles, Computational Geometry: Theory and Applications, 45(9), Elsevier (2012), 495–507. arXiv
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. B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth: Cubic graphs have bounded slope parameter, Graph Drawing 2008; Journal of Graph Algorithms and Applications 14(1), (2010) 5-17. pdf

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

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

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