In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
Abstract. In two-sided matching markets in which some doctors form couples, we present an algorithm ...
The stable roommates problem with payments has as input a graph G = (V,E) with an edge weighting w: ...
Abstract. In this paper, we introduce planar matchings on directed pseudo-line arrangements, which y...
We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseu...
We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseu...
We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseu...
In this paper, we fill in a gap in the wavefront-based definition of weighted straight skeletons in ...
This paper studies whether a sequence of myopic blockings leads to a stable matching in the roommate...
28 pages, 6 figures, published versionInternational audienceIn this paper, we investigate analytical...
Abstract. We study the computation of the straight skeleton of a planar straight-line graph (PSLG) b...
The stable roommates problem is a well-known problem of matching n people into n/2 disjoint pairs so...
In this article, Temperley's bijection between spanning trees of the square grid on the one han...
Recently a robustness notion for matching problems based on the concept of a (a, b)-supermatch is pr...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
Abstract. In two-sided matching markets in which some doctors form couples, we present an algorithm ...
The stable roommates problem with payments has as input a graph G = (V,E) with an edge weighting w: ...
Abstract. In this paper, we introduce planar matchings on directed pseudo-line arrangements, which y...
We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseu...
We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseu...
We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseu...
In this paper, we fill in a gap in the wavefront-based definition of weighted straight skeletons in ...
This paper studies whether a sequence of myopic blockings leads to a stable matching in the roommate...
28 pages, 6 figures, published versionInternational audienceIn this paper, we investigate analytical...
Abstract. We study the computation of the straight skeleton of a planar straight-line graph (PSLG) b...
The stable roommates problem is a well-known problem of matching n people into n/2 disjoint pairs so...
In this article, Temperley's bijection between spanning trees of the square grid on the one han...
Recently a robustness notion for matching problems based on the concept of a (a, b)-supermatch is pr...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
Given two planar polylines T and P with n and m edges, respectively, wepresent an O(m 2 n 2) time, O...
Abstract. In two-sided matching markets in which some doctors form couples, we present an algorithm ...
The stable roommates problem with payments has as input a graph G = (V,E) with an edge weighting w: ...