Herbert Fleischner
-
- Limits and Structures in Graph Theory 12
- Finite Group Theory Research 5
-
- Advanced Graph Theory Research 48
- Graph Labeling and Dimension Problems 13
- Geometry and Topology top 5%
- Graph theory and applications 24
-
- Computational Geometry and Mesh Generation 11
-
- Interconnection Networks and Systems 8
-
- graph theory and CDMA systems 13
- Co-authors
- Michael StiebitzStefan SzeiderOliver KullmannArthur M. HobbsBill JacksonBrendan D. McKayWilfried ImrichLars Andersen
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Discrete Mathematics (12 papers)Journal of Combinatorial Theory Series B (8 papers)Journal of Graph Theory (8 papers)
- Partner nations
- AustriaUnited StatesUnited Kingdom
In The Last Decade
Herbert Fleischner
60 papers receiving 551 citations
Peers
Comparison fields: 5 of 46
- Discrete Mathematics and Combinatorics 183
- Computational Theory and Mathematics 498
- Geometry and Topology 183
- Computer Graphics and Computer-Aided Design 38
- Computer Networks and Communications 133
Countries citing papers authored by Herbert Fleischner
This map shows the geographic impact of Herbert Fleischner'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 Herbert Fleischner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Herbert Fleischner more than expected).
Fields of papers citing papers by Herbert Fleischner
This network shows the impact of papers produced by Herbert Fleischner. 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 Herbert Fleischner. The network helps show where Herbert Fleischner may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Herbert Fleischner, 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 | 2020 | 5 | |
| 2 | 2018 | 0 | |
| 3 | 2016 | 1 | |
| 4 | 2015 | 6 | |
| 5 | 2009 | 16 | |
| 6 | 2008 | 1 | |
| 7 | 2002 | 46 | |
| 8 | 2002 | 3 | |
| 9 | 2001 | 13 | |
| 10 | Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference | 2000 | 4 |
| 11 | 1998 | 4 | |
| 12 | 1992 | 45 | |
| 13 | 1992 | 16 | |
| 14 | 1987 | 4 | |
| 15 | 1986 | 4 | |
| 16 | 1980 | 19 | |
| 17 | Transitive planar graphs | 1979 | 14 |
| 18 | 1975 | 9 | |
| 19 | 1974 | 96 | |
| 20 | 1973 | 5 |
About Herbert Fleischner
Herbert Fleischner is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computer Networks and Communications, having authored 64 papers that have together received 616 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (48 papers), Graph theory and applications (24 papers), Graph Labeling and Dimension Problems (13 papers), graph theory and CDMA systems (13 papers), Limits and Structures in Graph Theory (12 papers), Computational Geometry and Mesh Generation (11 papers), Interconnection Networks and Systems (8 papers) and Finite Group Theory Research (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (183 citations), Computational Theory and Mathematics (498 citations), Geometry and Topology (183 citations), Computer Graphics and Computer-Aided Design (38 citations) and Computer Networks and Communications (133 citations). Herbert Fleischner has collaborated with scholars based in Austria, United States and United Kingdom. Frequent co-authors include Michael Stiebitz, Stefan Szeider, Oliver Kullmann, Arthur M. Hobbs, Bill Jackson, Brendan D. McKay, Wilfried Imrich, Lars Andersen, Gert Sabidussi and András Frank. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Journal of Graph Theory, Discrete Applied Mathematics and Mathematische Nachrichten.
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.