BICO: BIRCH Meets Coresets for k-Means Clustering. - Hendrik Fichtenberger; Marc Gillé; Melanie Schmidt 001; Chris Schwiegelshohn; Christian Sohler (ESA, 2013)

PROBI: A Heuristic for the probabilistic k-median problem. - Hendrik Fichtenberger; Melanie Schmidt 001 (CoRR, 2013)

Signal/Background Classification of Time Series for Biological Virus Detection. - Dominic Siedhoff; Hendrik Fichtenberger; Pascal Libuschewski; Frank Weichert; Christian Sohler; Heinrich Müller (GCPR, 2014)

On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. - Hendrik Fichtenberger; Pan Peng 001; Christian Sohler (APPROX-RANDOM, 2015)

On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. - Hendrik Fichtenberger; Reut Levi; Yadu Vasudev; Maximilian Wötzel (CoRR, 2017)

Distributed Testing of Conductance. - Hendrik Fichtenberger; Yadu Vasudev (CoRR, 2017)

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. - Hendrik Fichtenberger; Reut Levi; Yadu Vasudev; Maximilian Wötzel (ICALP, 2018)

A Two-Sided Error Distributed Property Tester For Conductance. - Hendrik Fichtenberger; Yadu Vasudev (MFCS, 2018)

A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice. - Hendrik Fichtenberger; Dennis Rohde (NeurIPS, 2018)

Testing Individual-Based Stability Properties in Graphical Hedonic Games. - Hendrik Fichtenberger; Amer Krivosija; Anja Rey (AAMAS, 2019)

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. - Hendrik Fichtenberger; Pan Peng 001; Christian Sohler (SODA, 2019)

Testable Properties in General Graphs and Random Order Streaming. - Artur Czumaj; Hendrik Fichtenberger; Pan Peng 001; Christian Sohler (APPROX-RANDOM, 2020)

Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. - Hendrik Fichtenberger; Mingze Gao; Pan Peng 001 (ICALP, 2020)

Property testing of graphs and the role of neighborhood distributions - Hendrik Fichtenberger (2020)

Differentially Private Algorithms for Graphs Under Continual Observation. - Hendrik Fichtenberger; Monika Henzinger; Lara Ost (ESA, 2021)

Consistent k-Clustering for General Metrics. - Hendrik Fichtenberger; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson (SODA, 2021)

Testing stability prop﻿erties in graphical hedonic games. - Hendrik Fichtenberger; Anja Rey (Auton. Agents Multi Agent Syst., 2021)

On fully dynamic constant-factor approximation algorithms for clustering problems. - Hendrik Fichtenberger; Monika Henzinger; Andreas Wiese (CoRR, 2021)

Approximately Counting Subgraphs in Data Streams. - Hendrik Fichtenberger; Pan Peng 001 (PODS, 2022)

Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. - Hendrik Fichtenberger; Monika Henzinger; Jalaj Upadhyay (ICML, 2023)

HUGE: Huge Unsupervised Graph Embeddings with TPUs. - Brandon A. Mayer; Anton Tsitsulin; Hendrik Fichtenberger; Jonathan Halcrow; Bryan Perozzi (KDD, 2023)

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. - MohammadHossein Bateni; Hossein Esfandiari; Hendrik Fichtenberger; Monika Henzinger; Rajesh Jayaram; Vahab Mirrokni; Andreas Wiese (SODA, 2023)

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. - MohammadHossein Bateni; Hossein Esfandiari; Hendrik Fichtenberger; Monika Henzinger; Rajesh Jayaram; Vahab Mirrokni; Andreas Wiese (CoRR, 2023)

A Differentially Private Clustering Algorithm for Well-Clustered Graphs. - Weiqiang He; Hendrik Fichtenberger; Pan Peng 001 (ICLR, 2024)

Differential Privacy and Sublinear Time Are Incompatible Sometimes. - Jeremiah Blocki; Hendrik Fichtenberger; Elena Grigorescu; Tamalika Mukherjee (ITCS, 2025)

Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality. - Filipe Miguel Gonçalves de Almeida; CJ Carey; Hendrik Fichtenberger; Jonathan Halcrow; Silvio Lattanzi; André Linhares; Tao Meng; Ashkan Norouzi-Fard; Nikos Parotsidis; Bryan Perozzi; David Simcha (CoRR, 2025)