Note: From October 2025 I work at the Chair of Algorithmics, TU Dresden.

My new website is here.    Some of the content below may be out of date.

László Kozma

Location

LK picture
Address:
Takustr. 9, Room 114
14195 Berlin
Germany

E-mail: laszlo.kozma@fu-berlin.de
Phone: +49 30 838 66213



Arbeitsgruppe Theoretische Informatik
Institut für Informatik
Freie Universität Berlin


Office hours: Friday 9-10, or by e-mail appointment, or whenever my door is open.

Note: I'm happy to discuss possible thesis topics, usually related to algorithms and theoretical computer science. If you are interested in doing a thesis project with me, feel free to come by.

Websites: more official | less official


News and activities

2025 []

Aug--Dec 2025

  • Starting at TU Dresden in October
  • European Research Week on Geometric Graphs, Chorin
  • Günter Rote retirement colloquium at FU Berlin
  • Franz Baader retirement symposium at TU Dresden
  • Master thesis defense: Papenfuß
  • Junqi presents geometric data structure paper at ESA
  • Bachelor thesis defenses: Chung, Zimmerhofer, Meier, Vdovichenko
  • Research visits by: Debmalya Panigrahi, Diptarka Chakraborty, Justin Dallant, Alantha Newman
  • BPE paper with Johannes submitted
  • Compact permutation paper with Michal submitted
  • New online sorting paper (with several coauthors) submitted

Jan--Jul 2025

  • Advanced data structures lecture S25 and Seminar on recent breakthroughs in shortest paths algorithms S25
  • Online sorting paper at HALG
  • Raimund Seidel farewell event at Dagstuhl
  • Attending two Dagstuhl Seminars: Adaptive and Scalable Data Structures, and Learned Predictions for Data Structures
  • Bellman-Ford paper with Jialu fixed and extended, mentioned by Eppstein
  • Geometric data structure paper with Junqi submitted to ESA 25
  • TSP paper with Benjamin and Hwi presented at EuroCG
  • Seminar talks: Cartesian trees; Sorting by reversals
  • Master thesis defense: Voderholzer
  • Bachelor thesis defenses: Alhamdan, Nguyen, Hu, Shen


2024 []

Sep--Dec 2024

  • Benjamin graduates. Congratulations!
  • Short visit by Jean Cardinal and John Iacono
  • BPE paper with Johannes uploaded
  • PhD committee at FUB: Jonas Cleve
  • Master thesis defense: Kraleva
  • Bachelor thesis defense: Klingele
  • PhD external examiner of Akash Pareek at IIT
  • Seminar talks on max cut and on streaming
  • Advanced algorithms W24 and Algorithms Software Project W24
  • I'll be on the MFCS 25 PC

May--Aug 2024

  • PhD external examiner/committee Justin Dallant at ULB
  • Workshop: Algorithms and DS Today, Singapore
  • Randomized saddle paper accepted to ESA 24
  • Online sorting paper accepted to ESA 24
  • Short visit by Arturo Merino
  • Patterns paper presented at STOC/TheoryFest Vancouver
  • Invited talk at Analysis of Algorithms'24 in Bath
  • Seminar talk on single-source shortest paths

Mar--Apr 2024

  • Attending Workshop Comb/Algo/Geom in Dresden
  • Two papers submitted to ESA 24
  • Junqi Tan to start as PhD student
  • Avani Pawar to start student research project
  • Seminar talks on saddle points and on online sorting
  • Randomized algorithms lecture S24

Jan--Feb 2024


Teaching

Advanced algorithms, Fall 2024, Fall 2023, Fall 2022, Fall 2021, Fall 2020, Fall 2018.   [plan '23] ['18]
Randomized algorithms, Spring 2024, Spring 2019.   [plan '24] ['19]
Software Project: Applications of Algorithms, Fall 2024.
Seminar on Shortest Paths Algorithms: Recent breakthroughs, Spring 2025.
Seminar on Approximation Algorithms, Fall 2023.
Grundlagen der theoretischen Informatik, Spring 2023.
Seminar on Online Algorithms, Spring 2023.
Seminar on Algorithms: Beyond Worst-case Analysis, Fall 2022.
Seminar on Clustering, Fall 2021.   [course page]
Parameterized and exact exponential algorithms, Spring 2021.   [plan '21]
Algorithmic geometry (jointly with K. Kriegel), Spring 2021.
Advanced data structures, Spring 2025, Spring 2020.   [course page '20]
Analysis für Infomatik, Fall 2019.
Graph algorithms (at TU Eindhoven, jointly with J. Nederlof), Spring 2018.

Research

I am interested in efficient data structures and algorithms, algorithmic adaptivity, and algorithmic questions involving combinatorial and geometric structures. My papers (pdf downloads, slides, etc.) can be found on my personal website.


Selected publications (see here for full list and downloads):

Advised students (thesis projects)

Titles/abstracts of the theses and full contents (where available) can be accessed through the group websites: master | bachelor

Some potentially useful tips for tcs and math research and writing (R O'Donnell), talks (K Fatahalian), more on talks (A Gupta), research in general (DP Stern) and some timeless advice from G-C Rota, more advice from J. Baez, as well as from W. Thurston.

Projects

DFG Project Efficient Adaptive Data Structures (EAD), 2019-2022, PI.
DFG Project EAD II, 2023-2024, PI.

Last updated by László Kozma.