Daniel Perz

Orcid: 0000-0002-6557-2355

According to our database1, Daniel Perz authored at least 14 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Flipping odd matchings in geometric and combinatorial settings.
CoRR, August, 2025

Flipping Matchings is Hard.
CoRR, March, 2025

Minimum spanning blob-trees.
CoRR, March, 2025

2024
Flips in Odd Matchings.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

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

Perfect Matchings with Crossings.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

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

On Compatible Matchings.
Proceedings of the WALCOM: Algorithms and Computation, 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

2019
Graphs with Large Total Angular Resolution.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019


  Loading...