Hendrik Fichtenberger

Orcid: 0000-0003-3246-5323

Affiliations:
  • University of Vienna, Faculty of Computer Science, Austria
  • TU Dortmund, Department of Computer Science, Germany


According to our database1, Hendrik Fichtenberger authored at least 25 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Differential privacy and Sublinear time are incompatible sometimes.
CoRR, 2024

A Differentially Private Clustering Algorithm for Well-Clustered Graphs.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries.
CoRR, 2023

Optimal Fully Dynamic <i>k</i>-Center Clustering for Adaptive and Oblivious Adversaries.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

HUGE: Huge Unsupervised Graph Embeddings with TPUs.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation.
Proceedings of the International Conference on Machine Learning, 2023

2022
Approximately Counting Subgraphs in Data Streams.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
On fully dynamic constant-factor approximation algorithms for clustering problems.
CoRR, 2021

Testing stability properties in graphical hedonic games.
Auton. Agents Multi Agent Syst., 2021

Consistent k-Clustering for General Metrics.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Differentially Private Algorithms for Graphs Under Continual Observation.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Property testing of graphs and the role of neighborhood distributions
PhD thesis, 2020

Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Testable Properties in General Graphs and Random Order Streaming.
Proceedings of the Approximation, 2020

2019
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Testing Individual-Based Stability Properties in Graphical Hedonic Games.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A Two-Sided Error Distributed Property Tester For Conductance.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Distributed Testing of Conductance.
CoRR, 2017

On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error.
CoRR, 2017

2015
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs.
Proceedings of the Approximation, 2015

2014
Signal/Background Classification of Time Series for Biological Virus Detection.
Proceedings of the Pattern Recognition - 36th German Conference, 2014

2013
PROBI: A Heuristic for the probabilistic k-median problem.
CoRR, 2013

BICO: BIRCH Meets Coresets for k-Means Clustering.
Proceedings of the Algorithms - ESA 2013, 2013


  Loading...