Frederic Dorn
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Computational Geometry and Mesh Generation
Papers in
-
- Advanced Graph Theory Research 14
- Complexity and Algorithms in Graphs 9
-
- Interconnection Networks and Systems 5
- Optimization and Search Problems 4
- Co-authors
- Fedor V. Fomin (10 shared papers)Dimitrios M. Thilikos (6 shared papers)Hans L. Bodlaender (2 shared papers)Eelko Penninkx (2 shared papers)Rolf Niedermeier (2 shared papers)Jochen Alber (1 shared paper)Ignasi Sau (2 shared papers)Isolde Adler (2 shared papers)
In The Last Decade
Frederic Dorn
16 papers receiving 194 citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 183
- Computer Graphics and Computer-Aided Design 36
- Discrete Mathematics and Combinatorics 28
- Computer Networks and Communications 76
- Artificial Intelligence 34
Countries citing papers authored by Frederic Dorn
This map shows the geographic impact of Frederic Dorn'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 Frederic Dorn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frederic Dorn more than expected).
Fields of papers citing papers by Frederic Dorn
This network shows the impact of papers produced by Frederic Dorn. 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 Frederic Dorn. The network helps show where Frederic Dorn may publish in the future.
Co-authors
The 18 scholars most cited alongside Frederic Dorn, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 41 | |
| 2 | 2008 | 31 | |
| 3 | Catalan structures and dynamic programming in H-minor-free graphs | 2008 | 26 |
| 4 | 2010 | 25 | |
| 5 | 2011 | 17 | |
| 6 | 2004 | 16 | |
| 7 | 2012 | 15 | |
| 8 | 2013 | 11 | |
| 9 | 2013 | 9 | |
| 10 | 2011 | 5 | |
| 11 | 2016 | 5 | |
| 12 | Fast subexponential algorithm for non-local problems on graphs of bounded genus | 2006 | 3 |
| 13 | 2011 | 3 | |
| 14 | 2010 | 3 | |
| 15 | Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions | 2006 | 1 |
| 16 | 2008 | 1 |
About Frederic Dorn
Frederic Dorn is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Industrial and Manufacturing Engineering and Discrete Mathematics and Combinatorics, having authored 16 papers that have together received 212 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (9 papers), Interconnection Networks and Systems (5 papers), Optimization and Search Problems (4 papers), Algorithms and Data Compression (3 papers), Hermeneutics and Narrative Identity (1 paper), Water resources management and optimization (1 paper) and Water-Energy-Food Nexus Studies (1 paper). The work is most often cited by research in Computational Theory and Mathematics (183 citations), Computer Graphics and Computer-Aided Design (36 citations), Discrete Mathematics and Combinatorics (28 citations), Computer Networks and Communications (76 citations) and Artificial Intelligence (34 citations). Frederic Dorn has collaborated with scholars based in Norway, Germany and Greece. Frequent co-authors include Fedor V. Fomin, Dimitrios M. Thilikos, Hans L. Bodlaender, Eelko Penninkx, Rolf Niedermeier, Jochen Alber, Ignasi Sau, Isolde Adler, Mathias Weller and Hannes Moser. Their work appears in journals such as Algorithmica, Discrete Applied Mathematics, SIAM Journal on Discrete Mathematics, Theoretical Computer Science and Journal of Computer and System Sciences.
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.