Daniel Mölle

552 total citations
6 papers, 130 citations indexed

About

Daniel Mölle is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Daniel Mölle has authored 6 papers receiving a total of 130 indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Computational Theory and Mathematics, 3 papers in Computer Networks and Communications and 2 papers in Electrical and Electronic Engineering. Recurrent topics in Daniel Mölle's work include Complexity and Algorithms in Graphs (4 papers), Advanced Graph Theory Research (4 papers) and VLSI and FPGA Design Techniques (2 papers). Daniel Mölle is often cited by papers focused on Complexity and Algorithms in Graphs (4 papers), Advanced Graph Theory Research (4 papers) and VLSI and FPGA Design Techniques (2 papers). Daniel Mölle collaborates with scholars based in Germany, Netherlands and United States. Daniel Mölle's co-authors include Peter Rossmanith, Stefan Richter, Joachim Kneis, Walter Kern, Sing‐Hoi Sze, Jianer Chen, Fenghui Zhang and Songjian Lu and has published in prestigious journals such as SIAM Journal on Computing, Information Processing Letters and SIAM Journal on Discrete Mathematics.

In The Last Decade

Daniel Mölle

6 papers receiving 121 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Daniel Mölle Germany	5	106	61	33	12	12	6	130
Frank Gurski Germany	9	144 1.4×	72 1.2×	14 0.4×	18 1.5×	14 1.2×	26	186
Richard B. Tan Netherlands	8	86 0.8×	117 1.9×	55 1.7×	6 0.5×	11 0.9×	14	184
Aris Pagourtzis Greece	7	33 0.3×	74 1.2×	49 1.5×	3 0.3×	26 2.2×	36	146
Alexander Langer Germany	9	122 1.2×	50 0.8×	12 0.4×	16 1.3×	20 1.7×	16	152
Johan Thapper France	6	85 0.8×	56 0.9×	3 0.1×	11 0.9×	18 1.5×	15	103
Frederic Dorn Norway	9	178 1.7×	75 1.2×	23 0.7×	25 2.1×	34 2.8×	16	207
Cláudia Linhares Sales Brazil	8	194 1.8×	25 0.4×	26 0.8×	97 8.1×	11 0.9×	33	219
Dimitrios M. Thilikos France	7	127 1.2×	36 0.6×	9 0.3×	43 3.6×	18 1.5×	25	149
Madhu Sudan India	5	131 1.2×	76 1.2×	130 3.9×	10 0.8×	80 6.7×	12	258
S. Thiel United Kingdom	5	38 0.4×	90 1.5×	82 2.5×	2 0.2×	23 1.9×	7	159

Countries citing papers authored by Daniel Mölle

Since Specialization

Citations

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

Fields of papers citing papers by Daniel Mölle

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel Mölle

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

6 of 6 papers shown

1.

Chen, Jianer, Joachim Kneis, Songjian Lu, et al.. (2009). Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms. SIAM Journal on Computing. 38(6). 2526–2547. 28 indexed citations

2.

Kneis, Joachim, Daniel Mölle, Stefan Richter, & Peter Rossmanith. (2009). A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM Journal on Discrete Mathematics. 23(1). 407–427. 9 indexed citations

3.

Kern, Walter, et al.. (2007). Dynamic Programming for Minimum Steiner Trees. Theory of Computing Systems. 41(3). 493–500. 31 indexed citations

4.

Mölle, Daniel, Stefan Richter, & Peter Rossmanith. (2007). Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. Theory of Computing Systems. 43(2). 234–253. 24 indexed citations

5.

Mölle, Daniel, et al.. (2006). Intuitive algorithms and t-vertex cover. RWTH Publications (RWTH Aachen). 1 indexed citations

6.

Kneis, Joachim, Daniel Mölle, Stefan Richter, & Peter Rossmanith. (2006). Parameterized power domination complexity. Information Processing Letters. 98(4). 145–149. 37 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