Countries citing papers authored by Oswin Aichholzer
Since
Specialization
Citations
This map shows the geographic impact of Oswin Aichholzer'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 Oswin Aichholzer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oswin Aichholzer more than expected).
Fields of papers citing papers by Oswin Aichholzer
This network shows the impact of papers produced by Oswin Aichholzer. 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 Oswin Aichholzer. The network helps show where Oswin Aichholzer may publish in the future.
Co-authorship network of co-authors of Oswin Aichholzer
This figure shows the co-authorship network connecting the top 25 collaborators of Oswin Aichholzer.
A scholar is included among the top collaborators of Oswin Aichholzer 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 Oswin Aichholzer. Oswin Aichholzer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Aichholzer, Oswin, et al.. (2019). Triangles in the colored Euclidean plane.1 indexed citations
3.
Ábrego, Bernardo M., Oswin Aichholzer, Silvia Fernández‐Merchant, et al.. (2015). All Good Drawings of Small Complete Graphs. 57–60.2 indexed citations
4.
Á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
Aichholzer, Oswin, Howard Cheng, Satyan L. Devadoss, et al.. (2012). What makes a Tree a Straight Skeleton. 137–140.2 indexed citations
7.
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
8.
Aichholzer, Oswin, Greg Aloupis, Erik D. Demaine, et al.. (2011). Convexifying Polygons Without Losing Visibilities. Canadian Conference on Computational Geometry. 229–234.1 indexed citations
9.
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
10.
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
11.
Aichholzer, Oswin, Franz Aurenhammer, Erik D. Demaine, et al.. (2011). On k-convex polygons. Computational Geometry. 45(3). 73–87.6 indexed citations
12.
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
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
16.
Aichholzer, Oswin, et al.. (2008). Empty monochromatic triangles. Canadian Conference on Computational Geometry. 75–78.2 indexed citations
17.
Aichholzer, Oswin, Thomas Hackl, Birgit Vogtenhuber, et al.. (2006). On the number of plane graphs. Symposium on Discrete Algorithms. 504–513.11 indexed citations
18.
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
19.
Aichholzer, Oswin & Hannes Krasser. (2001). The point set order type data base: A collection of applications and results.. Canadian Conference on Computational Geometry. 17–20.27 indexed citations
20.
Aichholzer, Oswin, Erik D. Demaine, Jeff Erickson, et al.. (2000). Reconfiguring Convex Polygons.. Utrecht University Repository (Utrecht University).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.