About me
-
- Post Doctoral Researcher
- if you want to write me: first name . last name a epfl ch
-
Bio
- 1982 – born in Čadca (Slovakia)
- Sept 2000 – Jun 2005 – master degree in informatics at Comenius Univeristy (Bratislava, Slovakia)
- Jun 2005 – Aug 2006 – programmer in Isomi a.s. (Bratislava, Slovakia)
- Sept 2006 – Jun 2008 – master degree in computing science at Simon Fraser University (Burnaby, BC, Canada)
- Sept 2008 – May 2012 – PhD student in mathematics at EPFL (Lausanne, Switzerland)
- May 2012 – now – Post Doctoral Researcher at EPFL (Lausanne, Switzerland)
Publications
- JOURNAL PUBLICATIONS … (click)
- JOURNAL PUBLICATIONS
- Linear Bound on Extremal Functions of Some Forbidden Patterns in 0–1 Matrices. Discrete Mathematics Volume 309 (6) April 2009: Pages 1736-1739
- Intersecting Convex Sets by Rays (with Andreas Holmsen and Janos Pach), Discrete & Computational Geometry 42 (3), 2009, 343-358
- A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets (with Ondrej Bilka, Kevin Buchin, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa and Csaba D. Toth), The Electronic Journal of Combinatorics 17 (1), 2010
- Diameter Bounds for Planar Graphs (with Filip Moric and David Pritchard), Discrete Mathematics, vol. 311, issue 5, 2011, 327–335
- A Computational Approach to Conway’s Thrackle Conjecture (with Janos Pach), Computational Geometry 44, Issues 6-7, 2011, 345-355
- Graphs that Admit Polyline Drawings with Few Bends and Crossing Angles (with Eyal Ackerman, and Csaba D. Toth), SIAM J. Discrete Math. 26(1): 305-320 (2012)
- Graphs that Admit Right Angle Crossing Drawings (with Karin Arikushi, Radoslav Fulek, Balazs Keszegh, Filip Moric, and Csaba D. Toth), Comput. Geom. 45(4): 169-177
- On Disjoint Crossing–Families in Geometric Graphs (with Andrew Suk), Thirty Essays in Geometric Graph Theory, J. Pach ed., 289-302 (2012)
- Hanani-Tutte, Monotone Drawings and Level-Planarity (with Michael Pelsmajer, Marcus Schaefer and Daniel Stefankovic), Thirty Essays in Geometric Graph Theory, J. Pach ed., 263-287 (2012)
- Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs (with Noushin Saeedi, and Deniz Sari\”oz), Thirty Essays in Geometric Graph Theory, J. Pach ed., 249-261 (2012)
- Adjacent Crossings Do Matter (with M. Pelsmajer, Marcus Schaefer and Daniel Stefankovic), Journal of Graph Algorithms and Applications 16(3): 759-782 (2012)
- On Polygons Excluding Point Sets (with Balazs Keszegh, Filip Moric, and Igor Uljarevic), Graphs and Combinatorics, to appear
- Orthogeodesic Point-Set Embeddability (with Emilio Di Giacomo, Fabrizio Frati, Luca Grilli, Marcus Krug), submitted
- CONFERENCE PROCEEDINGS … (click)
- CONFERENCE PROCEEDINGS
- Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs (with Hongmei He, Ondrej Sykora, Imrich Vrto), SOFSEM 2005: 376-379
- Intersecting Convex Sets by Rays (with Andreas Holmsen and Janos Pach), Symposium on Computational Geometry 2008: 385-391
- A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets, (with Kevin Buchin Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Toth) in Proc. 7th Japan Conference on Computational Geometry and Graphs (Kanazawa, 2009), JAIST
- Graphs that Admit Right Angle Crossing Drawings, (with Karin Arikushi, Balazs Keszegh, Filip Moric, and Csaba D. Toth) in Proc.36th Workshop on Graph Theoretic Concepts in Comp. Sci.(Zarós, 2010), LNCS, Springer, 135-146
- Polygonizations Avoiding a Set of Points (with Balázs Keszegh, Filip Moric, and Igor Uljarevic), CCCG 2010, 273-276
- Coloring Geometric Hypergraph Defined by an Arrangement of Half-planes, CCCG 2010, 71-74
- A Computational Approach to Conway’s Thrackle Conjecture (with Janos Pach), Graph Drawing 2010, 226-237
- On the Size Of Graphs that Admit Polyline Drawings with Few Bends and Crossing Angles (with Eyal Ackerman, and Csaba D. Toth), Graph Drawing 2010, 1-12
- Hanani-Tutte and Monotone Drawings (with Michael Pelsmajer, Marcus Schaefer and Daniel Štefankovič), WG 2011, 283-294
- Orthogeodesic Point-Set Embeddability (with Emilio Di Giacomo, Fabrizio Frati, Luca Grilli, Marcus Krug), Graph Drawing 2011, 52-63
- On the Page Number of Upward Planar Directed Acyclic Graphs (with Fabrizio Frati and Andres Ruiz Vargas), Graph Drawing 2011, 391-402
- Adjacent Crossings Do Matter (with Michael Pelsmajer, Marcus Schaefer and Daniel Stefankovic), Graph Drawing 2011, 345-354
Preprints
- Efficient c-planarity testing algebraically (with J. Kynčl, and D. Pálvölgyi), manuscript in preparation
- Universal point sets for 3-trees (with C. D. Tóth), submitted
- Plane graphs with free edge lengths (with F. Morić, Y. Okamoto, T. Szabó, and C. D. Tóth), submitted
- Homometric sets in trees (with S. Mitrović), submitted
- On lines not supporting trees (with D. Neuwirth), submitted
Unpublished work
- Lower bound on the chromatic number of discrete Borsuk graph (with Gábor Tardos)
- On a planar matching in line segments endpoints visibility graph
Misc
Code for thrackle write-up:
