A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2016)

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection. - Ingo van Duijn; Irina Kostitsyna; Marc J. van Kreveld; Maarten Löffler (CCCG, 2016)

Applications of Incidence Bounds in Point Covering Problems. - Peyman Afshani; Edvin Berglin; Ingo van Duijn; Jesper Sindahl Nielsen (SoCG, 2016)

Permuting and Batched Geometric Lower Bounds in the I/O Model. - Peyman Afshani; Ingo van Duijn (ESA, 2017)

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2017)

Self-adjusting Linear Networks. - Chen Avin; Ingo van Duijn; Stefan Schmid 001 (SIROCCO, 2019)

A Lower Bound for Jumbled Indexing. - Peyman Afshani; Ingo van Duijn; Rasmus Killmann; Jesper Sindahl Nielsen (SODA, 2020)

Faster Pushdown Reachability Analysis with Applications in Network Verification. - Peter Gjøl Jensen; Stefan Schmid 001; Morten Konggaard Schou; Jirí Srba; Juan Vanerio; Ingo van Duijn (ATVA, 2021)

Repeatability Package for "Faster Pushdown Reachability Analysis with Applications in Network Verification". - Peter Gjøl Jensen; Stefan Schmid 001; Morten Konggaard Schou; Jirí Srba; Juan Vanerio; Ingo van Duijn (Zenodo, 2021)

Automata-Theoretic Approach to Verification of MPLS Networks Under Link Failures. - Ingo van Duijn; Peter Gjøl Jensen; Jesper Stenbjerg Jensen; Troels Beck Krøgh; Jonas Sand Madsen; Stefan Schmid 001; Jirí Srba; Marc Tom Thorgersen (IEEE/ACM Trans. Netw., 2022)

Self-adjusting grid networks. - Chen Avin; Ingo van Duijn; Maciej Pacut; Stefan Schmid 001 (Inf. Comput., 2023)