| 2025 | SODA | Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. | Sujoy Bhore, Balzs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dmtr Plvlgyi, Csaba D. Tth |
| 2016 | GD | On the Size of Planarly Connected Crossing Graphs. | Eyal Ackerman, Balzs Keszegh, Mt Vizer |
| 2015 | WG | On the Tree Search Problem with Non-uniform Costs. | Ferdinando Cicalese, Balzs Keszegh, Bernard Lidick, Dmtr Plvlgyi, Toms Valla |
| 2015 | WG | An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. | Balzs Keszegh, Dmtr Plvlgyi |
| 2014 | ESA | Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. | Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balzs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis |
| 2014 | FUN | Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. | Andrei Asinowski, Balzs Keszegh, Tillmann Miltzow |
| 2013 | SOFSEM | Online and Quasi-online Colorings of Wedges and Intervals. | Balzs Keszegh, Nathan Lemons, Dmtr Plvlgyi |
| 2012 | SOFSEM | Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. | Panagiotis Cheilaris, Balzs Keszegh, Dmtr Plvlgyi |
| 2010 | GD | Drawing Planar Graphs of Bounded Degree with Few Slopes. | Balzs Keszegh, Jnos Pach, Dmtr Plvlgyi |
| 2010 | WG | Graphs that Admit Right Angle Crossing Drawings. | Karin Arikushi, Radoslav Fulek, Balzs Keszegh, Filip Moric, Csaba D. Tth |
| 2008 | COCOON | Polychromatic Colorings of n-Dimensional Guillotine-Partitions. | Balzs Keszegh |
| 2008 | GD | Cubic Graphs Have Bounded Slope Parameter. | Balzs Keszegh, Jnos Pach, Dmtr Plvlgyi, Gza Tth |
| 2006 | GD | Drawing Cubic Graphs with at Most Five Slopes. | Balzs Keszegh, Jnos Pach, Dmtr Plvlgyi, Gza Tth |