About me

I am a PhD student in math of the DCG group at EPFL. Here is my detailed CV:

CV.pdf

Research

I am mainly interested in Combinatorics, Combinatorial geometry and Complexity theory. Here is a detailed list of my results:

Submitted/Accepted:

Combinatorial necklace splitting

2D-TUCKER is PPAD-complete

Permutations, hyperplanes and polynomials over finite fields (with András Gács, Tamás Héger and Zoltán Lóránt Nagy) 

Indecomposable coverings with concave polygons

Polychromatic Colorings of Arbitrary Rectengular Partitions (with D. Gerbner, B. Keszegh, N. Lemons, C. Palmer and B. Patkós).

Finding the biggest and smallest element with one lie (with D. Gerbner, B. Patkós and G. Wiener).

Convex polygons are cover-decomposable (with Géza Tóth).

2008

The slope parameter of cubic graphs is bounded (with B. Keszegh, J. Pach, and G. Tóth), in: Proceedings of Graph Drawing 2008, 50--60.

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

Deciding Soccer Scores and Partial Orientations of Graphs, in: EGRES Technical Reports 2008.

2007

Sequential search using question-sets with bounded intersections, in: Journal of Statistical Theory and Practice Vol 1, Num 2 (2007).

2006

 P2T is NP-complete, in: EGRES Quick-Proofs 2006.

Bounded-degree graphs can have arbitrarily large slope numbers (with János Pach), Electronic J. Combinatorics 13 (1) (2006), N1. 

2005

Baljó S Árnyak, in: Matematikai Lapok.

Szakdolgozat. (Master's Thesis)