Publications

Publications:

If you want to have the newest version of a paper and cannot access it from the conference or journal website, feel free to write me an email < cschwiegelshohn -- at -- gmail.com >.

2020:

  • Similarity Search for Dynamic Data Streams, IEEE Trans. Knowl. Data Eng. With Marc Bury and Mara Sorella.

  • Spectral Relaxations and Fair Densest Subgraph, CIKM. With Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone, and Cristina Menghini.

  • Commitment and Slack for Online Load Maximization , SPAA. With Samin Jamalabadi and Uwe Schwiegelshohn .

2019:

  • Structural Results on Matching Estimation with Applications to Streaming, Algorithmica. With Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova, and Samson Zhou.

  • Fully Dynamic Consistent Facility Location, NeurIPS. With Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, and David Saulpic.

  • Fair Coresets and Streaming Algorithms for Fair k-Means, WAOA. With Melanie Schmidt and Christian Sohler.

  • Oblivious Dimension Reduction for k-Means -- Beyond Subspaces and the Johnson-Lindenstrauss Lemma, STOC. With Luca Becchetti, Marc Bury, Vincent Cohen-Addad, and Fabrizio Grandoni.

I encourage anyone interested in this work to read the paper by Makarychev, Makarychev, and Razenshteyn. Independently from us, they obtained essentially optimal bounds for the same problem.

  • (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time, SODA. With Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, and Shay Solomon.

2018:

  • Coresets-Methods and History: A Theoreticians Design Patter for Approximation and Streaming Algorithms, Künstliche Intell. With Alexander Munteanu.

  • On Coresets for Logistic Regression, NeurIPS. With Alexander Munteanu, Christian Sohler, and David Woodruff.

  • Sketch 'Em All: Fast Approximate Similarity Search in Dynamic Data Streams, WSDM. With Marc Bury and Mara Sorella.

2017:

  • On the Local Structure of Stable Clustering Instances, FOCS. With Vincent Cohen-Addad.

  • On Finding the Jaccard Center, ICALP. With Marc Bury.

2016:

  • The Power of Migration for Online Slack Scheduling, ESA. With Uwe Schwiegelshohn.

  • Diameter and k-Center in Sliding Windows, ICALP. With Vincent Cohen-Addad and Christian Sohler.

2015:

  • Sublinear Estimation of Weighted Matchings in Dynamic Data Streams, ESA. With Marc Bury.

2013:

  • BICO: BIRCH Meets Coresets for k-Means Clustering, ESA. With Hendrik Fichtenberger, Marc Gillé (now Bury), Melanie Schmidt, and Christian Sohler.

BICO was intended to be a very fast, space efficient, practically useful clustering algorithm. Code can be found here.

2012:

  • Solving the Minimum String Cover Problem, ALENEX. With Stefan Canzar, Tobias Marshall, and Sven Rahmann.

Back to the main page.