Citations per year, relative to Birgit Vogtenhuber Birgit Vogtenhuber (= 1×)
peers
Bernardo M. Ábrego
Countries citing papers authored by Birgit Vogtenhuber
Since
Specialization
Citations
This map shows the geographic impact of Birgit Vogtenhuber'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 Birgit Vogtenhuber with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Birgit Vogtenhuber more than expected).
Fields of papers citing papers by Birgit Vogtenhuber
This network shows the impact of papers produced by Birgit Vogtenhuber. 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 Birgit Vogtenhuber. The network helps show where Birgit Vogtenhuber may publish in the future.
Co-authorship network of co-authors of Birgit Vogtenhuber
This figure shows the co-authorship network connecting the top 25 collaborators of Birgit Vogtenhuber.
A scholar is included among the top collaborators of Birgit Vogtenhuber 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 Birgit Vogtenhuber. Birgit Vogtenhuber is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ábrego, Bernardo M., Oswin Aichholzer, Silvia Fernández‐Merchant, et al.. (2015). All Good Drawings of Small Complete Graphs. 57–60.2 indexed citations
7.
Ábrego, Bernardo M., Oswin Aichholzer, Silvia Fernández‐Merchant, Pedro Ramos, & Birgit Vogtenhuber. (2014). Non-Shellable Drawings of Kn with Few Crossings. Canadian Conference on Computational Geometry.2 indexed citations
8.
Aichholzer, Oswin, Ruy Fabila‐Monroy, Thomas Hackl, et al.. (2014). On k-gons and k-holes in point sets. Computational Geometry. 48(7). 528–537.5 indexed citations
Aichholzer, Oswin, et al.. (2012). Lower Bounds for the Number of Small Convex k-Holes.. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 247–252.3 indexed citations
12.
Aichholzer, Oswin, Thomas Hackl, & Birgit Vogtenhuber. (2012). On 5-gons and 5-holes. Lecture notes in computer science. 7579. 1–13.3 indexed citations
Aichholzer, Oswin, Ruy Fabila‐Monroy, Thomas Hackl, et al.. (2011). 4-Holes in Point Sets. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 115–118.1 indexed citations
15.
Vogtenhuber, Birgit, Oswin Aichholzer, Clemens Huemer, et al.. (2011). On k-Gons and k-Holes in Point Sets. Canadian Conference on Computational Geometry. 21–26.8 indexed citations
16.
Aichholzer, Oswin, et al.. (2010). 3-Colorability of pseudo-triangulations. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 21–24.1 indexed citations
17.
Aichholzer, Oswin, et al.. (2009). Large bichromatic point sets admit empty monochromatic 4-gons. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 133–136.1 indexed citations
Aichholzer, Oswin, Thomas Hackl, Birgit Vogtenhuber, et al.. (2006). On the number of plane graphs. Symposium on Discrete Algorithms. 504–513.11 indexed citations
20.
Aichholzer, Oswin, Franz Aurenhammer, Thomas Hackl, et al.. (2005). Matching edges and faces in polygonal partitions. MPG.PuRe (Max Planck Society). 126–129.2 indexed citations
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.