Alexander Langer
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- Formal Methods in Verification
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 14
- Complexity and Algorithms in Graphs 12
- Graph Labeling and Dimension Problems 3
- Formal Methods in Verification 2
-
- Optimization and Search Problems 2
- Co-authors
- Peter Rossmanith (12 shared papers)Joachim Kneis (8 shared papers)Somnath Sikdar (5 shared papers)Felix Reidl (3 shared papers)Eun Jung Kim (1 shared paper)Ignasi Sau (1 shared paper)Henning Fernau (2 shared papers)Dieter Kratsch (2 shared papers)
In The Last Decade
Alexander Langer
15 papers receiving 137 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 122
- Discrete Mathematics and Combinatorics 16
- Computer Networks and Communications 50
- Computer Graphics and Computer-Aided Design 5
- Software 4
Countries citing papers authored by Alexander Langer
This map shows the geographic impact of Alexander Langer'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 Alexander Langer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Langer more than expected).
Fields of papers citing papers by Alexander Langer
This network shows the impact of papers produced by Alexander Langer. 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 Alexander Langer. The network helps show where Alexander Langer may publish in the future.
Co-authors
The 19 scholars most cited alongside Alexander Langer, 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 | 2015 | 28 | |
| 2 | 2011 | 25 | |
| 3 | 2009 | 18 | |
| 4 | 2014 | 14 | |
| 5 | 2013 | 12 | |
| 6 | 2012 | 11 | |
| 7 | 2010 | 10 | |
| 8 | 2011 | 10 | |
| 9 | 2013 | 8 | |
| 10 | 2009 | 4 | |
| 11 | Satellites and Mirrors for Solving Independent Set on Sparse Graphs | 2009 | 3 |
| 12 | Fast algorithms for decomposable graphs | 2013 | 3 |
| 13 | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Extended Abstract) | 2012 | 2 |
| 14 | Derandomizing Non-uniform Color-Coding I | 2009 | 2 |
| 15 | 1953 | 2 | |
| 16 | Die Schülerschule : Brief an eine Lehrerin | 1970 | 0 |
About Alexander Langer
Alexander Langer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Molecular Biology and Sociology and Political Science, having authored 16 papers that have together received 152 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (14 papers), Complexity and Algorithms in Graphs (12 papers), Graph Labeling and Dimension Problems (3 papers), Optimization and Search Problems (2 papers), Limits and Structures in Graph Theory (2 papers), Formal Methods in Verification (2 papers), Education Methods and Technologies (1 paper) and Sociology and Education Studies (1 paper). The work is most often cited by research in Computational Theory and Mathematics (122 citations), Discrete Mathematics and Combinatorics (16 citations), Computer Networks and Communications (50 citations), Computer Graphics and Computer-Aided Design (5 citations) and Software (4 citations). Alexander Langer has collaborated with scholars based in Germany, France and Czechia. Frequent co-authors include Peter Rossmanith, Joachim Kneis, Somnath Sikdar, Felix Reidl, Eun Jung Kim, Ignasi Sau, Henning Fernau, Dieter Kratsch, Christophe Paul and Mathieu Liedloff. Their work appears in journals such as Algorithmica, Theoretical Computer Science, Journal of Computer and System Sciences, Science and Computer Science Review.
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.