Cikkek

In preparation/To appear:

Octants are Cover Decomposable. (with Balázs Keszegh). pdf

Lower bounds on the obstacle number of graphs. (with Padmini Mukkamala and János Pach). pdf

Unique-maximum and conflict-free colorings for hypergraphs and tree graphs. (with Panagiotis Cheilaris and Balázs Keszegh). pdf

2011

Bin Packing via Discrepancy of Permutations (with Friedrich Eisenbrand and Thomas Rothvoß). SODA 2011. pdf

2010

Asymptotically optimal pairing strategy for Tic-Tac-Toe with numerous directions (with Padmini Mukkamala). Electron. J. Combin. 17 (2010), no. 1, Note 33, 6 pp. (electronic). pdf

Permutations, hyperplanes and polynomials over finite fields (with András Gács, Tamás Héger and Zoltán Lóránt Nagy). Finite Fields and Their Applications 16(5): 301-314 (2010). (Earlier version: 22nd British Combinatorial Conference.) pdf

Drawing planar graphs of bounded degree with few slopes (with Balázs Keszegh and János Pach). Graph Drawing 2010 pdf

On weakly intersecting pairs of sets (with Zoltán Király, Zoltán Lóránt Nagy and Mirkó Visontai). 7th International Conference on Lattice Path Combinatorics and Applications pdf

Indecomposable coverings with concave polygons. Discrete & Computational Geometry 44(3): 577-588 (2010). pdf (corrected minor things)

Finding the biggest and smallest element with one lie (with D. Gerbner, B. Patkós and G. Wiener). Discrete Applied Mathematics 158(9): 988-995 (2010). (Earlier version: International Conference on Interdisciplinary Mathematical and Statistical Techniques - IMST 2008 / FIM.) pdf

Vectors in a Box (with Kevin Buchin, Jiří Matoušek and Robin A. Moser). Coimbra Meeting on 0-1 Matrix Theory and Related Topics. pdf

Consistent digital line segments (with Tobias Christ and Miloš Stojakovic). SoCG 2010. pdf

Testing additive integrality gaps (with Friedrich Eisenbrand, Nicolai Hähnle and Gennady Shmonin). SODA 2010. pdf

Convex Polygons are Cover-Decomposable (with Géza Tóth). Discrete & Computational Geometry 43(3): 483-496 (2010). pdf

Polychromatic Colorings of Arbitrary Rectangular Partitions (with D. Gerbner, B. Keszegh, N. Lemons, C. Palmer and B. Patkós). Discrete Math. 310, No. 1, 21-30 (2010). (Earlier version: 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications.) pdf

Cubic Graphs Have Bounded Slope Parameter (with B. Keszegh, J. Pach, and G. Tóth). J. Graph Algorithms Appl. 14(1): 5-17 (2010). (Earlier version: Proceedings of Graph Drawing 2008, 50--60.) pdf

2009

2D-TUCKER is PPAD-complete. WINE 2009 Proceedings. pdf

Combinatorial necklace splitting. Electron. J. Combin. 16 (2009), no. 1, Research Paper 79, 8 pp. pdf

Deciding Soccer Scores and Partial Orientations of Graphs. Acta Univ. Sapientiae Math. 1 (2009), no. 1, 35--42. (Earlier version: EGRES Technical Reports 2008.) pdf

2008

Drawing cubic graphs with at most five slopes (with B. Keszegh, J. Pach, and G. Tóth). Comput. Geom. 40 (2008), no. 2, 138--147. (Earlier version: Graph drawing, 114--125, Lecture Notes in Comput. Sci., 4372, Springer, Berlin, 2007.) pdf

2007

Revisiting sequential search using question-sets with bounded intersections. J. Stat. Theory Pract. 1 (2007), no. 2, 199--204. pdf
A note explaining how this is related to a well-known puzzle involving ostrich eggs. pdf

2006

P2T is NP-complete. EGRES Quick-Proofs 2006. pdf

Bounded-degree graphs can have arbitrarily large slope numbers (with János Pach). Electron. J. Combin. 13 (2006), no. 1, Note 1, 4 pp. (electronic). pdf

2005

Baljó S Árnyak (Left compressed shadows---a simple proof of the Kruskal-Katona theorem). Mat. Lapok (N.S.) 10 (2000/01), no. 2, 13--16 (2005). pdf English Version: pdf

Theses

Decomposition of Geometric Set Systems and Graphs. (PhD Thesis, 2010) pdf

Communication Complexity. (Master's Thesis, 2005) pdf