Chris Schwiegelshohn

693 total citations
19 papers, 77 citations indexed

About

Chris Schwiegelshohn is a scholar working on Artificial Intelligence, Computer Vision and Pattern Recognition and Computer Networks and Communications. According to data from OpenAlex, Chris Schwiegelshohn has authored 19 papers receiving a total of 77 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Artificial Intelligence, 7 papers in Computer Vision and Pattern Recognition and 6 papers in Computer Networks and Communications. Recurrent topics in Chris Schwiegelshohn's work include Face and Expression Recognition (5 papers), Optimization and Search Problems (4 papers) and Complexity and Algorithms in Graphs (4 papers). Chris Schwiegelshohn is often cited by papers focused on Face and Expression Recognition (5 papers), Optimization and Search Problems (4 papers) and Complexity and Algorithms in Graphs (4 papers). Chris Schwiegelshohn collaborates with scholars based in Denmark, Italy and Germany. Chris Schwiegelshohn's co-authors include Vincent Cohen-Addad, Uwe Schwiegelshohn, Christian Sohler, Luca Becchetti, Aris Anagnostopoulos, David P. Woodruff, Vladimir Braverman, Robert Krauthgamer, Stefano Leonardi and Fabrizio Grandoni and has published in prestigious journals such as IEEE Transactions on Knowledge and Data Engineering, Operations Research Letters and Algorithmica.

In The Last Decade

Chris Schwiegelshohn

17 papers receiving 74 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Chris Schwiegelshohn Denmark	5	49	25	20	17	13	19	77
Ali Vakilian United States	5	38 0.8×	9 0.4×	22 1.1×	11 0.6×	9 0.7×	15	67
Sepideh Mahabadi United States	5	47 1.0×	22 0.9×	25 1.3×	30 1.8×	20 1.5×	10	81
Hossein Jowhari Canada	5	59 1.2×	12 0.5×	55 2.8×	55 3.2×	20 1.5×	9	100
Guillaume Cleuziou France	6	84 1.7×	27 1.1×	8 0.4×	7 0.4×	22 1.7×	11	101
Prasoon Goyal India	4	81 1.7×	56 2.2×	8 0.4×	7 0.4×	13 1.0×	7	116
Bangsheng Tang China	4	32 0.7×	17 0.7×	8 0.4×	23 1.4×	5 0.4×	9	68
Mario Lamberger Austria	5	47 1.0×	38 1.5×	7 0.3×	13 0.8×	8 0.6×	12	82
Tim Kaler United States	4	29 0.6×	34 1.4×	44 2.2×	28 1.6×	5 0.4×	8	85
Vikram Nitin United States	5	63 1.3×	24 1.0×	24 1.2×	9 0.5×	6 0.5×	6	107
Nicolas Labroche France	6	74 1.5×	29 1.2×	11 0.6×	4 0.2×	16 1.2×	15	92

Countries citing papers authored by Chris Schwiegelshohn

Since Specialization

Citations

This map shows the geographic impact of Chris Schwiegelshohn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Chris Schwiegelshohn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chris Schwiegelshohn more than expected).

Fields of papers citing papers by Chris Schwiegelshohn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Chris Schwiegelshohn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Chris Schwiegelshohn. The network helps show where Chris Schwiegelshohn may publish in the future.

Co-authorship network of co-authors of Chris Schwiegelshohn

This figure shows the co-authorship network connecting the top 25 collaborators of Chris Schwiegelshohn. A scholar is included among the top collaborators of Chris Schwiegelshohn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Chris Schwiegelshohn. Chris Schwiegelshohn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

19 of 19 papers shown

Caragiannis, Ioannis, et al.. (2024). Low-Distortion Clustering with Ordinal and Limited Cardinal Information. Proceedings of the AAAI Conference on Artificial Intelligence. 38(9). 9555–9563. 1 indexed citations

Bansal, Nikhil, et al.. (2024). Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds. SPIRE - Sciences Po Institutional REpository. 1707–1723.

Schwiegelshohn, Chris, et al.. (2024). Settling Time vs. Accuracy Tradeoffs for Clustering Big Data. Proceedings of the ACM on Management of Data. 2(3). 1–25. 1 indexed citations

Cohen-Addad, Vincent, et al.. (2023). Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation. 1105–1130.

Cohen-Addad, Vincent, Alessandro Epasto, Silvio Lattanzi, et al.. (2022). Scalable Differentially Private Clustering via Hierarchically Separated Trees. Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 221–230. 3 indexed citations

Braverman, Vladimir, et al.. (2022). The Power of Uniform Sampling for Coresets. 7 indexed citations

Leonardi, Stefano, et al.. (2021). Algorithms for fair k-clustering with multiple protected attributes. Operations Research Letters. 49(5). 787–789. 1 indexed citations

Anagnostopoulos, Aris, et al.. (2020). Spectral Relaxations and Fair Densest Subgraphs. IRIS Research product catalog (Sapienza University of Rome). 35–44. 12 indexed citations

Schwiegelshohn, Chris, et al.. (2020). Commitment and Slack for Online Load Maximization. IRIS Research product catalog (Sapienza University of Rome). 339–348. 3 indexed citations

10.

Grandoni, Fabrizio, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, & Shay Solomon. (2019). (1 + ε-Approximate incremental matching in constant deterministic amortized time. Symposium on Discrete Algorithms. 1886–1898. 2 indexed citations

11.

Schwiegelshohn, Chris, et al.. (2019). Similarity Search for Dynamic Data Streams. IEEE Transactions on Knowledge and Data Engineering. 32(11). 2241–2253. 8 indexed citations

12.

Schwiegelshohn, Chris, et al.. (2019). Text/Conference Paper. IRIS Research product catalog (Sapienza University of Rome). 31. 6561–6570. 4 indexed citations

13.

Grigorescu, Elena, et al.. (2018). Structural Results on Matching Estimation with Applications to Streaming. Algorithmica. 81(1). 367–392. 2 indexed citations

14.

Schwiegelshohn, Chris, et al.. (2018). Sketch 'Em All. IRIS Research product catalog (Sapienza University of Rome). 72–80. 2 indexed citations

15.

Schwiegelshohn, Chris, et al.. (2017). Coresets-Methods and History: A Theoreticians Design Pattern for Approximation and Streaming Algorithms. KI - Künstliche Intelligenz. 32(1). 37–53. 18 indexed citations

16.

Schwiegelshohn, Chris, et al.. (2017). On Finding the Jaccard Center. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 1 indexed citations

17.

Schwiegelshohn, Chris & Uwe Schwiegelshohn. (2016). The Power of Migration for Online Slack Scheduling. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 57. 17. 3 indexed citations

18.

Cohen-Addad, Vincent, Chris Schwiegelshohn, & Christian Sohler. (2016). Diameter and k-Center in Sliding Windows. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 55(55). 12. 6 indexed citations

19.

Schwiegelshohn, Chris, et al.. (2009). PEPPA. IRIS Research product catalog (Sapienza University of Rome). 1993–1998. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact