activity
20152022
most citedA lower bound on the order of the largest induced forest in planar graphs with high girth

1 citations · 1 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

François Dross, Krzysztof Fleszar, Karol Węgrzycki +1

In this paper, we study problems of connecting classes of points via noncrossing structures. Given a set of colored terminal points, we want to find a graph for each color that con…

cs.DS2019

Complexity of planar signed graph homomorphisms to cycles

François Dross, Florent Foucaud, Valia Mitsou +2

We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs…