André Kündgen
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 20
-
- Advanced Graph Theory Research 25
- Graph Labeling and Dimension Problems 12
- Co-authors
- Hal A. Kierstead (2 shared papers)Michael O. Albertson (1 shared paper)Maria Axenovich (2 shared papers)Michael J. Pelsmajer (3 shared papers)Zoltán Füredi (3 shared papers)Tao Jiang (1 shared paper)Daniel Kobler (1 shared paper)Vitaly Voloshin (1 shared paper)
- Journals
- Journal of Graph Theory (7 papers)Discrete Mathematics (4 papers)SIAM Journal on Discrete Mathematics (3 papers)Journal of Combinatorial Theory Series A (3 papers)The Electronic Journal of Combinatorics (3 papers)
- Partner nations
- United StatesDenmarkCanada
In The Last Decade
André Kündgen
29 papers receiving 354 citations
Peers
Comparison fields: 5 of 30
- Discrete Mathematics and Combinatorics 222
- Computational Theory and Mathematics 330
- Geometry and Topology 91
- Computer Graphics and Computer-Aided Design 27
- Algebra and Number Theory 9
Countries citing papers authored by André Kündgen
This map shows the geographic impact of André Kündgen'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 André Kündgen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites André Kündgen more than expected).
Fields of papers citing papers by André Kündgen
This network shows the impact of papers produced by André Kündgen. 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 André Kündgen. The network helps show where André Kündgen may publish in the future.
Co-authors
The 20 scholars most cited alongside André Kündgen, 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 31 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2004 | 97 | |
| 2 | 2004 | 37 | |
| 3 | 2007 | 35 | |
| 4 | 2000 | 28 | |
| 5 | 2001 | 24 | |
| 6 | 2002 | 22 | |
| 7 | 2002 | 17 | |
| 8 | 2008 | 16 | |
| 9 | 2001 | 12 | |
| 10 | Covering cliques with spanning bicliques | 1998 | 9 |
| 11 | 2001 | 8 | |
| 12 | 2009 | 8 | |
| 13 | 2005 | 7 | |
| 14 | 2009 | 7 | |
| 15 | 2001 | 5 | |
| 16 | 2011 | 5 | |
| 17 | 1999 | 4 | |
| 18 | 2002 | 4 | |
| 19 | 2011 | 4 | |
| 20 | 2017 | 3 |
About André Kündgen
André Kündgen is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Electrical and Electronic Engineering, having authored 31 papers that have together received 372 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Limits and Structures in Graph Theory (20 papers), Graph Labeling and Dimension Problems (12 papers), graph theory and CDMA systems (9 papers), Graph theory and applications (5 papers), Interconnection Networks and Systems (3 papers), Advanced Topology and Set Theory (3 papers) and Computational Geometry and Mesh Generation (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (222 citations), Computational Theory and Mathematics (330 citations), Geometry and Topology (91 citations), Computer Graphics and Computer-Aided Design (27 citations) and Algebra and Number Theory (9 citations). André Kündgen has collaborated with scholars based in United States, Denmark and Canada. Frequent co-authors include Hal A. Kierstead, Michael O. Albertson, Maria Axenovich, Michael J. Pelsmajer, Zoltán Füredi, Tao Jiang, Daniel Kobler, Vitaly Voloshin, Eric Mendelsohn and Sebastian M. Cioabă. Their work appears in journals such as Journal of Graph Theory, Discrete Mathematics, SIAM Journal on Discrete Mathematics, Journal of Combinatorial Theory Series A and The Electronic 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.