Andreas Brandstädt
- Computational Theory and Mathematics top 0.1%
- Computer Networks and Communications top 2%
- Discrete Mathematics and Combinatorics top 0.5%
- Geometry and Topology top 1%
- Electrical and Electronic Engineering
- Co-authors
- Van Bang LêJeremy SpinradFeodor F. DraganRaffaele MoscaVictor ChepoiVadim LozinDieter KratschHoàng-Oanh Le
- Topics
- Advanced Graph Theory Research (98 papers)Complexity and Algorithms in Graphs (50 papers)Graph Labeling and Dimension Problems (42 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- GermanyUnited StatesItaly
In The Last Decade
Andreas Brandstädt
106 papers receiving 2.3k citations
Hit Papers
Peers
Comparison fields: 5 of 84
- Computational Theory and Mathematics 2.3k
- Computer Networks and Communications 690
- Discrete Mathematics and Combinatorics 657
- Geometry and Topology 457
- Electrical and Electronic Engineering 272
Countries citing papers authored by Andreas Brandstädt
This map shows the geographic impact of Andreas Brandstädt'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 Andreas Brandstädt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreas Brandstädt more than expected).
Fields of papers citing papers by Andreas Brandstädt
This network shows the impact of papers produced by Andreas Brandstädt. 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 Andreas Brandstädt. The network helps show where Andreas Brandstädt may publish in the future.
Co-authorship network of co-authors of Andreas Brandstädt
This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Brandstädt. A scholar is included among the top collaborators of Andreas Brandstädt 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 Andreas Brandstädt. Andreas Brandstädt is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 3 | |
| 3 | 4 | |
| 4 | 1 | |
| 5 | 8 | |
| 6 | 0 | |
| 7 | 14 | |
| 8 | 18 | |
| 9 | 21 | |
| 10 | On Algorithms for (P5,Gem)-Free Graphs | 2 |
| 11 | On the linear structure and clique-width of bipartite permutation graphs. | 40 |
| 12 | 27 | |
| 13 | 4 | |
| 14 | 55 | |
| 15 | The computational complexity of feedback vertex set, Hamiltonian circuit, dominating set, Steiner tree, and BANDWIDTH on special perfect graphs | 4 |
| 16 | 61 | |
| 17 | 125 | |
| 18 | On Partitions of Permutations into Increasing and Decreasing Subsequences. | 15 |
| 19 | 6 | |
| 20 | Eine Hierarchie beschränkter Rückkehrberechnungen auf on-line Turingmaschinen. | 1 |
About Andreas Brandstädt
Andreas Brandstädt is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 110 papers that have together received 2.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (98 papers), Complexity and Algorithms in Graphs (50 papers) and Graph Labeling and Dimension Problems (42 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (657 citations), Computational Theory and Mathematics (2.3k citations) and Geometry and Topology (457 citations). Andreas Brandstädt has collaborated with scholars based in Germany, United States and Italy. Frequent co-authors include Van Bang Lê, Jeremy Spinrad, Feodor F. Dragan, Raffaele Mosca, Victor Chepoi, Vadim Lozin, Dieter Kratsch, Hoàng-Oanh Le, Lorna Stewart and Chı́nh T. Hoàng. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Oral Rehabilitation.
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.