Nicolas El Maalouly

most citedTopological Art in Simple Galleries

2 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2022

Compatible Spanning Trees in Simple Drawings of $K_{n}$

Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer +6

For a simple drawing $D$ of the complete graph $K_{n}$ , two (plane) subdrawings are compatible if their union is plane. Let $T_{D}$ be the set of all plane spanning trees on…

cs.DS2022★ 1 cited

Exact Matching: Algorithms and Related Problems

Nicolas El Maalouly

In 1982, Papadimitriou and Yannakakis introduced the Exact Matching (EM) problem where given an edge colored graph, with colors red and blue, and an integer $k$ , the goal is to dec…

cs.CG2021★ 2 cited

Topological Art in Simple Galleries

Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow +2

Let $P$ be a simple polygon, then the art gallery problem is looking for a minimum set of points (guards) that can see every point in $P$ . We say two points $a, b \in P$ can see each…

Compatible Spanning Trees in Simple Drawings of Kn​

Exact Matching: Algorithms and Related Problems

Topological Art in Simple Galleries

Compatible Spanning Trees in Simple Drawings of $K_{n}$