GaZIR: gaze-based zooming interface for image retrieval. - László Kozma 002; Arto Klami; Samuel Kaski (ICMI, 2009)

Minimum Average Distance Triangulations. - László Kozma 002 (ESA, 2012)

Privacy by Fake Data: A Geometric Approach. - Victor Alvarez 001; Erin W. Chambers; László Kozma 002 (CCCG, 2013)

Shattering, Graph Orientations, and Connectivity. - László Kozma 002; Shay Moran (Electron. J. Comb., 2013)

Streaming Algorithms for Partitioning Integer Sequences. - Christian Konrad 001; László Kozma 002 (CoRR, 2014)

Review of the tower of Hanoi: myths and maths by Andreas M. Hinz, Sandi Klavžar, Urož Milutinović and Ciril Petr. - László Kozma 002 (SIGACT News, 2014)

Self-Adjusting Binary Search Trees: What Makes Them Tick? - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (ESA, 2015)

Pattern-Avoiding Access in Binary Search Trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (FOCS, 2015)

Greedy Is an Almost Optimal Deque. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (WADS, 2015)

A Global Geometric View of Splaying. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (CoRR, 2015)

A PTAS for Euclidean Maximum Scatter TSP. - László Kozma 002; Tobias Mömke (CoRR, 2015)

Hitting Set for Hypergraphs of Low VC-dimension. - Karl Bringmann; László Kozma 002; Shay Moran; N. S. Narayanaswamy (ESA, 2016)

Binary search trees and rectangulations. - László Kozma 002; Thatchaphol Saranurak (CoRR, 2016)

The landscape of bounds for binary search trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (CoRR, 2016)

Binary search trees, rectangles and patterns. - László Kozma 002 (2016)

Maximum Scatter TSP in Doubling Metrics. - László Kozma 002; Tobias Mömke (SODA, 2017)

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. - Dani Dorfman; Haim Kaplan; László Kozma 002; Seth Pettie; Uri Zwick (ESA, 2018)

Multi-Finger Binary Search Trees. - Parinya Chalermsook; Mayank Goswami 001; László Kozma 002; Kurt Mehlhorn; Thatchaphol Saranurak (ISAAC, 2018)

Pairing heaps: the forward variant. - Dani Dorfman; Haim Kaplan; László Kozma 002; Uri Zwick (MFCS, 2018)

Time- and space-optimal algorithms for the many-visits TSP. - André Berger; László Kozma 002; Matthias Mnich; Roland Vincze (CoRR, 2018)

Review of Compact Data Structures - a practical approach by Gonzalo Navarro. - László Kozma 002 (SIGACT News, 2018)

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. - Haim Kaplan; László Kozma 002; Or Zamir; Uri Zwick (SOSA, 2019)

Hamiltonicity Below Dirac's Condition. - Bart M. P. Jansen; László Kozma 002; Jesper Nederlof (WG, 2019)

Faster and simpler algorithms for finding large patterns in permutations. - László Kozma 002 (CoRR, 2019)

Exact Exponential Algorithms for Two Poset Problems. - László Kozma 002 (SWAT, 2020)

Geometric group testing. - Benjamin Aram Berendsohn; László Kozma 002 (CoRR, 2020)

Smooth Heaps and a Dual View of Self-Adjusting Data Structures. - László Kozma 002; Thatchaphol Saranurak (SIAM J. Comput., 2020)

Time- and Space-optimal Algorithm for the Many-visits TSP. - André Berger; László Kozma 002; Matthias Mnich; Roland Vincze (ACM Trans. Algorithms, 2020)

Analysis of Smooth Heaps and Slim Heaps. - Maria Hartmann; László Kozma 002; Corwin Sinnamon; Robert E. Tarjan (ICALP, 2021)

Finding and Counting Permutations via CSPs. - Benjamin Aram Berendsohn; László Kozma 002; Dániel Marx (Algorithmica, 2021)

Group Testing with Geometric Ranges. - Benjamin Aram Berendsohn; László Kozma 002 (ISIT, 2022)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; László Kozma 002; Manuel Lafond; Günter Rote; Yuki Tokuni; Max Willert; Binhai Zhu (JCDCGGG, 2022)

Fixed-Point Cycles and Approximate EFX Allocations. - Benjamin Aram Berendsohn; Simona Boyadzhiyska; László Kozma 002 (MFCS, 2022)

Splay trees on trees. - Benjamin Aram Berendsohn; László Kozma 002 (SODA, 2022)

Fixed-point cycles and EFX allocations. - Benjamin Aram Berendsohn; Simona Boyadzhiyska; László Kozma 002 (CoRR, 2022)

Fast Approximation of Search Trees on Trees with Centroid Trees. - Benjamin Aram Berendsohn; Ishay Golinsky; Haim Kaplan; László Kozma 002 (ICALP, 2023)

Scalable Data Structures (Dagstuhl Seminar 23211). - Gerth Stølting Brodal; John Iacono; László Kozma 002; Vijaya Ramachandran; Justin Dallant (Dagstuhl Reports, 2023)

Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. - Mikkel Abrahamsen; Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; László Kozma 002 (ESA, 2024)

An Optimal Randomized Algorithm for Finding the Saddlepoint. - Justin Dallant; Frederik Haagensen; Riko Jacob; László Kozma 002; Sebastian Wild (ESA, 2024)

Finding the saddlepoint faster than sorting. - Justin Dallant; Frederik Haagensen; Riko Jacob; László Kozma 002; Sebastian Wild (SOSA, 2024)

Optimization with Pattern-Avoiding Input. - Benjamin Aram Berendsohn; László Kozma 002; Michal Opler (STOC, 2024)

Non-adaptive Bellman-Ford: Yen's improvement is optimal. - Jialu Hu; László Kozma 002 (CoRR, 2024)

Theoretical Analysis of Byte-Pair Encoding. - László Kozma 002; Johannes Voderholzer (CoRR, 2024)

Balanced TSP partitioning. - Benjamin Aram Berendsohn; Hwi Kim; László Kozma 002 (CoRR, 2025)

Faster exponential algorithms for cut problems via geometric data structures. - László Kozma 002; Junqi Tan (CoRR, 2025)