Sepp Hartung

440 total citations
16 papers, 121 citations indexed

About

Sepp Hartung is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Sepp Hartung has authored 16 papers receiving a total of 121 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 3 papers in Computer Networks and Communications. Recurrent topics in Sepp Hartung's work include Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (9 papers) and Internet Traffic Analysis and Secure E-voting (4 papers). Sepp Hartung is often cited by papers focused on Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (9 papers) and Internet Traffic Analysis and Secure E-voting (4 papers). Sepp Hartung collaborates with scholars based in Germany, Netherlands and Czechia. Sepp Hartung's co-authors include André Nichterlein, Rolf Niedermeier, Ondřej Suchý, Christian Komusiewicz, Robert Bredereck, Jiong Guo, Stefan Kratsch, René van Bevern, Gerhard J. Woeginger and Jeson Chen and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Journal of Artificial Intelligence Research.

In The Last Decade

Sepp Hartung

16 papers receiving 114 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Sepp Hartung Germany	8	73	33	19	18	17	16	121
Ondřej Suchý Czechia	7	79 1.1×	25 0.8×	31 1.6×	8 0.4×	18 1.1×	31	121
Pierre Charbit France	6	136 1.9×	23 0.7×	30 1.6×	3 0.2×	17 1.0×	28	177
Rajesh Chitnis United States	7	123 1.7×	28 0.8×	58 3.1×	2 0.1×	9 0.5×	20	145
Luciano Gualà Italy	6	57 0.8×	9 0.3×	45 2.4×	6 0.3×	15 0.9×	34	109
Yaron Velner Israel	5	39 0.5×	39 1.2×	29 1.5×	4 0.2×	4 0.2×	11	105
Ian Stewart United Kingdom	4	214 2.9×	12 0.4×	77 4.1×	11 0.6×	19 1.1×	32	285
Alexis C. Kaporis Greece	7	59 0.8×	33 1.0×	78 4.1×	3 0.2×	29 1.7×	21	141
Gilles Geeraerts Belgium	7	91 1.2×	38 1.2×	34 1.8×	4 0.2×	4 0.2×	28	127
Marius Schneider Germany	5	22 0.3×	205 6.2×	39 2.1×	13 0.7×	4 0.2×	12	249
Kshipra Bhawalkar United States	5	17 0.2×	30 0.9×	51 2.7×	6 0.3×	30 1.8×	6	165

Countries citing papers authored by Sepp Hartung

Since Specialization

Citations

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

Fields of papers citing papers by Sepp Hartung

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Sepp Hartung

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

16 of 16 papers shown

Bredereck, Robert, Jiehua Chen, Sepp Hartung, et al.. (2021). A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. Proceedings of the AAAI Conference on Artificial Intelligence. 26(1). 1292–1298. 1 indexed citations

Bevern, René van, Robert Bredereck, Sepp Hartung, et al.. (2017). Fixed-parameter algorithms for DAG Partitioning. Discrete Applied Mathematics. 220. 134–160. 3 indexed citations

Talmon, Nimrod & Sepp Hartung. (2017). The complexity of degree anonymization by graph contractions. Information and Computation. 256. 212–225. 2 indexed citations

Bazgan, Cristina, Robert Bredereck, Sepp Hartung, André Nichterlein, & Gerhard J. Woeginger. (2016). Finding large degree-anonymous subgraphs is hard. Theoretical Computer Science. 622. 90–110. 2 indexed citations

Bulteau, Laurent, et al.. (2016). Co-Clustering under the Maximum Norm. Algorithms. 9(1). 17–17. 3 indexed citations

Bredereck, Robert, et al.. (2015). The complexity of degree anonymization by vertex addition. Theoretical Computer Science. 607. 16–34. 11 indexed citations

Bredereck, Robert, Jiehua Chen, Sepp Hartung, et al.. (2015). On explaining integer vectors by few homogeneous segments. Journal of Computer and System Sciences. 81(4). 766–782. 1 indexed citations

Hartung, Sepp & André Nichterlein. (2015). NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM Journal on Discrete Mathematics. 29(4). 1931–1960. 2 indexed citations

Hartung, Sepp, Christian Komusiewicz, & André Nichterlein. (2015). Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Journal of Graph Algorithms and Applications. 19(1). 155–190. 17 indexed citations

10.

Hartung, Sepp, André Nichterlein, Rolf Niedermeier, & Ondřej Suchý. (2014). A refined complexity analysis of degree anonymization in graphs. Information and Computation. 243. 249–262. 11 indexed citations

11.

Bevern, René van, Sepp Hartung, André Nichterlein, & Manuel Sorge. (2014). Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Operations Research Letters. 42(4). 290–292. 9 indexed citations

12.

Bredereck, Robert, Jeson Chen, Sepp Hartung, et al.. (2014). A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. Journal of Artificial Intelligence Research. 50. 409–446. 20 indexed citations

13.

Hartung, Sepp & Rolf Niedermeier. (2013). Incremental list coloring of graphs, parameterized by conservation. Theoretical Computer Science. 494. 86–98. 12 indexed citations

14.

Hartung, Sepp & André Nichterlein. (2013). On the Parameterized and Approximation Hardness of Metric Dimension. 266–276. 15 indexed citations

15.

Guo, Jiong, Sepp Hartung, Rolf Niedermeier, & Ondřej Suchý. (2012). The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica. 67(1). 89–110. 10 indexed citations

16.

Hartung, Sepp, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, & Johannes Uhlmann. (2010). Exact Algorithms and Experiments for Hierarchical Tree Clustering. Proceedings of the AAAI Conference on Artificial Intelligence. 24(1). 457–462. 2 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