André van Renssen

448 total citations
26 papers, 75 citations indexed

About

André van Renssen is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, André van Renssen has authored 26 papers receiving a total of 75 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Graphics and Computer-Aided Design, 14 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in André van Renssen's work include Computational Geometry and Mesh Generation (15 papers), Advanced Graph Theory Research (13 papers) and Data Management and Algorithms (5 papers). André van Renssen is often cited by papers focused on Computational Geometry and Mesh Generation (15 papers), Advanced Graph Theory Research (13 papers) and Data Management and Algorithms (5 papers). André van Renssen collaborates with scholars based in Canada, Australia and Japan. André van Renssen's co-authors include Wouter Meulemans, Bettina Speckmann, Kevin Buchin, Prosenjit Bose, Rolf Fagerberg, Jean-Lou De Carufel, Matias Korman, Yushi Uno, Mirela Damian and Ge Xia and has published in prestigious journals such as Theoretical Computer Science, Algorithmica and SIAM Journal on Discrete Mathematics.

In The Last Decade

André van Renssen

18 papers receiving 73 citations

Peers

André van Renssen
Jean-Lou De Carufel Canada
Maarten Löffler Netherlands
Giordano Da Lozzo Italy
Kenneth Weiss United States
Sophie Toulouse France
Tillmann Miltzow Germany
Peihan Miao China
Andrew Suk United States
S. I. Cooper United States
Farhan Tauheed Switzerland
Jean-Lou De Carufel Canada
André van Renssen
Citations per year, relative to André van Renssen André van Renssen (= 1×) peers Jean-Lou De Carufel

Countries citing papers authored by André van Renssen

Since Specialization
Citations

This map shows the geographic impact of André van Renssen'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é van Renssen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites André van Renssen more than expected).

Fields of papers citing papers by André van Renssen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by André van Renssen. 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é van Renssen. The network helps show where André van Renssen may publish in the future.

Co-authorship network of co-authors of André van Renssen

This figure shows the co-authorship network connecting the top 25 collaborators of André van Renssen. A scholar is included among the top collaborators of André van Renssen 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 André van Renssen. André van Renssen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gudmundsson, Joachim, et al.. (2024). Pattern formation for fat robots with lights. Computational Geometry. 128. 102161–102161.
2.
Gudmundsson, Joachim, et al.. (2023). Oriented Spanners. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
3.
Renssen, André van, et al.. (2020). Bounded-degree spanners in the presence of polygonal obstacle. Theoretical Computer Science. 854. 159–173.
4.
Arkin, Esther M., Mirela Damian, Erik D. Demaine, et al.. (2019). Universal Reconfiguration of Facet-Connected Modular Robots by Pivots:\n The $O(1)$ Musketeers. arXiv (Cornell University). 1 indexed citations
5.
Korman, Matias, et al.. (2019). Routing in polygonal domains. Computational Geometry. 87. 101593–101593. 1 indexed citations
6.
Bose, Prosenjit & André van Renssen. (2019). Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints. International Journal of Computational Geometry & Applications. 29(2). 95–120. 1 indexed citations
7.
Bose, Prosenjit, Jean-Lou De Carufel, & André van Renssen. (2018). Constrained generalized Delaunay graphs are plane spanners. Computational Geometry. 74. 50–65. 1 indexed citations
8.
Bose, Prosenjit, et al.. (2018). On Plane Constrained Bounded-Degree Spanners. Algorithmica. 81(4). 1392–1415. 2 indexed citations
9.
Kreveld, Marc van, et al.. (2018). Geometry and Generation of a New Graph Planarity Game. TU/e Research Portal. 1–8.
10.
Korman, Matias, et al.. (2017). Time–space trade-offs for triangulations and Voronoi diagrams. Computational Geometry. 73. 35–45. 2 indexed citations
11.
Barba, Luis, Prosenjit Bose, Mirela Damian, et al.. (2017). Continuous Yao graphs. Computational Geometry. 67. 42–52.
12.
Díez, Yago, et al.. (2017). Hanabi is NP-hard, even for cheaters who look at their cards. Theoretical Computer Science. 675. 43–55. 5 indexed citations
13.
Aichholzer, Oswin, Thomas Hackl, Matias Korman, et al.. (2016). Packing Short Plane Spanning Trees in Complete Geometric Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 64. 12.
14.
Buchin, Kevin, Wouter Meulemans, André van Renssen, & Bettina Speckmann. (2016). Area-Preserving Simplification and Schematization of Polygonal Subdivisions. ACM Transactions on Spatial Algorithms and Systems. 2(1). 1–36. 27 indexed citations
15.
Bose, Prosenjit, et al.. (2015). Towards tight bounds on theta-graphs: More is not always better. Theoretical Computer Science. 616. 70–93. 6 indexed citations
16.
Renssen, André van. (2014). On the Spanning Ratio of Constrained Yao-Graphs.. Canadian Conference on Computational Geometry.
17.
Bose, Prosenjit, et al.. (2012). Competitive routing in the half-θ6-graph. Symposium on Discrete Algorithms. 1319–1328. 5 indexed citations
18.
Bose, Prosenjit, et al.. (2012). Optimal Bounds on Theta-Graphs: More is not Always Better.. Canadian Conference on Computational Geometry. 291–296. 1 indexed citations
19.
Bose, Prosenjit, et al.. (2012). Competitive Routing on a Bounded-Degree Plane Spanner. University of Southern Denmark Research Portal (University of Southern Denmark). 285–290. 1 indexed citations
20.
Bose, Prosenjit, et al.. (2012). Making triangulations 4-connected using flips. Computational Geometry. 47(2). 187–197. 3 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Jean-Lou De Carufel Breakdown of academic impact, for papers by Maarten Löffler Breakdown of academic impact, for papers by Giordano Da Lozzo Breakdown of academic impact, for papers by Kenneth Weiss Breakdown of academic impact, for papers by Sophie Toulouse Breakdown of academic impact, for papers by Tillmann Miltzow Breakdown of academic impact, for papers by Peihan Miao Breakdown of academic impact, for papers by Andrew Suk Breakdown of academic impact, for papers by S. I. Cooper Breakdown of academic impact, for papers by Farhan Tauheed
Rankless by CCL
2026