Gender-aware facility location in multi-gender world
From MaRDI portal
Publication:3301019
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 1445284 (Why is no real title available?)
- A characterization of interval catch digraphs
- A linear time algorithm for minimum link paths inside a simple polygon
- Algorithms for interval catch digraphs
- Algorithms for weakly triangulated graphs
- An efficient algorithm for finding a two-pair, and its applications
- Approximating watchman routes
- Finding the shortest watchman route in a simple polygon
- Hiding people in polygons
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Interval digraphs: An analogue of interval graphs
- Introduction to algorithms.
- Minimum-link paths among obstacles in the plane
- Minimum-link paths revisited
- Optimizing weakly triangulated graphs
- Touring a sequence of polygons
- Visibility Algorithms in the Plane
- Watchman tours for polygons with holes
- Weakly triangulated graphs
- \textsc{FPsolve}: a generic solver for fixpoint equations over semirings
This page was built for publication: Gender-aware facility location in multi-gender world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301019)