Frederic Dorn

790 total citations
16 papers, 207 citations indexed

About

Frederic Dorn is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Frederic Dorn has authored 16 papers receiving a total of 207 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 3 papers in Artificial Intelligence. Recurrent topics in Frederic Dorn's work include Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (9 papers) and Interconnection Networks and Systems (5 papers). Frederic Dorn is often cited by papers focused on Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (9 papers) and Interconnection Networks and Systems (5 papers). Frederic Dorn collaborates with scholars based in Norway, Germany and Greece. Frederic Dorn's co-authors include Fedor V. Fomin, Dimitrios M. Thilikos, Hans L. Bodlaender, Eelko Penninkx, Rolf Niedermeier, Jochen Alber, Ignasi Sau, Isolde Adler, Hannes Moser and Mathias Weller and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Discrete Applied Mathematics.

In The Last Decade

Frederic Dorn

16 papers receiving 189 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Frederic Dorn Norway	9	178	75	36	34	25	16	207
Eelko Penninkx Netherlands	4	145 0.8×	52 0.7×	26 0.7×	16 0.5×	22 0.9×	6	159
Bart M. P. Jansen Netherlands	10	216 1.2×	54 0.7×	20 0.6×	28 0.8×	37 1.5×	45	254
Fahad Panolan India	7	183 1.0×	75 1.0×	20 0.6×	14 0.4×	31 1.2×	57	205
Vincent Bouchitté France	7	196 1.1×	88 1.2×	14 0.4×	25 0.7×	26 1.0×	15	224
Ján Katrenič Slovakia	6	199 1.1×	103 1.4×	29 0.8×	13 0.4×	54 2.2×	10	236
Alexander Langer Germany	9	122 0.7×	50 0.7×	5 0.1×	20 0.6×	16 0.6×	16	152
Frank Gurski Germany	9	144 0.8×	72 1.0×	10 0.3×	14 0.4×	18 0.7×	26	186
Gabriel Semanišin Slovakia	8	286 1.6×	85 1.1×	27 0.8×	11 0.3×	123 4.9×	31	327
Dimitrios M. Thilikos France	7	127 0.7×	36 0.5×	5 0.1×	18 0.5×	43 1.7×	25	149
Michael J. Pelsmajer United States	9	185 1.0×	33 0.4×	74 2.1×	7 0.2×	56 2.2×	33	215

Countries citing papers authored by Frederic Dorn

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Frederic Dorn

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

16 of 16 papers shown

Dorn, Frederic, Hossein Farahmand, Hans Ivar Skjelbred, & Michael Belsnes. (2016). Modelling Minimum Pressure Height in Short-term Hydropower Production Planning. Energy Procedia. 87. 69–76. 5 indexed citations

Dorn, Frederic, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, & Saket Saurabh. (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 233. 60–70. 8 indexed citations

Dorn, Frederic, Hannes Moser, Rolf Niedermeier, & Mathias Weller. (2013). Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM Journal on Discrete Mathematics. 27(1). 75–94. 11 indexed citations

Dorn, Frederic, Fedor V. Fomin, & Dimitrios M. Thilikos. (2012). Catalan structures and dynamic programming in H-minor-free graphs. Journal of Computer and System Sciences. 78(5). 1606–1622. 15 indexed citations

Adler, Isolde, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, & Dimitrios M. Thilikos. (2011). Faster parameterized algorithms for minor containment. Theoretical Computer Science. 412(50). 7018–7028. 17 indexed citations

Bonsma, Paul & Frederic Dorn. (2011). Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Transactions on Algorithms. 7(4). 1–19. 3 indexed citations

Adler, Isolde, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, & Dimitrios M. Thilikos. (2011). Fast Minor Testing in Planar Graphs. Algorithmica. 64(1). 69–84. 5 indexed citations

Dorn, Frederic. (2010). Planar Subgraph Isomorphism Revisited. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5. 263–274. 25 indexed citations

Dorn, Frederic, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, & Saket Saurabh. (2010). Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 251–262. 3 indexed citations

10.

Dorn, Frederic, Eelko Penninkx, Hans L. Bodlaender, & Fedor V. Fomin. (2009). Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica. 58(3). 790–810. 38 indexed citations

11.

Dorn, Frederic, Fedor V. Fomin, & Dimitrios M. Thilikos. (2008). Catalan structures and dynamic programming in H-minor-free graphs. Symposium on Discrete Algorithms. 631–640. 26 indexed citations

12.

Dorn, Frederic & Jan Arne Telle. (2008). Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discrete Applied Mathematics. 157(12). 2737–2746. 1 indexed citations

13.

Dorn, Frederic, Fedor V. Fomin, & Dimitrios M. Thilikos. (2008). Subexponential parameterized algorithms. Computer Science Review. 2(1). 29–39. 30 indexed citations

14.

Dorn, Frederic, Eelko Penninkx, Hans L. Bodlaender, & Fedor V. Fomin. (2006). Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Utrecht University Repository (Utrecht University). 1 indexed citations

15.

Dorn, Frederic, Fedor V. Fomin, & Dimitrios M. Thilikos. (2006). Fast subexponential algorithm for non-local problems on graphs of bounded genus. 3 indexed citations

16.

Alber, Jochen, Frederic Dorn, & Rolf Niedermeier. (2004). Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics. 145(2). 219–231. 16 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