Search Results - "Masárová, Zuzana"
-
1
Token Swapping on Trees
Published in Discrete mathematics and theoretical computer science (2023)“…The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The…”
Get full text
Journal Article -
2
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
Published in Discrete & computational geometry (01-06-2019)“…Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite…”
Get full text
Journal Article -
3
Token Swapping on Trees
Published in Discrete mathematics and theoretical computer science (01-04-2022)“…The input to the token swapping problem is a graph with vertices ж, U2,..., vn, and n tokens with labels 1, 2,..., n, one on each vertex. The goal is to get…”
Get full text
Journal Article -
4
Folding polyominoes with holes into a cube
Published in Computational geometry : theory and applications (01-02-2021)“…When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open…”
Get full text
Journal Article -
5
Removing Popular Faces in Curve Arrangements
Published in Journal of graph algorithms and applications (03-11-2024)“…A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram…”
Get full text
Journal Article -
6
On Compatible Matchings
Published in Journal of graph algorithms and applications (01-06-2022)“…A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is…”
Get full text
Journal Article -
7
Removing Popular Faces in Curve Arrangements
Published 24-02-2022“…A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram…”
Get full text
Journal Article -
8
On Compatible Matchings
Published 05-09-2022“…Journal of Graph Algorithms and Applications, Vol. 26, no. 2, pp. 225-240, 2022 A matching is compatible to two or more labeled point sets of size $n$ with…”
Get full text
Journal Article -
9
Token Swapping on Trees
Published 13-01-2023“…Discrete Mathematics & Theoretical Computer Science, vol. 24, no 2, Discrete Algorithms (January 18, 2023) dmtcs:8383 The input to the token swapping problem…”
Get full text
Journal Article -
10
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
Published 07-10-2017“…Given a triangulation of a point set in the plane, a \emph{flip} deletes an edge $e$ whose removal leaves a convex quadrilateral, and replaces $e$ by the…”
Get full text
Journal Article -
11
Hardness of Token Swapping on Trees
Published 11-03-2021“…Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token…”
Get full text
Journal Article -
12
On word-representability of polyomino triangulations
Published 14-05-2014“…A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)$…”
Get full text
Journal Article -
13
Folding Polyominoes with Holes into a Cube
Published 22-10-2019“…When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open…”
Get full text
Journal Article