Daniel Perz

Orcid: 0000-0002-6557-2355

According to our database1, Daniel Perz authored at least 11 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Perfect Matchings with Crossings.
Algorithmica, March, 2024

Flips in Odd Matchings.
CoRR, 2024

2023
Graphs with large total angular resolution.
Theor. Comput. Sci., 2023

2022
On Compatible Matchings.
J. Graph Algorithms Appl., 2022

No Selection Lemma for Empty Triangles.
CoRR, 2022

Finding a Battleship of Uncertain Shape.
CoRR, 2022

Disjoint Compatibility via Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Nearest-Neighbor Decompositions of Drawings.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021
Empty rainbow triangles in <i>k</i>-colored point sets.
Comput. Geom., 2021

2020
Empty Rainbow Triangles in k-colored Point Sets.
CoRR, 2020

Plane Spanning Trees in Edge-Colored Simple Drawings of K<sub>n</sub>.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020


  Loading...