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 24
- Complexity and Algorithms in Graphs 15
- Formal Methods in Verification 2
-
- Interconnection Networks and Systems 8
- Optimization and Search Problems 6
- Co-authors
- Fedor V. Fomin (14 shared papers)Dimitrios M. Thilikos (10 shared papers)Eelko Penninkx (2 shared papers)Hans L. Bodlaender (2 shared papers)Rolf Niedermeier (3 shared papers)Jochen Alber (1 shared paper)Isolde Adler (4 shared papers)Ignasi Sau (4 shared papers)
In The Last Decade
Frederic Dorn
26 papers receiving 481 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 462
- Computer Graphics and Computer-Aided Design 88
- Discrete Mathematics and Combinatorics 48
- Computer Networks and Communications 225
- Industrial and Manufacturing Engineering 20
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
Showing the 20 most-cited of 26 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 71 | |
| 2 | 2005 | 63 | |
| 3 | 2008 | 50 | |
| 4 | 2010 | 42 | |
| 5 | Catalan structures and dynamic programming in H-minor-free graphs | 2008 | 39 |
| 6 | 2004 | 39 | |
| 7 | 2006 | 37 | |
| 8 | 2011 | 27 | |
| 9 | 2012 | 18 | |
| 10 | 2013 | 16 | |
| 11 | 2007 | 15 | |
| 12 | 2006 | 14 | |
| 13 | 2013 | 14 | |
| 14 | 2010 | 11 | |
| 15 | 2010 | 9 | |
| 16 | 2016 | 8 | |
| 17 | 2011 | 7 | |
| 18 | 2008 | 7 | |
| 19 | 2006 | 6 | |
| 20 | 2009 | 5 |
About Frederic Dorn
Frederic Dorn is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Artificial Intelligence and Geometry and Topology, having authored 26 papers that have together received 519 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (24 papers), Complexity and Algorithms in Graphs (15 papers), Interconnection Networks and Systems (8 papers), Optimization and Search Problems (6 papers), Algorithms and Data Compression (5 papers), Limits and Structures in Graph Theory (3 papers), Formal Methods in Verification (2 papers) and Graph theory and applications (2 papers). The work is most often cited by research in Computational Theory and Mathematics (462 citations), Computer Graphics and Computer-Aided Design (88 citations), Discrete Mathematics and Combinatorics (48 citations), Computer Networks and Communications (225 citations) and Industrial and Manufacturing Engineering (20 citations). Frederic Dorn has collaborated with scholars based in Norway, Germany and Greece. Frequent co-authors include Fedor V. Fomin, Dimitrios M. Thilikos, Eelko Penninkx, Hans L. Bodlaender, Rolf Niedermeier, Jochen Alber, Isolde Adler, Ignasi Sau, Paul Bonsma and Mathias Weller. Their work appears in journals such as Discrete Applied Mathematics, Algorithmica, Lecture notes in computer science, Theoretical Computer Science and Information and Computation.
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.