default search action
Hendrik Fichtenberger
Person information
- affiliation: University of Vienna, Faculty of Computer Science, Austria
- affiliation: TU Dortmund, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Weiqiang He, Hendrik Fichtenberger, Pan Peng:
A Differentially Private Clustering Algorithm for Well-Clustered Graphs. ICLR 2024 - [i16]Weiqiang He, Hendrik Fichtenberger, Pan Peng:
A Differentially Private Clustering Algorithm for Well-Clustered Graphs. CoRR abs/2403.14332 (2024) - [i15]Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee:
Differential privacy and Sublinear time are incompatible sometimes. CoRR abs/2407.07262 (2024) - 2023
- [c16]Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay:
Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. ICML 2023: 10072-10092 - [c15]Brandon A. Mayer
, Anton Tsitsulin
HUGE: Huge Unsupervised Graph Embeddings with TPUs. KDD 2023: 4638-4648 - [c14]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. SODA 2023: 2677-2727 - [i14]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. CoRR abs/2303.11843 (2023) - [i13]Brandon A. Mayer, Anton Tsitsulin, Hendrik Fichtenberger, Jonathan Halcrow, Bryan Perozzi:
HUGE: Huge Unsupervised Graph Embeddings with TPUs. CoRR abs/2307.14490 (2023) - 2022
- [c13]Hendrik Fichtenberger, Pan Peng:
Approximately Counting Subgraphs in Data Streams. PODS 2022: 413-425 - [i12]Hendrik Fichtenberger, Pan Peng:
Approximately Counting Subgraphs in Data Streams. CoRR abs/2203.14225 (2022) - 2021
- [j1]Hendrik Fichtenberger
Testing stability properties in graphical hedonic games. Auton. Agents Multi Agent Syst. 35(2): 26 (2021) - [c12]Hendrik Fichtenberger, Monika Henzinger
Differentially Private Algorithms for Graphs Under Continual Observation. ESA 2021: 42:1-42:16 - [c11]Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. SODA 2021: 2660-2678 - [i11]Hendrik Fichtenberger, Monika Henzinger, Lara Ost:
Differentially Private Algorithms for Graphs Under Continual Observation. CoRR abs/2106.14756 (2021) - [i10]Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese:
On fully dynamic constant-factor approximation algorithms for clustering problems. CoRR abs/2112.07217 (2021) - 2020
- [b1]Hendrik Fichtenberger:
Property testing of graphs and the role of neighborhood distributions. Dortmund University, Germany, 2020 - [c10]Artur Czumaj, Hendrik Fichtenberger
Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM 2020: 16:1-16:20 - [c9]Hendrik Fichtenberger
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. ICALP 2020: 45:1-45:13 - [i9]Hendrik Fichtenberger, Mingze Gao, Pan Peng:
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. CoRR abs/2005.01861 (2020) - [i8]Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. CoRR abs/2011.06888 (2020)
2010 – 2019
- 2019
- [c8]Hendrik Fichtenberger, Amer Krivosija, Anja Rey:
Testing Individual-Based Stability Properties in Graphical Hedonic Games. AAMAS 2019: 882-890 - [c7]Hendrik Fichtenberger
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. SODA 2019: 714-726 - [i7]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. CoRR abs/1905.01644 (2019) - 2018
- [c6]Hendrik Fichtenberger
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. ICALP 2018: 52:1-52:14 - [c5]Hendrik Fichtenberger
A Two-Sided Error Distributed Property Tester For Conductance. MFCS 2018: 19:1-19:15 - [c4]Hendrik Fichtenberger, Dennis Rohde:
A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice. NeurIPS 2018: 6743-6754 - [i6]Hendrik Fichtenberger, Dennis Rohde:
A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice. CoRR abs/1810.05064 (2018) - [i5]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. CoRR abs/1811.02937 (2018) - [i4]Hendrik Fichtenberger, Anja Rey:
Testing Stability Properties in Graphical Hedonic Games. CoRR abs/1812.09249 (2018) - 2017
- [i3]Hendrik Fichtenberger
Distributed Testing of Conductance. CoRR abs/1705.08174 (2017) - [i2]Hendrik Fichtenberger
On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. CoRR abs/1707.06126 (2017) - 2015
- [c3]Hendrik Fichtenberger
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. APPROX-RANDOM 2015: 786-799 - 2014
- [c2]Dominic Siedhoff, Hendrik Fichtenberger
Signal/Background Classification of Time Series for Biological Virus Detection. GCPR 2014: 388-398 - 2013
- [c1]Hendrik Fichtenberger
BICO: BIRCH Meets Coresets for k-Means Clustering. ESA 2013: 481-492 - [i1]Hendrik Fichtenberger
PROBI: A Heuristic for the probabilistic k-median problem. CoRR abs/1309.5781 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-17 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: