Dynablox: Real-Time Detection of Diverse Dynamic Objects in Complex Environments. - Lukas Schmid 001; Olov Andersson; Aurelio L. Sulser; Patrick Pfreundschuh; Roland Siegwart (IEEE Robotics Autom. Lett., 2023)

A Simple and Near-Optimal Algorithm for Directed Expander Decompositions. - Aurelio L. Sulser; Maximilian Probst Gutenberg (CoRR, 2024)

GLAudio Listens to the Sound of the Graph. - Aurelio L. Sulser; Johann Wenckstern; Clara Kuempel (CoRR, 2024)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths. - Nick Fischer; Bernhard Haeupler; Rustam Latypov; Antti Roeyskoe; Aurelio L. Sulser (CoRR, 2024)

Ramsey numbers for multiple copies of sparse graphs. - Aurelio L. Sulser; Milos Trujic (J. Graph Theory, 2024)

Near-Optimal Algorithm for Directed Expander Decompositions. - Aurelio L. Sulser; Maximilian Probst Gutenberg (ICALP, 2025)

Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory. - Nikola Zubic; Federico Soldà; Aurelio L. Sulser; Davide Scaramuzza 001 (ICLR, 2025)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path. - Nick Fischer; Bernhard Haeupler; Rustam Latypov; Antti Roeyskoe; Aurelio L. Sulser (SOSA, 2025)