Daniel Meister

797 total citations
48 papers, 314 citations indexed

About

Daniel Meister is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Daniel Meister has authored 48 papers receiving a total of 314 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 10 papers in Computer Graphics and Computer-Aided Design and 9 papers in Computer Networks and Communications. Recurrent topics in Daniel Meister's work include Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (10 papers). Daniel Meister is often cited by papers focused on Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (10 papers). Daniel Meister collaborates with scholars based in Germany, Norway and Czechia. Daniel Meister's co-authors include Jiřı́ Bittner, Pinar Heggernes, Charis Papadopoulos, Michael J. Doyle, Shinji Ogaki, Michael Guthe, Carsten Benthin, Dieter Kratsch, Pim van ’t Hof and Thomas Maier and has published in prestigious journals such as Journal of Sports Sciences, IEEE Transactions on Visualization and Computer Graphics and Ultrasound in Obstetrics and Gynecology.

In The Last Decade

Daniel Meister

45 papers receiving 290 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel Meister Germany 11 147 70 68 45 42 48 314
Asish Mukhopadhyay India 9 104 0.7× 94 1.3× 46 0.7× 26 0.6× 126 3.0× 49 271
Kim Whittlesey United States 6 137 0.9× 143 2.0× 52 0.8× 37 0.8× 10 0.2× 7 275
J Matousek Czechia 5 105 0.7× 114 1.6× 51 0.8× 19 0.4× 16 0.4× 6 198
Hyeon-Suk Na South Korea 9 17 0.1× 144 2.1× 75 1.1× 19 0.4× 12 0.3× 27 205
Lyudmil Aleksandrov Bulgaria 6 42 0.3× 114 1.6× 75 1.1× 32 0.7× 9 0.2× 12 182
Stefan Meiser Germany 6 43 0.3× 153 2.2× 103 1.5× 31 0.7× 13 0.3× 7 275
Telikepalli Kavitha India 6 104 0.7× 26 0.4× 28 0.4× 54 1.2× 42 1.0× 10 198
István Kovács Slovenia 12 80 0.5× 24 0.3× 17 0.3× 29 0.6× 215 5.1× 61 430
Dennis Amelunxen Germany 6 28 0.2× 8 0.1× 33 0.5× 28 0.6× 32 0.8× 9 232
Nathan Krislock Canada 9 75 0.5× 12 0.2× 30 0.4× 58 1.3× 80 1.9× 15 245

Countries citing papers authored by Daniel Meister

Since Specialization
Citations

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

Fields of papers citing papers by Daniel Meister

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel Meister

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Meister. A scholar is included among the top collaborators of Daniel Meister 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 Meister. Daniel Meister is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hua, Binh‐Son, et al.. (2021). Neural Sequence Transformation. Computer Graphics Forum. 40(7). 131–140. 1 indexed citations
2.
Meister, Daniel & Jiřı́ Bittner. (2017). Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction. IEEE Transactions on Visualization and Computer Graphics. 24(3). 1345–1353. 25 indexed citations
3.
Heggernes, Pinar, Daniel Meister, Charis Papadopoulos, & Udi Rotics. (2016). Clique-width of path powers. Discrete Applied Mathematics. 205. 62–72. 1 indexed citations
4.
Ganian, Robert, Petr Hliněný, Joachim Kneis, et al.. (2015). Are there any good digraph width measures?. Journal of Combinatorial Theory Series B. 116. 250–286. 7 indexed citations
5.
Courcelle, Bruno, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, & Udi Rotics. (2015). A characterisation of clique-width through nested partitions. Discrete Applied Mathematics. 187. 70–81. 7 indexed citations
6.
Meister, Daniel. (2014). Using swaps and deletes to make strings match. Theoretical Computer Science. 562. 606–620. 1 indexed citations
7.
Heggernes, Pinar, Pim van ’t Hof, Daniel Meister, & Yngve Villanger. (2014). Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theoretical Computer Science. 562. 252–269. 5 indexed citations
8.
Meister, Daniel. (2014). Clique-width with an inactive label. Discrete Mathematics. 337. 34–64. 2 indexed citations
9.
Meister, Daniel. (2013). Two characterisations of the minimal triangulations of permutation graphs. Discrete Mathematics. 313(20). 2262–2280. 1 indexed citations
10.
Fernau, Henning & Daniel Meister. (2013). Digraphs of bounded elimination width. Discrete Applied Mathematics. 168. 78–87. 1 indexed citations
11.
Heggernes, Pinar, Daniel Meister, & Andrzej Proskurowski. (2011). Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theoretical Computer Science. 412(12-14). 1275–1297. 3 indexed citations
12.
Golovach, Petr A., Pinar Heggernes, Dieter Kratsch, et al.. (2011). Bandwidth on AT-free graphs. Theoretical Computer Science. 412(50). 7001–7008. 5 indexed citations
13.
Heggernes, Pinar, Daniel Meister, & Charis Papadopoulos. (2011). Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discrete Applied Mathematics. 160(6). 888–901. 14 indexed citations
14.
Meister, Daniel. (2010). Treewidth and minimum fill-in on permutation graphs in linear time. Theoretical Computer Science. 411(40-42). 3685–3700. 4 indexed citations
15.
Heggernes, Pinar, Dieter Kratsch, & Daniel Meister. (2008). Bandwidth of bipartite permutation graphs in polynomial time. Journal of Discrete Algorithms. 7(4). 533–544. 12 indexed citations
16.
Glaßer, Christian, et al.. (2006). Error-bounded probabilistic computations between MA and AM. Journal of Computer and System Sciences. 72(6). 1043–1076. 13 indexed citations
17.
Meister, Daniel. (2006). Two characterisations of minimal triangulations of 2K2-free graphs. Discrete Mathematics. 306(24). 3327–3333. 8 indexed citations
18.
Meister, Daniel. (2004). Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discrete Applied Mathematics. 146(3). 193–218. 20 indexed citations
19.
Glaßer, Christian, et al.. (2003). Small Bounded-Error Computations and Completeness. Electronic colloquium on computational complexity. 45(2). 149–56.
20.
Meister, Daniel. (1987). Behavioral Test and Evaluation of Expert Systems.. International Conference on Human-Computer Interaction. 539–549. 1 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

Breakdown of academic impact, for papers by Asish Mukhopadhyay Breakdown of academic impact, for papers by Kim Whittlesey Breakdown of academic impact, for papers by J Matousek Breakdown of academic impact, for papers by Hyeon-Suk Na Breakdown of academic impact, for papers by Lyudmil Aleksandrov Breakdown of academic impact, for papers by Stefan Meiser Breakdown of academic impact, for papers by Telikepalli Kavitha Breakdown of academic impact, for papers by István Kovács Breakdown of academic impact, for papers by Dennis Amelunxen Breakdown of academic impact, for papers by Nathan Krislock
Rankless by CCL
2026