H.-C. Wirth

425 total citations
14 papers, 186 citations indexed

About

H.-C. Wirth is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, H.-C. Wirth has authored 14 papers receiving a total of 186 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 5 papers in Industrial and Manufacturing Engineering. Recurrent topics in H.-C. Wirth's work include Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (6 papers) and Advanced Graph Theory Research (5 papers). H.-C. Wirth is often cited by papers focused on Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (6 papers) and Advanced Graph Theory Research (5 papers). H.-C. Wirth collaborates with scholars based in Germany and United States. H.-C. Wirth's co-authors include Sven O. Krumke, Joachim Spoerhase, Hartmut Noltemeier, Jörg Rambau, S. S. Ravi, Madhav Marathe and R. Ravi and has published in prestigious journals such as European Journal of Operational Research, ACM Computing Surveys and Theoretical Computer Science.

In The Last Decade

H.-C. Wirth

14 papers receiving 177 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
H.-C. Wirth Germany	8	84	82	68	51	24	14	186
Alejandro Estrada‐Moreno Spain	11	82 1.0×	143 1.7×	25 0.4×	21 0.4×	34 1.4×	30	269
Elisabeth Gassner Austria	11	109 1.3×	102 1.2×	70 1.0×	203 4.0×	15 0.6×	20	283
Claude Tadonki France	6	34 0.4×	9 0.1×	72 1.1×	35 0.7×	10 0.4×	28	158
Malcolm C. Pullan United Kingdom	9	62 0.7×	198 2.4×	59 0.9×	16 0.3×	19 0.8×	10	315
Frédéric Gardi France	7	124 1.5×	49 0.6×	43 0.6×	6 0.1×	12 0.5×	14	200
Olivier Spanjaard France	8	64 0.8×	70 0.9×	27 0.4×	6 0.1×	6 0.3×	17	189
Daniel Cosmin Porumbel France	7	129 1.5×	48 0.6×	34 0.5×	14 0.3×	9 0.4×	17	186
Suzanne van der Ster Netherlands	6	73 0.9×	31 0.4×	54 0.8×	9 0.2×	9 0.4×	10	162
Laurent Gourvès France	9	66 0.8×	120 1.5×	61 0.9×	4 0.1×	25 1.0×	30	223
Nodari Vakhania Mexico	9	269 3.2×	32 0.4×	213 3.1×	5 0.1×	15 0.6×	47	342

Countries citing papers authored by H.-C. Wirth

Since Specialization

Citations

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

Fields of papers citing papers by H.-C. Wirth

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of H.-C. Wirth

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

14 of 14 papers shown

Spoerhase, Joachim & H.-C. Wirth. (2009). (r,p)-centroid problems on paths and trees. Theoretical Computer Science. 410(47-49). 5128–5137. 16 indexed citations

Spoerhase, Joachim & H.-C. Wirth. (2009). Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. Journal of Discrete Algorithms. 7(2). 256–266. 2 indexed citations

Spoerhase, Joachim & H.-C. Wirth. (2009). Relaxed voting and competitive location under monotonous gain functions on trees. Discrete Applied Mathematics. 158(4). 361–373. 2 indexed citations

Spoerhase, Joachim & H.-C. Wirth. (2008). Approximating ( r, p )-Centroid on a Path.. 193–195. 3 indexed citations

Spoerhase, Joachim & H.-C. Wirth. (2008). An algorithm for the single maximum coverage location or the -medianoid problem on trees. Information Processing Letters. 109(8). 391–394. 3 indexed citations

Noltemeier, Hartmut, Joachim Spoerhase, & H.-C. Wirth. (2007). Multiple voting location and single voting location on trees. European Journal of Operational Research. 181(2). 654–667. 25 indexed citations

Noltemeier, Hartmut, et al.. (2004). Optimizing cost flows by edge cost and capacity upgrade. Journal of Discrete Algorithms. 2(4). 407–423. 3 indexed citations

Noltemeier, Hartmut, et al.. (2002). On the flow cost lowering problem. European Journal of Operational Research. 137(2). 265–271. 8 indexed citations

Wirth, H.-C., et al.. (2001). Reload cost problems: minimum diameter spanning tree. Discrete Applied Mathematics. 113(1). 73–85. 21 indexed citations

10.

Krumke, Sven O., et al.. (2001). Euler is standing in line dial-a-ride problems with precedence-constraints. Discrete Applied Mathematics. 113(1). 87–107. 12 indexed citations

11.

Krumke, Sven O., Madhav Marathe, Hartmut Noltemeier, S. S. Ravi, & H.-C. Wirth. (2001). Upgrading bottleneck constrained forests. Discrete Applied Mathematics. 108(1-2). 129–142. 5 indexed citations

12.

Krumke, Sven O., Madhav Marathe, Hartmut Noltemeier, et al.. (1999). Improving Minimum Cost Spanning Trees by Upgrading Nodes. Journal of Algorithms. 33(1). 92–111. 10 indexed citations

13.

Noltemeier, Hartmut, H.-C. Wirth, & Sven O. Krumke. (1999). Network design and improvement. ACM Computing Surveys. 31(3es). 2–2. 7 indexed citations

14.

Krumke, Sven O. & H.-C. Wirth. (1998). On the minimum label spanning tree problem. Information Processing Letters. 66(2). 81–85. 69 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