Daniel Perz‘s Publications

This list is also available as BiBTeX file.
[1]
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect Matchings with Crossings. Algorithmica, 86:697--716, 2024. [ bib | DOI ]
[2]
Oswin Aichholzer, Anna Brötzner, Daniel Perz, and Patrick Schnider. Flips in Odd Matchings. In Proceedings of the 36th Canadian Conference on Computational Geometry (CCCG 2024), pages 299--303, 2024. [ bib | .pdf ]
[3]
Oswin Aichholzer, Anna Brötzner, Daniel Perz, and Patrick Schnider. Flips in Odd Matchings. In Proceedings of the 40th European Workshop on Computational Geometry (EuroCG 2024), pages 59:1--59:6, 2024. [ bib | .pdf ]
[4]
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, and Birgit Vogtenhuber. Graphs with large total angular resolution. Theoretical Computer Science, 943:73--88, 2023. [ bib | DOI | arXiv | http ]
[5]
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. On Compatible Matchings. Journal of Graph Algorithms and Applications, 26(2):225--240, 2022. [ bib | DOI ]
[6]
Eva-Maria Hainzl, Maarten Löffler, Daniel Perz, Josef Tkadlec, , and Markus Wallinger. Finding a Battleship of Uncertain Shape. In Proc. 38th European Workshop on Computational Geometry (EuroCG 2022), pages 48:1--48:7, Perugia, Italy, 2022. [ bib | arXiv | http ]
[7]
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect Matchings with Crossings. In Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7--9, 2022, Proceedings, pages 46--59, Berlin, Heidelberg, 2022. Springer-Verlag. [ bib | DOI ]
[8]
Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, and Birgit Vogtenhuber. Disjoint Compatibility via Graph Classes. In Michael A. Bekos and Michael Kaufmann, editors, Graph-Theoretic Concepts in Computer Science. WG 2022., volume 13453 of Lecture Notes in Computer Science (LNCS), pages 16--28, Cham, 2022. Springer International Publishing. [ bib | DOI ]
[9]
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. On Compatible Matchings. In Ryuhei Uehara, Seok-Hee Hong, and Subhas C. Nandy, editors, WALCOM: Algorithms and Computation, pages 221--233. Springer International Publishing, 2021. Best Paper Award. [ bib | DOI | arXiv ]
[10]
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, and Alexandra Weinberger. Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. In Graph Drawing and Network Visualization (GD 2020), Lecture Notes in Computer Science (LNCS), pages 482--489. Springer International Publishing, 2021. [ bib | DOI | arXiv | http ]
[11]
Ruy Fabila-Monroy, Daniel Perz, and Ana Laura Trujillo-Negrete. Empty rainbow triangles in k-colored point sets. Computational Geometry, 95:101731, 2021. [ bib | DOI | http ]
[12]
Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, and Daniel Perz. Nearest-Neighbor Decompositions of Drawings. In Proceedings of the 37th European Workshop on Computational Geometry (EuroCG2021), St. Petersburg, Germany, 2021. [ bib | .pdf ]
[13]
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect Matchings with Crossings. In Proceedings of the Computational Geometry: Young Researchers Forum, pages 24--27, 2021. [ bib | http ]
[14]
Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz, and Birgit Vogtenhuber. No selection lemma for empty triangles. In Proc. XIX Encuentros de Geometría Computacional, page 36, 2021. [ bib | http ]
[15]
Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz, and Birgit Vogtenhuber. No Selection Lemma for Empty Triangles. In Jaroslav Nešetřil, Guillem Perarnau, Juanjo Rué, and Oriol Serra, editors, Extended Abstracts EuroComb 2021, pages 720--725, Cham, 2021. Springer International Publishing. [ bib ]
[16]
Oswin Aichholzer, Maarten Löffler, Jayson Lynch, Zuzana Masárová, Joachim Orthaber, Irene Parada, Rosna Paul, Daniel Perz, Birgit Vogtenhuber, and Alexandra Weinberger. Dominect: A Simple yet Deep 2-Player Board Game. In 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCGGG 2020+1), pages 112--113, 2021. [ bib | http ]
[17]
O. Aichholzer, J. Obmann, P. Paták, D. Perz, and J. Tkadlec. Disjoint tree-compatible plane perfect matchings. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG2020), pages 56:1--56:7, Würzburg, Germany, 2020. [ bib | .pdf ]
[18]
R. Fabila-Monroy, D. Perz, and A. L. Trujillo. Empty Rainbow Triangles in k-colored Point Sets. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG2020), Würzburg, Germany, 2020. [ bib | .pdf ]
[19]
Oswin Aichholzer and Daniel Perz. Triangles in the colored Euclidean plane. In Proc. 35th European Workshop on Computational Geometry EuroCG '19, pages 10:1--10:7, Utrecht, The Netherlands, 2019. [ bib | .pdf | .pdf ]
[20]
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, and Birgit Vogtenhuber. Graphs with large total angular resolution. In Graph Drawing and Network Visualization. GD 2019, volume 11904 of Lecture Notes in Computer Science (LNCS), pages 193--199, Prague, Czechia, 2019. [ bib | DOI | arXiv ]

This file was generated by bibtex2html 1.98.