Martin Derka

activity

20112025

most citedSoK: Not Quite Water Under the Bridge: Review of Cross-Chain Bridge Hacks

14 citations · 25 across the 17 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.CG2017

Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges

Therese Biedl, Timothy M. Chan, Martin Derka +2

Let $T$ be an $n$ -node tree of maximum degree 4, and let $P$ be a set of $n$ points in the plane with no two points on the same horizontal or vertical line. It is an open question…

cs.CG2017

EPG-representations with small grid-size

Therese Biedl, Martin Derka, Vida Dujmovic +1

In an EPG-representation of a graph $G$ each vertex is represented by a path in the rectangular grid, and $(v, w)$ is an edge in $G$ if and only if the paths representing $v$ an $w$ …