Florian Pfender
Impact in
-
- Limits and Structures in Graph Theory
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 34
- Graph Labeling and Dimension Problems 13
- Complexity and Algorithms in Graphs 3
-
- Limits and Structures in Graph Theory 30
- Co-authors
- Michał Karoński (4 shared papers)Ronald J. Gould (11 shared papers)Alan Frieze (1 shared paper)Guantao Chen (3 shared papers)Günter M. Ziegler (1 shared paper)Bernard Lidický (11 shared papers)Tomasz Łuczak (4 shared papers)Bing Wei (2 shared papers)
- Journals
- Journal of Graph Theory (13 papers)Journal of Combinatorial Theory Series B (5 papers)Discrete Mathematics (4 papers)The Electronic Journal of Combinatorics (4 papers)European Journal of Combinatorics (2 papers)
- Partner nations
- United StatesGermanyPoland
In The Last Decade
Florian Pfender
44 papers receiving 573 citations
Peers
Comparison fields: 5 of 40
- Discrete Mathematics and Combinatorics 240
- Computational Theory and Mathematics 536
- Geometry and Topology 215
- Computer Graphics and Computer-Aided Design 30
- Electrical and Electronic Engineering 232
Countries citing papers authored by Florian Pfender
This map shows the geographic impact of Florian Pfender'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 Florian Pfender with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Florian Pfender more than expected).
Fields of papers citing papers by Florian Pfender
This network shows the impact of papers produced by Florian Pfender. 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 Florian Pfender. The network helps show where Florian Pfender may publish in the future.
Co-authors
The 25 scholars most cited alongside Florian Pfender, 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 47 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 143 | |
| 2 | 2011 | 83 | |
| 3 | 2002 | 74 | |
| 4 | 2003 | 39 | |
| 5 | Kissing Numbers, Sphere Packings, and Some Unexpected Proofs | 2004 | 30 |
| 6 | 2013 | 16 | |
| 7 | 2015 | 16 | |
| 8 | 2010 | 15 | |
| 9 | New Conditions for k-ordered Hamiltonian Graphs. | 2004 | 13 |
| 10 | 2003 | 13 | |
| 11 | 2004 | 13 | |
| 12 | 2012 | 12 | |
| 13 | Claw-free 3-connected P 11 -free graphs are hamiltonian | 2004 | 12 |
| 14 | 2005 | 11 | |
| 15 | 2013 | 10 | |
| 16 | 2017 | 9 | |
| 17 | 2004 | 9 | |
| 18 | 2020 | 8 | |
| 19 | 2016 | 7 | |
| 20 | 2020 | 7 |
About Florian Pfender
Florian Pfender is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 47 papers that have together received 623 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (30 papers), Graph theory and applications (20 papers), Graph Labeling and Dimension Problems (13 papers), graph theory and CDMA systems (13 papers), Computational Geometry and Mesh Generation (4 papers), Interconnection Networks and Systems (3 papers) and Complexity and Algorithms in Graphs (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (240 citations), Computational Theory and Mathematics (536 citations), Geometry and Topology (215 citations), Computer Graphics and Computer-Aided Design (30 citations) and Electrical and Electronic Engineering (232 citations). Florian Pfender has collaborated with scholars based in United States, Germany and Poland. Frequent co-authors include Michał Karoński, Ronald J. Gould, Alan Frieze, Guantao Chen, Günter M. Ziegler, Bernard Lidický, Tomasz Łuczak, Bing Wei, Michael Ferrara and Van Bang Lê. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Mathematics, The Electronic Journal of Combinatorics and European Journal of Combinatorics.
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.