Daniel G. Simon

activity

20242026

collaborators

3 papers

math.CO2026

Unit distance graphs with few crossings per edge

Panna GehÃ©r, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi, DÃ¡niel G. Simon +1

A graph is called a $k$ -planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investig…

math.OC2025

Discrete and Continuous Caching Games

Ãron JÃ¡nosik, Csenge MiklÃ³s, DÃ¡niel G. Simon +1

We investigate a discrete search game called the Multiple Caching Game where the searcher's aim is to find all of a set of $d$ treasures hidden in $n$ locations. Allowed queries ar…

math.CO2024

Saturated Partial Embeddings of Maximal Planar Graphs

Alexander Clifton, DÃ¡niel G. Simon

We investigate two notions of saturation for partial planar embeddings of maximal planar graphs. Let $G = (V, E)$ be a vertex-labeled maximal planar graph on $n$ vertices, which…