Ernst Althaus

777 total citations
32 papers, 299 citations indexed

About

Ernst Althaus is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Ernst Althaus has authored 32 papers receiving a total of 299 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 8 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in Ernst Althaus's work include Formal Methods in Verification (6 papers), Advanced Graph Theory Research (4 papers) and Algorithms and Data Compression (4 papers). Ernst Althaus is often cited by papers focused on Formal Methods in Verification (6 papers), Advanced Graph Theory Research (4 papers) and Algorithms and Data Compression (4 papers). Ernst Althaus collaborates with scholars based in Germany, United States and France. Ernst Althaus's co-authors include Ion Măndoiu, Alex Zelikovsky, Sushil K. Prasad, Gruiă Cälinescu, Kurt Mehlhorn, Hans‐Peter Lenhof, Jochen Könemann, Martin Skutella, Knut Reinert and Alberto Caprara and has published in prestigious journals such as SHILAP Revista de lepidopterología, Bioinformatics and Journal of Computational Chemistry.

In The Last Decade

Ernst Althaus

30 papers receiving 280 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ernst Althaus Germany	11	115	71	70	50	36	32	299
Volker Heun Germany	7	48 0.4×	78 1.1×	45 0.6×	109 2.2×	19 0.5×	16	185
David Eisenstat United States	7	207 1.8×	101 1.4×	57 0.8×	38 0.8×	20 0.6×	18	320
Daniele Paolo Scarpazza United States	12	181 1.6×	43 0.6×	28 0.4×	179 3.6×	28 0.8×	23	368
Arash Rafiey Canada	10	78 0.7×	44 0.6×	176 2.5×	53 1.1×	32 0.9×	35	303
Alexander Tiskin United Kingdom	11	191 1.7×	84 1.2×	118 1.7×	110 2.2×	21 0.6×	29	420
Enqiang Zhu China	12	60 0.5×	79 1.1×	223 3.2×	50 1.0×	43 1.2×	66	407
Søren Riis United Kingdom	12	119 1.0×	166 2.3×	199 2.8×	242 4.8×	45 1.3×	54	531
Maw‐Shang Chang Taiwan	15	154 1.3×	53 0.7×	377 5.4×	50 1.0×	64 1.8×	54	524
Toshihiro Fujito Japan	10	193 1.7×	23 0.3×	287 4.1×	45 0.9×	37 1.0×	25	386
Petr Kolman Czechia	12	117 1.0×	49 0.7×	173 2.5×	79 1.6×	25 0.7×	35	298

Countries citing papers authored by Ernst Althaus

Since Specialization

Citations

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

Fields of papers citing papers by Ernst Althaus

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ernst Althaus

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

Bouros, Panagiotis, et al.. (2021). Most Diverse Near-Shortest Paths. KOPS (University of Konstanz). 229–239. 14 indexed citations

Althaus, Ernst, et al.. (2020). Computing Euclidean Steiner trees over segments. SHILAP Revista de lepidopterología. 8(3-4). 309–325. 1 indexed citations

Althaus, Ernst, et al.. (2017). Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. Science of Computer Programming. 148. 123–160. 3 indexed citations

Althaus, Ernst, André Brinkmann, Peter Kling, et al.. (2017). Scheduling shared continuous resources on many-cores. Journal of Scheduling. 21(1). 77–92. 2 indexed citations

Althaus, Ernst, et al.. (2013). On the low-dimensional Steiner minimum tree problem in Hamming metric. Theoretical Computer Science. 505. 2–10. 2 indexed citations

Lengauer, Thomas, et al.. (2013). Efficient computation of root mean square deviations under rigid transformations. Journal of Computational Chemistry. 35(10). 765–771. 10 indexed citations

Althaus, Ernst, et al.. (2012). Certifying feasibility and objective value of linear programs. Operations Research Letters. 40(4). 292–297. 2 indexed citations

Althaus, Ernst, et al.. (2011). Precise and efficient parametric path analysis. OPUS (Augsburg University). 141–150. 13 indexed citations

Althaus, Ernst, Stefan Canzar, Mark R. Emmett, et al.. (2010). Computing H/D-Exchange rates of single residues from data of proteolytic fragments. BMC Bioinformatics. 11(1). 424–424. 32 indexed citations

10.

Althaus, Ernst, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, & Julián Mestre. (2010). Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica. 61(2). 342–361. 1 indexed citations

11.

Althaus, Ernst, et al.. (2010). A New Combinatorial Approach to Parametric Path Analysis. OPUS (Augsburg University). 2 indexed citations

12.

Althaus, Ernst, Stefan Canzar, Mark R. Emmett, et al.. (2009). Discrete fitting of hydrogen-deuterium-exchange data of overlapping fragments. Data Archiving and Networked Services (DANS). 496–502. 6 indexed citations

13.

Althaus, Ernst, et al.. (2006). Computing steiner minimum trees in Hamming metric. Symposium on Discrete Algorithms. 172–181. 8 indexed citations

14.

Althaus, Ernst, Friedrich Eisenbrand, Stefan Funke, & Kurt Mehlhorn. (2004). Point containment in the integer hull of a polyhedron. Symposium on Discrete Algorithms. 929–933. 1 indexed citations

15.

Althaus, Ernst, Stefan Funke, Sariel Har-Peled, et al.. (2004). Approximating k-hop minimum-spanning trees. Operations Research Letters. 33(2). 115–120. 33 indexed citations

16.

Althaus, Ernst, et al.. (2003). An efficient graph algorithm for dominance constraints. Journal of Algorithms. 48(1). 194–219. 22 indexed citations

17.

Althaus, Ernst, Alberto Caprara, Hans‐Peter Lenhof, & Knut Reinert. (2002). Multiple sequence alignment with arbitrary gap costs:Computing an optimal solution using polyhedral combinatorics. Bioinformatics. 18(suppl_2). S4–S16. 14 indexed citations

18.

Althaus, Ernst, et al.. (2001). An efficient algorithm for the configuration problem of dominance graphs. Symposium on Discrete Algorithms. 815–824. 2 indexed citations

19.

Althaus, Ernst & Kurt Mehlhorn. (2000). TSP-Based Curve Reconstruction in Polynomial Time. Max Planck Institute for Plasma Physics. 686–695. 1 indexed citations

20.

Althaus, Ernst, Kurt Mehlhorn, Stefan Näher, & Stefan Schirra. (2000). Experiments on curve reconstruction. Max Planck Institute for Plasma Physics. 103–114. 9 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