Christian Schulz

3.9k total citations
62 papers, 1.3k citations indexed

About

Christian Schulz is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Christian Schulz has authored 62 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computer Networks and Communications, 18 papers in Computational Theory and Mathematics and 17 papers in Computer Vision and Pattern Recognition. Recurrent topics in Christian Schulz's work include VLSI and FPGA Design Techniques (16 papers), Interconnection Networks and Systems (14 papers) and Graph Theory and Algorithms (11 papers). Christian Schulz is often cited by papers focused on VLSI and FPGA Design Techniques (16 papers), Interconnection Networks and Systems (14 papers) and Graph Theory and Algorithms (11 papers). Christian Schulz collaborates with scholars based in Germany, Austria and United States. Christian Schulz's co-authors include Klaus Hildebrandt, Christoph von Tycowicz, Hans‐Peter Seidel, Hans-Peter Seidel, Sebastian Engell, Peter Sanders, Olaf Stursberg, Konrad Polthier, Stefan Kowalewski and Geir Hasle and has published in prestigious journals such as Proceedings of the IEEE, European Journal of Operational Research and ACM Transactions on Graphics.

In The Last Decade

Christian Schulz

59 papers receiving 1.3k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Christian Schulz Germany	20	372	322	321	201	193	62	1.3k
Luiz Henrique de Figueiredo Brazil	19	287 0.8×	491 1.5×	108 0.3×	492 2.4×	153 0.8×	76	1.5k
Gang Hu China	19	303 0.8×	328 1.0×	185 0.6×	56 0.3×	126 0.7×	130	1.5k
Arvind U. Raghunathan United States	22	207 0.6×	56 0.2×	452 1.4×	121 0.6×	393 2.0×	80	1.5k
Xiao-Shan Gao China	25	192 0.5×	868 2.7×	543 1.7×	185 0.9×	89 0.5×	160	2.0k
Tetsuo Asano Japan	16	575 1.5×	89 0.3×	165 0.5×	465 2.3×	220 1.1×	108	1.4k
Günter Rote Germany	23	544 1.5×	216 0.7×	73 0.2×	808 4.0×	205 1.1×	152	1.8k
Piyush Kumar United States	17	427 1.1×	184 0.6×	78 0.2×	219 1.1×	113 0.6×	62	1.3k
Elisha Sacks United States	17	318 0.9×	145 0.5×	281 0.9×	234 1.2×	92 0.5×	87	988
P. J. Narayanan India	21	1.7k 4.5×	244 0.8×	90 0.3×	480 2.4×	250 1.3×	130	2.2k
Tony Tung Japan	17	746 2.0×	593 1.8×	111 0.3×	212 1.1×	537 2.8×	44	1.5k

Countries citing papers authored by Christian Schulz

Since Specialization

Citations

This map shows the geographic impact of Christian Schulz'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 Christian Schulz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christian Schulz more than expected).

Fields of papers citing papers by Christian Schulz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christian Schulz. 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 Christian Schulz. The network helps show where Christian Schulz may publish in the future.

Co-authorship network of co-authors of Christian Schulz

This figure shows the co-authorship network connecting the top 25 collaborators of Christian Schulz. A scholar is included among the top collaborators of Christian Schulz 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 Christian Schulz. Christian Schulz 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:

20 of 20 papers shown

Schulz, Christian, et al.. (2024). Finding Near-Optimal Weight Independent Sets at Scale. Journal of Graph Algorithms and Applications. 28(1). 439–473.

Schaeffer, Luke, et al.. (2024). Decidability for Sturmian words. Logical Methods in Computer Science. Volume 20, Issue 3.

Schulz, Christian, et al.. (2023). Finding Near-Optimal Weight Independent Sets at Scale. Proceedings of the Genetic and Evolutionary Computation Conference. 480. 293–302. 1 indexed citations

Schulz, Christian, et al.. (2023). A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering. 207–210. 1 indexed citations

Schulz, Christian, et al.. (2022). O’Reach: Even Faster Reachability in Large Graphs. ACM Journal of Experimental Algorithmics. 27. 1–27. 3 indexed citations

Schlag, Sebastian, et al.. (2022). High-Quality Hypergraph Partitioning. ACM Journal of Experimental Algorithmics. 27. 1–39. 53 indexed citations

Çatalyürek, Ümit V., Karen Devine, Henning Meyerhenke, et al.. (2022). More Recent Advances in (Hyper)Graph Partitioning. ACM Computing Surveys. 55(12). 1–38. 28 indexed citations

Schulz, Christian, et al.. (2022). Buffered Streaming Graph Partitioning. ACM Journal of Experimental Algorithmics. 27. 1–26. 4 indexed citations

Henzinger, Monika, et al.. (2022). Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide. ACM Journal of Experimental Algorithmics. 27. 1–45. 17 indexed citations

10.

Schulz, Christian, et al.. (2021). O'Reach: Even Faster Reachability in Large Graphs. arXiv (Cornell University). 1 indexed citations

11.

Henzinger, Monika, et al.. (2020). Faster Fully Dynamic Transitive Closure in Practice. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

12.

Henzinger, Monika, et al.. (2018). Memetic Graph Clustering. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 103. 15. 1 indexed citations

13.

Moreira, Orlando, et al.. (2018). Evolutionary multi-level acyclic graph partitioning. Proceedings of the Genetic and Evolutionary Computation Conference. 332–339. 5 indexed citations

14.

Khodkar, Abdollah, et al.. (2017). Existence of some signed magic arrays. Discrete Mathematics. 340(5). 906–926. 3 indexed citations

15.

Schlag, Sebastian, et al.. (2015). k-way Hypergraph Partitioning via n-Level Recursive Bisection. 53–67. 27 indexed citations

16.

Hildebrandt, Klaus, Christian Schulz, Christoph von Tycowicz, & Konrad Polthier. (2012). Interactive spacetime control of deformable objects. ACM Transactions on Graphics. 31(4). 1–8. 1 indexed citations

17.

Schulz, Christian, et al.. (2005). Virtual power plants with combined heat and power micro-units. 5 pp.–5. 52 indexed citations

18.

Stauffer, Dietrich, A. O. Sousa, & Christian Schulz. (2004). Discretized Opinion Dynamics of The Deffuant Model on Scale-Free Networks. Journal of Artificial Societies and Social Simulation. 7(3). 1–7. 30 indexed citations

19.

Engell, Sebastian, Stefan Kowalewski, Christian Schulz, & Olaf Stursberg. (2000). Continuous-discrete interactions in chemical processing plants. Proceedings of the IEEE. 88(7). 1050–1068. 123 indexed citations

20.

Engell, Sebastian, et al.. (1995). Hybrid Simulation of Flexible Batch Plants. IFAC Proceedings Volumes. 28(9). 123–128. 4 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