Egon Wanke

1.4k total citations
40 papers, 551 citations indexed

About

Egon Wanke is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Egon Wanke has authored 40 papers receiving a total of 551 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 8 papers in Industrial and Manufacturing Engineering. Recurrent topics in Egon Wanke's work include Advanced Graph Theory Research (13 papers), Interconnection Networks and Systems (8 papers) and Complexity and Algorithms in Graphs (7 papers). Egon Wanke is often cited by papers focused on Advanced Graph Theory Research (13 papers), Interconnection Networks and Systems (8 papers) and Complexity and Algorithms in Graphs (7 papers). Egon Wanke collaborates with scholars based in Germany, Netherlands and Japan. Egon Wanke's co-authors include Rolf Kötter, Thomas Lengauer, Frank Gurski, Ina Koch, Andrew Reid, Gleb Bezgin, Fuminori Tsuchiya, Akiko Kumada, Takeshi Sakanoi and Masashi Kamogawa and has published in prestigious journals such as NeuroImage, Philosophical Transactions of the Royal Society B Biological Sciences and European Journal of Operational Research.

In The Last Decade

Egon Wanke

35 papers receiving 515 citations

Peers

Egon Wanke

CTM

CN

CNC

MB

AI

Elizabeth Munch United States

Jim Geelen Canada

Nargis Bibi Pakistan

Filippo Mignosi Italy

Alice Patania United States

Yuankun Xue United States

Irina Fedulova Russia

Alessandro Muscoloni Germany

Bogdan Danila United States

D. Stott Parker United States

Elizabeth Munch United States

Egon Wanke

343 ×1.2

CTM

22 ×0.2

CN

11 ×0.1

CNC

74 ×0.9

MB

44 ×0.7

AI

Citations per year, relative to Egon Wanke Egon Wanke (= 1×) peers Elizabeth Munch

Countries citing papers authored by Egon Wanke

Since Specialization

Citations

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

Fields of papers citing papers by Egon Wanke

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Egon Wanke

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

1.

Wanke, Egon, et al.. (2023). A note on the complexity of k-metric dimension. Applied Mathematics and Computation. 457. 128204–128204. 1 indexed citations

2.

Kamogawa, Masashi, Tomoyuki Suzuki, Hironobu Fujiwara, et al.. (2023). Characteristics of the Blitzortung.org Lightning Location Catalog in Japan. Atmosphere. 14(10). 1507–1507. 1 indexed citations

3.

Wanke, Egon, Mitsuteru Sato, Takeshi Sakanoi, et al.. (2018). A study of lightning location system (Blitz) based on VLF sferics. 1–7. 8 indexed citations

4.

Wanke, Egon, et al.. (2016). A linear time algorithm for metric dimension of cactus block graphs. Theoretical Computer Science. 630. 43–62. 8 indexed citations

5.

Reid, Andrew, et al.. (2009). Optimization of cortical hierarchies with continuous scales and ranges. NeuroImage. 47(2). 611–617. 24 indexed citations

6.

Gurski, Frank & Egon Wanke. (2008). The NLC-width and clique-width for powers of graphs of bounded tree-width. Discrete Applied Mathematics. 157(4). 583–595. 8 indexed citations

7.

Bezgin, Gleb, et al.. (2008). Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty. Neural Networks. 21(8). 1132–1145. 20 indexed citations

8.

Gurski, Frank & Egon Wanke. (2007). Line graphs of bounded clique-width. Discrete Mathematics. 307(22). 2734–2754. 22 indexed citations

9.

Gurski, Frank & Egon Wanke. (2006). Vertex disjoint paths on clique-width bounded graphs. Theoretical Computer Science. 359(1-3). 188–199. 18 indexed citations

10.

Gurski, Frank & Egon Wanke. (2005). On the relationship between NLC-width and linear NLC-width. Theoretical Computer Science. 347(1-2). 76–89. 23 indexed citations

11.

Kötter, Rolf & Egon Wanke. (2005). Mapping brains without coordinates. Philosophical Transactions of the Royal Society B Biological Sciences. 360(1456). 751–766. 106 indexed citations

12.

Wanke, Egon, et al.. (1997). The Bounded Degree Problem for eNCE Graph Grammars. Information and Computation. 135(1). 15–35. 1 indexed citations

13.

Koch, Ina, Thomas Lengauer, & Egon Wanke. (1996). An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures. Journal of Computational Biology. 3(2). 289–306. 89 indexed citations

14.

Wanke, Egon, et al.. (1995). Emptiness Problems of eNCE Graph Languages. Journal of Computer and System Sciences. 51(3). 472–485. 4 indexed citations

15.

Wanke, Egon. (1994). The complexity of connectivity problems on context-free graph languages. Journal of Computer and System Sciences. 49(1). 57–82.

16.

Wanke, Egon. (1994). On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages. Information and Computation. 113(1). 26–49. 3 indexed citations

17.

Wanke, Egon. (1994). k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics. 54(2-3). 251–266. 75 indexed citations

18.

Wanke, Egon, et al.. (1993). Polynomial algorithms for minimum cost paths in periodic graphs. Symposium on Discrete Algorithms. 493–499. 5 indexed citations

19.

Wanke, Egon. (1991). Algorithms for graph problems on BNLC structured graphs. Information and Computation. 94(1). 93–122. 6 indexed citations

20.

Lengauer, Thomas & Egon Wanke. (1988). Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs. SIAM Journal on Computing. 17(6). 1063–1080. 24 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