<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml">
<url><loc>https://scifaro.com/en/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196"/></url>
<url><loc>https://scifaro.com/zh/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-algorithm-to-calculate-hypervolume-indicator-of-pareto-approximation-set-0704.1196"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197"/></url>
<url><loc>https://scifaro.com/zh/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-shortest-paths-in-simple-cube-curves-at-a-glance-0704.3197"/></url>
<url><loc>https://scifaro.com/en/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086</loc><lastmod>2009-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086"/></url>
<url><loc>https://scifaro.com/zh/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086</loc><lastmod>2009-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-domino-problem-in-the-hyperbolic-plane-a-new-solution-complement-0705.0086"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350"/></url>
<url><loc>https://scifaro.com/zh/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-laying-points-optimally-on-a-plane-and-a-circle-0705.0350"/></url>
<url><loc>https://scifaro.com/en/abs/moving-walkways-escalators-and-elevators-0705.0635</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moving-walkways-escalators-and-elevators-0705.0635"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/moving-walkways-escalators-and-elevators-0705.0635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moving-walkways-escalators-and-elevators-0705.0635"/></url>
<url><loc>https://scifaro.com/zh/abs/moving-walkways-escalators-and-elevators-0705.0635</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moving-walkways-escalators-and-elevators-0705.0635"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/moving-walkways-escalators-and-elevators-0705.0635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moving-walkways-escalators-and-elevators-0705.0635"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364"/></url>
<url><loc>https://scifaro.com/zh/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-shortest-descending-paths-0705.1364"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-manhattan-towers-0705.1541</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-manhattan-towers-0705.1541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-manhattan-towers-0705.1541"/></url>
<url><loc>https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956"/></url>
<url><loc>https://scifaro.com/zh/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0705.1956"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835"/></url>
<url><loc>https://scifaro.com/zh/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagram-of-polygonal-chains-under-the-discrete-fr-echet-distance-0705.2835"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-and-localing-homology-classes-0705.3061</loc><lastmod>2007-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-and-localing-homology-classes-0705.3061"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/measuring-and-localing-homology-classes-0705.3061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-and-localing-homology-classes-0705.3061"/></url>
<url><loc>https://scifaro.com/zh/abs/measuring-and-localing-homology-classes-0705.3061</loc><lastmod>2007-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-and-localing-homology-classes-0705.3061"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/measuring-and-localing-homology-classes-0705.3061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-and-localing-homology-classes-0705.3061"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343</loc><lastmod>2007-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343"/></url>
<url><loc>https://scifaro.com/zh/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343</loc><lastmod>2007-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-separable-algorithms-to-compute-the-reverse-euclidean-distance-transformation-and-discrete-medial-axis-in-arbitrary-dimension-0705.3343"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820"/></url>
<url><loc>https://scifaro.com/zh/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-maximal-angles-for-plane-straight-line-graphs-0705.3820"/></url>
<url><loc>https://scifaro.com/en/abs/the-distance-geometry-of-music-0705.4085</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-distance-geometry-of-music-0705.4085"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-distance-geometry-of-music-0705.4085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-distance-geometry-of-music-0705.4085"/></url>
<url><loc>https://scifaro.com/zh/abs/the-distance-geometry-of-music-0705.4085</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-distance-geometry-of-music-0705.4085"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-distance-geometry-of-music-0705.4085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-distance-geometry-of-music-0705.4085"/></url>
<url><loc>https://scifaro.com/en/abs/moving-vertices-to-make-drawings-plane-0706.1002</loc><lastmod>2008-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moving-vertices-to-make-drawings-plane-0706.1002"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/moving-vertices-to-make-drawings-plane-0706.1002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moving-vertices-to-make-drawings-plane-0706.1002"/></url>
<url><loc>https://scifaro.com/zh/abs/moving-vertices-to-make-drawings-plane-0706.1002</loc><lastmod>2008-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moving-vertices-to-make-drawings-plane-0706.1002"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/moving-vertices-to-make-drawings-plane-0706.1002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moving-vertices-to-make-drawings-plane-0706.1002"/></url>
<url><loc>https://scifaro.com/en/abs/stability-of-boundary-measures-0706.2153</loc><lastmod>2010-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-boundary-measures-0706.2153"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/stability-of-boundary-measures-0706.2153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-boundary-measures-0706.2153"/></url>
<url><loc>https://scifaro.com/zh/abs/stability-of-boundary-measures-0706.2153</loc><lastmod>2010-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-boundary-measures-0706.2153"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/stability-of-boundary-measures-0706.2153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-boundary-measures-0706.2153"/></url>
<url><loc>https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161</loc><lastmod>2008-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161"/></url>
<url><loc>https://scifaro.com/zh/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161</loc><lastmod>2008-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-domino-problem-of-the-hyperbolic-plane-is-undecidable-0706.4161"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-orthogonal-terrains-0707.0610</loc><lastmod>2007-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-orthogonal-terrains-0707.0610"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unfolding-orthogonal-terrains-0707.0610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-orthogonal-terrains-0707.0610"/></url>
<url><loc>https://scifaro.com/zh/abs/unfolding-orthogonal-terrains-0707.0610</loc><lastmod>2007-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-orthogonal-terrains-0707.0610"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unfolding-orthogonal-terrains-0707.0610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-orthogonal-terrains-0707.0610"/></url>
<url><loc>https://scifaro.com/en/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258</loc><lastmod>2009-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258"/></url>
<url><loc>https://scifaro.com/zh/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258</loc><lastmod>2009-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/star-unfolding-convex-polyhedra-via-quasigeodesic-loops-0707.4258"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-equipartition-0707.4298</loc><lastmod>2008-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-equipartition-0707.4298"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-note-on-equipartition-0707.4298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-equipartition-0707.4298"/></url>
<url><loc>https://scifaro.com/zh/abs/a-note-on-equipartition-0707.4298</loc><lastmod>2008-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-equipartition-0707.4298"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-note-on-equipartition-0707.4298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-equipartition-0707.4298"/></url>
<url><loc>https://scifaro.com/en/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964</loc><lastmod>2007-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964"/></url>
<url><loc>https://scifaro.com/zh/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964</loc><lastmod>2007-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nodally-3-connected-planar-graphs-and-convex-combination-mappings-0708.0964"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909</loc><lastmod>2007-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909"/></url>
<url><loc>https://scifaro.com/zh/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909</loc><lastmod>2007-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-the-voronoi-diagram-of-polygonal-curves-under-the-discrete-frechet-distance-0708.1909"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-a-planar-graph-0709.0170</loc><lastmod>2009-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-a-planar-graph-0709.0170"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/untangling-a-planar-graph-0709.0170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-a-planar-graph-0709.0170"/></url>
<url><loc>https://scifaro.com/zh/abs/untangling-a-planar-graph-0709.0170</loc><lastmod>2009-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-a-planar-graph-0709.0170"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/untangling-a-planar-graph-0709.0170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-a-planar-graph-0709.0170"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-restricted-convex-caps-0709.1647</loc><lastmod>2007-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-restricted-convex-caps-0709.1647"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unfolding-restricted-convex-caps-0709.1647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-restricted-convex-caps-0709.1647"/></url>
<url><loc>https://scifaro.com/zh/abs/unfolding-restricted-convex-caps-0709.1647</loc><lastmod>2007-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-restricted-convex-caps-0709.1647"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unfolding-restricted-convex-caps-0709.1647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-restricted-convex-caps-0709.1647"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941</loc><lastmod>2008-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941"/></url>
<url><loc>https://scifaro.com/zh/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941</loc><lastmod>2008-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-simplification-of-polygonal-curves-using-nested-approximations-0709.1941"/></url>
<url><loc>https://scifaro.com/en/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942</loc><lastmod>2007-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942"/></url>
<url><loc>https://scifaro.com/zh/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942</loc><lastmod>2007-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connecting-polygonizations-via-stretches-and-twangs-0709.1942"/></url>
<url><loc>https://scifaro.com/en/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196"/></url>
<url><loc>https://scifaro.com/zh/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bregman-voronoi-diagrams-properties-algorithms-and-applications-0709.2196"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512"/></url>
<url><loc>https://scifaro.com/zh/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-homology-classes-ii-localization-and-stability-0709.2512"/></url>
<url><loc>https://scifaro.com/en/abs/triangulating-the-real-projective-plane-0709.2831</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangulating-the-real-projective-plane-0709.2831"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/triangulating-the-real-projective-plane-0709.2831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangulating-the-real-projective-plane-0709.2831"/></url>
<url><loc>https://scifaro.com/zh/abs/triangulating-the-real-projective-plane-0709.2831</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangulating-the-real-projective-plane-0709.2831"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/triangulating-the-real-projective-plane-0709.2831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangulating-the-real-projective-plane-0709.2831"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554</loc><lastmod>2007-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554"/></url>
<url><loc>https://scifaro.com/zh/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554</loc><lastmod>2007-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-on-guard-placement-for-wireless-localization-0709.3554"/></url>
<url><loc>https://scifaro.com/en/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087"/></url>
<url><loc>https://scifaro.com/zh/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-topology-of-bendless-three-dimensional-orthogonal-graph-drawing-0709.4087"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232</loc><lastmod>2007-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232"/></url>
<url><loc>https://scifaro.com/zh/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232</loc><lastmod>2007-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-a-uniform-plane-filling-path-in-the-ternary-heptagrid-of-the-hyperbolic-plane-0710.0232"/></url>
<url><loc>https://scifaro.com/en/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811</loc><lastmod>2007-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811"/></url>
<url><loc>https://scifaro.com/zh/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811</loc><lastmod>2007-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/band-unfoldings-and-prismatoids-a-counterexample-0710.0811"/></url>
<url><loc>https://scifaro.com/en/abs/degeneracy-of-angular-voronoi-diagram-0710.0925</loc><lastmod>2007-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degeneracy-of-angular-voronoi-diagram-0710.0925"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/degeneracy-of-angular-voronoi-diagram-0710.0925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degeneracy-of-angular-voronoi-diagram-0710.0925"/></url>
<url><loc>https://scifaro.com/zh/abs/degeneracy-of-angular-voronoi-diagram-0710.0925</loc><lastmod>2007-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degeneracy-of-angular-voronoi-diagram-0710.0925"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/degeneracy-of-angular-voronoi-diagram-0710.0925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degeneracy-of-angular-voronoi-diagram-0710.0925"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641</loc><lastmod>2010-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641"/></url>
<url><loc>https://scifaro.com/zh/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641</loc><lastmod>2010-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-bound-for-untangling-geometric-planar-graphs-0710.1641"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-spanners-with-small-chromatic-number-0711.0114</loc><lastmod>2007-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-spanners-with-small-chromatic-number-0711.0114"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/geometric-spanners-with-small-chromatic-number-0711.0114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-spanners-with-small-chromatic-number-0711.0114"/></url>
<url><loc>https://scifaro.com/zh/abs/geometric-spanners-with-small-chromatic-number-0711.0114</loc><lastmod>2007-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-spanners-with-small-chromatic-number-0711.0114"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/geometric-spanners-with-small-chromatic-number-0711.0114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-spanners-with-small-chromatic-number-0711.0114"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-d-forms-have-no-spurious-creases-0711.2605</loc><lastmod>2009-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-d-forms-have-no-spurious-creases-0711.2605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-d-forms-have-no-spurious-creases-0711.2605"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-rigidity-in-the-plane-0711.2835</loc><lastmod>2008-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-rigidity-in-the-plane-0711.2835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-rigidity-in-the-plane-0711.2835"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-centroids-of-symmetrized-bregman-divergences-0711.3242</loc><lastmod>2007-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-centroids-of-symmetrized-bregman-divergences-0711.3242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-centroids-of-symmetrized-bregman-divergences-0711.3242"/></url>
<url><loc>https://scifaro.com/en/abs/a-condition-number-analysis-of-an-algorithm-for-solving-a-system-of-polynomial-equations-with-one-degree-of-freedom-0711.4656</loc><lastmod>2009-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-condition-number-analysis-of-an-algorithm-for-solving-a-system-of-polynomial-equations-with-one-degree-of-freedom-0711.4656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-condition-number-analysis-of-an-algorithm-for-solving-a-system-of-polynomial-equations-with-one-degree-of-freedom-0711.4656"/></url>
<url><loc>https://scifaro.com/en/abs/spanners-of-complete-k-partite-geometric-graphs-0712.0554</loc><lastmod>2007-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanners-of-complete-k-partite-geometric-graphs-0712.0554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanners-of-complete-k-partite-geometric-graphs-0712.0554"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-edge-flips-in-dense-surface-triangulations-0712.1959</loc><lastmod>2007-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-edge-flips-in-dense-surface-triangulations-0712.1959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-edge-flips-in-dense-surface-triangulations-0712.1959"/></url>
<url><loc>https://scifaro.com/en/abs/hinged-dissections-exist-0712.2094</loc><lastmod>2008-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hinged-dissections-exist-0712.2094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hinged-dissections-exist-0712.2094"/></url>
<url><loc>https://scifaro.com/en/abs/towards-persistence-based-reconstruction-in-euclidean-spaces-0712.2638</loc><lastmod>2007-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-persistence-based-reconstruction-in-euclidean-spaces-0712.2638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-persistence-based-reconstruction-in-euclidean-spaces-0712.2638"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximum-span-of-fixed-angle-chains-0801.0258</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximum-span-of-fixed-angle-chains-0801.0258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximum-span-of-fixed-angle-chains-0801.0258"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-eps-approximations-of-terrains-0801.2793</loc><lastmod>2008-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-eps-approximations-of-terrains-0801.2793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-eps-approximations-of-terrains-0801.2793"/></url>
<url><loc>https://scifaro.com/en/abs/shallow-low-and-light-trees-and-tight-lower-bounds-for-euclidean-spanners-0801.3581</loc><lastmod>2011-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shallow-low-and-light-trees-and-tight-lower-bounds-for-euclidean-spanners-0801.3581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shallow-low-and-light-trees-and-tight-lower-bounds-for-euclidean-spanners-0801.3581"/></url>
<url><loc>https://scifaro.com/en/abs/spanners-of-additively-weighted-point-sets-0801.4013</loc><lastmod>2008-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanners-of-additively-weighted-point-sets-0801.4013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanners-of-additively-weighted-point-sets-0801.4013"/></url>
<url><loc>https://scifaro.com/en/abs/a-class-of-convex-polyhedra-with-few-edge-unfoldings-0801.4019</loc><lastmod>2008-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-class-of-convex-polyhedra-with-few-edge-unfoldings-0801.4019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-class-of-convex-polyhedra-with-few-edge-unfoldings-0801.4019"/></url>
<url><loc>https://scifaro.com/en/abs/a-locked-orthogonal-tree-0801.4405</loc><lastmod>2008-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-locked-orthogonal-tree-0801.4405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-locked-orthogonal-tree-0801.4405"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-polygons-and-graphs-0802.1312</loc><lastmod>2011-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-polygons-and-graphs-0802.1312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-polygons-and-graphs-0802.1312"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-curvilinear-art-galleries-with-edge-or-mobile-guards-via-2-dominance-of-triangulation-graphs-0802.1361</loc><lastmod>2011-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-curvilinear-art-galleries-with-edge-or-mobile-guards-via-2-dominance-of-triangulation-graphs-0802.1361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-curvilinear-art-galleries-with-edge-or-mobile-guards-via-2-dominance-of-triangulation-graphs-0802.1361"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-complex-structure-on-surfel-surfaces-0802.1617</loc><lastmod>2008-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-complex-structure-on-surfel-surfaces-0802.1617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-complex-structure-on-surfel-surfaces-0802.1617"/></url>
<url><loc>https://scifaro.com/en/abs/well-centered-triangulation-0802.2108</loc><lastmod>2010-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-centered-triangulation-0802.2108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-centered-triangulation-0802.2108"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-curvilinear-art-galleries-with-vertex-or-point-guards-0802.2594</loc><lastmod>2009-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-curvilinear-art-galleries-with-vertex-or-point-guards-0802.2594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-curvilinear-art-galleries-with-vertex-or-point-guards-0802.2594"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-set-cover-and-hitting-sets-for-polytopes-in-r-3-0802.2861</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-set-cover-and-hitting-sets-for-polytopes-in-r-3-0802.2861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-set-cover-and-hitting-sets-for-polytopes-in-r-3-0802.2861"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-homology-classes-0802.2865</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-homology-classes-0802.2865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-homology-classes-0802.2865"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-in-place-reconfiguration-algorithm-for-sliding-cube-shaped-robots-in-a-quadratic-number-of-moves-0802.3414</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-in-place-reconfiguration-algorithm-for-sliding-cube-shaped-robots-in-a-quadratic-number-of-moves-0802.3414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-in-place-reconfiguration-algorithm-for-sliding-cube-shaped-robots-in-a-quadratic-number-of-moves-0802.3414"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-yao-yao-based-spanner-of-bounded-degree-0802.4325</loc><lastmod>2008-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-yao-yao-based-spanner-of-bounded-degree-0802.4325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-yao-yao-based-spanner-of-bounded-degree-0802.4325"/></url>
<url><loc>https://scifaro.com/en/abs/staged-self-assembly-nanomanufacture-of-arbitrary-shapes-with-o-1-glues-0803.0316</loc><lastmod>2008-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/staged-self-assembly-nanomanufacture-of-arbitrary-shapes-with-o-1-glues-0803.0316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/staged-self-assembly-nanomanufacture-of-arbitrary-shapes-with-o-1-glues-0803.0316"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-topology-of-the-restricted-delaunay-triangulation-and-witness-complex-in-higher-dimensions-0803.1296</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-topology-of-the-restricted-delaunay-triangulation-and-witness-complex-in-higher-dimensions-0803.1296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-topology-of-the-restricted-delaunay-triangulation-and-witness-complex-in-higher-dimensions-0803.1296"/></url>
<url><loc>https://scifaro.com/en/abs/spacetime-meshing-for-discontinuous-galerkin-methods-0804.0942</loc><lastmod>2008-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spacetime-meshing-for-discontinuous-galerkin-methods-0804.0942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spacetime-meshing-for-discontinuous-galerkin-methods-0804.0942"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-spacetime-meshing-with-nonlocal-cone-constraints-0804.0946</loc><lastmod>2008-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-spacetime-meshing-with-nonlocal-cone-constraints-0804.0946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-spacetime-meshing-with-nonlocal-cone-constraints-0804.0946"/></url>
<url><loc>https://scifaro.com/en/abs/cauchy-s-arm-lemma-on-a-growing-sphere-0804.0986</loc><lastmod>2008-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cauchy-s-arm-lemma-on-a-growing-sphere-0804.0986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cauchy-s-arm-lemma-on-a-growing-sphere-0804.0986"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-stretch-factor-of-convex-delaunay-graphs-0804.1041</loc><lastmod>2008-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-convex-delaunay-graphs-0804.1041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-convex-delaunay-graphs-0804.1041"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-the-area-of-a-3-coloured-disk-packing-0804.1173</loc><lastmod>2008-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-the-area-of-a-3-coloured-disk-packing-0804.1173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-the-area-of-a-3-coloured-disk-packing-0804.1173"/></url>
<url><loc>https://scifaro.com/en/abs/natural-pseudo-distance-and-optimal-matching-between-reduced-size-functions-0804.3500</loc><lastmod>2008-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-pseudo-distance-and-optimal-matching-between-reduced-size-functions-0804.3500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-pseudo-distance-and-optimal-matching-between-reduced-size-functions-0804.3500"/></url>
<url><loc>https://scifaro.com/en/abs/eppstein-s-bound-on-intersecting-triangles-revisited-0804.4415</loc><lastmod>2013-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eppstein-s-bound-on-intersecting-triangles-revisited-0804.4415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eppstein-s-bound-on-intersecting-triangles-revisited-0804.4415"/></url>
<url><loc>https://scifaro.com/en/abs/an-affine-invariant-time-dependent-triangulation-of-spatio-temporal-data-0804.4740</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-affine-invariant-time-dependent-triangulation-of-spatio-temporal-data-0804.4740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-affine-invariant-time-dependent-triangulation-of-spatio-temporal-data-0804.4740"/></url>
<url><loc>https://scifaro.com/en/abs/straight-skeletons-of-three-dimensional-polyhedra-0805.0022</loc><lastmod>2008-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straight-skeletons-of-three-dimensional-polyhedra-0805.0022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straight-skeletons-of-three-dimensional-polyhedra-0805.0022"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-of-triangular-meshes-in-shape-space-0805.0162</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-of-triangular-meshes-in-shape-space-0805.0162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-of-triangular-meshes-in-shape-space-0805.0162"/></url>
<url><loc>https://scifaro.com/en/abs/3d-building-model-fitting-using-a-new-kinetic-framework-0805.0648</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3d-building-model-fitting-using-a-new-kinetic-framework-0805.0648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3d-building-model-fitting-using-a-new-kinetic-framework-0805.0648"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-shortest-descending-paths-in-terrains-0805.1401</loc><lastmod>2008-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-shortest-descending-paths-in-terrains-0805.1401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-shortest-descending-paths-in-terrains-0805.1401"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-polygon-queries-on-the-plane-a-new-approach-0805.2681</loc><lastmod>2009-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-polygon-queries-on-the-plane-a-new-approach-0805.2681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-polygon-queries-on-the-plane-a-new-approach-0805.2681"/></url>
<url><loc>https://scifaro.com/en/abs/succinct-geometric-indexes-supporting-point-location-queries-0805.4147</loc><lastmod>2008-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/succinct-geometric-indexes-supporting-point-location-queries-0805.4147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/succinct-geometric-indexes-supporting-point-location-queries-0805.4147"/></url>
<url><loc>https://scifaro.com/en/abs/on-collinear-sets-in-straight-line-drawings-0806.0253</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-collinear-sets-in-straight-line-drawings-0806.0253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-collinear-sets-in-straight-line-drawings-0806.0253"/></url>
<url><loc>https://scifaro.com/en/abs/succinct-greedy-graph-drawing-in-the-hyperbolic-plane-0806.0341</loc><lastmod>2008-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/succinct-greedy-graph-drawing-in-the-hyperbolic-plane-0806.0341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/succinct-greedy-graph-drawing-in-the-hyperbolic-plane-0806.0341"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability-0806.0920</loc><lastmod>2010-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability-0806.0920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability-0806.0920"/></url>
<url><loc>https://scifaro.com/en/abs/steiner-trees-and-spanning-trees-in-six-pin-soap-films-0806.1340</loc><lastmod>2008-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steiner-trees-and-spanning-trees-in-six-pin-soap-films-0806.1340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steiner-trees-and-spanning-trees-in-six-pin-soap-films-0806.1340"/></url>
<url><loc>https://scifaro.com/en/abs/highway-hull-revisited-0806.1416</loc><lastmod>2009-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/highway-hull-revisited-0806.1416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/highway-hull-revisited-0806.1416"/></url>
<url><loc>https://scifaro.com/en/abs/the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-is-undecidable-0806.1602</loc><lastmod>2009-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-is-undecidable-0806.1602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-injectivity-of-the-global-function-of-a-cellular-automaton-in-the-hyperbolic-plane-is-undecidable-0806.1602"/></url>
<url><loc>https://scifaro.com/en/abs/self-overlapping-curves-revisited-0806.1724</loc><lastmod>2008-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-overlapping-curves-revisited-0806.1724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-overlapping-curves-revisited-0806.1724"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-theta-guarded-region-0806.2090</loc><lastmod>2008-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-theta-guarded-region-0806.2090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-theta-guarded-region-0806.2090"/></url>
<url><loc>https://scifaro.com/en/abs/triangulation-of-simple-3d-shapes-with-well-centered-tetrahedra-0806.2332</loc><lastmod>2008-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangulation-of-simple-3d-shapes-with-well-centered-tetrahedra-0806.2332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangulation-of-simple-3d-shapes-with-well-centered-tetrahedra-0806.2332"/></url>
<url><loc>https://scifaro.com/en/abs/existence-of-a-polyhedron-which-does-not-have-a-non-overlapping-pseudo-edge-unfolding-0806.2360</loc><lastmod>2008-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existence-of-a-polyhedron-which-does-not-have-a-non-overlapping-pseudo-edge-unfolding-0806.2360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existence-of-a-polyhedron-which-does-not-have-a-non-overlapping-pseudo-edge-unfolding-0806.2360"/></url>
<url><loc>https://scifaro.com/en/abs/biased-range-trees-0806.2707</loc><lastmod>2008-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biased-range-trees-0806.2707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biased-range-trees-0806.2707"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-the-vertex-centroid-of-a-polyhedron-0806.3456</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-the-vertex-centroid-of-a-polyhedron-0806.3456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-the-vertex-centroid-of-a-polyhedron-0806.3456"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-2d-euclidean-2-center-with-outliers-0806.4326</loc><lastmod>2008-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-2d-euclidean-2-center-with-outliers-0806.4326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-2d-euclidean-2-center-with-outliers-0806.4326"/></url>
<url><loc>https://scifaro.com/en/abs/locality-and-bounding-box-quality-of-two-dimensional-space-filling-curves-0806.4787</loc><lastmod>2008-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locality-and-bounding-box-quality-of-two-dimensional-space-filling-curves-0806.4787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locality-and-bounding-box-quality-of-two-dimensional-space-filling-curves-0806.4787"/></url>
<url><loc>https://scifaro.com/en/abs/on-stars-and-steiner-stars-ii-0806.4858</loc><lastmod>2008-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-stars-and-steiner-stars-ii-0806.4858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-stars-and-steiner-stars-ii-0806.4858"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-embedding-simplicial-complexes-in-r-d-0807.0336</loc><lastmod>2009-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-embedding-simplicial-complexes-in-r-d-0807.0336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-embedding-simplicial-complexes-in-r-d-0807.0336"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-of-multiple-coverings-into-more-parts-0807.0552</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-of-multiple-coverings-into-more-parts-0807.0552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-of-multiple-coverings-into-more-parts-0807.0552"/></url>
<url><loc>https://scifaro.com/en/abs/line-transversals-of-convex-polyhedra-in-reals-3-0807.1221</loc><lastmod>2008-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-transversals-of-convex-polyhedra-in-reals-3-0807.1221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-transversals-of-convex-polyhedra-in-reals-3-0807.1221"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-unit-squares-with-few-visibilities-0807.2178</loc><lastmod>2008-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-unit-squares-with-few-visibilities-0807.2178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-unit-squares-with-few-visibilities-0807.2178"/></url>
<url><loc>https://scifaro.com/en/abs/isometric-diamond-subgraphs-0807.2218</loc><lastmod>2008-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isometric-diamond-subgraphs-0807.2218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isometric-diamond-subgraphs-0807.2218"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-exploration-with-time-discrete-vision-0807.2358</loc><lastmod>2010-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-exploration-with-time-discrete-vision-0807.2358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-exploration-with-time-discrete-vision-0807.2358"/></url>
<url><loc>https://scifaro.com/en/abs/inapproximability-for-metric-embeddings-into-r-d-0807.2472</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inapproximability-for-metric-embeddings-into-r-d-0807.2472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inapproximability-for-metric-embeddings-into-r-d-0807.2472"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-planning-with-constraints-on-translational-distances-between-geometric-objects-0808.2931</loc><lastmod>2008-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-planning-with-constraints-on-translational-distances-between-geometric-objects-0808.2931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-planning-with-constraints-on-translational-distances-between-geometric-objects-0808.2931"/></url>
<url><loc>https://scifaro.com/en/abs/studying-geometric-graph-properties-of-road-networks-through-an-algorithmic-lens-0808.3694</loc><lastmod>2009-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/studying-geometric-graph-properties-of-road-networks-through-an-algorithmic-lens-0808.3694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/studying-geometric-graph-properties-of-road-networks-through-an-algorithmic-lens-0808.3694"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximations-for-guarding-1-5-dimensional-terrains-0809.0159</loc><lastmod>2008-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximations-for-guarding-1-5-dimensional-terrains-0809.0159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximations-for-guarding-1-5-dimensional-terrains-0809.0159"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-volume-of-unions-and-intersections-of-high-dimensional-geometric-objects-0809.0835</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-volume-of-unions-and-intersections-of-high-dimensional-geometric-objects-0809.0835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-volume-of-unions-and-intersections-of-high-dimensional-geometric-objects-0809.0835"/></url>
<url><loc>https://scifaro.com/en/abs/largest-empty-circle-centered-on-a-query-line-0809.2651</loc><lastmod>2010-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/largest-empty-circle-centered-on-a-query-line-0809.2651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/largest-empty-circle-centered-on-a-query-line-0809.2651"/></url>
<url><loc>https://scifaro.com/en/abs/communication-efficient-construction-of-the-plane-localized-delaunay-graph-0809.2956</loc><lastmod>2008-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communication-efficient-construction-of-the-plane-localized-delaunay-graph-0809.2956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communication-efficient-construction-of-the-plane-localized-delaunay-graph-0809.2956"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-graphs-with-convex-and-connected-configuration-spaces-0809.3935</loc><lastmod>2009-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-graphs-with-convex-and-connected-configuration-spaces-0809.3935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-graphs-with-convex-and-connected-configuration-spaces-0809.3935"/></url>
<url><loc>https://scifaro.com/en/abs/simulated-annealing-for-weighted-polygon-packing-0809.5005</loc><lastmod>2008-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulated-annealing-for-weighted-polygon-packing-0809.5005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulated-annealing-for-weighted-polygon-packing-0809.5005"/></url>
<url><loc>https://scifaro.com/en/abs/planar-visibility-counting-0810.0052</loc><lastmod>2009-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-visibility-counting-0810.0052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-visibility-counting-0810.0052"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-1-dof-henneberg-i-graphs-with-efficient-configuration-spaces-0810.1997</loc><lastmod>2008-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-1-dof-henneberg-i-graphs-with-efficient-configuration-spaces-0810.1997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-1-dof-henneberg-i-graphs-with-efficient-configuration-spaces-0810.1997"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithmic-techniques-for-several-multidimensional-geometric-data-management-and-analysis-problems-0810.4423</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithmic-techniques-for-several-multidimensional-geometric-data-management-and-analysis-problems-0810.4423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithmic-techniques-for-several-multidimensional-geometric-data-management-and-analysis-problems-0810.4423"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-graphs-of-zonohedra-0811.0254</loc><lastmod>2008-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-graphs-of-zonohedra-0811.0254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-graphs-of-zonohedra-0811.0254"/></url>
<url><loc>https://scifaro.com/en/abs/configuration-spaces-of-convex-and-embedded-polygons-in-the-plane-0811.1365</loc><lastmod>2008-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/configuration-spaces-of-convex-and-embedded-polygons-in-the-plane-0811.1365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/configuration-spaces-of-convex-and-embedded-polygons-in-the-plane-0811.1365"/></url>
<url><loc>https://scifaro.com/en/abs/necessary-conditions-for-discontinuities-of-multidimensional-size-functions-0811.1868</loc><lastmod>2009-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/necessary-conditions-for-discontinuities-of-multidimensional-size-functions-0811.1868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/necessary-conditions-for-discontinuities-of-multidimensional-size-functions-0811.1868"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-generation-of-the-axial-lines-of-urban-environments-to-capture-what-we-perceive-0811.4489</loc><lastmod>2013-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-generation-of-the-axial-lines-of-urban-environments-to-capture-what-we-perceive-0811.4489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-generation-of-the-axial-lines-of-urban-environments-to-capture-what-we-perceive-0811.4489"/></url>
<url><loc>https://scifaro.com/en/abs/zigzag-persistence-0812.0197</loc><lastmod>2008-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zigzag-persistence-0812.0197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zigzag-persistence-0812.0197"/></url>
<url><loc>https://scifaro.com/en/abs/k-means-requires-exponentially-many-iterations-even-in-the-plane-0812.0382</loc><lastmod>2008-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-means-requires-exponentially-many-iterations-even-in-the-plane-0812.0382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-means-requires-exponentially-many-iterations-even-in-the-plane-0812.0382"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-triangulations-in-linear-time-part-i-0812.0387</loc><lastmod>2009-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-triangulations-in-linear-time-part-i-0812.0387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-triangulations-in-linear-time-part-i-0812.0387"/></url>
<url><loc>https://scifaro.com/en/abs/dilation-smoothed-distance-and-minimization-diagrams-of-convex-functions-0812.0607</loc><lastmod>2010-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dilation-smoothed-distance-and-minimization-diagrams-of-convex-functions-0812.0607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dilation-smoothed-distance-and-minimization-diagrams-of-convex-functions-0812.0607"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-algorithms-for-geometric-graphs-with-sublinearly-many-edge-crossings-0812.0893</loc><lastmod>2010-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-algorithms-for-geometric-graphs-with-sublinearly-many-edge-crossings-0812.0893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-algorithms-for-geometric-graphs-with-sublinearly-many-edge-crossings-0812.0893"/></url>
<url><loc>https://scifaro.com/en/abs/stability-of-curvature-measures-0812.1390</loc><lastmod>2008-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-curvature-measures-0812.1390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-curvature-measures-0812.1390"/></url>
<url><loc>https://scifaro.com/en/abs/the-convex-hull-of-a-regular-set-of-integer-vectors-is-polyhedral-and-effectively-computable-0812.1951</loc><lastmod>2008-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-convex-hull-of-a-regular-set-of-integer-vectors-is-polyhedral-and-effectively-computable-0812.1951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-convex-hull-of-a-regular-set-of-integer-vectors-is-polyhedral-and-effectively-computable-0812.1951"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-convex-polyhedra-via-quasigeodesic-star-unfoldings-0812.2257</loc><lastmod>2008-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-convex-polyhedra-via-quasigeodesic-star-unfoldings-0812.2257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-convex-polyhedra-via-quasigeodesic-star-unfoldings-0812.2257"/></url>
<url><loc>https://scifaro.com/en/abs/shape-fitting-on-point-sets-with-probability-distributions-0812.2967</loc><lastmod>2008-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shape-fitting-on-point-sets-with-probability-distributions-0812.2967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shape-fitting-on-point-sets-with-probability-distributions-0812.2967"/></url>
<url><loc>https://scifaro.com/en/abs/chain-based-representations-for-solid-and-physical-modeling-0812.3249</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chain-based-representations-for-solid-and-physical-modeling-0812.3249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chain-based-representations-for-solid-and-physical-modeling-0812.3249"/></url>
<url><loc>https://scifaro.com/en/abs/succinct-greedy-geometric-routing-in-the-euclidean-plane-0812.3893</loc><lastmod>2009-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/succinct-greedy-geometric-routing-in-the-euclidean-plane-0812.3893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/succinct-greedy-geometric-routing-in-the-euclidean-plane-0812.3893"/></url>
<url><loc>https://scifaro.com/en/abs/a-pseudopolynomial-algorithm-for-alexandrov-s-theorem-0812.5030</loc><lastmod>2010-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-pseudopolynomial-algorithm-for-alexandrov-s-theorem-0812.5030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-pseudopolynomial-algorithm-for-alexandrov-s-theorem-0812.5030"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-carpenter-s-rule-theorem-for-self-touching-linkages-0901.1322</loc><lastmod>2009-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-carpenter-s-rule-theorem-for-self-touching-linkages-0901.1322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-carpenter-s-rule-theorem-for-self-touching-linkages-0901.1322"/></url>
<url><loc>https://scifaro.com/en/abs/entropy-triangulation-and-point-location-in-planar-subdivisions-0901.1908</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entropy-triangulation-and-point-location-in-planar-subdivisions-0901.1908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entropy-triangulation-and-point-location-in-planar-subdivisions-0901.1908"/></url>
<url><loc>https://scifaro.com/en/abs/area-universal-rectangular-layouts-0901.3924</loc><lastmod>2009-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/area-universal-rectangular-layouts-0901.3924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/area-universal-rectangular-layouts-0901.3924"/></url>
<url><loc>https://scifaro.com/en/abs/computing-k-centers-on-a-line-0902.3282</loc><lastmod>2009-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-k-centers-on-a-line-0902.3282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-k-centers-on-a-line-0902.3282"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-matching-of-planar-regions-0902.4337</loc><lastmod>2009-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-matching-of-planar-regions-0902.4337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-matching-of-planar-regions-0902.4337"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-marketing-mix-optimization-0903.0308</loc><lastmod>2009-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-marketing-mix-optimization-0903.0308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-marketing-mix-optimization-0903.0308"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-curves-from-points-and-tangents-0903.1817</loc><lastmod>2009-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-curves-from-points-and-tangents-0903.1817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-curves-from-points-and-tangents-0903.1817"/></url>
<url><loc>https://scifaro.com/en/abs/hyperbolic-voronoi-diagrams-made-easy-0903.3287</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperbolic-voronoi-diagrams-made-easy-0903.3287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperbolic-voronoi-diagrams-made-easy-0903.3287"/></url>
<url><loc>https://scifaro.com/en/abs/ambient-isotopic-meshing-of-implicit-algebraic-surface-with-singularities-0903.3524</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ambient-isotopic-meshing-of-implicit-algebraic-surface-with-singularities-0903.3524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ambient-isotopic-meshing-of-implicit-algebraic-surface-with-singularities-0903.3524"/></url>
<url><loc>https://scifaro.com/en/abs/multidimensional-online-robot-motion-0903.4696</loc><lastmod>2011-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multidimensional-online-robot-motion-0903.4696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multidimensional-online-robot-motion-0903.4696"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-necessary-and-sufficient-condition-of-greedy-routing-supporting-geographical-data-networks-0903.5208</loc><lastmod>2009-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-necessary-and-sufficient-condition-of-greedy-routing-supporting-geographical-data-networks-0903.5208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-necessary-and-sufficient-condition-of-greedy-routing-supporting-geographical-data-networks-0903.5208"/></url>
<url><loc>https://scifaro.com/en/abs/exact-join-detection-for-convex-polyhedra-and-other-numerical-abstractions-0904.1783</loc><lastmod>2009-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-join-detection-for-convex-polyhedra-and-other-numerical-abstractions-0904.1783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-join-detection-for-convex-polyhedra-and-other-numerical-abstractions-0904.1783"/></url>
<url><loc>https://scifaro.com/en/abs/colorful-strips-0904.2115</loc><lastmod>2011-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colorful-strips-0904.2115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colorful-strips-0904.2115"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-robust-ptas-for-minimum-clique-partition-in-unit-disk-graphs-0904.2203</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-robust-ptas-for-minimum-clique-partition-in-unit-disk-graphs-0904.2203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-robust-ptas-for-minimum-clique-partition-in-unit-disk-graphs-0904.2203"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-paths-on-3d-surfaces-survey-and-open-problems-0904.2550</loc><lastmod>2012-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-paths-on-3d-surfaces-survey-and-open-problems-0904.2550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-paths-on-3d-surfaces-survey-and-open-problems-0904.2550"/></url>
<url><loc>https://scifaro.com/en/abs/orientation-constrained-rectangular-layouts-0904.4312</loc><lastmod>2009-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orientation-constrained-rectangular-layouts-0904.4312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orientation-constrained-rectangular-layouts-0904.4312"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-coverings-and-the-planar-sensor-cover-problem-0905.1093</loc><lastmod>2009-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-coverings-and-the-planar-sensor-cover-problem-0905.1093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-coverings-and-the-planar-sensor-cover-problem-0905.1093"/></url>
<url><loc>https://scifaro.com/en/abs/on-lines-joints-and-incidences-in-three-dimensions-0905.1583</loc><lastmod>2009-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lines-joints-and-incidences-in-three-dimensions-0905.1583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lines-joints-and-incidences-in-three-dimensions-0905.1583"/></url>
<url><loc>https://scifaro.com/en/abs/summing-a-polynomial-function-over-integral-points-of-a-polygon-user-s-guide-0905.1820</loc><lastmod>2009-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/summing-a-polynomial-function-over-integral-points-of-a-polygon-user-s-guide-0905.1820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/summing-a-polynomial-function-over-integral-points-of-a-polygon-user-s-guide-0905.1820"/></url>
<url><loc>https://scifaro.com/en/abs/some-properties-of-yao-y4-subgraphs-0905.2249</loc><lastmod>2009-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-properties-of-yao-y4-subgraphs-0905.2249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-properties-of-yao-y4-subgraphs-0905.2249"/></url>
<url><loc>https://scifaro.com/en/abs/the-emergence-of-sparse-spanners-and-greedy-well-separated-pair-decomposition-0905.2605</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-emergence-of-sparse-spanners-and-greedy-well-separated-pair-decomposition-0905.2605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-emergence-of-sparse-spanners-and-greedy-well-separated-pair-decomposition-0905.2605"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expected-maximum-degree-of-gabriel-and-yao-graphs-0905.3584</loc><lastmod>2009-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expected-maximum-degree-of-gabriel-and-yao-graphs-0905.3584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expected-maximum-degree-of-gabriel-and-yao-graphs-0905.3584"/></url>
<url><loc>https://scifaro.com/en/abs/a-dihedral-acute-triangulation-of-the-cube-0905.3715</loc><lastmod>2009-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dihedral-acute-triangulation-of-the-cube-0905.3715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dihedral-acute-triangulation-of-the-cube-0905.3715"/></url>
<url><loc>https://scifaro.com/en/abs/the-convergence-of-bird-flocking-0905.4241</loc><lastmod>2009-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-convergence-of-bird-flocking-0905.4241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-convergence-of-bird-flocking-0905.4241"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-nearest-neighbor-queries-in-fixed-dimension-0905.4441</loc><lastmod>2014-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-nearest-neighbor-queries-in-fixed-dimension-0905.4441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-nearest-neighbor-queries-in-fixed-dimension-0905.4441"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-sum-of-square-roots-via-lattice-reduction-0905.4487</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-sum-of-square-roots-via-lattice-reduction-0905.4487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-sum-of-square-roots-via-lattice-reduction-0905.4487"/></url>
<url><loc>https://scifaro.com/en/abs/on-lines-and-joints-0906.0558</loc><lastmod>2009-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lines-and-joints-0906.0558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lines-and-joints-0906.0558"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-methods-for-counting-euclidean-embeddings-of-rigid-graphs-0906.1437</loc><lastmod>2009-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-methods-for-counting-euclidean-embeddings-of-rigid-graphs-0906.1437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-methods-for-counting-euclidean-embeddings-of-rigid-graphs-0906.1437"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-blooming-of-convex-polyhedra-0906.2461</loc><lastmod>2009-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-blooming-of-convex-polyhedra-0906.2461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-blooming-of-convex-polyhedra-0906.2461"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-two-dimensional-voronoi-diagrams-via-divide-and-conquer-of-envelopes-in-space-0906.2760</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-two-dimensional-voronoi-diagrams-via-divide-and-conquer-of-envelopes-in-space-0906.2760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-two-dimensional-voronoi-diagrams-via-divide-and-conquer-of-envelopes-in-space-0906.2760"/></url>
<url><loc>https://scifaro.com/en/abs/minkowski-sum-construction-and-other-applications-of-arrangements-of-geodesic-arcs-on-the-sphere-0906.3240</loc><lastmod>2009-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minkowski-sum-construction-and-other-applications-of-arrangements-of-geodesic-arcs-on-the-sphere-0906.3240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minkowski-sum-construction-and-other-applications-of-arrangements-of-geodesic-arcs-on-the-sphere-0906.3240"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-some-geometric-problems-in-unbounded-dimension-0906.3469</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-some-geometric-problems-in-unbounded-dimension-0906.3469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-some-geometric-problems-in-unbounded-dimension-0906.3469"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-tractability-and-lower-bounds-for-stabbing-problems-0906.3896</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-tractability-and-lower-bounds-for-stabbing-problems-0906.3896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-tractability-and-lower-bounds-for-stabbing-problems-0906.3896"/></url>
<url><loc>https://scifaro.com/en/abs/clarksons-algorithm-for-violator-spaces-0906.4706</loc><lastmod>2009-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clarksons-algorithm-for-violator-spaces-0906.4706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clarksons-algorithm-for-violator-spaces-0906.4706"/></url>
<url><loc>https://scifaro.com/en/abs/non-existence-of-pleated-folds-how-paper-folds-between-creases-0906.4747</loc><lastmod>2009-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-existence-of-pleated-folds-how-paper-folds-between-creases-0906.4747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-existence-of-pleated-folds-how-paper-folds-between-creases-0906.4747"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-incremental-construction-of-compressed-quadtrees-0907.0907</loc><lastmod>2009-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-incremental-construction-of-compressed-quadtrees-0907.0907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-incremental-construction-of-compressed-quadtrees-0907.0907"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-polynomial-time-approximation-schemes-for-target-tracking-0907.1080</loc><lastmod>2009-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-polynomial-time-approximation-schemes-for-target-tracking-0907.1080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-polynomial-time-approximation-schemes-for-target-tracking-0907.1080"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-spanning-trees-with-low-crossing-number-0907.1131</loc><lastmod>2009-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-spanning-trees-with-low-crossing-number-0907.1131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-spanning-trees-with-low-crossing-number-0907.1131"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-guarding-terrains-0907.1280</loc><lastmod>2009-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-guarding-terrains-0907.1280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-guarding-terrains-0907.1280"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-intrinsic-numerical-method-for-pde-on-surfaces-0907.1817</loc><lastmod>2009-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-intrinsic-numerical-method-for-pde-on-surfaces-0907.1817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-intrinsic-numerical-method-for-pde-on-surfaces-0907.1817"/></url>
<url><loc>https://scifaro.com/en/abs/computing-multidimensional-persistence-0907.2423</loc><lastmod>2010-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-multidimensional-persistence-0907.2423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-multidimensional-persistence-0907.2423"/></url>
<url><loc>https://scifaro.com/en/abs/gmap-drawing-graphs-as-maps-0907.2585</loc><lastmod>2009-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gmap-drawing-graphs-as-maps-0907.2585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gmap-drawing-graphs-as-maps-0907.2585"/></url>
<url><loc>https://scifaro.com/en/abs/cutting-a-convex-polyhedron-out-of-a-sphere-0907.4068</loc><lastmod>2010-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cutting-a-convex-polyhedron-out-of-a-sphere-0907.4068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cutting-a-convex-polyhedron-out-of-a-sphere-0907.4068"/></url>
<url><loc>https://scifaro.com/en/abs/iterative-pushdown-automata-and-hyperbolic-contour-words-0907.4957</loc><lastmod>2009-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterative-pushdown-automata-and-hyperbolic-contour-words-0907.4957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterative-pushdown-automata-and-hyperbolic-contour-words-0907.4957"/></url>
<url><loc>https://scifaro.com/en/abs/a-nonlinear-approach-to-dimension-reduction-0907.5477</loc><lastmod>2015-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-nonlinear-approach-to-dimension-reduction-0907.5477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-nonlinear-approach-to-dimension-reduction-0907.5477"/></url>
<url><loc>https://scifaro.com/en/abs/small-grid-embeddings-of-3-polytopes-0908.0488</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-grid-embeddings-of-3-polytopes-0908.0488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-grid-embeddings-of-3-polytopes-0908.0488"/></url>
<url><loc>https://scifaro.com/en/abs/planar-drawings-of-higher-genus-graphs-0908.1608</loc><lastmod>2009-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-drawings-of-higher-genus-graphs-0908.1608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-drawings-of-higher-genus-graphs-0908.1608"/></url>
<url><loc>https://scifaro.com/en/abs/being-fat-and-friendly-is-not-enough-0908.2369</loc><lastmod>2009-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/being-fat-and-friendly-is-not-enough-0908.2369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/being-fat-and-friendly-is-not-enough-0908.2369"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-3d-crystalline-robots-using-o-log-n-parallel-moves-0908.2440</loc><lastmod>2009-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-3d-crystalline-robots-using-o-log-n-parallel-moves-0908.2440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-3d-crystalline-robots-using-o-log-n-parallel-moves-0908.2440"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-all-regular-polygons-in-a-point-set-0908.2442</loc><lastmod>2009-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-all-regular-polygons-in-a-point-set-0908.2442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-all-regular-polygons-in-a-point-set-0908.2442"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-feature-size-preserving-decompositions-0908.2493</loc><lastmod>2009-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-feature-size-preserving-decompositions-0908.2493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-feature-size-preserving-decompositions-0908.2493"/></url>
<url><loc>https://scifaro.com/en/abs/carnival-of-samplings-nets-approximations-relative-and-sensitive-0908.3716</loc><lastmod>2009-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/carnival-of-samplings-nets-approximations-relative-and-sensitive-0908.3716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/carnival-of-samplings-nets-approximations-relative-and-sensitive-0908.3716"/></url>
<url><loc>https://scifaro.com/en/abs/spreading-grid-cells-0908.3911</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spreading-grid-cells-0908.3911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spreading-grid-cells-0908.3911"/></url>
<url><loc>https://scifaro.com/en/abs/graph-theoretic-solutions-to-computational-geometry-problems-0908.3916</loc><lastmod>2009-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-theoretic-solutions-to-computational-geometry-problems-0908.3916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-theoretic-solutions-to-computational-geometry-problems-0908.3916"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-planar-embeddability-of-trees-inside-simple-polygons-0908.4041</loc><lastmod>2009-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-planar-embeddability-of-trees-inside-simple-polygons-0908.4041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-planar-embeddability-of-trees-inside-simple-polygons-0908.4041"/></url>
<url><loc>https://scifaro.com/en/abs/semi-algebraic-range-reporting-and-emptiness-searching-with-applications-0908.4061</loc><lastmod>2009-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-algebraic-range-reporting-and-emptiness-searching-with-applications-0908.4061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-algebraic-range-reporting-and-emptiness-searching-with-applications-0908.4061"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-set-multi-cover-problem-in-geometric-settings-0909.0537</loc><lastmod>2009-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-set-multi-cover-problem-in-geometric-settings-0909.0537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-set-multi-cover-problem-in-geometric-settings-0909.0537"/></url>
<url><loc>https://scifaro.com/en/abs/relative-p-epsilon-approximations-in-geometry-0909.0717</loc><lastmod>2010-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-p-epsilon-approximations-in-geometry-0909.0717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-p-epsilon-approximations-in-geometry-0909.0717"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-spatial-skyline-points-0909.0814</loc><lastmod>2019-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-spatial-skyline-points-0909.0814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-spatial-skyline-points-0909.0814"/></url>
<url><loc>https://scifaro.com/en/abs/new-approximation-algorithms-for-minimum-enclosing-convex-shapes-0909.1062</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-approximation-algorithms-for-minimum-enclosing-convex-shapes-0909.1062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-approximation-algorithms-for-minimum-enclosing-convex-shapes-0909.1062"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-clique-partition-in-unit-disk-graphs-0909.1552</loc><lastmod>2009-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-clique-partition-in-unit-disk-graphs-0909.1552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-clique-partition-in-unit-disk-graphs-0909.1552"/></url>
<url><loc>https://scifaro.com/en/abs/optimally-fast-incremental-manhattan-plane-embedding-and-planar-tight-span-construction-0909.1866</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimally-fast-incremental-manhattan-plane-embedding-and-planar-tight-span-construction-0909.1866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimally-fast-incremental-manhattan-plane-embedding-and-planar-tight-span-construction-0909.1866"/></url>
<url><loc>https://scifaro.com/en/abs/navigation-in-tilings-of-the-hyperbolic-plane-and-possible-applications-0909.2157</loc><lastmod>2009-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/navigation-in-tilings-of-the-hyperbolic-plane-and-possible-applications-0909.2157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/navigation-in-tilings-of-the-hyperbolic-plane-and-possible-applications-0909.2157"/></url>
<url><loc>https://scifaro.com/en/abs/going-off-road-transversal-complexity-in-road-networks-0909.2891</loc><lastmod>2009-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/going-off-road-transversal-complexity-in-road-networks-0909.2891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/going-off-road-transversal-complexity-in-road-networks-0909.2891"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-largest-empty-axis-parallel-box-amidst-n-points-0909.3127</loc><lastmod>2009-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-largest-empty-axis-parallel-box-amidst-n-points-0909.3127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-largest-empty-axis-parallel-box-amidst-n-points-0909.3127"/></url>
<url><loc>https://scifaro.com/en/abs/succinct-representation-of-well-spaced-point-clouds-0909.3137</loc><lastmod>2009-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/succinct-representation-of-well-spaced-point-clouds-0909.3137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/succinct-representation-of-well-spaced-point-clouds-0909.3137"/></url>
<url><loc>https://scifaro.com/en/abs/on-low-distortion-embeddings-of-statistical-distance-measures-into-low-dimensional-spaces-0909.3169</loc><lastmod>2010-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-low-distortion-embeddings-of-statistical-distance-measures-into-low-dimensional-spaces-0909.3169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-low-distortion-embeddings-of-statistical-distance-measures-into-low-dimensional-spaces-0909.3169"/></url>
<url><loc>https://scifaro.com/en/abs/long-non-crossing-configurations-in-the-plane-0909.4094</loc><lastmod>2010-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/long-non-crossing-configurations-in-the-plane-0909.4094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/long-non-crossing-configurations-in-the-plane-0909.4094"/></url>
<url><loc>https://scifaro.com/en/abs/the-directed-hausdorff-distance-between-imprecise-point-sets-0909.4642</loc><lastmod>2009-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-directed-hausdorff-distance-between-imprecise-point-sets-0909.4642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-directed-hausdorff-distance-between-imprecise-point-sets-0909.4642"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-crease-pattern-for-folding-orthogonal-shapes-0909.5388</loc><lastmod>2009-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-crease-pattern-for-folding-orthogonal-shapes-0909.5388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-crease-pattern-for-folding-orthogonal-shapes-0909.5388"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-loops-in-a-shortest-homology-basis-from-point-data-0909.5654</loc><lastmod>2009-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-loops-in-a-shortest-homology-basis-from-point-data-0909.5654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-loops-in-a-shortest-homology-basis-from-point-data-0909.5654"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-ordinary-or-monochromatic-intersection-points-0910.0286</loc><lastmod>2009-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-ordinary-or-monochromatic-intersection-points-0910.0286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-ordinary-or-monochromatic-intersection-points-0910.0286"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-into-the-rectilinear-plane-in-optimal-o-n-2-0910.1059</loc><lastmod>2011-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-into-the-rectilinear-plane-in-optimal-o-n-2-0910.1059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-into-the-rectilinear-plane-in-optimal-o-n-2-0910.1059"/></url>
<url><loc>https://scifaro.com/en/abs/covering-points-by-disjoint-boxes-with-outliers-0910.1643</loc><lastmod>2010-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-points-by-disjoint-boxes-with-outliers-0910.1643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-points-by-disjoint-boxes-with-outliers-0910.1643"/></url>
<url><loc>https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0910.1923</loc><lastmod>2009-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0910.1923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-the-halfspace-depth-problem-0910.1923"/></url>
<url><loc>https://scifaro.com/en/abs/complementary-space-for-enhanced-uncertainty-and-dynamics-visualization-0910.4084</loc><lastmod>2009-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complementary-space-for-enhanced-uncertainty-and-dynamics-visualization-0910.4084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complementary-space-for-enhanced-uncertainty-and-dynamics-visualization-0910.4084"/></url>
<url><loc>https://scifaro.com/en/abs/digital-curvatures-applied-to-3d-object-analysis-and-recognition-a-case-study-0910.4144</loc><lastmod>2009-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digital-curvatures-applied-to-3d-object-analysis-and-recognition-a-case-study-0910.4144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digital-curvatures-applied-to-3d-object-analysis-and-recognition-a-case-study-0910.4144"/></url>
<url><loc>https://scifaro.com/en/abs/piercing-translates-and-homothets-of-a-convex-body-0910.4172</loc><lastmod>2009-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/piercing-translates-and-homothets-of-a-convex-body-0910.4172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/piercing-translates-and-homothets-of-a-convex-body-0910.4172"/></url>
<url><loc>https://scifaro.com/en/abs/topological-de-noising-strengthening-the-topological-signal-0910.5947</loc><lastmod>2016-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-de-noising-strengthening-the-topological-signal-0910.5947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-de-noising-strengthening-the-topological-signal-0910.5947"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-transversality-by-measuring-the-robustness-of-intersections-0911.2142</loc><lastmod>2010-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-transversality-by-measuring-the-robustness-of-intersections-0911.2142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-transversality-by-measuring-the-robustness-of-intersections-0911.2142"/></url>
<url><loc>https://scifaro.com/en/abs/memoryless-routing-in-convex-subdivisions-random-walks-are-optimal-0911.2484</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memoryless-routing-in-convex-subdivisions-random-walks-are-optimal-0911.2484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memoryless-routing-in-convex-subdivisions-random-walks-are-optimal-0911.2484"/></url>
<url><loc>https://scifaro.com/en/abs/about-a-new-splitting-for-the-algorithmic-study-of-the-tilings-p-q-of-the-hyperbolic-plane-when-q-is-odd-0911.4040</loc><lastmod>2009-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-a-new-splitting-for-the-algorithmic-study-of-the-tilings-p-q-of-the-hyperbolic-plane-when-q-is-odd-0911.4040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-a-new-splitting-for-the-algorithmic-study-of-the-tilings-p-q-of-the-hyperbolic-plane-when-q-is-odd-0911.4040"/></url>
<url><loc>https://scifaro.com/en/abs/on-convexification-of-polygons-by-pops-0911.4146</loc><lastmod>2009-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-convexification-of-polygons-by-pops-0911.4146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-convexification-of-polygons-by-pops-0911.4146"/></url>
<url><loc>https://scifaro.com/en/abs/automated-proofs-in-geometry-computing-upper-bounds-for-the-heilbronn-problem-for-triangles-0911.4375</loc><lastmod>2010-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-proofs-in-geometry-computing-upper-bounds-for-the-heilbronn-problem-for-triangles-0911.4375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-proofs-in-geometry-computing-upper-bounds-for-the-heilbronn-problem-for-triangles-0911.4375"/></url>
<url><loc>https://scifaro.com/en/abs/querying-two-boundary-points-for-shortest-paths-in-a-polygonal-domain-0911.5017</loc><lastmod>2009-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-two-boundary-points-for-shortest-paths-in-a-polygonal-domain-0911.5017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-two-boundary-points-for-shortest-paths-in-a-polygonal-domain-0911.5017"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hulls-of-spheres-and-convex-hulls-of-convex-polytopes-lying-on-parallel-hyperplanes-0911.5086</loc><lastmod>2011-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hulls-of-spheres-and-convex-hulls-of-convex-polytopes-lying-on-parallel-hyperplanes-0911.5086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hulls-of-spheres-and-convex-hulls-of-convex-polytopes-lying-on-parallel-hyperplanes-0911.5086"/></url>
<url><loc>https://scifaro.com/en/abs/steinitz-theorems-for-orthogonal-polyhedra-0912.0537</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steinitz-theorems-for-orthogonal-polyhedra-0912.0537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steinitz-theorems-for-orthogonal-polyhedra-0912.0537"/></url>
<url><loc>https://scifaro.com/en/abs/computing-hulls-and-centerpoints-in-positive-definite-space-0912.1580</loc><lastmod>2009-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-hulls-and-centerpoints-in-positive-definite-space-0912.1580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-hulls-and-centerpoints-in-positive-definite-space-0912.1580"/></url>
<url><loc>https://scifaro.com/en/abs/dispersion-in-disks-0912.2125</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dispersion-in-disks-0912.2125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dispersion-in-disks-0912.2125"/></url>
<url><loc>https://scifaro.com/en/abs/zone-diagrams-in-euclidean-spaces-and-in-other-normed-spaces-0912.3016</loc><lastmod>2013-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zone-diagrams-in-euclidean-spaces-and-in-other-normed-spaces-0912.3016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zone-diagrams-in-euclidean-spaces-and-in-other-normed-spaces-0912.3016"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-and-combinatorial-properties-of-well-centered-triangulations-in-three-and-higher-dimensions-0912.3097</loc><lastmod>2009-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-and-combinatorial-properties-of-well-centered-triangulations-in-three-and-higher-dimensions-0912.3097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-and-combinatorial-properties-of-well-centered-triangulations-in-three-and-higher-dimensions-0912.3097"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-layout-implementation-using-centroidal-voronoi-tessellations-0912.3974</loc><lastmod>2009-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-layout-implementation-using-centroidal-voronoi-tessellations-0912.3974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-layout-implementation-using-centroidal-voronoi-tessellations-0912.3974"/></url>
<url><loc>https://scifaro.com/en/abs/distance-k-sectors-exist-0912.4164</loc><lastmod>2010-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-k-sectors-exist-0912.4164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-k-sectors-exist-0912.4164"/></url>
<url><loc>https://scifaro.com/en/abs/the-traveling-salesman-problem-under-squared-euclidean-distances-1001.0236</loc><lastmod>2010-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-traveling-salesman-problem-under-squared-euclidean-distances-1001.0236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-traveling-salesman-problem-under-squared-euclidean-distances-1001.0236"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-tree-and-a-path-with-no-geometric-simultaneous-embedding-1001.0555</loc><lastmod>2010-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-tree-and-a-path-with-no-geometric-simultaneous-embedding-1001.0555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-tree-and-a-path-with-no-geometric-simultaneous-embedding-1001.0555"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-distributions-and-shapes-using-the-kernel-distance-1001.0591</loc><lastmod>2011-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-distributions-and-shapes-using-the-kernel-distance-1001.0591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-distributions-and-shapes-using-the-kernel-distance-1001.0591"/></url>
<url><loc>https://scifaro.com/en/abs/the-geodesic-diameter-of-polygonal-domains-1001.0695</loc><lastmod>2012-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geodesic-diameter-of-polygonal-domains-1001.0695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geodesic-diameter-of-polygonal-domains-1001.0695"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-deterministic-rendezvous-in-bounded-terrains-1001.0889</loc><lastmod>2015-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-deterministic-rendezvous-in-bounded-terrains-1001.0889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-deterministic-rendezvous-in-bounded-terrains-1001.0889"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-topological-simplification-of-discrete-functions-on-surfaces-1001.1269</loc><lastmod>2015-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-topological-simplification-of-discrete-functions-on-surfaces-1001.1269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-topological-simplification-of-discrete-functions-on-surfaces-1001.1269"/></url>
<url><loc>https://scifaro.com/en/abs/multidimensional-data-structures-and-techniques-for-efficient-decision-making-1001.1454</loc><lastmod>2010-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multidimensional-data-structures-and-techniques-for-efficient-decision-making-1001.1454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multidimensional-data-structures-and-techniques-for-efficient-decision-making-1001.1454"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-boundedness-of-an-iteration-involving-points-on-the-hypersphere-1001.1624</loc><lastmod>2013-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-boundedness-of-an-iteration-involving-points-on-the-hypersphere-1001.1624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-boundedness-of-an-iteration-involving-points-on-the-hypersphere-1001.1624"/></url>
<url><loc>https://scifaro.com/en/abs/planar-visibility-testing-and-counting-1001.2734</loc><lastmod>2010-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-visibility-testing-and-counting-1001.2734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-visibility-testing-and-counting-1001.2734"/></url>
<url><loc>https://scifaro.com/en/abs/point-location-in-disconnected-planar-subdivisions-1001.2763</loc><lastmod>2010-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-location-in-disconnected-planar-subdivisions-1001.2763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-location-in-disconnected-planar-subdivisions-1001.2763"/></url>
<url><loc>https://scifaro.com/en/abs/pi-2-angle-yao-graphs-are-spanners-1001.2913</loc><lastmod>2012-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pi-2-angle-yao-graphs-are-spanners-1001.2913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pi-2-angle-yao-graphs-are-spanners-1001.2913"/></url>
<url><loc>https://scifaro.com/en/abs/farthest-polygon-voronoi-diagrams-1001.3593</loc><lastmod>2010-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/farthest-polygon-voronoi-diagrams-1001.3593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/farthest-polygon-voronoi-diagrams-1001.3593"/></url>
<url><loc>https://scifaro.com/en/abs/the-tropical-double-description-method-1001.4119</loc><lastmod>2011-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tropical-double-description-method-1001.4119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tropical-double-description-method-1001.4119"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-for-guarding-simple-galleries-from-the-perimeter-1001.4231</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-for-guarding-simple-galleries-from-the-perimeter-1001.4231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-for-guarding-simple-galleries-from-the-perimeter-1001.4231"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-bound-on-the-number-of-unit-area-triangles-1001.4764</loc><lastmod>2010-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-bound-on-the-number-of-unit-area-triangles-1001.4764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-bound-on-the-number-of-unit-area-triangles-1001.4764"/></url>
<url><loc>https://scifaro.com/en/abs/maximal-f-vectors-of-minkowski-sums-of-large-numbers-of-polytopes-1002.0155</loc><lastmod>2010-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximal-f-vectors-of-minkowski-sums-of-large-numbers-of-polytopes-1002.0155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximal-f-vectors-of-minkowski-sums-of-large-numbers-of-polytopes-1002.0155"/></url>
<url><loc>https://scifaro.com/en/abs/odds-on-trees-1002.1092</loc><lastmod>2010-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/odds-on-trees-1002.1092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/odds-on-trees-1002.1092"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-tilings-and-space-filling-curves-with-little-fragmentation-1002.1843</loc><lastmod>2010-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-tilings-and-space-filling-curves-with-little-fragmentation-1002.1843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-tilings-and-space-filling-curves-with-little-fragmentation-1002.1843"/></url>
<url><loc>https://scifaro.com/en/abs/persistence-diagrams-and-the-heat-equation-homotopy-1002.1937</loc><lastmod>2010-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistence-diagrams-and-the-heat-equation-homotopy-1002.1937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistence-diagrams-and-the-heat-equation-homotopy-1002.1937"/></url>
<url><loc>https://scifaro.com/en/abs/removing-local-extrema-from-imprecise-terrains-1002.2580</loc><lastmod>2011-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/removing-local-extrema-from-imprecise-terrains-1002.2580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/removing-local-extrema-from-imprecise-terrains-1002.2580"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-higher-order-delaunay-triangulations-1002.4364</loc><lastmod>2010-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-higher-order-delaunay-triangulations-1002.4364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-higher-order-delaunay-triangulations-1002.4364"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-fr-echet-distance-for-realistic-curves-in-near-linear-time-1003.0460</loc><lastmod>2012-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-fr-echet-distance-for-realistic-curves-in-near-linear-time-1003.0460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-fr-echet-distance-for-realistic-curves-in-near-linear-time-1003.0460"/></url>
<url><loc>https://scifaro.com/en/abs/randomly-removing-g-handles-at-once-1003.1426</loc><lastmod>2010-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomly-removing-g-handles-at-once-1003.1426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomly-removing-g-handles-at-once-1003.1426"/></url>
<url><loc>https://scifaro.com/en/abs/flattening-single-vertex-origami-the-non-expansive-case-1003.3490</loc><lastmod>2010-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flattening-single-vertex-origami-the-non-expansive-case-1003.3490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flattening-single-vertex-origami-the-non-expansive-case-1003.3490"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-reconstruction-from-point-normal-data-1003.3499</loc><lastmod>2010-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-reconstruction-from-point-normal-data-1003.3499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-reconstruction-from-point-normal-data-1003.3499"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-fewest-turn-map-directions-based-on-the-connectivity-of-natural-roads-1003.3536</loc><lastmod>2013-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-fewest-turn-map-directions-based-on-the-connectivity-of-natural-roads-1003.3536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-fewest-turn-map-directions-based-on-the-connectivity-of-natural-roads-1003.3536"/></url>
<url><loc>https://scifaro.com/en/abs/the-yao-graph-y-6-is-a-spanner-1003.3713</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-yao-graph-y-6-is-a-spanner-1003.3713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-yao-graph-y-6-is-a-spanner-1003.3713"/></url>
<url><loc>https://scifaro.com/en/abs/stability-of-reeb-graphs-under-function-perturbations-the-case-of-closed-curves-1003.4610</loc><lastmod>2010-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-reeb-graphs-under-function-perturbations-the-case-of-closed-curves-1003.4610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-reeb-graphs-under-function-perturbations-the-case-of-closed-curves-1003.4610"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-degree-planar-geometric-spanners-1003.4963</loc><lastmod>2010-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-degree-planar-geometric-spanners-1003.4963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-degree-planar-geometric-spanners-1003.4963"/></url>
<url><loc>https://scifaro.com/en/abs/stability-of-epsilon-kernels-1003.5874</loc><lastmod>2010-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-epsilon-kernels-1003.5874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-epsilon-kernels-1003.5874"/></url>
<url><loc>https://scifaro.com/en/abs/querying-for-the-largest-empty-geometric-object-in-a-desired-location-1004.0558</loc><lastmod>2010-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-for-the-largest-empty-geometric-object-in-a-desired-location-1004.0558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-for-the-largest-empty-geometric-object-in-a-desired-location-1004.0558"/></url>
<url><loc>https://scifaro.com/en/abs/patrolling-a-street-network-is-strongly-np-complete-but-in-p-for-tree-structures-1004.0744</loc><lastmod>2015-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patrolling-a-street-network-is-strongly-np-complete-but-in-p-for-tree-structures-1004.0744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patrolling-a-street-network-is-strongly-np-complete-but-in-p-for-tree-structures-1004.0744"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-point-to-face-shortest-paths-in-r-3-1004.1588</loc><lastmod>2010-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-point-to-face-shortest-paths-in-r-3-1004.1588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-point-to-face-shortest-paths-in-r-3-1004.1588"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-stochastic-planarization-1004.1666</loc><lastmod>2010-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-stochastic-planarization-1004.1666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-stochastic-planarization-1004.1666"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-analysis-of-balloon-drawing-for-rooted-trees-1004.2338</loc><lastmod>2010-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-analysis-of-balloon-drawing-for-rooted-trees-1004.2338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-analysis-of-balloon-drawing-for-rooted-trees-1004.2338"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-dominating-set-in-disk-graphs-1004.3320</loc><lastmod>2010-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-dominating-set-in-disk-graphs-1004.3320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-dominating-set-in-disk-graphs-1004.3320"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-bounds-on-the-slicing-number-1004.3381</loc><lastmod>2010-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-bounds-on-the-slicing-number-1004.3381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-bounds-on-the-slicing-number-1004.3381"/></url>
<url><loc>https://scifaro.com/en/abs/convergent-discrete-laplace-beltrami-operators-over-surfaces-1004.3486</loc><lastmod>2010-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergent-discrete-laplace-beltrami-operators-over-surfaces-1004.3486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergent-discrete-laplace-beltrami-operators-over-surfaces-1004.3486"/></url>
<url><loc>https://scifaro.com/en/abs/fr-echet-distance-problems-in-weighted-regions-1004.4901</loc><lastmod>2010-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-echet-distance-problems-in-weighted-regions-1004.4901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-echet-distance-problems-in-weighted-regions-1004.4901"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-manhattan-network-problem-in-normed-planes-with-polygonal-balls-a-factor-2-5-approximation-algorithm-1004.5517</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-manhattan-network-problem-in-normed-planes-with-polygonal-balls-a-factor-2-5-approximation-algorithm-1004.5517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-manhattan-network-problem-in-normed-planes-with-polygonal-balls-a-factor-2-5-approximation-algorithm-1004.5517"/></url>
<url><loc>https://scifaro.com/en/abs/using-smith-normal-forms-and-mu-bases-to-compute-all-the-singularities-of-rational-planar-curves-1005.0085</loc><lastmod>2010-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-smith-normal-forms-and-mu-bases-to-compute-all-the-singularities-of-rational-planar-curves-1005.0085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-smith-normal-forms-and-mu-bases-to-compute-all-the-singularities-of-rational-planar-curves-1005.0085"/></url>
<url><loc>https://scifaro.com/en/abs/a-kinetic-triangulation-scheme-for-moving-points-in-the-plane-1005.0912</loc><lastmod>2010-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-kinetic-triangulation-scheme-for-moving-points-in-the-plane-1005.0912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-kinetic-triangulation-scheme-for-moving-points-in-the-plane-1005.0912"/></url>
<url><loc>https://scifaro.com/en/abs/no-embedding-of-the-automorphisms-of-a-topological-space-into-a-compact-metric-space-endows-them-with-a-composition-that-passes-to-the-limit-1005.0921</loc><lastmod>2010-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-embedding-of-the-automorphisms-of-a-topological-space-into-a-compact-metric-space-endows-them-with-a-composition-that-passes-to-the-limit-1005.0921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-embedding-of-the-automorphisms-of-a-topological-space-into-a-compact-metric-space-endows-them-with-a-composition-that-passes-to-the-limit-1005.0921"/></url>
<url><loc>https://scifaro.com/en/abs/incidences-in-three-dimensions-and-distinct-distances-in-the-plane-1005.0982</loc><lastmod>2010-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incidences-in-three-dimensions-and-distinct-distances-in-the-plane-1005.0982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incidences-in-three-dimensions-and-distinct-distances-in-the-plane-1005.0982"/></url>
<url><loc>https://scifaro.com/en/abs/opaque-sets-1005.2218</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/opaque-sets-1005.2218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/opaque-sets-1005.2218"/></url>
<url><loc>https://scifaro.com/en/abs/surface-parametrization-of-nonsimply-connected-planar-b-ezier-regions-1005.2822</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-parametrization-of-nonsimply-connected-planar-b-ezier-regions-1005.2822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-parametrization-of-nonsimply-connected-planar-b-ezier-regions-1005.2822"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-time-construction-of-euclidean-sparse-spanners-with-tiny-diameter-1005.4155</loc><lastmod>2011-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-time-construction-of-euclidean-sparse-spanners-with-tiny-diameter-1005.4155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-time-construction-of-euclidean-sparse-spanners-with-tiny-diameter-1005.4155"/></url>
<url><loc>https://scifaro.com/en/abs/simple-wriggling-is-hard-unless-you-are-a-fat-hippo-1005.5413</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-wriggling-is-hard-unless-you-are-a-fat-hippo-1005.5413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-wriggling-is-hard-unless-you-are-a-fat-hippo-1005.5413"/></url>
<url><loc>https://scifaro.com/en/abs/the-dilation-of-the-delaunay-triangulation-is-greater-than-pi-2-1006.0291</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dilation-of-the-delaunay-triangulation-is-greater-than-pi-2-1006.0291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dilation-of-the-delaunay-triangulation-is-greater-than-pi-2-1006.0291"/></url>
<url><loc>https://scifaro.com/en/abs/body-and-cad-geometric-constraint-systems-1006.1126</loc><lastmod>2010-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/body-and-cad-geometric-constraint-systems-1006.1126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/body-and-cad-geometric-constraint-systems-1006.1126"/></url>
<url><loc>https://scifaro.com/en/abs/cloning-voronoi-diagrams-via-retroactive-data-structures-1006.1921</loc><lastmod>2010-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cloning-voronoi-diagrams-via-retroactive-data-structures-1006.1921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cloning-voronoi-diagrams-via-retroactive-data-structures-1006.1921"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-diameter-of-a-polygonal-domain-in-o-n-4-log-n-time-1006.1998</loc><lastmod>2011-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-diameter-of-a-polygonal-domain-in-o-n-4-log-n-time-1006.1998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-diameter-of-a-polygonal-domain-in-o-n-4-log-n-time-1006.1998"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithm-for-line-segment-coverage-for-wireless-sensor-network-1006.2955</loc><lastmod>2017-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithm-for-line-segment-coverage-for-wireless-sensor-network-1006.2955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithm-for-line-segment-coverage-for-wireless-sensor-network-1006.2955"/></url>
<url><loc>https://scifaro.com/en/abs/regular-labelings-and-geometric-structures-1007.0221</loc><lastmod>2010-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-labelings-and-geometric-structures-1007.0221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-labelings-and-geometric-structures-1007.0221"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-sum-dipolar-spanning-tree-in-r-3-1007.1222</loc><lastmod>2010-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-sum-dipolar-spanning-tree-in-r-3-1007.1222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-sum-dipolar-spanning-tree-in-r-3-1007.1222"/></url>
<url><loc>https://scifaro.com/en/abs/on-flat-polyhedra-deriving-from-alexandrov-s-theorem-1007.2016</loc><lastmod>2015-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-flat-polyhedra-deriving-from-alexandrov-s-theorem-1007.2016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-flat-polyhedra-deriving-from-alexandrov-s-theorem-1007.2016"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-bound-on-the-maximum-interference-of-random-sensors-in-the-highway-model-1007.2120</loc><lastmod>2010-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-bound-on-the-maximum-interference-of-random-sensors-in-the-highway-model-1007.2120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-bound-on-the-maximum-interference-of-random-sensors-in-the-highway-model-1007.2120"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-tomography-with-topological-guarantees-1007.2452</loc><lastmod>2015-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-tomography-with-topological-guarantees-1007.2452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-tomography-with-topological-guarantees-1007.2452"/></url>
<url><loc>https://scifaro.com/en/abs/polyominoes-and-polyiamonds-as-fundamental-domains-of-isohedral-tilings-with-rotational-symmetry-1007.2460</loc><lastmod>2012-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyominoes-and-polyiamonds-as-fundamental-domains-of-isohedral-tilings-with-rotational-symmetry-1007.2460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyominoes-and-polyiamonds-as-fundamental-domains-of-isohedral-tilings-with-rotational-symmetry-1007.2460"/></url>
<url><loc>https://scifaro.com/en/abs/on-folding-a-polygon-to-a-polyhedron-1007.3181</loc><lastmod>2010-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-folding-a-polygon-to-a-polyhedron-1007.3181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-folding-a-polygon-to-a-polyhedron-1007.3181"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-geometric-permutations-1007.3244</loc><lastmod>2010-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-geometric-permutations-1007.3244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-geometric-permutations-1007.3244"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-low-dimensional-queries-1007.3296</loc><lastmod>2012-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-low-dimensional-queries-1007.3296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-low-dimensional-queries-1007.3296"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-convex-polygons-1007.3607</loc><lastmod>2010-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-convex-polygons-1007.3607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-convex-polygons-1007.3607"/></url>
<url><loc>https://scifaro.com/en/abs/witness-gabriel-graphs-1008.1051</loc><lastmod>2010-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witness-gabriel-graphs-1008.1051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witness-gabriel-graphs-1008.1051"/></url>
<url><loc>https://scifaro.com/en/abs/witness-delaunay-graphs-1008.1053</loc><lastmod>2010-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witness-delaunay-graphs-1008.1053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witness-delaunay-graphs-1008.1053"/></url>
<url><loc>https://scifaro.com/en/abs/circle-packing-for-origami-design-is-hard-1008.1224</loc><lastmod>2010-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circle-packing-for-origami-design-is-hard-1008.1224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circle-packing-for-origami-design-is-hard-1008.1224"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-over-geodesics-for-exact-principal-geodesic-analysis-1008.1902</loc><lastmod>2013-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-over-geodesics-for-exact-principal-geodesic-analysis-1008.1902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-over-geodesics-for-exact-principal-geodesic-analysis-1008.1902"/></url>
<url><loc>https://scifaro.com/en/abs/proximity-drawings-of-high-degree-trees-1008.3193</loc><lastmod>2015-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proximity-drawings-of-high-degree-trees-1008.3193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proximity-drawings-of-high-degree-trees-1008.3193"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-of-graphs-induced-by-directional-antennas-1008.3889</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-of-graphs-induced-by-directional-antennas-1008.3889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-of-graphs-induced-by-directional-antennas-1008.3889"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-by-paths-of-bounded-curvature-in-a-convex-polygon-1008.4244</loc><lastmod>2010-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-by-paths-of-bounded-curvature-in-a-convex-polygon-1008.4244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-by-paths-of-bounded-curvature-in-a-convex-polygon-1008.4244"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-3d-angular-resolution-for-low-degree-graphs-1009.0045</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-3d-angular-resolution-for-low-degree-graphs-1009.0045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-3d-angular-resolution-for-low-degree-graphs-1009.0045"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-graphs-in-the-plane-with-a-prescribed-outer-face-and-polynomial-area-1009.0088</loc><lastmod>2012-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-graphs-in-the-plane-with-a-prescribed-outer-face-and-polynomial-area-1009.0088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-graphs-in-the-plane-with-a-prescribed-outer-face-and-polynomial-area-1009.0088"/></url>
<url><loc>https://scifaro.com/en/abs/lombardi-drawings-of-graphs-1009.0579</loc><lastmod>2011-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lombardi-drawings-of-graphs-1009.0579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lombardi-drawings-of-graphs-1009.0579"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-1009.0581</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-1009.0581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-trees-with-perfect-angular-resolution-and-polynomial-area-1009.0581"/></url>
<url><loc>https://scifaro.com/en/abs/layered-depth-normal-images-a-sparse-implicit-representation-of-solid-models-1009.0794</loc><lastmod>2010-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layered-depth-normal-images-a-sparse-implicit-representation-of-solid-models-1009.0794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layered-depth-normal-images-a-sparse-implicit-representation-of-solid-models-1009.0794"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-semimagic-squares-for-digital-halftoning-1009.1373</loc><lastmod>2013-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-semimagic-squares-for-digital-halftoning-1009.1373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-semimagic-squares-for-digital-halftoning-1009.1373"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-simple-arrangements-of-five-double-pseudolines-1009.1575</loc><lastmod>2011-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-simple-arrangements-of-five-double-pseudolines-1009.1575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-simple-arrangements-of-five-double-pseudolines-1009.1575"/></url>
<url><loc>https://scifaro.com/en/abs/fat-polygonal-partitions-with-applications-to-visualization-and-embeddings-1009.1866</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fat-polygonal-partitions-with-applications-to-visualization-and-embeddings-1009.1866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fat-polygonal-partitions-with-applications-to-visualization-and-embeddings-1009.1866"/></url>
<url><loc>https://scifaro.com/en/abs/privacy-preserving-data-oblivious-geometric-algorithms-for-geographic-data-1009.1904</loc><lastmod>2010-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/privacy-preserving-data-oblivious-geometric-algorithms-for-geographic-data-1009.1904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/privacy-preserving-data-oblivious-geometric-algorithms-for-geographic-data-1009.1904"/></url>
<url><loc>https://scifaro.com/en/abs/on-unit-distances-in-a-convex-polygon-1009.2216</loc><lastmod>2014-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-unit-distances-in-a-convex-polygon-1009.2216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-unit-distances-in-a-convex-polygon-1009.2216"/></url>
<url><loc>https://scifaro.com/en/abs/on-isosceles-triangles-and-related-problems-in-a-convex-polygon-1009.2218</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-isosceles-triangles-and-related-problems-in-a-convex-polygon-1009.2218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-isosceles-triangles-and-related-problems-in-a-convex-polygon-1009.2218"/></url>
<url><loc>https://scifaro.com/en/abs/some-new-equiprojective-polyhedra-1009.2252</loc><lastmod>2010-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-new-equiprojective-polyhedra-1009.2252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-new-equiprojective-polyhedra-1009.2252"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-algorithm-for-reconstructing-a-simple-polygon-from-the-visibility-angles-1009.2521</loc><lastmod>2010-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-algorithm-for-reconstructing-a-simple-polygon-from-the-visibility-angles-1009.2521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-algorithm-for-reconstructing-a-simple-polygon-from-the-visibility-angles-1009.2521"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-area-enclosing-triangle-with-a-fixed-angle-1009.3006</loc><lastmod>2013-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-area-enclosing-triangle-with-a-fixed-angle-1009.3006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-area-enclosing-triangle-with-a-fixed-angle-1009.3006"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-graphs-of-uncertainty-regions-1009.3469</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-graphs-of-uncertainty-regions-1009.3469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-graphs-of-uncertainty-regions-1009.3469"/></url>
<url><loc>https://scifaro.com/en/abs/priority-range-trees-1009.3527</loc><lastmod>2010-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/priority-range-trees-1009.3527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/priority-range-trees-1009.3527"/></url>
<url><loc>https://scifaro.com/en/abs/integer-point-sets-minimizing-average-pairwise-l1-distance-what-is-the-optimal-shape-of-a-town-1009.5628</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-point-sets-minimizing-average-pairwise-l1-distance-what-is-the-optimal-shape-of-a-town-1009.5628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-point-sets-minimizing-average-pairwise-l1-distance-what-is-the-optimal-shape-of-a-town-1009.5628"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-extract-the-geometry-and-topology-from-very-large-3d-segmentations-1009.6215</loc><lastmod>2010-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-extract-the-geometry-and-topology-from-very-large-3d-segmentations-1009.6215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-extract-the-geometry-and-topology-from-very-large-3d-segmentations-1009.6215"/></url>
<url><loc>https://scifaro.com/en/abs/inaccessibility-inside-theorem-for-point-in-polygon-1010.0552</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inaccessibility-inside-theorem-for-point-in-polygon-1010.0552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inaccessibility-inside-theorem-for-point-in-polygon-1010.0552"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-path-problem-in-rectangular-complexes-of-global-nonpositive-curvature-1010.0852</loc><lastmod>2014-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-path-problem-in-rectangular-complexes-of-global-nonpositive-curvature-1010.0852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-path-problem-in-rectangular-complexes-of-global-nonpositive-curvature-1010.0852"/></url>
<url><loc>https://scifaro.com/en/abs/flat-zipper-unfolding-pairs-for-platonic-solids-1010.2450</loc><lastmod>2010-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flat-zipper-unfolding-pairs-for-platonic-solids-1010.2450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flat-zipper-unfolding-pairs-for-platonic-solids-1010.2450"/></url>
<url><loc>https://scifaro.com/en/abs/simplification-of-cross-field-topology-1010.2958</loc><lastmod>2010-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplification-of-cross-field-topology-1010.2958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplification-of-cross-field-topology-1010.2958"/></url>
<url><loc>https://scifaro.com/en/abs/maxwell-independence-a-new-rank-estimate-for-3d-rigidity-matroids-1010.4052</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maxwell-independence-a-new-rank-estimate-for-3d-rigidity-matroids-1010.4052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maxwell-independence-a-new-rank-estimate-for-3d-rigidity-matroids-1010.4052"/></url>
<url><loc>https://scifaro.com/en/abs/no-dimension-independent-core-sets-for-containment-under-homothetics-1010.4229</loc><lastmod>2012-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-dimension-independent-core-sets-for-containment-under-homothetics-1010.4229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-dimension-independent-core-sets-for-containment-under-homothetics-1010.4229"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimized-divide-and-conquer-algorithm-for-the-closest-pair-problem-in-the-planar-case-1010.5908</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimized-divide-and-conquer-algorithm-for-the-closest-pair-problem-in-the-planar-case-1010.5908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimized-divide-and-conquer-algorithm-for-the-closest-pair-problem-in-the-planar-case-1010.5908"/></url>
<url><loc>https://scifaro.com/en/abs/volume-enclosing-surface-extraction-1011.1787</loc><lastmod>2012-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/volume-enclosing-surface-extraction-1011.1787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/volume-enclosing-surface-extraction-1011.1787"/></url>
<url><loc>https://scifaro.com/en/abs/normal-art-galleries-wall-in-all-in-1011.1917</loc><lastmod>2012-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-art-galleries-wall-in-all-in-1011.1917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-art-galleries-wall-in-all-in-1011.1917"/></url>
<url><loc>https://scifaro.com/en/abs/forward-kinematics-analysis-and-tension-distribution-of-a-cable-driven-sinking-winches-mechanism-1011.2269</loc><lastmod>2010-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-kinematics-analysis-and-tension-distribution-of-a-cable-driven-sinking-winches-mechanism-1011.2269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-kinematics-analysis-and-tension-distribution-of-a-cable-driven-sinking-winches-mechanism-1011.2269"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-nearest-neighbors-search-in-high-dimensions-using-locality-sensitive-hashing-1011.4955</loc><lastmod>2010-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-nearest-neighbors-search-in-high-dimensions-using-locality-sensitive-hashing-1011.4955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-nearest-neighbors-search-in-high-dimensions-using-locality-sensitive-hashing-1011.4955"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-the-shortest-path-between-two-curves-on-a-parametric-surface-by-geodesic-like-method-1011.5320</loc><lastmod>2010-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-the-shortest-path-between-two-curves-on-a-parametric-surface-by-geodesic-like-method-1011.5320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-the-shortest-path-between-two-curves-on-a-parametric-surface-by-geodesic-like-method-1011.5320"/></url>
<url><loc>https://scifaro.com/en/abs/on-affine-rigidity-1011.5553</loc><lastmod>2013-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-affine-rigidity-1011.5553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-affine-rigidity-1011.5553"/></url>
<url><loc>https://scifaro.com/en/abs/on-short-cuts-or-fencing-in-rectangular-strips-1011.5920</loc><lastmod>2010-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-short-cuts-or-fencing-in-rectangular-strips-1011.5920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-short-cuts-or-fencing-in-rectangular-strips-1011.5920"/></url>
<url><loc>https://scifaro.com/en/abs/a-near-optimal-algorithm-for-finding-euclidean-shortest-path-in-polygonal-domain-1011.6481</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-near-optimal-algorithm-for-finding-euclidean-shortest-path-in-polygonal-domain-1011.6481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-near-optimal-algorithm-for-finding-euclidean-shortest-path-in-polygonal-domain-1011.6481"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-shortest-path-through-a-weighted-planar-subdivision-1011.6498</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-shortest-path-through-a-weighted-planar-subdivision-1011.6498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-shortest-path-through-a-weighted-planar-subdivision-1011.6498"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithms-for-the-point-set-embeddability-problem-for-plane-3-trees-1012.0230</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithms-for-the-point-set-embeddability-problem-for-plane-3-trees-1012.0230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithms-for-the-point-set-embeddability-problem-for-plane-3-trees-1012.0230"/></url>
<url><loc>https://scifaro.com/en/abs/a-center-transversal-theorem-for-hyperplanes-and-applications-to-graph-drawing-1012.0548</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-center-transversal-theorem-for-hyperplanes-and-applications-to-graph-drawing-1012.0548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-center-transversal-theorem-for-hyperplanes-and-applications-to-graph-drawing-1012.0548"/></url>
<url><loc>https://scifaro.com/en/abs/quickest-path-queries-on-transportation-network-1012.0634</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quickest-path-queries-on-transportation-network-1012.0634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quickest-path-queries-on-transportation-network-1012.0634"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximation-algorithm-for-the-euclidean-bottleneck-steiner-tree-problem-1012.1502</loc><lastmod>2010-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-the-euclidean-bottleneck-steiner-tree-problem-1012.1502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-the-euclidean-bottleneck-steiner-tree-problem-1012.1502"/></url>
<url><loc>https://scifaro.com/en/abs/treemaps-with-bounded-aspect-ratio-1012.1749</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/treemaps-with-bounded-aspect-ratio-1012.1749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/treemaps-with-bounded-aspect-ratio-1012.1749"/></url>
<url><loc>https://scifaro.com/en/abs/the-2-center-problem-in-three-dimensions-1012.2694</loc><lastmod>2010-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-2-center-problem-in-three-dimensions-1012.2694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-2-center-problem-in-three-dimensions-1012.2694"/></url>
<url><loc>https://scifaro.com/en/abs/cohomologous-harmonic-cochains-1012.2835</loc><lastmod>2011-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cohomologous-harmonic-cochains-1012.2835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cohomologous-harmonic-cochains-1012.2835"/></url>
<url><loc>https://scifaro.com/en/abs/the-least-spanning-area-of-a-knot-and-the-optimal-bounding-chain-problem-1012.3030</loc><lastmod>2011-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-least-spanning-area-of-a-knot-and-the-optimal-bounding-chain-problem-1012.3030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-least-spanning-area-of-a-knot-and-the-optimal-bounding-chain-problem-1012.3030"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-the-3d-surface-generator-vesta-1012.3057</loc><lastmod>2011-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-the-3d-surface-generator-vesta-1012.3057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-the-3d-surface-generator-vesta-1012.3057"/></url>
<url><loc>https://scifaro.com/en/abs/curve-reconstruction-in-riemannian-manifolds-ordering-motion-frames-1012.3359</loc><lastmod>2010-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curve-reconstruction-in-riemannian-manifolds-ordering-motion-frames-1012.3359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curve-reconstruction-in-riemannian-manifolds-ordering-motion-frames-1012.3359"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-delaunay-graphs-with-respect-to-any-convex-set-are-plane-graphs-1012.4881</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-delaunay-graphs-with-respect-to-any-convex-set-are-plane-graphs-1012.4881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-delaunay-graphs-with-respect-to-any-convex-set-are-plane-graphs-1012.4881"/></url>
<url><loc>https://scifaro.com/en/abs/unsolved-problems-in-visibility-graphs-of-points-segments-and-polygons-1012.5187</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsolved-problems-in-visibility-graphs-of-points-segments-and-polygons-1012.5187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsolved-problems-in-visibility-graphs-of-points-segments-and-polygons-1012.5187"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-grid-polygons-online-1012.5240</loc><lastmod>2010-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-grid-polygons-online-1012.5240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-grid-polygons-online-1012.5240"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-simple-triangular-and-hexagonal-grid-polygons-online-1012.5253</loc><lastmod>2010-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-simple-triangular-and-hexagonal-grid-polygons-online-1012.5253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-simple-triangular-and-hexagonal-grid-polygons-online-1012.5253"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-competitive-online-ray-search-with-an-error-prone-robot-1012.5259</loc><lastmod>2010-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-competitive-online-ray-search-with-an-error-prone-robot-1012.5259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-competitive-online-ray-search-with-an-error-prone-robot-1012.5259"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-planar-homothets-and-three-dimensional-hypergraphs-1101.0565</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-planar-homothets-and-three-dimensional-hypergraphs-1101.0565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-planar-homothets-and-three-dimensional-hypergraphs-1101.0565"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-linear-programming-approach-to-the-discrete-willmore-boundary-value-problem-and-generalizations-1101.0777</loc><lastmod>2011-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-linear-programming-approach-to-the-discrete-willmore-boundary-value-problem-and-generalizations-1101.0777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-linear-programming-approach-to-the-discrete-willmore-boundary-value-problem-and-generalizations-1101.0777"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-non-termination-of-ruppert-s-algorithm-1101.1071</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-non-termination-of-ruppert-s-algorithm-1101.1071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-non-termination-of-ruppert-s-algorithm-1101.1071"/></url>
<url><loc>https://scifaro.com/en/abs/fast-approximation-algorithms-for-art-gallery-problems-in-simple-polygons-1101.1346</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-approximation-algorithms-for-art-gallery-problems-in-simple-polygons-1101.1346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-approximation-algorithms-for-art-gallery-problems-in-simple-polygons-1101.1346"/></url>
<url><loc>https://scifaro.com/en/abs/fast-vertex-guarding-for-polygons-1101.3297</loc><lastmod>2011-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-vertex-guarding-for-polygons-1101.3297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-vertex-guarding-for-polygons-1101.3297"/></url>
<url><loc>https://scifaro.com/en/abs/sweeping-an-oval-to-a-vanishing-point-1101.4667</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sweeping-an-oval-to-a-vanishing-point-1101.4667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sweeping-an-oval-to-a-vanishing-point-1101.4667"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximating-the-riemannian-1-center-1101.4718</loc><lastmod>2021-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximating-the-riemannian-1-center-1101.4718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximating-the-riemannian-1-center-1101.4718"/></url>
<url><loc>https://scifaro.com/en/abs/computing-pseudotriangulations-via-branched-coverings-1102.0151</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-pseudotriangulations-via-branched-coverings-1102.0151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-pseudotriangulations-via-branched-coverings-1102.0151"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hull-of-points-lying-on-lines-in-o-n-log-n-time-after-preprocessing-1102.2008</loc><lastmod>2012-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hull-of-points-lying-on-lines-in-o-n-log-n-time-after-preprocessing-1102.2008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hull-of-points-lying-on-lines-in-o-n-log-n-time-after-preprocessing-1102.2008"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-automata-and-discrete-geometry-1102.2315</loc><lastmod>2011-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-automata-and-discrete-geometry-1102.2315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-automata-and-discrete-geometry-1102.2315"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-interference-in-ad-hoc-networks-with-bounded-communication-radius-1102.2785</loc><lastmod>2012-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-interference-in-ad-hoc-networks-with-bounded-communication-radius-1102.2785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-interference-in-ad-hoc-networks-with-bounded-communication-radius-1102.2785"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximation-algorithm-for-computing-shortest-paths-in-weighted-3-d-domains-1102.3165</loc><lastmod>2011-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-computing-shortest-paths-in-weighted-3-d-domains-1102.3165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-computing-shortest-paths-in-weighted-3-d-domains-1102.3165"/></url>
<url><loc>https://scifaro.com/en/abs/homology-and-robustness-of-level-and-interlevel-sets-1102.3389</loc><lastmod>2011-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homology-and-robustness-of-level-and-interlevel-sets-1102.3389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homology-and-robustness-of-level-and-interlevel-sets-1102.3389"/></url>
<url><loc>https://scifaro.com/en/abs/orphan-free-anisotropic-voronoi-diagrams-1102.3670</loc><lastmod>2011-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orphan-free-anisotropic-voronoi-diagrams-1102.3670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orphan-free-anisotropic-voronoi-diagrams-1102.3670"/></url>
<url><loc>https://scifaro.com/en/abs/duals-of-orphan-free-anisotropic-voronoi-diagrams-are-triangulations-1102.3673</loc><lastmod>2012-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duals-of-orphan-free-anisotropic-voronoi-diagrams-are-triangulations-1102.3673"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duals-of-orphan-free-anisotropic-voronoi-diagrams-are-triangulations-1102.3673"/></url>
<url><loc>https://scifaro.com/en/abs/the-mst-of-symmetric-disk-graphs-in-arbitrary-metrics-is-light-1102.4866</loc><lastmod>2011-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mst-of-symmetric-disk-graphs-in-arbitrary-metrics-is-light-1102.4866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mst-of-symmetric-disk-graphs-in-arbitrary-metrics-is-light-1102.4866"/></url>
<url><loc>https://scifaro.com/en/abs/witnessed-k-distance-1102.4972</loc><lastmod>2011-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witnessed-k-distance-1102.4972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witnessed-k-distance-1102.4972"/></url>
<url><loc>https://scifaro.com/en/abs/complete-subdivision-algorithms-ii-isotopic-meshing-of-singular-algebraic-curves-1102.5463</loc><lastmod>2011-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-subdivision-algorithms-ii-isotopic-meshing-of-singular-algebraic-curves-1102.5463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-subdivision-algorithms-ii-isotopic-meshing-of-singular-algebraic-curves-1102.5463"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-cases-of-the-discretizable-molecular-distance-geometry-problem-1103.1264</loc><lastmod>2011-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-cases-of-the-discretizable-molecular-distance-geometry-problem-1103.1264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-cases-of-the-discretizable-molecular-distance-geometry-problem-1103.1264"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-maximum-independent-set-of-pseudo-disks-1103.1431</loc><lastmod>2011-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-maximum-independent-set-of-pseudo-disks-1103.1431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-maximum-independent-set-of-pseudo-disks-1103.1431"/></url>
<url><loc>https://scifaro.com/en/abs/a-gentle-introduction-to-the-kernel-distance-1103.1625</loc><lastmod>2011-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gentle-introduction-to-the-kernel-distance-1103.1625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gentle-introduction-to-the-kernel-distance-1103.1625"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-the-complexity-of-halfspace-intersections-when-the-bounded-faces-have-small-dimension-1103.2575</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-the-complexity-of-halfspace-intersections-when-the-bounded-faces-have-small-dimension-1103.2575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-the-complexity-of-halfspace-intersections-when-the-bounded-faces-have-small-dimension-1103.2575"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-fr-e-chet-distance-between-folded-polygons-1103.2865</loc><lastmod>2011-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-fr-e-chet-distance-between-folded-polygons-1103.2865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-fr-e-chet-distance-between-folded-polygons-1103.2865"/></url>
<url><loc>https://scifaro.com/en/abs/improved-examples-of-non-termination-for-ruppert-s-algorithm-1103.3903</loc><lastmod>2011-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-examples-of-non-termination-for-ruppert-s-algorithm-1103.3903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-examples-of-non-termination-for-ruppert-s-algorithm-1103.3903"/></url>
<url><loc>https://scifaro.com/en/abs/computing-shortest-paths-among-curved-obstacles-in-the-plane-1103.3911</loc><lastmod>2015-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-shortest-paths-among-curved-obstacles-in-the-plane-1103.3911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-shortest-paths-among-curved-obstacles-in-the-plane-1103.3911"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometric-stability-of-voronoi-diagrams-with-respect-to-small-changes-of-the-sites-1103.4125</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometric-stability-of-voronoi-diagrams-with-respect-to-small-changes-of-the-sites-1103.4125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometric-stability-of-voronoi-diagrams-with-respect-to-small-changes-of-the-sites-1103.4125"/></url>
<url><loc>https://scifaro.com/en/abs/undirected-connectivity-of-sparse-yao-graphs-1103.4343</loc><lastmod>2011-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undirected-connectivity-of-sparse-yao-graphs-1103.4343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undirected-connectivity-of-sparse-yao-graphs-1103.4343"/></url>
<url><loc>https://scifaro.com/en/abs/the-stretch-factor-of-the-delaunay-triangulation-is-less-than-1-998-1103.4361</loc><lastmod>2013-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stretch-factor-of-the-delaunay-triangulation-is-less-than-1-998-1103.4361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stretch-factor-of-the-delaunay-triangulation-is-less-than-1-998-1103.4361"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-discrepancy-computation-and-epsilon-net-verification-in-high-dimension-1103.4503</loc><lastmod>2011-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-discrepancy-computation-and-epsilon-net-verification-in-high-dimension-1103.4503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-discrepancy-computation-and-epsilon-net-verification-in-high-dimension-1103.4503"/></url>
<url><loc>https://scifaro.com/en/abs/orthogonal-range-searching-on-the-ram-revisited-1103.5510</loc><lastmod>2011-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthogonal-range-searching-on-the-ram-revisited-1103.5510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthogonal-range-searching-on-the-ram-revisited-1103.5510"/></url>
<url><loc>https://scifaro.com/en/abs/the-fem-approach-to-the-3d-electrodiffusion-on-meshes-optimized-with-the-metropolis-algorithm-1103.5855</loc><lastmod>2011-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fem-approach-to-the-3d-electrodiffusion-on-meshes-optimized-with-the-metropolis-algorithm-1103.5855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fem-approach-to-the-3d-electrodiffusion-on-meshes-optimized-with-the-metropolis-algorithm-1103.5855"/></url>
<url><loc>https://scifaro.com/en/abs/a-doubly-exponentially-crumbled-cake-1104.0122</loc><lastmod>2011-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-doubly-exponentially-crumbled-cake-1104.0122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-doubly-exponentially-crumbled-cake-1104.0122"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-stable-delaunay-graphs-1104.0622</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-stable-delaunay-graphs-1104.0622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-stable-delaunay-graphs-1104.0622"/></url>
<url><loc>https://scifaro.com/en/abs/locating-a-service-facility-and-a-rapid-transit-line-1104.0753</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locating-a-service-facility-and-a-rapid-transit-line-1104.0753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locating-a-service-facility-and-a-rapid-transit-line-1104.0753"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-polygonal-representation-of-planar-graphs-1104.1482</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-polygonal-representation-of-planar-graphs-1104.1482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-polygonal-representation-of-planar-graphs-1104.1482"/></url>
<url><loc>https://scifaro.com/en/abs/self-assembly-with-geometric-tiles-1104.2809</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-assembly-with-geometric-tiles-1104.2809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-assembly-with-geometric-tiles-1104.2809"/></url>
<url><loc>https://scifaro.com/en/abs/inplace-algorithm-for-priority-search-tree-and-its-use-in-computing-largest-empty-axis-parallel-rectangle-1104.3076</loc><lastmod>2011-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inplace-algorithm-for-priority-search-tree-and-its-use-in-computing-largest-empty-axis-parallel-rectangle-1104.3076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inplace-algorithm-for-priority-search-tree-and-its-use-in-computing-largest-empty-axis-parallel-rectangle-1104.3076"/></url>
<url><loc>https://scifaro.com/en/abs/collective-construction-of-2d-block-structures-with-holes-1104.3847</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collective-construction-of-2d-block-structures-with-holes-1104.3847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collective-construction-of-2d-block-structures-with-holes-1104.3847"/></url>
<url><loc>https://scifaro.com/en/abs/searching-polyhedra-by-rotating-half-planes-1104.4137</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-polyhedra-by-rotating-half-planes-1104.4137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-polyhedra-by-rotating-half-planes-1104.4137"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-cell-connection-and-separation-in-line-segment-arrangements-1104.4618</loc><lastmod>2011-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cell-connection-and-separation-in-line-segment-arrangements-1104.4618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cell-connection-and-separation-in-line-segment-arrangements-1104.4618"/></url>
<url><loc>https://scifaro.com/en/abs/on-isolating-points-using-disks-1104.5043</loc><lastmod>2011-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-isolating-points-using-disks-1104.5043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-isolating-points-using-disks-1104.5043"/></url>
<url><loc>https://scifaro.com/en/abs/a-static-optimality-transformation-with-applications-to-planar-point-location-1104.5597</loc><lastmod>2012-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-static-optimality-transformation-with-applications-to-planar-point-location-1104.5597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-static-optimality-transformation-with-applications-to-planar-point-location-1104.5597"/></url>
<url><loc>https://scifaro.com/en/abs/consistent-labeling-of-rotating-maps-1104.5634</loc><lastmod>2011-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistent-labeling-of-rotating-maps-1104.5634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistent-labeling-of-rotating-maps-1104.5634"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-proof-of-the-existence-of-a-planar-separator-1105.0103</loc><lastmod>2025-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-proof-of-the-existence-of-a-planar-separator-1105.0103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-proof-of-the-existence-of-a-planar-separator-1105.0103"/></url>
<url><loc>https://scifaro.com/en/abs/tracking-moving-objects-with-few-handovers-1105.0392</loc><lastmod>2011-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracking-moving-objects-with-few-handovers-1105.0392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracking-moving-objects-with-few-handovers-1105.0392"/></url>
<url><loc>https://scifaro.com/en/abs/adjacency-preserving-spatial-treemaps-1105.0398</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjacency-preserving-spatial-treemaps-1105.0398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjacency-preserving-spatial-treemaps-1105.0398"/></url>
<url><loc>https://scifaro.com/en/abs/connecting-a-set-of-circles-with-minimum-sum-of-radii-1105.0791</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connecting-a-set-of-circles-with-minimum-sum-of-radii-1105.0791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connecting-a-set-of-circles-with-minimum-sum-of-radii-1105.0791"/></url>
<url><loc>https://scifaro.com/en/abs/collinearities-in-kinetic-point-sets-1105.3078</loc><lastmod>2011-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collinearities-in-kinetic-point-sets-1105.3078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collinearities-in-kinetic-point-sets-1105.3078"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-preserving-convexifications-using-single-vertex-moves-1105.3435</loc><lastmod>2011-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-preserving-convexifications-using-single-vertex-moves-1105.3435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-preserving-convexifications-using-single-vertex-moves-1105.3435"/></url>
<url><loc>https://scifaro.com/en/abs/on-2-site-voronoi-diagrams-under-geometric-distance-functions-1105.4130</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-2-site-voronoi-diagrams-under-geometric-distance-functions-1105.4130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-2-site-voronoi-diagrams-under-geometric-distance-functions-1105.4130"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-diagram-the-generator-recognition-problem-1105.4246</loc><lastmod>2011-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagram-the-generator-recognition-problem-1105.4246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagram-the-generator-recognition-problem-1105.4246"/></url>
<url><loc>https://scifaro.com/en/abs/common-edge-unzippings-for-tetrahedra-1105.5401</loc><lastmod>2011-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-edge-unzippings-for-tetrahedra-1105.5401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-edge-unzippings-for-tetrahedra-1105.5401"/></url>
<url><loc>https://scifaro.com/en/abs/computing-all-maps-into-a-sphere-1105.6257</loc><lastmod>2014-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-all-maps-into-a-sphere-1105.6257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-all-maps-into-a-sphere-1105.6257"/></url>
<url><loc>https://scifaro.com/en/abs/interleaved-computation-for-persistent-homology-1105.6305</loc><lastmod>2011-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interleaved-computation-for-persistent-homology-1105.6305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interleaved-computation-for-persistent-homology-1105.6305"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-low-dimensional-topology-1106.0216</loc><lastmod>2012-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-low-dimensional-topology-1106.0216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-low-dimensional-topology-1106.0216"/></url>
<url><loc>https://scifaro.com/en/abs/random-hyperplane-search-trees-in-high-dimensions-1106.0461</loc><lastmod>2011-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-hyperplane-search-trees-in-high-dimensions-1106.0461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-hyperplane-search-trees-in-high-dimensions-1106.0461"/></url>
<url><loc>https://scifaro.com/en/abs/ice-creams-and-wedge-graphs-1106.0855</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ice-creams-and-wedge-graphs-1106.0855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ice-creams-and-wedge-graphs-1106.0855"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-maximal-empty-rectangle-containing-a-query-point-1106.3628</loc><lastmod>2011-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-maximal-empty-rectangle-containing-a-query-point-1106.3628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-maximal-empty-rectangle-containing-a-query-point-1106.3628"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-interpolation-on-multi-dimensional-grid-to-quantizing-grid-s-data-base-as-a-recursion-1106.3739</loc><lastmod>2011-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-interpolation-on-multi-dimensional-grid-to-quantizing-grid-s-data-base-as-a-recursion-1106.3739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-interpolation-on-multi-dimensional-grid-to-quantizing-grid-s-data-base-as-a-recursion-1106.3739"/></url>
<url><loc>https://scifaro.com/en/abs/convex-geometry-and-stoichiometry-1106.3773</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-geometry-and-stoichiometry-1106.3773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-geometry-and-stoichiometry-1106.3773"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-bounds-on-the-length-of-a-longest-edge-in-delaunay-graphs-of-random-points-in-d-dimensions-1106.4927</loc><lastmod>2011-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-bounds-on-the-length-of-a-longest-edge-in-delaunay-graphs-of-random-points-in-d-dimensions-1106.4927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-bounds-on-the-length-of-a-longest-edge-in-delaunay-graphs-of-random-points-in-d-dimensions-1106.4927"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-range-selection-in-linear-space-1106.5076</loc><lastmod>2013-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-range-selection-in-linear-space-1106.5076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-range-selection-in-linear-space-1106.5076"/></url>
<url><loc>https://scifaro.com/en/abs/the-theory-of-the-interleaving-distance-on-multidimensional-persistence-modules-1106.5305</loc><lastmod>2015-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theory-of-the-interleaving-distance-on-multidimensional-persistence-modules-1106.5305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theory-of-the-interleaving-distance-on-multidimensional-persistence-modules-1106.5305"/></url>
<url><loc>https://scifaro.com/en/abs/operations-on-polytopes-application-to-tolerance-analysis-1106.6148</loc><lastmod>2011-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operations-on-polytopes-application-to-tolerance-analysis-1106.6148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operations-on-polytopes-application-to-tolerance-analysis-1106.6148"/></url>
<url><loc>https://scifaro.com/en/abs/the-cost-of-bounded-curvature-1106.6214</loc><lastmod>2012-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cost-of-bounded-curvature-1106.6214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cost-of-bounded-curvature-1106.6214"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-number-of-faces-of-the-minkowski-sum-of-two-convex-polytopes-1106.6254</loc><lastmod>2011-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-number-of-faces-of-the-minkowski-sum-of-two-convex-polytopes-1106.6254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-number-of-faces-of-the-minkowski-sum-of-two-convex-polytopes-1106.6254"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-tverberg-points-in-linear-time-for-any-fixed-dimension-1107.0104</loc><lastmod>2020-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-tverberg-points-in-linear-time-for-any-fixed-dimension-1107.0104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-tverberg-points-in-linear-time-for-any-fixed-dimension-1107.0104"/></url>
<url><loc>https://scifaro.com/en/abs/homological-coordinatization-1107.0511</loc><lastmod>2011-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homological-coordinatization-1107.0511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homological-coordinatization-1107.0511"/></url>
<url><loc>https://scifaro.com/en/abs/motion-planning-via-manifold-samples-1107.0803</loc><lastmod>2015-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/motion-planning-via-manifold-samples-1107.0803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/motion-planning-via-manifold-samples-1107.0803"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-minimum-manhattan-networks-in-higher-dimensions-1107.0901</loc><lastmod>2012-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-minimum-manhattan-networks-in-higher-dimensions-1107.0901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-minimum-manhattan-networks-in-higher-dimensions-1107.0901"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-point-movement-for-covering-circular-regions-1107.1012</loc><lastmod>2011-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-point-movement-for-covering-circular-regions-1107.1012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-point-movement-for-covering-circular-regions-1107.1012"/></url>
<url><loc>https://scifaro.com/en/abs/bidirected-minimum-manhattan-network-problem-1107.1359</loc><lastmod>2011-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bidirected-minimum-manhattan-network-problem-1107.1359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bidirected-minimum-manhattan-network-problem-1107.1359"/></url>
<url><loc>https://scifaro.com/en/abs/jaywalking-your-dog-computing-the-fr-echet-distance-with-shortcuts-1107.1720</loc><lastmod>2013-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/jaywalking-your-dog-computing-the-fr-echet-distance-with-shortcuts-1107.1720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/jaywalking-your-dog-computing-the-fr-echet-distance-with-shortcuts-1107.1720"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-distance-between-piecewise-linear-bivariate-functions-1107.2312</loc><lastmod>2011-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-distance-between-piecewise-linear-bivariate-functions-1107.2312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-distance-between-piecewise-linear-bivariate-functions-1107.2312"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-packing-under-non-uniform-constraints-1107.2949</loc><lastmod>2011-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-packing-under-non-uniform-constraints-1107.2949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-packing-under-non-uniform-constraints-1107.2949"/></url>
<url><loc>https://scifaro.com/en/abs/a-further-generalization-of-the-colourful-carath-eodory-theorem-1107.3380</loc><lastmod>2014-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-further-generalization-of-the-colourful-carath-eodory-theorem-1107.3380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-further-generalization-of-the-colourful-carath-eodory-theorem-1107.3380"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-for-centerlines-1107.3421</loc><lastmod>2012-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-for-centerlines-1107.3421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-for-centerlines-1107.3421"/></url>
<url><loc>https://scifaro.com/en/abs/annotating-simplices-with-a-homology-basis-and-its-applications-1107.3793</loc><lastmod>2012-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/annotating-simplices-with-a-homology-basis-and-its-applications-1107.3793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/annotating-simplices-with-a-homology-basis-and-its-applications-1107.3793"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-obstacle-number-of-a-plane-graph-1107.4624</loc><lastmod>2011-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-obstacle-number-of-a-plane-graph-1107.4624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-obstacle-number-of-a-plane-graph-1107.4624"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-the-incircle-predicate-for-the-euclidean-voronoi-diagram-of-axes-aligned-line-segments-1107.5204</loc><lastmod>2011-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-the-incircle-predicate-for-the-euclidean-voronoi-diagram-of-axes-aligned-line-segments-1107.5204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-the-incircle-predicate-for-the-euclidean-voronoi-diagram-of-axes-aligned-line-segments-1107.5204"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-connectivity-with-directional-antennas-1108.0492</loc><lastmod>2011-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-connectivity-with-directional-antennas-1108.0492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-connectivity-with-directional-antennas-1108.0492"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-bregman-near-neighbors-in-sublinear-time-beyond-the-triangle-inequality-1108.0835</loc><lastmod>2013-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-bregman-near-neighbors-in-sublinear-time-beyond-the-triangle-inequality-1108.0835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-bregman-near-neighbors-in-sublinear-time-beyond-the-triangle-inequality-1108.0835"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-the-branching-structure-of-an-algebraic-curve-1108.2038</loc><lastmod>2011-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-the-branching-structure-of-an-algebraic-curve-1108.2038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-the-branching-structure-of-an-algebraic-curve-1108.2038"/></url>
<url><loc>https://scifaro.com/en/abs/witness-rectangle-graphs-1108.2058</loc><lastmod>2011-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witness-rectangle-graphs-1108.2058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witness-rectangle-graphs-1108.2058"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-cover-a-point-set-with-a-v-shape-of-minimum-width-1108.2063</loc><lastmod>2011-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-cover-a-point-set-with-a-v-shape-of-minimum-width-1108.2063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-cover-a-point-set-with-a-v-shape-of-minimum-width-1108.2063"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-zigzag-persistence-to-topological-data-analysis-1108.3545</loc><lastmod>2011-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-zigzag-persistence-to-topological-data-analysis-1108.3545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-zigzag-persistence-to-topological-data-analysis-1108.3545"/></url>
<url><loc>https://scifaro.com/en/abs/interactions-between-digital-geometry-and-combinatorics-on-words-1108.3615</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactions-between-digital-geometry-and-combinatorics-on-words-1108.3615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactions-between-digital-geometry-and-combinatorics-on-words-1108.3615"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-a-single-face-in-an-arrangement-of-s-intersecting-curves-1108.4336</loc><lastmod>2011-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-a-single-face-in-an-arrangement-of-s-intersecting-curves-1108.4336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-a-single-face-in-an-arrangement-of-s-intersecting-curves-1108.4336"/></url>
<url><loc>https://scifaro.com/en/abs/automatically-creating-design-models-from-3d-anthropometry-data-1108.4572</loc><lastmod>2012-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatically-creating-design-models-from-3d-anthropometry-data-1108.4572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatically-creating-design-models-from-3d-anthropometry-data-1108.4572"/></url>
<url><loc>https://scifaro.com/en/abs/inapproximability-of-orthogonal-compaction-1108.4705</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inapproximability-of-orthogonal-compaction-1108.4705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inapproximability-of-orthogonal-compaction-1108.4705"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-problems-of-length-constrained-heaviest-segments-1108.4972</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-problems-of-length-constrained-heaviest-segments-1108.4972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-problems-of-length-constrained-heaviest-segments-1108.4972"/></url>
<url><loc>https://scifaro.com/en/abs/confluent-hasse-diagrams-1108.5361</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluent-hasse-diagrams-1108.5361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluent-hasse-diagrams-1108.5361"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-separable-nonlinear-least-squares-problem-1108.5499</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-separable-nonlinear-least-squares-problem-1108.5499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-separable-nonlinear-least-squares-problem-1108.5499"/></url>
<url><loc>https://scifaro.com/en/abs/balancing-degree-diameter-and-weight-in-euclidean-spanners-1108.6022</loc><lastmod>2011-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancing-degree-diameter-and-weight-in-euclidean-spanners-1108.6022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancing-degree-diameter-and-weight-in-euclidean-spanners-1108.6022"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-conservation-law-on-curved-surfaces-1109.0129</loc><lastmod>2011-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-conservation-law-on-curved-surfaces-1109.0129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-conservation-law-on-curved-surfaces-1109.0129"/></url>
<url><loc>https://scifaro.com/en/abs/fully-retroactive-approximate-range-and-nearest-neighbor-searching-1109.0312</loc><lastmod>2011-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-retroactive-approximate-range-and-nearest-neighbor-searching-1109.0312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-retroactive-approximate-range-and-nearest-neighbor-searching-1109.0312"/></url>
<url><loc>https://scifaro.com/en/abs/planar-and-poly-arc-lombardi-drawings-1109.0345</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-and-poly-arc-lombardi-drawings-1109.0345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-and-poly-arc-lombardi-drawings-1109.0345"/></url>
<url><loc>https://scifaro.com/en/abs/a-space-optimal-hidden-surface-removal-algorithm-for-iso-oriented-rectangles-1109.0389</loc><lastmod>2011-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-space-optimal-hidden-surface-removal-algorithm-for-iso-oriented-rectangles-1109.0389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-space-optimal-hidden-surface-removal-algorithm-for-iso-oriented-rectangles-1109.0389"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-maintenance-of-half-space-depth-for-points-and-contours-1109.1517</loc><lastmod>2011-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-maintenance-of-half-space-depth-for-points-and-contours-1109.1517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-maintenance-of-half-space-depth-for-points-and-contours-1109.1517"/></url>
<url><loc>https://scifaro.com/en/abs/pinning-balloons-with-perfect-angles-and-optimal-area-1109.1705</loc><lastmod>2011-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pinning-balloons-with-perfect-angles-and-optimal-area-1109.1705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pinning-balloons-with-perfect-angles-and-optimal-area-1109.1705"/></url>
<url><loc>https://scifaro.com/en/abs/deconstructing-approximate-offsets-1109.2158</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deconstructing-approximate-offsets-1109.2158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deconstructing-approximate-offsets-1109.2158"/></url>
<url><loc>https://scifaro.com/en/abs/an-inventory-of-three-dimensional-hilbert-space-filling-curves-1109.2323</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inventory-of-three-dimensional-hilbert-space-filling-curves-1109.2323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inventory-of-three-dimensional-hilbert-space-filling-curves-1109.2323"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-coverage-verification-1109.2361</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-coverage-verification-1109.2361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-coverage-verification-1109.2361"/></url>
<url><loc>https://scifaro.com/en/abs/angle-restricted-steiner-arborescences-for-flow-map-layout-1109.3316</loc><lastmod>2011-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angle-restricted-steiner-arborescences-for-flow-map-layout-1109.3316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angle-restricted-steiner-arborescences-for-flow-map-layout-1109.3316"/></url>
<url><loc>https://scifaro.com/en/abs/failure-filtrations-for-fenced-sensor-networks-1109.6535</loc><lastmod>2016-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/failure-filtrations-for-fenced-sensor-networks-1109.6535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/failure-filtrations-for-fenced-sensor-networks-1109.6535"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-optimal-locally-gabriel-graphs-1110.1180</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-optimal-locally-gabriel-graphs-1110.1180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-optimal-locally-gabriel-graphs-1110.1180"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-homotopy-test-on-surfaces-1110.4573</loc><lastmod>2011-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-homotopy-test-on-surfaces-1110.4573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-homotopy-test-on-surfaces-1110.4573"/></url>
<url><loc>https://scifaro.com/en/abs/making-triangulations-4-connected-using-flips-1110.6473</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-triangulations-4-connected-using-flips-1110.6473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-triangulations-4-connected-using-flips-1110.6473"/></url>
<url><loc>https://scifaro.com/en/abs/flow-computations-on-imprecise-terrains-1111.1651</loc><lastmod>2012-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flow-computations-on-imprecise-terrains-1111.1651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flow-computations-on-imprecise-terrains-1111.1651"/></url>
<url><loc>https://scifaro.com/en/abs/optimum-partition-parameter-of-divide-and-conquer-algorithm-for-solving-closest-pair-problem-1111.2422</loc><lastmod>2011-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimum-partition-parameter-of-divide-and-conquer-algorithm-for-solving-closest-pair-problem-1111.2422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimum-partition-parameter-of-divide-and-conquer-algorithm-for-solving-closest-pair-problem-1111.2422"/></url>
<url><loc>https://scifaro.com/en/abs/localized-geometric-query-problems-1111.2918</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localized-geometric-query-problems-1111.2918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localized-geometric-query-problems-1111.2918"/></url>
<url><loc>https://scifaro.com/en/abs/down-the-rabbit-hole-robust-proximity-search-and-density-estimation-in-sublinear-space-1111.2942</loc><lastmod>2013-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/down-the-rabbit-hole-robust-proximity-search-and-density-estimation-in-sublinear-space-1111.2942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/down-the-rabbit-hole-robust-proximity-search-and-density-estimation-in-sublinear-space-1111.2942"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-visibility-polygon-using-few-variables-1111.3584</loc><lastmod>2013-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-visibility-polygon-using-few-variables-1111.3584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-visibility-polygon-using-few-variables-1111.3584"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-erdos-szekeres-theorems-1111.3824</loc><lastmod>2012-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-erdos-szekeres-theorems-1111.3824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-erdos-szekeres-theorems-1111.3824"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-linear-program-for-minimum-weight-triangulation-1111.5305</loc><lastmod>2015-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-linear-program-for-minimum-weight-triangulation-1111.5305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-linear-program-for-minimum-weight-triangulation-1111.5305"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expected-complexity-of-random-convex-hulls-1111.5340</loc><lastmod>2011-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expected-complexity-of-random-convex-hulls-1111.5340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expected-complexity-of-random-convex-hulls-1111.5340"/></url>
<url><loc>https://scifaro.com/en/abs/ann-queries-covering-voronoi-diagram-with-hyperboxes-1111.5893</loc><lastmod>2014-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ann-queries-covering-voronoi-diagram-with-hyperboxes-1111.5893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ann-queries-covering-voronoi-diagram-with-hyperboxes-1111.5893"/></url>
<url><loc>https://scifaro.com/en/abs/erd-h-o-s-szekeres-and-testing-weak-epsilon-nets-are-np-hard-in-3-dimensions-and-what-now-1111.5979</loc><lastmod>2011-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/erd-h-o-s-szekeres-and-testing-weak-epsilon-nets-are-np-hard-in-3-dimensions-and-what-now-1111.5979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/erd-h-o-s-szekeres-and-testing-weak-epsilon-nets-are-np-hard-in-3-dimensions-and-what-now-1111.5979"/></url>
<url><loc>https://scifaro.com/en/abs/the-clique-problem-in-ray-intersection-graphs-1111.5986</loc><lastmod>2011-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-clique-problem-in-ray-intersection-graphs-1111.5986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-clique-problem-in-ray-intersection-graphs-1111.5986"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-interference-in-wireless-ad-hoc-networks-with-nodes-in-random-position-1111.6689</loc><lastmod>2011-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-interference-in-wireless-ad-hoc-networks-with-nodes-in-random-position-1111.6689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-interference-in-wireless-ad-hoc-networks-with-nodes-in-random-position-1111.6689"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-non-trivial-cycles-in-directed-and-undirected-surface-graphs-1111.6990</loc><lastmod>2012-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-non-trivial-cycles-in-directed-and-undirected-surface-graphs-1111.6990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-non-trivial-cycles-in-directed-and-undirected-surface-graphs-1111.6990"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-low-dimensional-coverage-problems-1112.0689</loc><lastmod>2011-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-low-dimensional-coverage-problems-1112.0689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-low-dimensional-coverage-problems-1112.0689"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expected-complexity-of-voronoi-diagrams-on-terrains-1112.0695</loc><lastmod>2011-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expected-complexity-of-voronoi-diagrams-on-terrains-1112.0695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expected-complexity-of-voronoi-diagrams-on-terrains-1112.0695"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-convex-partitions-and-maximum-empty-polytopes-1112.1124</loc><lastmod>2014-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-convex-partitions-and-maximum-empty-polytopes-1112.1124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-convex-partitions-and-maximum-empty-polytopes-1112.1124"/></url>
<url><loc>https://scifaro.com/en/abs/the-dimension-of-spline-spaces-with-highest-order-smoothness-over-hierarchical-t-meshes-1112.1144</loc><lastmod>2011-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dimension-of-spline-spaces-with-highest-order-smoothness-over-hierarchical-t-meshes-1112.1144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dimension-of-spline-spaces-with-highest-order-smoothness-over-hierarchical-t-meshes-1112.1144"/></url>
<url><loc>https://scifaro.com/en/abs/a-spectral-sequence-for-parallelized-persistence-1112.1245</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spectral-sequence-for-parallelized-persistence-1112.1245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spectral-sequence-for-parallelized-persistence-1112.1245"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bounds-on-the-number-of-faces-of-the-minkowski-sum-of-convex-polytopes-via-the-cayley-trick-1112.1535</loc><lastmod>2011-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bounds-on-the-number-of-faces-of-the-minkowski-sum-of-convex-polytopes-via-the-cayley-trick-1112.1535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bounds-on-the-number-of-faces-of-the-minkowski-sum-of-convex-polytopes-via-the-cayley-trick-1112.1535"/></url>
<url><loc>https://scifaro.com/en/abs/generating-k-facets-by-induction-on-the-dimension-1112.1562</loc><lastmod>2017-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-k-facets-by-induction-on-the-dimension-1112.1562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-k-facets-by-induction-on-the-dimension-1112.1562"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-average-distance-triangulations-1112.1828</loc><lastmod>2012-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-average-distance-triangulations-1112.1828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-average-distance-triangulations-1112.1828"/></url>
<url><loc>https://scifaro.com/en/abs/epsilon-samples-of-kernels-1112.4105</loc><lastmod>2012-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epsilon-samples-of-kernels-1112.4105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epsilon-samples-of-kernels-1112.4105"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-algorithms-for-euler-characteristic-of-simplicial-complexes-1112.4523</loc><lastmod>2011-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-algorithms-for-euler-characteristic-of-simplicial-complexes-1112.4523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-algorithms-for-euler-characteristic-of-simplicial-complexes-1112.4523"/></url>
<url><loc>https://scifaro.com/en/abs/circular-arc-cartograms-1112.4626</loc><lastmod>2012-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circular-arc-cartograms-1112.4626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circular-arc-cartograms-1112.4626"/></url>
<url><loc>https://scifaro.com/en/abs/the-price-of-matching-selfish-vertices-1112.4632</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-price-of-matching-selfish-vertices-1112.4632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-price-of-matching-selfish-vertices-1112.4632"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-orthogonal-polyhedra-with-quadratic-refinement-the-delta-unfolding-algorithm-1112.4791</loc><lastmod>2011-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-orthogonal-polyhedra-with-quadratic-refinement-the-delta-unfolding-algorithm-1112.4791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-orthogonal-polyhedra-with-quadratic-refinement-the-delta-unfolding-algorithm-1112.4791"/></url>
<url><loc>https://scifaro.com/en/abs/memory-constrained-algorithms-for-simple-polygons-1112.5904</loc><lastmod>2013-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memory-constrained-algorithms-for-simple-polygons-1112.5904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memory-constrained-algorithms-for-simple-polygons-1112.5904"/></url>
<url><loc>https://scifaro.com/en/abs/cayley-configuration-spaces-of-a-common-class-of-mechanisms-in-two-dimensions-1112.6008</loc><lastmod>2025-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cayley-configuration-spaces-of-a-common-class-of-mechanisms-in-two-dimensions-1112.6008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cayley-configuration-spaces-of-a-common-class-of-mechanisms-in-two-dimensions-1112.6008"/></url>
<url><loc>https://scifaro.com/en/abs/cayley-configuration-spaces-of-1-dof-tree-decomposable-linkages-part-ii-combinatorial-characterization-of-complexity-1112.6009</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cayley-configuration-spaces-of-1-dof-tree-decomposable-linkages-part-ii-combinatorial-characterization-of-complexity-1112.6009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cayley-configuration-spaces-of-1-dof-tree-decomposable-linkages-part-ii-combinatorial-characterization-of-complexity-1112.6009"/></url>
<url><loc>https://scifaro.com/en/abs/cone-fields-and-topological-sampling-in-manifolds-with-bounded-curvature-1112.6160</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cone-fields-and-topological-sampling-in-manifolds-with-bounded-curvature-1112.6160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cone-fields-and-topological-sampling-in-manifolds-with-bounded-curvature-1112.6160"/></url>
<url><loc>https://scifaro.com/en/abs/non-crossing-connectors-in-the-plane-1201.0917</loc><lastmod>2012-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-crossing-connectors-in-the-plane-1201.0917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-crossing-connectors-in-the-plane-1201.0917"/></url>
<url><loc>https://scifaro.com/en/abs/covering-and-piercing-disks-with-two-centers-1201.1198</loc><lastmod>2012-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-and-piercing-disks-with-two-centers-1201.1198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-and-piercing-disks-with-two-centers-1201.1198"/></url>
<url><loc>https://scifaro.com/en/abs/exact-symbolic-numeric-computation-of-planar-algebraic-curves-1201.1548</loc><lastmod>2012-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-symbolic-numeric-computation-of-planar-algebraic-curves-1201.1548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-symbolic-numeric-computation-of-planar-algebraic-curves-1201.1548"/></url>
<url><loc>https://scifaro.com/en/abs/partial-searchlight-scheduling-is-strongly-pspace-complete-1201.2097</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-searchlight-scheduling-is-strongly-pspace-complete-1201.2097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-searchlight-scheduling-is-strongly-pspace-complete-1201.2097"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-for-shallow-partitions-1201.2267</loc><lastmod>2012-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-for-shallow-partitions-1201.2267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-for-shallow-partitions-1201.2267"/></url>
<url><loc>https://scifaro.com/en/abs/finding-convex-hulls-using-quickhull-on-the-gpu-1201.2936</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-convex-hulls-using-quickhull-on-the-gpu-1201.2936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-convex-hulls-using-quickhull-on-the-gpu-1201.2936"/></url>
<url><loc>https://scifaro.com/en/abs/spring-embedders-and-force-directed-graph-drawing-algorithms-1201.3011</loc><lastmod>2012-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spring-embedders-and-force-directed-graph-drawing-algorithms-1201.3011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spring-embedders-and-force-directed-graph-drawing-algorithms-1201.3011"/></url>
<url><loc>https://scifaro.com/en/abs/comparison-of-persistent-homologies-for-vector-functions-from-continuous-to-discrete-and-back-1201.3217</loc><lastmod>2013-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparison-of-persistent-homologies-for-vector-functions-from-continuous-to-discrete-and-back-1201.3217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparison-of-persistent-homologies-for-vector-functions-from-continuous-to-discrete-and-back-1201.3217"/></url>
<url><loc>https://scifaro.com/en/abs/a-toolkit-to-describe-and-interactively-display-three-manifolds-embedded-in-four-space-1201.5788</loc><lastmod>2012-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-toolkit-to-describe-and-interactively-display-three-manifolds-embedded-in-four-space-1201.5788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-toolkit-to-describe-and-interactively-display-three-manifolds-embedded-in-four-space-1201.5788"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-homology-for-simplicial-eilenberg-maclane-spaces-1201.6222</loc><lastmod>2013-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-homology-for-simplicial-eilenberg-maclane-spaces-1201.6222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-homology-for-simplicial-eilenberg-maclane-spaces-1201.6222"/></url>
<url><loc>https://scifaro.com/en/abs/practical-conditions-for-well-behaved-ness-of-anisotropic-voronoi-diagrams-1202.0867</loc><lastmod>2012-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-conditions-for-well-behaved-ness-of-anisotropic-voronoi-diagrams-1202.0867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-conditions-for-well-behaved-ness-of-anisotropic-voronoi-diagrams-1202.0867"/></url>
<url><loc>https://scifaro.com/en/abs/bottleneck-non-crossing-matching-in-the-plane-1202.4146</loc><lastmod>2012-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottleneck-non-crossing-matching-in-the-plane-1202.4146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottleneck-non-crossing-matching-in-the-plane-1202.4146"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-minimum-sum-coverage-by-aligned-disks-1202.4821</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-minimum-sum-coverage-by-aligned-disks-1202.4821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-minimum-sum-coverage-by-aligned-disks-1202.4821"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-dgss-and-gatps-in-an-adaptative-and-collaborative-blended-learning-web-environment-1202.4833</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-dgss-and-gatps-in-an-adaptative-and-collaborative-blended-learning-web-environment-1202.4833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-dgss-and-gatps-in-an-adaptative-and-collaborative-blended-learning-web-environment-1202.4833"/></url>
<url><loc>https://scifaro.com/en/abs/the-stretch-factor-of-l-1-and-l-infty-delaunay-triangulations-1202.5127</loc><lastmod>2012-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stretch-factor-of-l-1-and-l-infty-delaunay-triangulations-1202.5127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stretch-factor-of-l-1-and-l-infty-delaunay-triangulations-1202.5127"/></url>
<url><loc>https://scifaro.com/en/abs/fr-echet-distance-revisited-and-extended-1202.5610</loc><lastmod>2012-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-echet-distance-revisited-and-extended-1202.5610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-echet-distance-revisited-and-extended-1202.5610"/></url>
<url><loc>https://scifaro.com/en/abs/computing-l1-shortest-paths-among-polygonal-obstacles-in-the-plane-1202.5715</loc><lastmod>2012-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-l1-shortest-paths-among-polygonal-obstacles-in-the-plane-1202.5715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-l1-shortest-paths-among-polygonal-obstacles-in-the-plane-1202.5715"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-interference-in-random-point-sets-1202.5945</loc><lastmod>2012-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-interference-in-random-point-sets-1202.5945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-interference-in-random-point-sets-1202.5945"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-inner-product-search-using-tree-data-structures-1202.6101</loc><lastmod>2021-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-inner-product-search-using-tree-data-structures-1202.6101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-inner-product-search-using-tree-data-structures-1202.6101"/></url>
<url><loc>https://scifaro.com/en/abs/local-routing-in-graphs-embedded-on-surfaces-of-arbitrary-genus-1202.6109</loc><lastmod>2012-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-routing-in-graphs-embedded-on-surfaces-of-arbitrary-genus-1202.6109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-routing-in-graphs-embedded-on-surfaces-of-arbitrary-genus-1202.6109"/></url>
<url><loc>https://scifaro.com/en/abs/homeomorphic-approximation-of-the-intersection-curve-of-two-rational-surfaces-1203.0442</loc><lastmod>2012-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homeomorphic-approximation-of-the-intersection-curve-of-two-rational-surfaces-1203.0442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homeomorphic-approximation-of-the-intersection-curve-of-two-rational-surfaces-1203.0442"/></url>
<url><loc>https://scifaro.com/en/abs/certified-approximation-of-parametric-space-curves-with-cubic-b-spline-curves-1203.0478</loc><lastmod>2012-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-approximation-of-parametric-space-curves-with-cubic-b-spline-curves-1203.0478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-approximation-of-parametric-space-curves-with-cubic-b-spline-curves-1203.0478"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-the-geographical-studies-with-geogebra-software-1203.0912</loc><lastmod>2012-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-the-geographical-studies-with-geogebra-software-1203.0912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-the-geographical-studies-with-geogebra-software-1203.0912"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-arrangement-based-range-free-localization-in-sensor-networks-1203.1042</loc><lastmod>2012-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-arrangement-based-range-free-localization-in-sensor-networks-1203.1042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-arrangement-based-range-free-localization-in-sensor-networks-1203.1042"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-free-graph-orientations-with-parity-constraints-1203.3256</loc><lastmod>2012-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-free-graph-orientations-with-parity-constraints-1203.3256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-free-graph-orientations-with-parity-constraints-1203.3256"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-position-localization-and-tracking-dplt-of-malicious-nodes-in-cluster-based-mobile-ad-hoc-networks-manet-1203.3601</loc><lastmod>2012-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-position-localization-and-tracking-dplt-of-malicious-nodes-in-cluster-based-mobile-ad-hoc-networks-manet-1203.3601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-position-localization-and-tracking-dplt-of-malicious-nodes-in-cluster-based-mobile-ad-hoc-networks-manet-1203.3601"/></url>
<url><loc>https://scifaro.com/en/abs/atlasing-of-assembly-landscapes-using-distance-geometry-and-graph-rigidity-1203.3811</loc><lastmod>2020-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/atlasing-of-assembly-landscapes-using-distance-geometry-and-graph-rigidity-1203.3811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/atlasing-of-assembly-landscapes-using-distance-geometry-and-graph-rigidity-1203.3811"/></url>
<url><loc>https://scifaro.com/en/abs/skeletal-rigidity-of-phylogenetic-trees-1203.5782</loc><lastmod>2015-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skeletal-rigidity-of-phylogenetic-trees-1203.5782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skeletal-rigidity-of-phylogenetic-trees-1203.5782"/></url>
<url><loc>https://scifaro.com/en/abs/adding-one-edge-to-planar-graphs-makes-crossing-number-and-1-planarity-hard-1203.5944</loc><lastmod>2012-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-one-edge-to-planar-graphs-makes-crossing-number-and-1-planarity-hard-1203.5944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-one-edge-to-planar-graphs-makes-crossing-number-and-1-planarity-hard-1203.5944"/></url>
<url><loc>https://scifaro.com/en/abs/circle-separability-queries-in-logarithmic-time-1203.6266</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circle-separability-queries-in-logarithmic-time-1203.6266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circle-separability-queries-in-logarithmic-time-1203.6266"/></url>
<url><loc>https://scifaro.com/en/abs/general-analysis-tool-box-for-controlled-perturbation-1203.6464</loc><lastmod>2012-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-analysis-tool-box-for-controlled-perturbation-1203.6464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-analysis-tool-box-for-controlled-perturbation-1203.6464"/></url>
<url><loc>https://scifaro.com/en/abs/polylogarithmic-approximation-for-generalized-minimum-manhattan-networks-1203.6481</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polylogarithmic-approximation-for-generalized-minimum-manhattan-networks-1203.6481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polylogarithmic-approximation-for-generalized-minimum-manhattan-networks-1203.6481"/></url>
<url><loc>https://scifaro.com/en/abs/linear-size-approximations-to-the-vietoris-rips-filtration-1203.6786</loc><lastmod>2013-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-size-approximations-to-the-vietoris-rips-filtration-1203.6786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-size-approximations-to-the-vietoris-rips-filtration-1203.6786"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-radial-orderings-of-planar-point-sets-1204.0547</loc><lastmod>2012-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-radial-orderings-of-planar-point-sets-1204.0547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-radial-orderings-of-planar-point-sets-1204.0547"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-approximation-for-crossing-number-1204.0660</loc><lastmod>2012-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-approximation-for-crossing-number-1204.0660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-approximation-for-crossing-number-1204.0660"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-hodge-star-1204.0747</loc><lastmod>2017-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-hodge-star-1204.0747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-hodge-star-1204.0747"/></url>
<url><loc>https://scifaro.com/en/abs/self-improving-algorithms-for-coordinate-wise-maxima-1204.0824</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-improving-algorithms-for-coordinate-wise-maxima-1204.0824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-improving-algorithms-for-coordinate-wise-maxima-1204.0824"/></url>
<url><loc>https://scifaro.com/en/abs/certified-rational-parametric-approximation-of-real-algebraic-space-curves-with-local-generic-position-method-1204.0905</loc><lastmod>2012-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-rational-parametric-approximation-of-real-algebraic-space-curves-with-local-generic-position-method-1204.0905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-rational-parametric-approximation-of-real-algebraic-space-curves-with-local-generic-position-method-1204.0905"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-theorem-and-an-algorithm-for-a-convex-hull-problem-1204.1873</loc><lastmod>2013-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-theorem-and-an-algorithm-for-a-convex-hull-problem-1204.1873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-theorem-and-an-algorithm-for-a-convex-hull-problem-1204.1873"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-techniques-to-find-optimal-planar-boxes-1204.2034</loc><lastmod>2012-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-techniques-to-find-optimal-planar-boxes-1204.2034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-techniques-to-find-optimal-planar-boxes-1204.2034"/></url>
<url><loc>https://scifaro.com/en/abs/vie-physarale-evaluation-of-roman-roads-with-slime-mould-1204.2260</loc><lastmod>2012-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vie-physarale-evaluation-of-roman-roads-with-slime-mould-1204.2260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vie-physarale-evaluation-of-roman-roads-with-slime-mould-1204.2260"/></url>
<url><loc>https://scifaro.com/en/abs/space-efficient-algorithms-for-visibility-problems-in-simple-polygon-1204.2634</loc><lastmod>2012-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-efficient-algorithms-for-visibility-problems-in-simple-polygon-1204.2634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-efficient-algorithms-for-visibility-problems-in-simple-polygon-1204.2634"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-solution-for-computing-circle-intersection-areas-and-its-applications-to-wireless-communications-1204.3569</loc><lastmod>2024-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-solution-for-computing-circle-intersection-areas-and-its-applications-to-wireless-communications-1204.3569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-solution-for-computing-circle-intersection-areas-and-its-applications-to-wireless-communications-1204.3569"/></url>
<url><loc>https://scifaro.com/en/abs/simple-agents-learn-to-find-their-way-an-introduction-on-mapping-polygons-1204.3850</loc><lastmod>2018-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-agents-learn-to-find-their-way-an-introduction-on-mapping-polygons-1204.3850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-agents-learn-to-find-their-way-an-introduction-on-mapping-polygons-1204.3850"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-city-voronoi-diagrams-1204.4374</loc><lastmod>2012-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-city-voronoi-diagrams-1204.4374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-city-voronoi-diagrams-1204.4374"/></url>
<url><loc>https://scifaro.com/en/abs/robust-geometric-spanners-1204.4679</loc><lastmod>2013-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-geometric-spanners-1204.4679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-geometric-spanners-1204.4679"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-planar-point-location-with-sub-logarithmic-local-updates-1204.4714</loc><lastmod>2013-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-planar-point-location-with-sub-logarithmic-local-updates-1204.4714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-planar-point-location-with-sub-logarithmic-local-updates-1204.4714"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-discrete-fr-echet-distance-in-subquadratic-time-1204.5333</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-discrete-fr-echet-distance-in-subquadratic-time-1204.5333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-discrete-fr-echet-distance-in-subquadratic-time-1204.5333"/></url>
<url><loc>https://scifaro.com/en/abs/the-traveling-salesman-problem-for-lines-and-rays-in-the-plane-1204.5828</loc><lastmod>2012-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-traveling-salesman-problem-for-lines-and-rays-in-the-plane-1204.5828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-traveling-salesman-problem-for-lines-and-rays-in-the-plane-1204.5828"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-on-euclidean-embeddings-of-rigid-graphs-with-8-vertices-1204.6527</loc><lastmod>2014-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-on-euclidean-embeddings-of-rigid-graphs-with-8-vertices-1204.6527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-on-euclidean-embeddings-of-rigid-graphs-with-8-vertices-1204.6527"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-clustering-in-high-dimensional-space-1204.6699</loc><lastmod>2012-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-clustering-in-high-dimensional-space-1204.6699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-clustering-in-high-dimensional-space-1204.6699"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-algorithm-for-projective-clustering-1204.6717</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-algorithm-for-projective-clustering-1204.6717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-algorithm-for-projective-clustering-1204.6717"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-computations-on-indecisive-and-uncertain-points-1205.0273</loc><lastmod>2012-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-computations-on-indecisive-and-uncertain-points-1205.0273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-computations-on-indecisive-and-uncertain-points-1205.0273"/></url>
<url><loc>https://scifaro.com/en/abs/on-projections-of-arbitrary-lattices-1205.0910</loc><lastmod>2013-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-projections-of-arbitrary-lattices-1205.0910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-projections-of-arbitrary-lattices-1205.0910"/></url>
<url><loc>https://scifaro.com/en/abs/source-unfoldings-of-convex-polyhedra-via-certain-closed-curves-1205.0963</loc><lastmod>2012-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/source-unfoldings-of-convex-polyhedra-via-certain-closed-curves-1205.0963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/source-unfoldings-of-convex-polyhedra-via-certain-closed-curves-1205.0963"/></url>
<url><loc>https://scifaro.com/en/abs/volumetric-mapping-of-genus-zero-objects-via-mass-preservation-1205.1225</loc><lastmod>2012-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/volumetric-mapping-of-genus-zero-objects-via-mass-preservation-1205.1225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/volumetric-mapping-of-genus-zero-objects-via-mass-preservation-1205.1225"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-majority-depth-1205.1524</loc><lastmod>2013-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-majority-depth-1205.1524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-majority-depth-1205.1524"/></url>
<url><loc>https://scifaro.com/en/abs/locating-a-single-facility-and-a-high-speed-line-1205.1556</loc><lastmod>2012-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locating-a-single-facility-and-a-high-speed-line-1205.1556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locating-a-single-facility-and-a-high-speed-line-1205.1556"/></url>
<url><loc>https://scifaro.com/en/abs/the-1-center-and-1-highway-problem-1205.1882</loc><lastmod>2012-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-1-center-and-1-highway-problem-1205.1882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-1-center-and-1-highway-problem-1205.1882"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-prismatoids-as-convex-patches-counterexamples-and-positive-results-1205.2048</loc><lastmod>2012-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-prismatoids-as-convex-patches-counterexamples-and-positive-results-1205.2048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-prismatoids-as-convex-patches-counterexamples-and-positive-results-1205.2048"/></url>
<url><loc>https://scifaro.com/en/abs/flip-distance-between-two-triangulations-of-a-point-set-is-np-complete-1205.2425</loc><lastmod>2012-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-distance-between-two-triangulations-of-a-point-set-is-np-complete-1205.2425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-distance-between-two-triangulations-of-a-point-set-is-np-complete-1205.2425"/></url>
<url><loc>https://scifaro.com/en/abs/outerplanar-graph-drawings-with-few-slopes-1205.2548</loc><lastmod>2014-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outerplanar-graph-drawings-with-few-slopes-1205.2548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outerplanar-graph-drawings-with-few-slopes-1205.2548"/></url>
<url><loc>https://scifaro.com/en/abs/triangulating-the-square-and-squaring-the-triangle-quadtrees-and-delaunay-triangulations-are-equivalent-1205.4738</loc><lastmod>2012-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangulating-the-square-and-squaring-the-triangle-quadtrees-and-delaunay-triangulations-are-equivalent-1205.4738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangulating-the-square-and-squaring-the-triangle-quadtrees-and-delaunay-triangulations-are-equivalent-1205.4738"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-and-guarding-arrangements-1205.5162</loc><lastmod>2012-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-and-guarding-arrangements-1205.5162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-and-guarding-arrangements-1205.5162"/></url>
<url><loc>https://scifaro.com/en/abs/improved-implementation-of-point-location-in-general-two-dimensional-subdivisions-1205.5434</loc><lastmod>2015-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-implementation-of-point-location-in-general-two-dimensional-subdivisions-1205.5434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-implementation-of-point-location-in-general-two-dimensional-subdivisions-1205.5434"/></url>
<url><loc>https://scifaro.com/en/abs/signed-simplicial-decomposition-and-overlay-of-n-d-polytope-complexes-1205.5691</loc><lastmod>2012-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signed-simplicial-decomposition-and-overlay-of-n-d-polytope-complexes-1205.5691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signed-simplicial-decomposition-and-overlay-of-n-d-polytope-complexes-1205.5691"/></url>
<url><loc>https://scifaro.com/en/abs/good-covers-are-algorithmically-unrecognizable-1205.6082</loc><lastmod>2016-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/good-covers-are-algorithmically-unrecognizable-1205.6082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/good-covers-are-algorithmically-unrecognizable-1205.6082"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-stretch-factor-of-randomly-embedded-random-graphs-1205.6252</loc><lastmod>2013-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-randomly-embedded-random-graphs-1205.6252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-randomly-embedded-random-graphs-1205.6252"/></url>
<url><loc>https://scifaro.com/en/abs/robust-non-parametric-data-approximation-of-pointsets-via-data-reduction-1205.6717</loc><lastmod>2012-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-non-parametric-data-approximation-of-pointsets-via-data-reduction-1205.6717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-non-parametric-data-approximation-of-pointsets-via-data-reduction-1205.6717"/></url>
<url><loc>https://scifaro.com/en/abs/a-history-of-flips-in-combinatorial-triangulations-1206.0303</loc><lastmod>2013-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-history-of-flips-in-combinatorial-triangulations-1206.0303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-history-of-flips-in-combinatorial-triangulations-1206.0303"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-embeddings-with-vertices-mapping-to-pre-specified-points-1206.0514</loc><lastmod>2012-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-embeddings-with-vertices-mapping-to-pre-specified-points-1206.0514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-embeddings-with-vertices-mapping-to-pre-specified-points-1206.0514"/></url>
<url><loc>https://scifaro.com/en/abs/large-convex-holes-in-random-point-sets-1206.0805</loc><lastmod>2012-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-convex-holes-in-random-point-sets-1206.0805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-convex-holes-in-random-point-sets-1206.0805"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-local-homology-from-samples-1206.0834</loc><lastmod>2013-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-local-homology-from-samples-1206.0834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-local-homology-from-samples-1206.0834"/></url>
<url><loc>https://scifaro.com/en/abs/from-pop-up-cards-to-coffee-cup-caustics-the-knight-s-visor-1206.1312</loc><lastmod>2012-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-pop-up-cards-to-coffee-cup-caustics-the-knight-s-visor-1206.1312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-pop-up-cards-to-coffee-cup-caustics-the-knight-s-visor-1206.1312"/></url>
<url><loc>https://scifaro.com/en/abs/the-visible-perimeter-of-an-arrangement-of-disks-1206.1422</loc><lastmod>2013-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-visible-perimeter-of-an-arrangement-of-disks-1206.1422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-visible-perimeter-of-an-arrangement-of-disks-1206.1422"/></url>
<url><loc>https://scifaro.com/en/abs/hidden-mobile-guards-in-simple-polygons-1206.1803</loc><lastmod>2012-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hidden-mobile-guards-in-simple-polygons-1206.1803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hidden-mobile-guards-in-simple-polygons-1206.1803"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-monotonic-polygon-deflation-1206.1982</loc><lastmod>2019-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-monotonic-polygon-deflation-1206.1982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-monotonic-polygon-deflation-1206.1982"/></url>
<url><loc>https://scifaro.com/en/abs/near-linear-time-deterministic-plane-steiner-spanners-and-tsp-approximation-for-well-spaced-point-sets-1206.2254</loc><lastmod>2016-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-linear-time-deterministic-plane-steiner-spanners-and-tsp-approximation-for-well-spaced-point-sets-1206.2254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-linear-time-deterministic-plane-steiner-spanners-and-tsp-approximation-for-well-spaced-point-sets-1206.2254"/></url>
<url><loc>https://scifaro.com/en/abs/flip-distance-between-triangulations-of-a-planar-point-set-is-apx-hard-1206.3179</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-distance-between-triangulations-of-a-planar-point-set-is-apx-hard-1206.3179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-distance-between-triangulations-of-a-planar-point-set-is-apx-hard-1206.3179"/></url>
<url><loc>https://scifaro.com/en/abs/functional-currents-a-new-mathematical-tool-to-model-and-analyse-functional-shapes-1206.3564</loc><lastmod>2013-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-currents-a-new-mathematical-tool-to-model-and-analyse-functional-shapes-1206.3564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-currents-a-new-mathematical-tool-to-model-and-analyse-functional-shapes-1206.3564"/></url>
<url><loc>https://scifaro.com/en/abs/an-infinite-class-of-sparse-yao-spanners-1206.3628</loc><lastmod>2012-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-infinite-class-of-sparse-yao-spanners-1206.3628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-infinite-class-of-sparse-yao-spanners-1206.3628"/></url>
<url><loc>https://scifaro.com/en/abs/robust-statistics-hypothesis-testing-and-confidence-intervals-for-persistent-homology-on-metric-measure-spaces-1206.4581</loc><lastmod>2014-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-statistics-hypothesis-testing-and-confidence-intervals-for-persistent-homology-on-metric-measure-spaces-1206.4581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-statistics-hypothesis-testing-and-confidence-intervals-for-persistent-homology-on-metric-measure-spaces-1206.4581"/></url>
<url><loc>https://scifaro.com/en/abs/bend-bounded-path-intersection-graphs-sausages-noodles-and-waffles-on-a-grill-1206.5159</loc><lastmod>2012-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bend-bounded-path-intersection-graphs-sausages-noodles-and-waffles-on-a-grill-1206.5159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bend-bounded-path-intersection-graphs-sausages-noodles-and-waffles-on-a-grill-1206.5159"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-upper-bound-for-the-vc-dimension-of-visibility-regions-1206.5689</loc><lastmod>2012-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-upper-bound-for-the-vc-dimension-of-visibility-regions-1206.5689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-upper-bound-for-the-vc-dimension-of-visibility-regions-1206.5689"/></url>
<url><loc>https://scifaro.com/en/abs/planar-lombardi-drawings-for-subcubic-graphs-1206.6142</loc><lastmod>2012-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-lombardi-drawings-for-subcubic-graphs-1206.6142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-lombardi-drawings-for-subcubic-graphs-1206.6142"/></url>
<url><loc>https://scifaro.com/en/abs/locally-correct-frechet-matchings-1206.6257</loc><lastmod>2012-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locally-correct-frechet-matchings-1206.6257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locally-correct-frechet-matchings-1206.6257"/></url>
<url><loc>https://scifaro.com/en/abs/single-source-dilation-bounded-minimum-spanning-trees-1206.6943</loc><lastmod>2012-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/single-source-dilation-bounded-minimum-spanning-trees-1206.6943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/single-source-dilation-bounded-minimum-spanning-trees-1206.6943"/></url>
<url><loc>https://scifaro.com/en/abs/faster-geometric-algorithms-via-dynamic-determinant-computation-1206.7067</loc><lastmod>2016-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-geometric-algorithms-via-dynamic-determinant-computation-1206.7067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-geometric-algorithms-via-dynamic-determinant-computation-1206.7067"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-coloring-line-arrangements-1207.0080</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-coloring-line-arrangements-1207.0080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-coloring-line-arrangements-1207.0080"/></url>
<url><loc>https://scifaro.com/en/abs/online-exploration-of-polygons-with-holes-1207.0240</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-exploration-of-polygons-with-holes-1207.0240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-exploration-of-polygons-with-holes-1207.0240"/></url>
<url><loc>https://scifaro.com/en/abs/the-number-of-distinct-distances-from-a-vertex-of-a-convex-polygon-1207.1266</loc><lastmod>2013-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-number-of-distinct-distances-from-a-vertex-of-a-convex-polygon-1207.1266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-number-of-distinct-distances-from-a-vertex-of-a-convex-polygon-1207.1266"/></url>
<url><loc>https://scifaro.com/en/abs/bichromatic-compatible-matchings-1207.2375</loc><lastmod>2013-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bichromatic-compatible-matchings-1207.2375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bichromatic-compatible-matchings-1207.2375"/></url>
<url><loc>https://scifaro.com/en/abs/an-xml-format-for-conjectures-in-geometry-work-in-progress-1207.2511</loc><lastmod>2012-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-xml-format-for-conjectures-in-geometry-work-in-progress-1207.2511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-xml-format-for-conjectures-in-geometry-work-in-progress-1207.2511"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-the-dual-complex-of-hyper-rectangular-partitions-1207.3202</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-the-dual-complex-of-hyper-rectangular-partitions-1207.3202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-the-dual-complex-of-hyper-rectangular-partitions-1207.3202"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-convex-decompositions-1207.3468</loc><lastmod>2012-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-convex-decompositions-1207.3468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-convex-decompositions-1207.3468"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-and-correct-even-odd-algorithm-for-the-point-in-polygon-problem-for-complex-polygons-1207.3502</loc><lastmod>2017-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-and-correct-even-odd-algorithm-for-the-point-in-polygon-problem-for-complex-polygons-1207.3502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-and-correct-even-odd-algorithm-for-the-point-in-polygon-problem-for-complex-polygons-1207.3502"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-the-hausdorff-distance-between-sets-of-line-segments-in-parallel-1207.3962</loc><lastmod>2012-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-the-hausdorff-distance-between-sets-of-line-segments-in-parallel-1207.3962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-the-hausdorff-distance-between-sets-of-line-segments-in-parallel-1207.3962"/></url>
<url><loc>https://scifaro.com/en/abs/on-locally-gabriel-geometric-graphs-1207.4082</loc><lastmod>2012-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-locally-gabriel-geometric-graphs-1207.4082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-locally-gabriel-geometric-graphs-1207.4082"/></url>
<url><loc>https://scifaro.com/en/abs/diamond-kite-adaptive-quadrilateral-meshing-1207.5082</loc><lastmod>2014-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diamond-kite-adaptive-quadrilateral-meshing-1207.5082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diamond-kite-adaptive-quadrilateral-meshing-1207.5082"/></url>
<url><loc>https://scifaro.com/en/abs/effective-topological-degree-computation-based-on-interval-arithmetic-1207.6331</loc><lastmod>2014-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-topological-degree-computation-based-on-interval-arithmetic-1207.6331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-topological-degree-computation-based-on-interval-arithmetic-1207.6331"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-on-minimizing-the-maximum-sensor-movement-for-barrier-coverage-of-a-linear-domain-1207.6409</loc><lastmod>2015-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-on-minimizing-the-maximum-sensor-movement-for-barrier-coverage-of-a-linear-domain-1207.6409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-on-minimizing-the-maximum-sensor-movement-for-barrier-coverage-of-a-linear-domain-1207.6409"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-rose-the-first-simple-symmetric-11-venn-diagram-1207.6452</loc><lastmod>2012-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-rose-the-first-simple-symmetric-11-venn-diagram-1207.6452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-rose-the-first-simple-symmetric-11-venn-diagram-1207.6452"/></url>
<url><loc>https://scifaro.com/en/abs/the-medusa-of-spatial-sorting-topological-construction-1207.6474</loc><lastmod>2012-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-medusa-of-spatial-sorting-topological-construction-1207.6474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-medusa-of-spatial-sorting-topological-construction-1207.6474"/></url>
<url><loc>https://scifaro.com/en/abs/two-player-game-variant-of-the-erdos-szekeres-problem-1207.6778</loc><lastmod>2012-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-player-game-variant-of-the-erdos-szekeres-problem-1207.6778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-player-game-variant-of-the-erdos-szekeres-problem-1207.6778"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-maxmin-length-triangulation-1208.0202</loc><lastmod>2012-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-maxmin-length-triangulation-1208.0202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-maxmin-length-triangulation-1208.0202"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-algorithm-for-optimal-feed-link-placement-1208.0395</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-algorithm-for-optimal-feed-link-placement-1208.0395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-algorithm-for-optimal-feed-link-placement-1208.0395"/></url>
<url><loc>https://scifaro.com/en/abs/point-separable-classes-of-simple-computable-planar-curves-1208.2245</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-separable-classes-of-simple-computable-planar-curves-1208.2245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-separable-classes-of-simple-computable-planar-curves-1208.2245"/></url>
<url><loc>https://scifaro.com/en/abs/compressive-sensing-with-local-geometric-features-1208.2447</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compressive-sensing-with-local-geometric-features-1208.2447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compressive-sensing-with-local-geometric-features-1208.2447"/></url>
<url><loc>https://scifaro.com/en/abs/small-strong-epsilon-nets-1208.2785</loc><lastmod>2012-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-strong-epsilon-nets-1208.2785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-strong-epsilon-nets-1208.2785"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computation-of-zone-and-double-zone-diagrams-1208.3124</loc><lastmod>2018-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computation-of-zone-and-double-zone-diagrams-1208.3124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computation-of-zone-and-double-zone-diagrams-1208.3124"/></url>
<url><loc>https://scifaro.com/en/abs/analytical-solution-for-the-generalized-fermat-torricelli-problem-1208.3324</loc><lastmod>2014-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analytical-solution-for-the-generalized-fermat-torricelli-problem-1208.3324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analytical-solution-for-the-generalized-fermat-torricelli-problem-1208.3324"/></url>
<url><loc>https://scifaro.com/en/abs/on-range-searching-with-semialgebraic-sets-ii-1208.3384</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-range-searching-with-semialgebraic-sets-ii-1208.3384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-range-searching-with-semialgebraic-sets-ii-1208.3384"/></url>
<url><loc>https://scifaro.com/en/abs/space-time-trade-offs-for-stack-based-algorithms-1208.3663</loc><lastmod>2014-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-time-trade-offs-for-stack-based-algorithms-1208.3663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-time-trade-offs-for-stack-based-algorithms-1208.3663"/></url>
<url><loc>https://scifaro.com/en/abs/computing-topological-persistence-for-simplicial-maps-1208.5018</loc><lastmod>2014-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-topological-persistence-for-simplicial-maps-1208.5018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-topological-persistence-for-simplicial-maps-1208.5018"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existence-of-a-neutral-region-1208.5045</loc><lastmod>2012-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existence-of-a-neutral-region-1208.5045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existence-of-a-neutral-region-1208.5045"/></url>
<url><loc>https://scifaro.com/en/abs/g2-matrix-manifold-a-software-construct-1208.6188</loc><lastmod>2012-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/g2-matrix-manifold-a-software-construct-1208.6188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/g2-matrix-manifold-a-software-construct-1208.6188"/></url>
<url><loc>https://scifaro.com/en/abs/counting-plane-graphs-cross-graph-charging-schemes-1209.0194</loc><lastmod>2012-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-plane-graphs-cross-graph-charging-schemes-1209.0194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-plane-graphs-cross-graph-charging-schemes-1209.0194"/></url>
<url><loc>https://scifaro.com/en/abs/flip-distance-between-triangulations-of-a-simple-polygon-is-np-complete-1209.0579</loc><lastmod>2017-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-distance-between-triangulations-of-a-simple-polygon-is-np-complete-1209.0579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-distance-between-triangulations-of-a-simple-polygon-is-np-complete-1209.0579"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-weight-euclidean-t-spanner-is-np-hard-1209.0679</loc><lastmod>2012-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-weight-euclidean-t-spanner-is-np-hard-1209.0679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-weight-euclidean-t-spanner-is-np-hard-1209.0679"/></url>
<url><loc>https://scifaro.com/en/abs/force-directed-graph-drawing-using-social-gravity-and-scaling-1209.0748</loc><lastmod>2012-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/force-directed-graph-drawing-using-social-gravity-and-scaling-1209.0748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/force-directed-graph-drawing-using-social-gravity-and-scaling-1209.0748"/></url>
<url><loc>https://scifaro.com/en/abs/progress-on-partial-edge-drawings-1209.0830</loc><lastmod>2012-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progress-on-partial-edge-drawings-1209.0830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progress-on-partial-edge-drawings-1209.0830"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-the-convex-kakeya-problem-1209.2171</loc><lastmod>2012-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-the-convex-kakeya-problem-1209.2171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-the-convex-kakeya-problem-1209.2171"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-on-point-visibility-graphs-1209.2308</loc><lastmod>2014-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-on-point-visibility-graphs-1209.2308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-on-point-visibility-graphs-1209.2308"/></url>
<url><loc>https://scifaro.com/en/abs/unit-disk-cover-problem-1209.2951</loc><lastmod>2012-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-disk-cover-problem-1209.2951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-disk-cover-problem-1209.2951"/></url>
<url><loc>https://scifaro.com/en/abs/on-universal-point-sets-for-planar-graphs-1209.3594</loc><lastmod>2013-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-universal-point-sets-for-planar-graphs-1209.3594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-universal-point-sets-for-planar-graphs-1209.3594"/></url>
<url><loc>https://scifaro.com/en/abs/edge-routing-with-ordered-bundles-1209.4227</loc><lastmod>2012-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-routing-with-ordered-bundles-1209.4227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-routing-with-ordered-bundles-1209.4227"/></url>
<url><loc>https://scifaro.com/en/abs/four-soviets-walk-the-dog-improved-bounds-for-computing-the-fr-echet-distance-1209.4403</loc><lastmod>2017-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/four-soviets-walk-the-dog-improved-bounds-for-computing-the-fr-echet-distance-1209.4403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/four-soviets-walk-the-dog-improved-bounds-for-computing-the-fr-echet-distance-1209.4403"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-simulation-of-locally-optimal-tool-paths-in-three-axis-milling-1209.4854</loc><lastmod>2014-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-simulation-of-locally-optimal-tool-paths-in-three-axis-milling-1209.4854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-simulation-of-locally-optimal-tool-paths-in-three-axis-milling-1209.4854"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-sensitivity-of-shape-fitting-problems-1209.4893</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-sensitivity-of-shape-fitting-problems-1209.4893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-sensitivity-of-shape-fitting-problems-1209.4893"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-schemes-for-covering-and-packing-1209.5199</loc><lastmod>2012-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-schemes-for-covering-and-packing-1209.5199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-schemes-for-covering-and-packing-1209.5199"/></url>
<url><loc>https://scifaro.com/en/abs/packing-identical-simple-polygons-is-np-hard-1209.5307</loc><lastmod>2012-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-identical-simple-polygons-is-np-hard-1209.5307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-identical-simple-polygons-is-np-hard-1209.5307"/></url>
<url><loc>https://scifaro.com/en/abs/the-medusa-of-spatial-sorting-3d-kinetic-alpha-complexes-and-implementation-1209.5434</loc><lastmod>2012-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-medusa-of-spatial-sorting-3d-kinetic-alpha-complexes-and-implementation-1209.5434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-medusa-of-spatial-sorting-3d-kinetic-alpha-complexes-and-implementation-1209.5434"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-topological-n-k-configurations-1210.0306</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-topological-n-k-configurations-1210.0306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-topological-n-k-configurations-1210.0306"/></url>
<url><loc>https://scifaro.com/en/abs/planar-shape-manipulation-using-approximate-geometric-primitives-1210.0607</loc><lastmod>2012-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-shape-manipulation-using-approximate-geometric-primitives-1210.0607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-shape-manipulation-using-approximate-geometric-primitives-1210.0607"/></url>
<url><loc>https://scifaro.com/en/abs/contributions-to-persistence-theory-1210.3092</loc><lastmod>2014-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contributions-to-persistence-theory-1210.3092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contributions-to-persistence-theory-1210.3092"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-gromov-hyperbolicity-of-a-discrete-metric-space-1210.3323</loc><lastmod>2015-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-gromov-hyperbolicity-of-a-discrete-metric-space-1210.3323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-gromov-hyperbolicity-of-a-discrete-metric-space-1210.3323"/></url>
<url><loc>https://scifaro.com/en/abs/plane-sweep-incremental-algorithm-computing-delaunay-tessellations-of-large-datasets-1210.3595</loc><lastmod>2012-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-sweep-incremental-algorithm-computing-delaunay-tessellations-of-large-datasets-1210.3595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-sweep-incremental-algorithm-computing-delaunay-tessellations-of-large-datasets-1210.3595"/></url>
<url><loc>https://scifaro.com/en/abs/inapproximability-of-the-smallest-superpolyomino-problem-1210.3877</loc><lastmod>2012-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inapproximability-of-the-smallest-superpolyomino-problem-1210.3877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inapproximability-of-the-smallest-superpolyomino-problem-1210.3877"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-tetrahedralizations-with-steiner-points-1210.5484</loc><lastmod>2012-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-tetrahedralizations-with-steiner-points-1210.5484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-tetrahedralizations-with-steiner-points-1210.5484"/></url>
<url><loc>https://scifaro.com/en/abs/index-notation-of-grid-graphs-1210.7123</loc><lastmod>2012-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/index-notation-of-grid-graphs-1210.7123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/index-notation-of-grid-graphs-1210.7123"/></url>
<url><loc>https://scifaro.com/en/abs/on-numbers-of-pseudo-triangulations-1210.7126</loc><lastmod>2012-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-numbers-of-pseudo-triangulations-1210.7126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-numbers-of-pseudo-triangulations-1210.7126"/></url>
<url><loc>https://scifaro.com/en/abs/an-interactive-programme-for-steiner-trees-1210.7788</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interactive-programme-for-steiner-trees-1210.7788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interactive-programme-for-steiner-trees-1210.7788"/></url>
<url><loc>https://scifaro.com/en/abs/limited-capacity-many-to-many-point-matching-in-one-dimension-1210.8123</loc><lastmod>2012-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limited-capacity-many-to-many-point-matching-in-one-dimension-1210.8123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limited-capacity-many-to-many-point-matching-in-one-dimension-1210.8123"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-opaque-covers-for-polygonal-regions-1210.8139</loc><lastmod>2012-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-opaque-covers-for-polygonal-regions-1210.8139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-opaque-covers-for-polygonal-regions-1210.8139"/></url>
<url><loc>https://scifaro.com/en/abs/the-hyperbolic-voronoi-diagram-in-arbitrary-dimension-1210.8234</loc><lastmod>2021-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hyperbolic-voronoi-diagram-in-arbitrary-dimension-1210.8234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hyperbolic-voronoi-diagram-in-arbitrary-dimension-1210.8234"/></url>
<url><loc>https://scifaro.com/en/abs/improving-the-numerical-robustness-of-sphere-swept-collision-detection-1211.0059</loc><lastmod>2012-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-the-numerical-robustness-of-sphere-swept-collision-detection-1211.0059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-the-numerical-robustness-of-sphere-swept-collision-detection-1211.0059"/></url>
<url><loc>https://scifaro.com/en/abs/harmonious-hilbert-curves-and-other-extradimensional-space-filling-curves-1211.0175</loc><lastmod>2012-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/harmonious-hilbert-curves-and-other-extradimensional-space-filling-curves-1211.0175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/harmonious-hilbert-curves-and-other-extradimensional-space-filling-curves-1211.0175"/></url>
<url><loc>https://scifaro.com/en/abs/self-improving-algorithms-for-coordinate-wise-maxima-and-convex-hulls-1211.0952</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-improving-algorithms-for-coordinate-wise-maxima-and-convex-hulls-1211.0952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-improving-algorithms-for-coordinate-wise-maxima-and-convex-hulls-1211.0952"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-statistics-vertex-extraction-and-tracing-algorithm-osveta-1211.1345</loc><lastmod>2012-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-statistics-vertex-extraction-and-tracing-algorithm-osveta-1211.1345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-statistics-vertex-extraction-and-tracing-algorithm-osveta-1211.1345"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-results-on-curve-point-set-matching-with-fr-echet-distance-1211.2030</loc><lastmod>2012-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-results-on-curve-point-set-matching-with-fr-echet-distance-1211.2030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-results-on-curve-point-set-matching-with-fr-echet-distance-1211.2030"/></url>
<url><loc>https://scifaro.com/en/abs/trees-in-simple-polygons-1211.2118</loc><lastmod>2012-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-in-simple-polygons-1211.2118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-in-simple-polygons-1211.2118"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-and-searching-polyhedra-1211.2483</loc><lastmod>2012-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-and-searching-polyhedra-1211.2483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-and-searching-polyhedra-1211.2483"/></url>
<url><loc>https://scifaro.com/en/abs/teichm-uller-extremal-mapping-and-its-applications-to-landmark-matching-registration-1211.2569</loc><lastmod>2012-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teichm-uller-extremal-mapping-and-its-applications-to-landmark-matching-registration-1211.2569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teichm-uller-extremal-mapping-and-its-applications-to-landmark-matching-registration-1211.2569"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-orientation-equilateral-triangle-matching-of-point-sets-1211.2734</loc><lastmod>2012-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-orientation-equilateral-triangle-matching-of-point-sets-1211.2734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-orientation-equilateral-triangle-matching-of-point-sets-1211.2734"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-computation-of-homotopy-groups-and-postnikov-systems-in-fixed-dimension-1211.3093</loc><lastmod>2014-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-computation-of-homotopy-groups-and-postnikov-systems-in-fixed-dimension-1211.3093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-computation-of-homotopy-groups-and-postnikov-systems-in-fixed-dimension-1211.3093"/></url>
<url><loc>https://scifaro.com/en/abs/clipping-of-arbitrary-polygons-with-degeneracies-1211.3376</loc><lastmod>2014-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clipping-of-arbitrary-polygons-with-degeneracies-1211.3376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clipping-of-arbitrary-polygons-with-degeneracies-1211.3376"/></url>
<url><loc>https://scifaro.com/en/abs/determining-the-number-of-holes-of-a-2d-digital-component-is-easy-1211.3812</loc><lastmod>2012-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determining-the-number-of-holes-of-a-2d-digital-component-is-easy-1211.3812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determining-the-number-of-holes-of-a-2d-digital-component-is-easy-1211.3812"/></url>
<url><loc>https://scifaro.com/en/abs/visiting-all-sites-with-your-dog-1211.4559</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visiting-all-sites-with-your-dog-1211.4559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visiting-all-sites-with-your-dog-1211.4559"/></url>
<url><loc>https://scifaro.com/en/abs/angle-optimization-of-graphs-embedded-in-the-plane-1211.4927</loc><lastmod>2013-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angle-optimization-of-graphs-embedded-in-the-plane-1211.4927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angle-optimization-of-graphs-embedded-in-the-plane-1211.4927"/></url>
<url><loc>https://scifaro.com/en/abs/on-top-k-weighted-sum-aggregate-nearest-and-farthest-neighbors-in-the-l-1-plane-1211.5084</loc><lastmod>2014-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-top-k-weighted-sum-aggregate-nearest-and-farthest-neighbors-in-the-l-1-plane-1211.5084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-top-k-weighted-sum-aggregate-nearest-and-farthest-neighbors-in-the-l-1-plane-1211.5084"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-convex-transversals-1211.5107</loc><lastmod>2012-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-convex-transversals-1211.5107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-convex-transversals-1211.5107"/></url>
<url><loc>https://scifaro.com/en/abs/hardware-accelerated-raycasting-towards-an-effective-brain-mri-visualization-1211.5595</loc><lastmod>2012-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardware-accelerated-raycasting-towards-an-effective-brain-mri-visualization-1211.5595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardware-accelerated-raycasting-towards-an-effective-brain-mri-visualization-1211.5595"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-number-of-faces-of-the-minkowski-sum-of-three-convex-polytopes-1211.6089</loc><lastmod>2012-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-number-of-faces-of-the-minkowski-sum-of-three-convex-polytopes-1211.6089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-number-of-faces-of-the-minkowski-sum-of-three-convex-polytopes-1211.6089"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-of-collapsible-complexes-is-np-complete-1211.6254</loc><lastmod>2015-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-of-collapsible-complexes-is-np-complete-1211.6254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-of-collapsible-complexes-is-np-complete-1211.6254"/></url>
<url><loc>https://scifaro.com/en/abs/the-monotonicity-of-f-vectors-of-random-polytopes-1211.7020</loc><lastmod>2012-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-monotonicity-of-f-vectors-of-random-polytopes-1211.7020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-monotonicity-of-f-vectors-of-random-polytopes-1211.7020"/></url>
<url><loc>https://scifaro.com/en/abs/the-theta-5-graph-is-a-spanner-1212.0570</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theta-5-graph-is-a-spanner-1212.0570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theta-5-graph-is-a-spanner-1212.0570"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-is-good-an-experimental-study-on-minimum-clique-cover-and-maximum-independent-set-problems-for-randomly-generated-rectangles-1212.0640</loc><lastmod>2012-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-is-good-an-experimental-study-on-minimum-clique-cover-and-maximum-independent-set-problems-for-randomly-generated-rectangles-1212.0640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-is-good-an-experimental-study-on-minimum-clique-cover-and-maximum-independent-set-problems-for-randomly-generated-rectangles-1212.0640"/></url>
<url><loc>https://scifaro.com/en/abs/how-many-vertex-locations-can-be-arbitrarily-chosen-when-drawing-planar-graphs-1212.0804</loc><lastmod>2012-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-many-vertex-locations-can-be-arbitrarily-chosen-when-drawing-planar-graphs-1212.0804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-many-vertex-locations-can-be-arbitrarily-chosen-when-drawing-planar-graphs-1212.0804"/></url>
<url><loc>https://scifaro.com/en/abs/computing-consensus-curves-1212.0935</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-consensus-curves-1212.0935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-consensus-curves-1212.0935"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometric-stability-of-voronoi-diagrams-in-normed-spaces-which-are-not-uniformly-convex-1212.1094</loc><lastmod>2013-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometric-stability-of-voronoi-diagrams-in-normed-spaces-which-are-not-uniformly-convex-1212.1094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometric-stability-of-voronoi-diagrams-in-normed-spaces-which-are-not-uniformly-convex-1212.1094"/></url>
<url><loc>https://scifaro.com/en/abs/the-projector-algorithm-a-simple-parallel-algorithm-for-computing-voronoi-diagrams-and-delaunay-graphs-1212.1095</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-projector-algorithm-a-simple-parallel-algorithm-for-computing-voronoi-diagrams-and-delaunay-graphs-1212.1095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-projector-algorithm-a-simple-parallel-algorithm-for-computing-voronoi-diagrams-and-delaunay-graphs-1212.1095"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-of-polygonal-curves-in-the-presence-of-outliers-1212.1617</loc><lastmod>2013-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-of-polygonal-curves-in-the-presence-of-outliers-1212.1617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-of-polygonal-curves-in-the-presence-of-outliers-1212.1617"/></url>
<url><loc>https://scifaro.com/en/abs/small-size-relative-p-epsilon-approximations-for-well-behaved-range-spaces-1212.2303</loc><lastmod>2012-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-size-relative-p-epsilon-approximations-for-well-behaved-range-spaces-1212.2303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-size-relative-p-epsilon-approximations-for-well-behaved-range-spaces-1212.2303"/></url>
<url><loc>https://scifaro.com/en/abs/making-triangles-colorful-1212.2346</loc><lastmod>2012-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-triangles-colorful-1212.2346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-triangles-colorful-1212.2346"/></url>
<url><loc>https://scifaro.com/en/abs/the-modified-direct-method-an-approach-for-smoothing-planar-and-surface-meshes-1212.3133</loc><lastmod>2016-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-modified-direct-method-an-approach-for-smoothing-planar-and-surface-meshes-1212.3133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-modified-direct-method-an-approach-for-smoothing-planar-and-surface-meshes-1212.3133"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-approach-to-output-sensitive-voronoi-diagrams-and-delaunay-triangulations-1212.5098</loc><lastmod>2013-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-approach-to-output-sensitive-voronoi-diagrams-and-delaunay-triangulations-1212.5098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-approach-to-output-sensitive-voronoi-diagrams-and-delaunay-triangulations-1212.5098"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hull-and-linear-programming-in-read-only-setup-with-limited-work-space-1212.5353</loc><lastmod>2012-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hull-and-linear-programming-in-read-only-setup-with-limited-work-space-1212.5353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hull-and-linear-programming-in-read-only-setup-with-limited-work-space-1212.5353"/></url>
<url><loc>https://scifaro.com/en/abs/t-base-a-triangle-based-iterative-algorithm-for-smoothing-quadrilateral-meshes-1212.6036</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/t-base-a-triangle-based-iterative-algorithm-for-smoothing-quadrilateral-meshes-1212.6036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/t-base-a-triangle-based-iterative-algorithm-for-smoothing-quadrilateral-meshes-1212.6036"/></url>
<url><loc>https://scifaro.com/en/abs/ear-clipping-based-algorithms-of-generating-high-quality-polygon-triangulation-1212.6038</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ear-clipping-based-algorithms-of-generating-high-quality-polygon-triangulation-1212.6038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ear-clipping-based-algorithms-of-generating-high-quality-polygon-triangulation-1212.6038"/></url>
<url><loc>https://scifaro.com/en/abs/weak-visibility-queries-of-line-segments-in-simple-polygons-1212.6039</loc><lastmod>2012-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-visibility-queries-of-line-segments-in-simple-polygons-1212.6039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-visibility-queries-of-line-segments-in-simple-polygons-1212.6039"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-finding-convex-hulls-of-planar-point-sets-1212.6043</loc><lastmod>2013-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-finding-convex-hulls-of-planar-point-sets-1212.6043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-finding-convex-hulls-of-planar-point-sets-1212.6043"/></url>
<url><loc>https://scifaro.com/en/abs/a-hybrid-approach-for-optimizing-planar-triangular-meshes-1212.6045</loc><lastmod>2013-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hybrid-approach-for-optimizing-planar-triangular-meshes-1212.6045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hybrid-approach-for-optimizing-planar-triangular-meshes-1212.6045"/></url>
<url><loc>https://scifaro.com/en/abs/universal-point-sets-for-planar-three-tree-1212.6148</loc><lastmod>2013-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-point-sets-for-planar-three-tree-1212.6148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-point-sets-for-planar-three-tree-1212.6148"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-triangle-free-rectangle-overlap-graphs-with-o-log-log-n-colors-1301.0541</loc><lastmod>2014-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-triangle-free-rectangle-overlap-graphs-with-o-log-log-n-colors-1301.0541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-triangle-free-rectangle-overlap-graphs-with-o-log-log-n-colors-1301.0541"/></url>
<url><loc>https://scifaro.com/en/abs/apollonian-circumcircles-of-ifs-fractals-1301.1378</loc><lastmod>2015-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/apollonian-circumcircles-of-ifs-fractals-1301.1378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/apollonian-circumcircles-of-ifs-fractals-1301.1378"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-a-balanced-binary-tree-on-a-bounded-point-set-1301.3471</loc><lastmod>2013-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-a-balanced-binary-tree-on-a-bounded-point-set-1301.3471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-a-balanced-binary-tree-on-a-bounded-point-set-1301.3471"/></url>
<url><loc>https://scifaro.com/en/abs/from-quantitative-spatial-operator-to-qualitative-spatial-relation-using-constructive-solid-geometry-logic-rules-and-optimized-9-im-model-a-semantic-based-approach-1301.4780</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-quantitative-spatial-operator-to-qualitative-spatial-relation-using-constructive-solid-geometry-logic-rules-and-optimized-9-im-model-a-semantic-based-approach-1301.4780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-quantitative-spatial-operator-to-qualitative-spatial-relation-using-constructive-solid-geometry-logic-rules-and-optimized-9-im-model-a-semantic-based-approach-1301.4780"/></url>
<url><loc>https://scifaro.com/en/abs/from-3d-point-clouds-to-semantic-objects-an-ontology-based-detection-approach-1301.4783</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-3d-point-clouds-to-semantic-objects-an-ontology-based-detection-approach-1301.4783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-3d-point-clouds-to-semantic-objects-an-ontology-based-detection-approach-1301.4783"/></url>
<url><loc>https://scifaro.com/en/abs/a-rank-based-convex-hull-method-for-dense-data-sets-1301.4809</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rank-based-convex-hull-method-for-dense-data-sets-1301.4809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rank-based-convex-hull-method-for-dense-data-sets-1301.4809"/></url>
<url><loc>https://scifaro.com/en/abs/integration-of-knowledge-to-support-automatic-object-reconstruction-from-images-and-3d-data-1301.4848</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integration-of-knowledge-to-support-automatic-object-reconstruction-from-images-and-3d-data-1301.4848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integration-of-knowledge-to-support-automatic-object-reconstruction-from-images-and-3d-data-1301.4848"/></url>
<url><loc>https://scifaro.com/en/abs/toward-the-automatic-generation-of-a-semantic-vrml-model-from-unorganized-3d-point-clouds-1301.5349</loc><lastmod>2013-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-the-automatic-generation-of-a-semantic-vrml-model-from-unorganized-3d-point-clouds-1301.5349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-the-automatic-generation-of-a-semantic-vrml-model-from-unorganized-3d-point-clouds-1301.5349"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-of-polyhedral-surface-uniformization-1301.6336</loc><lastmod>2013-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-of-polyhedral-surface-uniformization-1301.6336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-of-polyhedral-surface-uniformization-1301.6336"/></url>
<url><loc>https://scifaro.com/en/abs/bringing-order-to-special-cases-of-klee-s-measure-problem-1301.7154</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bringing-order-to-special-cases-of-klee-s-measure-problem-1301.7154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bringing-order-to-special-cases-of-klee-s-measure-problem-1301.7154"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-one-dimensional-k-center-problems-1301.7512</loc><lastmod>2014-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-one-dimensional-k-center-problems-1301.7512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-one-dimensional-k-center-problems-1301.7512"/></url>
<url><loc>https://scifaro.com/en/abs/graph-layouts-via-layered-separators-1302.0304</loc><lastmod>2013-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-layouts-via-layered-separators-1302.0304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-layouts-via-layered-separators-1302.0304"/></url>
<url><loc>https://scifaro.com/en/abs/local-redesigning-of-airspace-sectors-1302.1089</loc><lastmod>2013-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-redesigning-of-airspace-sectors-1302.1089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-redesigning-of-airspace-sectors-1302.1089"/></url>
<url><loc>https://scifaro.com/en/abs/persistence-modules-algebra-and-algorithms-1302.2015</loc><lastmod>2013-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistence-modules-algebra-and-algorithms-1302.2015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistence-modules-algebra-and-algorithms-1302.2015"/></url>
<url><loc>https://scifaro.com/en/abs/diffuse-reflection-diameter-in-simple-polygons-1302.2271</loc><lastmod>2015-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diffuse-reflection-diameter-in-simple-polygons-1302.2271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diffuse-reflection-diameter-in-simple-polygons-1302.2271"/></url>
<url><loc>https://scifaro.com/en/abs/extendability-of-continuous-maps-is-undecidable-1302.2370</loc><lastmod>2013-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extendability-of-continuous-maps-is-undecidable-1302.2370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extendability-of-continuous-maps-is-undecidable-1302.2370"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-hypergraphs-induced-by-dynamic-point-sets-and-bottomless-rectangles-1302.2426</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-hypergraphs-induced-by-dynamic-point-sets-and-bottomless-rectangles-1302.2426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-hypergraphs-induced-by-dynamic-point-sets-and-bottomless-rectangles-1302.2426"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-link-paths-revisited-1302.3091</loc><lastmod>2013-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-link-paths-revisited-1302.3091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-link-paths-revisited-1302.3091"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-numerical-algorithm-for-computing-topological-characteristics-of-three-dimensional-bodies-1302.3669</loc><lastmod>2014-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-numerical-algorithm-for-computing-topological-characteristics-of-three-dimensional-bodies-1302.3669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-numerical-algorithm-for-computing-topological-characteristics-of-three-dimensional-bodies-1302.3669"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-finding-area-universal-rectangular-layouts-1302.3672</loc><lastmod>2016-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-finding-area-universal-rectangular-layouts-1302.3672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-finding-area-universal-rectangular-layouts-1302.3672"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-boundary-tracking-using-alpha-and-delaunay-cech-shapes-1302.3982</loc><lastmod>2013-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-boundary-tracking-using-alpha-and-delaunay-cech-shapes-1302.3982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-boundary-tracking-using-alpha-and-delaunay-cech-shapes-1302.3982"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-parallel-segments-and-characterization-of-unique-bichromatic-matchings-1302.4400</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-parallel-segments-and-characterization-of-unique-bichromatic-matchings-1302.4400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-parallel-segments-and-characterization-of-unique-bichromatic-matchings-1302.4400"/></url>
<url><loc>https://scifaro.com/en/abs/unions-of-onions-preprocessing-imprecise-points-for-fast-onion-decomposition-1302.5328</loc><lastmod>2017-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unions-of-onions-preprocessing-imprecise-points-for-fast-onion-decomposition-1302.5328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unions-of-onions-preprocessing-imprecise-points-for-fast-onion-decomposition-1302.5328"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-is-as-good-as-delaunay-almost-1302.5635</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-is-as-good-as-delaunay-almost-1302.5635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-is-as-good-as-delaunay-almost-1302.5635"/></url>
<url><loc>https://scifaro.com/en/abs/steve-space-time-enclosing-volume-extraction-1302.5683</loc><lastmod>2016-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steve-space-time-enclosing-volume-extraction-1302.5683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steve-space-time-enclosing-volume-extraction-1302.5683"/></url>
<url><loc>https://scifaro.com/en/abs/the-unified-segment-tree-and-its-application-to-the-rectangle-intersection-problem-1302.6653</loc><lastmod>2013-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-unified-segment-tree-and-its-application-to-the-rectangle-intersection-problem-1302.6653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-unified-segment-tree-and-its-application-to-the-rectangle-intersection-problem-1302.6653"/></url>
<url><loc>https://scifaro.com/en/abs/numerical-analysis-of-topological-characteristics-of-three-dimensional-geological-models-of-oil-and-gas-fields-1302.6885</loc><lastmod>2014-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/numerical-analysis-of-topological-characteristics-of-three-dimensional-geological-models-of-oil-and-gas-fields-1302.6885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/numerical-analysis-of-topological-characteristics-of-three-dimensional-geological-models-of-oil-and-gas-fields-1302.6885"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-simultaneous-geometric-graph-embedding-1302.7127</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-simultaneous-geometric-graph-embedding-1302.7127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-simultaneous-geometric-graph-embedding-1302.7127"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-euclidean-steiner-forest-1302.7270</loc><lastmod>2014-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-euclidean-steiner-forest-1302.7270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-euclidean-steiner-forest-1302.7270"/></url>
<url><loc>https://scifaro.com/en/abs/simple-curve-embedding-1303.0821</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-curve-embedding-1303.0821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-curve-embedding-1303.0821"/></url>
<url><loc>https://scifaro.com/en/abs/equilateral-l-contact-graphs-1303.1279</loc><lastmod>2013-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equilateral-l-contact-graphs-1303.1279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equilateral-l-contact-graphs-1303.1279"/></url>
<url><loc>https://scifaro.com/en/abs/computing-similarity-between-a-pair-of-trajectories-1303.1585</loc><lastmod>2013-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-similarity-between-a-pair-of-trajectories-1303.1585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-similarity-between-a-pair-of-trajectories-1303.1585"/></url>
<url><loc>https://scifaro.com/en/abs/new-hardness-results-for-guarding-orthogonal-polygons-with-sliding-cameras-1303.2162</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-hardness-results-for-guarding-orthogonal-polygons-with-sliding-cameras-1303.2162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-hardness-results-for-guarding-orthogonal-polygons-with-sliding-cameras-1303.2162"/></url>
<url><loc>https://scifaro.com/en/abs/point-set-isolation-using-unit-disks-is-np-complete-1303.2779</loc><lastmod>2013-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-set-isolation-using-unit-disks-is-np-complete-1303.2779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-set-isolation-using-unit-disks-is-np-complete-1303.2779"/></url>
<url><loc>https://scifaro.com/en/abs/a-3d-curve-offset-approach-for-ruled-surface-generation-in-engineering-design-1303.3578</loc><lastmod>2013-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-3d-curve-offset-approach-for-ruled-surface-generation-in-engineering-design-1303.3578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-3d-curve-offset-approach-for-ruled-surface-generation-in-engineering-design-1303.3578"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-sparseness-enforcing-projections-1303.5259</loc><lastmod>2013-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-sparseness-enforcing-projections-1303.5259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-sparseness-enforcing-projections-1303.5259"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-k-distance-approximation-1303.5388</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-k-distance-approximation-1303.5388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-k-distance-approximation-1303.5388"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-stretch-factor-of-the-theta-4-graph-1303.5473</loc><lastmod>2013-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-the-theta-4-graph-1303.5473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-the-theta-4-graph-1303.5473"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-algorithm-for-computing-motorcycle-graphs-1303.5958</loc><lastmod>2013-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-algorithm-for-computing-motorcycle-graphs-1303.5958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-algorithm-for-computing-motorcycle-graphs-1303.5958"/></url>
<url><loc>https://scifaro.com/en/abs/trajectory-grouping-structures-1303.6127</loc><lastmod>2013-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trajectory-grouping-structures-1303.6127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trajectory-grouping-structures-1303.6127"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-of-fractional-brownian-surfaces-via-spectral-synthesis-on-manifolds-1303.6377</loc><lastmod>2015-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-of-fractional-brownian-surfaces-via-spectral-synthesis-on-manifolds-1303.6377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-of-fractional-brownian-surfaces-via-spectral-synthesis-on-manifolds-1303.6377"/></url>
<url><loc>https://scifaro.com/en/abs/random-discrete-morse-theory-and-a-new-library-of-triangulations-1303.6422</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-discrete-morse-theory-and-a-new-library-of-triangulations-1303.6422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-discrete-morse-theory-and-a-new-library-of-triangulations-1303.6422"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-intrinsic-delaunay-triangulations-of-submanifolds-1303.6493</loc><lastmod>2013-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-intrinsic-delaunay-triangulations-of-submanifolds-1303.6493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-intrinsic-delaunay-triangulations-of-submanifolds-1303.6493"/></url>
<url><loc>https://scifaro.com/en/abs/the-traveling-salesman-problem-for-lines-balls-and-planes-1303.6659</loc><lastmod>2015-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-traveling-salesman-problem-for-lines-balls-and-planes-1303.6659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-traveling-salesman-problem-for-lines-balls-and-planes-1303.6659"/></url>
<url><loc>https://scifaro.com/en/abs/a-review-of-dynamic-nurbs-approach-1303.6683</loc><lastmod>2013-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-review-of-dynamic-nurbs-approach-1303.6683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-review-of-dynamic-nurbs-approach-1303.6683"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-discrete-morse-theory-1303.7037</loc><lastmod>2018-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-discrete-morse-theory-1303.7037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-discrete-morse-theory-1303.7037"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-construction-of-spanners-in-d-dimensions-1303.7217</loc><lastmod>2013-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-construction-of-spanners-in-d-dimensions-1303.7217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-construction-of-spanners-in-d-dimensions-1303.7217"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-similarity-between-curves-on-2-manifolds-via-homotopy-area-1303.7427</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-similarity-between-curves-on-2-manifolds-via-homotopy-area-1303.7427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-similarity-between-curves-on-2-manifolds-via-homotopy-area-1303.7427"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-largest-empty-convex-subset-in-space-is-w-1-hard-1304.0247</loc><lastmod>2013-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-largest-empty-convex-subset-in-space-is-w-1-hard-1304.0247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-largest-empty-convex-subset-in-space-is-w-1-hard-1304.0247"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-minimization-diagrams-and-generalized-proximity-search-1304.0393</loc><lastmod>2013-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-minimization-diagrams-and-generalized-proximity-search-1304.0393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-minimization-diagrams-and-generalized-proximity-search-1304.0393"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-algorithm-for-well-spaced-points-and-approximate-delaunay-graphs-1304.0524</loc><lastmod>2013-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-algorithm-for-well-spaced-points-and-approximate-delaunay-graphs-1304.0524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-algorithm-for-well-spaced-points-and-approximate-delaunay-graphs-1304.0524"/></url>
<url><loc>https://scifaro.com/en/abs/graph-induced-complex-on-point-data-1304.0662</loc><lastmod>2013-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-induced-complex-on-point-data-1304.0662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-induced-complex-on-point-data-1304.0662"/></url>
<url><loc>https://scifaro.com/en/abs/edge-contractions-and-simplicial-homology-1304.0664</loc><lastmod>2013-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-contractions-and-simplicial-homology-1304.0664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-contractions-and-simplicial-homology-1304.0664"/></url>
<url><loc>https://scifaro.com/en/abs/network-farthest-point-diagrams-1304.1909</loc><lastmod>2014-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-farthest-point-diagrams-1304.1909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-farthest-point-diagrams-1304.1909"/></url>
<url><loc>https://scifaro.com/en/abs/on-growing-connected-beta-skeletons-1304.1986</loc><lastmod>2013-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-growing-connected-beta-skeletons-1304.1986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-growing-connected-beta-skeletons-1304.1986"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-predictability-of-the-number-of-convex-vertices-1304.2604</loc><lastmod>2013-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-predictability-of-the-number-of-convex-vertices-1304.2604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-predictability-of-the-number-of-convex-vertices-1304.2604"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hull-incremental-variations-on-the-akl-toussaint-heuristics-simple-optimal-and-space-saving-convex-hull-algorithms-1304.2676</loc><lastmod>2013-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hull-incremental-variations-on-the-akl-toussaint-heuristics-simple-optimal-and-space-saving-convex-hull-algorithms-1304.2676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hull-incremental-variations-on-the-akl-toussaint-heuristics-simple-optimal-and-space-saving-convex-hull-algorithms-1304.2676"/></url>
<url><loc>https://scifaro.com/en/abs/the-stability-of-delaunay-triangulations-1304.2947</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stability-of-delaunay-triangulations-1304.2947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stability-of-delaunay-triangulations-1304.2947"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-average-number-of-edges-in-theta-graphs-1304.3402</loc><lastmod>2013-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-average-number-of-edges-in-theta-graphs-1304.3402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-average-number-of-edges-in-theta-graphs-1304.3402"/></url>
<url><loc>https://scifaro.com/en/abs/on-topological-changes-in-the-delaunay-triangulation-of-moving-points-1304.3671</loc><lastmod>2013-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-topological-changes-in-the-delaunay-triangulation-of-moving-points-1304.3671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-topological-changes-in-the-delaunay-triangulation-of-moving-points-1304.3671"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-driven-collapses-for-converting-a-cech-complex-into-a-triangulation-of-a-nicely-triangulable-shape-1304.3680</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-driven-collapses-for-converting-a-cech-complex-into-a-triangulation-of-a-nicely-triangulable-shape-1304.3680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-driven-collapses-for-converting-a-cech-complex-into-a-triangulation-of-a-nicely-triangulable-shape-1304.3680"/></url>
<url><loc>https://scifaro.com/en/abs/range-counting-coresets-for-uncertain-data-1304.4243</loc><lastmod>2013-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-counting-coresets-for-uncertain-data-1304.4243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-counting-coresets-for-uncertain-data-1304.4243"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-computing-constrained-reflection-paths-in-simple-polygon-1304.4320</loc><lastmod>2014-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-computing-constrained-reflection-paths-in-simple-polygon-1304.4320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-computing-constrained-reflection-paths-in-simple-polygon-1304.4320"/></url>
<url><loc>https://scifaro.com/en/abs/developing-a-general-algorithm-for-ball-curve-with-gc2-1304.4677</loc><lastmod>2013-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/developing-a-general-algorithm-for-ball-curve-with-gc2-1304.4677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/developing-a-general-algorithm-for-ball-curve-with-gc2-1304.4677"/></url>
<url><loc>https://scifaro.com/en/abs/the-varifold-representation-of-non-oriented-shapes-for-diffeomorphic-registration-1304.6108</loc><lastmod>2013-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-varifold-representation-of-non-oriented-shapes-for-diffeomorphic-registration-1304.6108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-varifold-representation-of-non-oriented-shapes-for-diffeomorphic-registration-1304.6108"/></url>
<url><loc>https://scifaro.com/en/abs/hilbert-curves-in-2-dimensions-generated-by-l-systems-1304.6296</loc><lastmod>2013-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hilbert-curves-in-2-dimensions-generated-by-l-systems-1304.6296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hilbert-curves-in-2-dimensions-generated-by-l-systems-1304.6296"/></url>
<url><loc>https://scifaro.com/en/abs/the-compressed-annotation-matrix-an-efficient-data-structure-for-computing-persistent-cohomology-1304.6813</loc><lastmod>2020-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-compressed-annotation-matrix-an-efficient-data-structure-for-computing-persistent-cohomology-1304.6813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-compressed-annotation-matrix-an-efficient-data-structure-for-computing-persistent-cohomology-1304.6813"/></url>
<url><loc>https://scifaro.com/en/abs/fast-clustering-with-lower-bounds-no-customer-too-far-no-shop-too-small-1304.7318</loc><lastmod>2013-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-clustering-with-lower-bounds-no-customer-too-far-no-shop-too-small-1304.7318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-clustering-with-lower-bounds-no-customer-too-far-no-shop-too-small-1304.7318"/></url>
<url><loc>https://scifaro.com/en/abs/non-positive-curvature-and-the-planar-embedding-conjecture-1304.7512</loc><lastmod>2013-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-positive-curvature-and-the-planar-embedding-conjecture-1304.7512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-positive-curvature-and-the-planar-embedding-conjecture-1304.7512"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-time-convex-hull-under-the-lp-metrics-1304.7833</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-time-convex-hull-under-the-lp-metrics-1304.7833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-time-convex-hull-under-the-lp-metrics-1304.7833"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-the-euclidean-bottleneck-full-steiner-tree-problem-1305.0172</loc><lastmod>2013-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-the-euclidean-bottleneck-full-steiner-tree-problem-1305.0172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-the-euclidean-bottleneck-full-steiner-tree-problem-1305.0172"/></url>
<url><loc>https://scifaro.com/en/abs/multi-sided-boundary-labeling-1305.0750</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-sided-boundary-labeling-1305.0750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-sided-boundary-labeling-1305.0750"/></url>
<url><loc>https://scifaro.com/en/abs/gromov-hausdorff-approximation-of-metric-spaces-with-linear-structure-1305.1172</loc><lastmod>2013-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gromov-hausdorff-approximation-of-metric-spaces-with-linear-structure-1305.1172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gromov-hausdorff-approximation-of-metric-spaces-with-linear-structure-1305.1172"/></url>
<url><loc>https://scifaro.com/en/abs/a-clifford-algebra-approach-to-the-discretizable-molecular-distance-geometry-problem-1305.1596</loc><lastmod>2013-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-clifford-algebra-approach-to-the-discretizable-molecular-distance-geometry-problem-1305.1596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-clifford-algebra-approach-to-the-discretizable-molecular-distance-geometry-problem-1305.1596"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-registration-of-high-genus-surfaces-1305.2283</loc><lastmod>2014-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-registration-of-high-genus-surfaces-1305.2283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-registration-of-high-genus-surfaces-1305.2283"/></url>
<url><loc>https://scifaro.com/en/abs/on-improved-bounds-on-bounded-degree-spanning-trees-for-points-in-arbitrary-dimension-1305.2661</loc><lastmod>2014-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-improved-bounds-on-bounded-degree-spanning-trees-for-points-in-arbitrary-dimension-1305.2661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-improved-bounds-on-bounded-degree-spanning-trees-for-points-in-arbitrary-dimension-1305.2661"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-top-k-dominating-queries-1305.2835</loc><lastmod>2013-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-top-k-dominating-queries-1305.2835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-top-k-dominating-queries-1305.2835"/></url>
<url><loc>https://scifaro.com/en/abs/face-guarding-polyhedra-1305.2866</loc><lastmod>2014-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/face-guarding-polyhedra-1305.2866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/face-guarding-polyhedra-1305.2866"/></url>
<url><loc>https://scifaro.com/en/abs/average-stretch-factor-how-low-does-it-go-1305.4170</loc><lastmod>2013-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-stretch-factor-how-low-does-it-go-1305.4170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-stretch-factor-how-low-does-it-go-1305.4170"/></url>
<url><loc>https://scifaro.com/en/abs/clustered-planarity-testing-revisited-1305.4519</loc><lastmod>2015-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustered-planarity-testing-revisited-1305.4519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustered-planarity-testing-revisited-1305.4519"/></url>
<url><loc>https://scifaro.com/en/abs/correcting-self-intersecting-polygons-using-minimal-memory-a-simple-and-efficient-algorithm-and-thoughts-on-line-segment-intersection-algorithms-1305.4573</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correcting-self-intersecting-polygons-using-minimal-memory-a-simple-and-efficient-algorithm-and-thoughts-on-line-segment-intersection-algorithms-1305.4573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correcting-self-intersecting-polygons-using-minimal-memory-a-simple-and-efficient-algorithm-and-thoughts-on-line-segment-intersection-algorithms-1305.4573"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-unsolvability-of-the-weighted-region-shortest-path-problem-1305.5209</loc><lastmod>2013-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-unsolvability-of-the-weighted-region-shortest-path-problem-1305.5209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-unsolvability-of-the-weighted-region-shortest-path-problem-1305.5209"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-the-double-circle-on-a-grid-of-minimum-size-1305.6693</loc><lastmod>2013-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-the-double-circle-on-a-grid-of-minimum-size-1305.6693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-the-double-circle-on-a-grid-of-minimum-size-1305.6693"/></url>
<url><loc>https://scifaro.com/en/abs/local-and-global-analysis-of-parametric-solid-sweeps-1305.7351</loc><lastmod>2013-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-and-global-analysis-of-parametric-solid-sweeps-1305.7351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-and-global-analysis-of-parametric-solid-sweeps-1305.7351"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-and-robust-persistent-homology-for-measures-1306.0039</loc><lastmod>2014-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-and-robust-persistent-homology-for-measures-1306.0039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-and-robust-persistent-homology-for-measures-1306.0039"/></url>
<url><loc>https://scifaro.com/en/abs/tracing-cross-free-polylines-oriented-by-a-n-symmetry-direction-field-on-triangulated-surfaces-1306.0706</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracing-cross-free-polylines-oriented-by-a-n-symmetry-direction-field-on-triangulated-surfaces-1306.0706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracing-cross-free-polylines-oriented-by-a-n-symmetry-direction-field-on-triangulated-surfaces-1306.0706"/></url>
<url><loc>https://scifaro.com/en/abs/kamiwaai-interactive-3d-sketching-with-java-based-on-cl-4-1-conformal-model-of-euclidean-space-1306.0996</loc><lastmod>2013-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kamiwaai-interactive-3d-sketching-with-java-based-on-cl-4-1-conformal-model-of-euclidean-space-1306.0996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kamiwaai-interactive-3d-sketching-with-java-based-on-cl-4-1-conformal-model-of-euclidean-space-1306.0996"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-detecting-dependencies-and-rigid-subsystems-for-cad-1306.1572</loc><lastmod>2015-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-detecting-dependencies-and-rigid-subsystems-for-cad-1306.1572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-detecting-dependencies-and-rigid-subsystems-for-cad-1306.1572"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-zone-of-the-boundary-of-a-convex-body-1306.2104</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-zone-of-the-boundary-of-a-convex-body-1306.2104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-zone-of-the-boundary-of-a-convex-body-1306.2104"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-and-global-optimization-based-smoothing-methods-for-mixed-volume-meshes-1306.2260</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-and-global-optimization-based-smoothing-methods-for-mixed-volume-meshes-1306.2260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-and-global-optimization-based-smoothing-methods-for-mixed-volume-meshes-1306.2260"/></url>
<url><loc>https://scifaro.com/en/abs/map-matching-with-simplicity-constraints-1306.2827</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/map-matching-with-simplicity-constraints-1306.2827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/map-matching-with-simplicity-constraints-1306.2827"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-plane-outside-obstacle-representations-1306.2978</loc><lastmod>2013-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-plane-outside-obstacle-representations-1306.2978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-plane-outside-obstacle-representations-1306.2978"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-tolerant-tverberg-partitions-1306.3452</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-tolerant-tverberg-partitions-1306.3452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-tolerant-tverberg-partitions-1306.3452"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-on-open-edge-and-open-mobile-guarding-of-polygons-and-triangulations-1306.4359</loc><lastmod>2013-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-on-open-edge-and-open-mobile-guarding-of-polygons-and-triangulations-1306.4359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-on-open-edge-and-open-mobile-guarding-of-polygons-and-triangulations-1306.4359"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-greedy-spanner-in-linear-space-1306.4919</loc><lastmod>2013-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-greedy-spanner-in-linear-space-1306.4919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-greedy-spanner-in-linear-space-1306.4919"/></url>
<url><loc>https://scifaro.com/en/abs/empty-triangles-in-good-drawings-of-the-complete-graph-1306.5081</loc><lastmod>2013-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/empty-triangles-in-good-drawings-of-the-complete-graph-1306.5081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/empty-triangles-in-good-drawings-of-the-complete-graph-1306.5081"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-greedy-drawings-of-trees-1306.5224</loc><lastmod>2013-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-greedy-drawings-of-trees-1306.5224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-greedy-drawings-of-trees-1306.5224"/></url>
<url><loc>https://scifaro.com/en/abs/self-approaching-graphs-1306.5460</loc><lastmod>2016-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-approaching-graphs-1306.5460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-approaching-graphs-1306.5460"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-fr-echet-distance-with-a-retractable-leash-1306.5527</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-fr-echet-distance-with-a-retractable-leash-1306.5527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-fr-echet-distance-with-a-retractable-leash-1306.5527"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-distance-problems-in-planar-complexes-of-global-nonpositive-curvature-1306.5796</loc><lastmod>2014-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-distance-problems-in-planar-complexes-of-global-nonpositive-curvature-1306.5796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-distance-problems-in-planar-complexes-of-global-nonpositive-curvature-1306.5796"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-incremental-construction-of-the-hausdorff-voronoi-diagram-of-non-crossing-clusters-1306.5838</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-incremental-construction-of-the-hausdorff-voronoi-diagram-of-non-crossing-clusters-1306.5838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-incremental-construction-of-the-hausdorff-voronoi-diagram-of-non-crossing-clusters-1306.5838"/></url>
<url><loc>https://scifaro.com/en/abs/the-two-handed-tile-assembly-model-is-not-intrinsically-universal-1306.6710</loc><lastmod>2014-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-two-handed-tile-assembly-model-is-not-intrinsically-universal-1306.6710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-two-handed-tile-assembly-model-is-not-intrinsically-universal-1306.6710"/></url>
<url><loc>https://scifaro.com/en/abs/fractal-and-mathematical-morphology-in-intricate-comparison-between-tertiary-protein-structures-1307.0029</loc><lastmod>2013-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractal-and-mathematical-morphology-in-intricate-comparison-between-tertiary-protein-structures-1307.0029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractal-and-mathematical-morphology-in-intricate-comparison-between-tertiary-protein-structures-1307.0029"/></url>
<url><loc>https://scifaro.com/en/abs/distance-domination-guarding-and-vertex-cover-for-maximal-outerplanar-graph-1307.2043</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-domination-guarding-and-vertex-cover-for-maximal-outerplanar-graph-1307.2043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-domination-guarding-and-vertex-cover-for-maximal-outerplanar-graph-1307.2043"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-fr-e-chet-distance-with-shortcuts-is-np-hard-1307.2097</loc><lastmod>2013-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-fr-e-chet-distance-with-shortcuts-is-np-hard-1307.2097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-fr-e-chet-distance-with-shortcuts-is-np-hard-1307.2097"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-data-structures-for-the-semi-yao-graph-and-all-nearest-neighbors-in-r-d-1307.2700</loc><lastmod>2013-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-data-structures-for-the-semi-yao-graph-and-all-nearest-neighbors-in-r-d-1307.2700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-data-structures-for-the-semi-yao-graph-and-all-nearest-neighbors-in-r-d-1307.2700"/></url>
<url><loc>https://scifaro.com/en/abs/making-octants-colorful-and-related-covering-decomposition-problems-1307.2705</loc><lastmod>2014-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-octants-colorful-and-related-covering-decomposition-problems-1307.2705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-octants-colorful-and-related-covering-decomposition-problems-1307.2705"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-distance-between-reeb-graphs-1307.2839</loc><lastmod>2016-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-distance-between-reeb-graphs-1307.2839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-distance-between-reeb-graphs-1307.2839"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-cech-complexes-in-low-and-high-dimensions-1307.3272</loc><lastmod>2013-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-cech-complexes-in-low-and-high-dimensions-1307.3272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-cech-complexes-in-low-and-high-dimensions-1307.3272"/></url>
<url><loc>https://scifaro.com/en/abs/the-yao-graph-y-5-is-a-spanner-1307.5030</loc><lastmod>2013-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-yao-graph-y-5-is-a-spanner-1307.5030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-yao-graph-y-5-is-a-spanner-1307.5030"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-range-reporting-of-convex-hull-1307.5612</loc><lastmod>2013-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-range-reporting-of-convex-hull-1307.5612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-range-reporting-of-convex-hull-1307.5612"/></url>
<url><loc>https://scifaro.com/en/abs/new-and-improved-spanning-ratios-for-yao-graphs-1307.5829</loc><lastmod>2019-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-and-improved-spanning-ratios-for-yao-graphs-1307.5829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-and-improved-spanning-ratios-for-yao-graphs-1307.5829"/></url>
<url><loc>https://scifaro.com/en/abs/applied-similarity-problems-using-frechet-distance-1307.6628</loc><lastmod>2013-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applied-similarity-problems-using-frechet-distance-1307.6628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applied-similarity-problems-using-frechet-distance-1307.6628"/></url>
<url><loc>https://scifaro.com/en/abs/local-smooth-and-consistent-jacobi-set-simplification-1307.7752</loc><lastmod>2013-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-smooth-and-consistent-jacobi-set-simplification-1307.7752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-smooth-and-consistent-jacobi-set-simplification-1307.7752"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-inference-on-kernel-density-estimates-1307.7760</loc><lastmod>2015-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-inference-on-kernel-density-estimates-1307.7760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-inference-on-kernel-density-estimates-1307.7760"/></url>
<url><loc>https://scifaro.com/en/abs/a-size-sensitive-discrepancy-bound-for-set-systems-of-bounded-primal-shatter-dimension-1307.8139</loc><lastmod>2013-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-size-sensitive-discrepancy-bound-for-set-systems-of-bounded-primal-shatter-dimension-1307.8139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-size-sensitive-discrepancy-bound-for-set-systems-of-bounded-primal-shatter-dimension-1307.8139"/></url>
<url><loc>https://scifaro.com/en/abs/helly-type-theorems-in-property-testing-1307.8268</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/helly-type-theorems-in-property-testing-1307.8268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/helly-type-theorems-in-property-testing-1307.8268"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-arrangement-graphs-in-small-grids-or-how-to-play-planarity-1308.0066</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-arrangement-graphs-in-small-grids-or-how-to-play-planarity-1308.0066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-arrangement-graphs-in-small-grids-or-how-to-play-planarity-1308.0066"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-continuous-functions-in-topological-cad-data-1308.0256</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-continuous-functions-in-topological-cad-data-1308.0256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-continuous-functions-in-topological-cad-data-1308.0256"/></url>
<url><loc>https://scifaro.com/en/abs/superpatterns-and-universal-point-sets-1308.0403</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superpatterns-and-universal-point-sets-1308.0403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superpatterns-and-universal-point-sets-1308.0403"/></url>
<url><loc>https://scifaro.com/en/abs/a-deterministic-pseudorandom-perturbation-scheme-for-arbitrary-polynomial-predicates-1308.1986</loc><lastmod>2013-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deterministic-pseudorandom-perturbation-scheme-for-arbitrary-polynomial-predicates-1308.1986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deterministic-pseudorandom-perturbation-scheme-for-arbitrary-polynomial-predicates-1308.1986"/></url>
<url><loc>https://scifaro.com/en/abs/coding-and-compression-of-three-dimensional-meshes-by-planes-1308.2509</loc><lastmod>2013-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coding-and-compression-of-three-dimensional-meshes-by-planes-1308.2509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coding-and-compression-of-three-dimensional-meshes-by-planes-1308.2509"/></url>
<url><loc>https://scifaro.com/en/abs/a-7-2-approximation-algorithm-for-guarding-orthogonal-art-galleries-with-sliding-cameras-1308.2757</loc><lastmod>2013-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-7-2-approximation-algorithm-for-guarding-orthogonal-art-galleries-with-sliding-cameras-1308.2757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-7-2-approximation-algorithm-for-guarding-orthogonal-art-galleries-with-sliding-cameras-1308.2757"/></url>
<url><loc>https://scifaro.com/en/abs/isometric-embedding-of-busemann-surfaces-into-l-1-1308.3181</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isometric-embedding-of-busemann-surfaces-into-l-1-1308.3181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isometric-embedding-of-busemann-surfaces-into-l-1-1308.3181"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-planar-graphs-with-a-prescribed-inner-face-1308.3370</loc><lastmod>2013-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-a-prescribed-inner-face-1308.3370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-a-prescribed-inner-face-1308.3370"/></url>
<url><loc>https://scifaro.com/en/abs/a-variational-principle-for-improving-2d-triangle-meshes-based-on-hyperbolic-volume-1308.3872</loc><lastmod>2013-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-variational-principle-for-improving-2d-triangle-meshes-based-on-hyperbolic-volume-1308.3872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-variational-principle-for-improving-2d-triangle-meshes-based-on-hyperbolic-volume-1308.3872"/></url>
<url><loc>https://scifaro.com/en/abs/a-2-chain-can-interlock-with-an-open-10-chain-1308.4186</loc><lastmod>2013-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-2-chain-can-interlock-with-an-open-10-chain-1308.4186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-2-chain-can-interlock-with-an-open-10-chain-1308.4186"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-planar-graphs-drawings-efficiently-1308.4291</loc><lastmod>2013-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-planar-graphs-drawings-efficiently-1308.4291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-planar-graphs-drawings-efficiently-1308.4291"/></url>
<url><loc>https://scifaro.com/en/abs/simple-and-robust-boolean-operations-for-triangulated-surfaces-1308.4434</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-and-robust-boolean-operations-for-triangulated-surfaces-1308.4434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-and-robust-boolean-operations-for-triangulated-surfaces-1308.4434"/></url>
<url><loc>https://scifaro.com/en/abs/facets-for-art-gallery-problems-1308.4670</loc><lastmod>2014-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facets-for-art-gallery-problems-1308.4670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facets-for-art-gallery-problems-1308.4670"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-impossibility-of-dimension-reduction-for-doubling-subsets-of-ell-p-p-2-1308.4996</loc><lastmod>2013-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-impossibility-of-dimension-reduction-for-doubling-subsets-of-ell-p-p-2-1308.4996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-impossibility-of-dimension-reduction-for-doubling-subsets-of-ell-p-p-2-1308.4996"/></url>
<url><loc>https://scifaro.com/en/abs/1-visibility-representations-of-1-planar-graphs-1308.5079</loc><lastmod>2013-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-visibility-representations-of-1-planar-graphs-1308.5079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-visibility-representations-of-1-planar-graphs-1308.5079"/></url>
<url><loc>https://scifaro.com/en/abs/fitting-voronoi-diagrams-to-planar-tesselations-1308.5550</loc><lastmod>2013-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fitting-voronoi-diagrams-to-planar-tesselations-1308.5550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fitting-voronoi-diagrams-to-planar-tesselations-1308.5550"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-tractability-of-crossing-minimization-of-almost-trees-1308.5741</loc><lastmod>2013-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-tractability-of-crossing-minimization-of-almost-trees-1308.5741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-tractability-of-crossing-minimization-of-almost-trees-1308.5741"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-planar-graph-drawings-while-maintaining-height-1308.6693</loc><lastmod>2013-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-planar-graph-drawings-while-maintaining-height-1308.6693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-planar-graph-drawings-while-maintaining-height-1308.6693"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-and-bounds-for-drawing-non-planar-graphs-with-crossing-free-subgraphs-1308.6706</loc><lastmod>2014-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-and-bounds-for-drawing-non-planar-graphs-with-crossing-free-subgraphs-1308.6706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-and-bounds-for-drawing-non-planar-graphs-with-crossing-free-subgraphs-1308.6706"/></url>
<url><loc>https://scifaro.com/en/abs/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings-1308.6778</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings-1308.6778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-ilp-sat-to-determine-pathwidth-visibility-representations-and-other-grid-based-graph-drawings-1308.6778"/></url>
<url><loc>https://scifaro.com/en/abs/many-to-one-boundary-labeling-with-backbones-1308.6801</loc><lastmod>2013-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-to-one-boundary-labeling-with-backbones-1308.6801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-to-one-boundary-labeling-with-backbones-1308.6801"/></url>
<url><loc>https://scifaro.com/en/abs/strict-confluent-drawing-1308.6824</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-confluent-drawing-1308.6824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-confluent-drawing-1308.6824"/></url>
<url><loc>https://scifaro.com/en/abs/strip-planarity-testing-of-embedded-planar-graphs-1309.0683</loc><lastmod>2013-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strip-planarity-testing-of-embedded-planar-graphs-1309.0683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strip-planarity-testing-of-embedded-planar-graphs-1309.0683"/></url>
<url><loc>https://scifaro.com/en/abs/intrinsic-universality-and-the-computational-power-of-self-assembly-1309.1265</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intrinsic-universality-and-the-computational-power-of-self-assembly-1309.1265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intrinsic-universality-and-the-computational-power-of-self-assembly-1309.1265"/></url>
<url><loc>https://scifaro.com/en/abs/a-piano-movers-problem-reformulated-1309.1588</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-piano-movers-problem-reformulated-1309.1588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-piano-movers-problem-reformulated-1309.1588"/></url>
<url><loc>https://scifaro.com/en/abs/aggregate-max-nearest-neighbor-searching-in-the-plane-1309.1807</loc><lastmod>2013-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aggregate-max-nearest-neighbor-searching-in-the-plane-1309.1807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aggregate-max-nearest-neighbor-searching-in-the-plane-1309.1807"/></url>
<url><loc>https://scifaro.com/en/abs/sinr-diagram-with-interference-cancellation-1309.3193</loc><lastmod>2013-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sinr-diagram-with-interference-cancellation-1309.3193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sinr-diagram-with-interference-cancellation-1309.3193"/></url>
<url><loc>https://scifaro.com/en/abs/on-topological-and-geometric-19-4-configurations-1309.3201</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-topological-and-geometric-19-4-configurations-1309.3201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-topological-and-geometric-19-4-configurations-1309.3201"/></url>
<url><loc>https://scifaro.com/en/abs/matching-colored-points-with-rectangles-1309.3696</loc><lastmod>2014-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-colored-points-with-rectangles-1309.3696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-colored-points-with-rectangles-1309.3696"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-preserving-polygon-simplification-1309.3858</loc><lastmod>2013-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-preserving-polygon-simplification-1309.3858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-preserving-polygon-simplification-1309.3858"/></url>
<url><loc>https://scifaro.com/en/abs/trajectory-based-dynamic-map-labeling-1309.3963</loc><lastmod>2013-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trajectory-based-dynamic-map-labeling-1309.3963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trajectory-based-dynamic-map-labeling-1309.3963"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-computing-topological-invariants-in-2d-and-3d-digital-spaces-1309.4109</loc><lastmod>2013-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-computing-topological-invariants-in-2d-and-3d-digital-spaces-1309.4109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-computing-topological-invariants-in-2d-and-3d-digital-spaces-1309.4109"/></url>
<url><loc>https://scifaro.com/en/abs/terrain-visibility-with-multiple-viewpoints-1309.4323</loc><lastmod>2014-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terrain-visibility-with-multiple-viewpoints-1309.4323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terrain-visibility-with-multiple-viewpoints-1309.4323"/></url>
<url><loc>https://scifaro.com/en/abs/path-based-distance-for-street-map-comparison-1309.6131</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/path-based-distance-for-street-map-comparison-1309.6131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/path-based-distance-for-street-map-comparison-1309.6131"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-homotopy-theory-in-topological-data-analysis-1309.6628</loc><lastmod>2014-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-homotopy-theory-in-topological-data-analysis-1309.6628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-homotopy-theory-in-topological-data-analysis-1309.6628"/></url>
<url><loc>https://scifaro.com/en/abs/independent-and-hitting-sets-of-rectangles-intersecting-a-diagonal-line-algorithms-and-complexity-1309.6659</loc><lastmod>2016-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-and-hitting-sets-of-rectangles-intersecting-a-diagonal-line-algorithms-and-complexity-1309.6659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-and-hitting-sets-of-rectangles-intersecting-a-diagonal-line-algorithms-and-complexity-1309.6659"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-line-segment-weak-visibility-queries-in-simple-polygons-1309.7803</loc><lastmod>2013-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-line-segment-weak-visibility-queries-in-simple-polygons-1309.7803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-line-segment-weak-visibility-queries-in-simple-polygons-1309.7803"/></url>
<url><loc>https://scifaro.com/en/abs/alpha-concave-hull-a-generalization-of-convex-hull-1309.7829</loc><lastmod>2014-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alpha-concave-hull-a-generalization-of-convex-hull-1309.7829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alpha-concave-hull-a-generalization-of-convex-hull-1309.7829"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-computation-of-persistent-homology-1310.0710</loc><lastmod>2013-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-computation-of-persistent-homology-1310.0710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-computation-of-persistent-homology-1310.0710"/></url>
<url><loc>https://scifaro.com/en/abs/bijective-mappings-of-meshes-with-boundary-and-the-degree-in-mesh-processing-1310.0955</loc><lastmod>2014-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bijective-mappings-of-meshes-with-boundary-and-the-degree-in-mesh-processing-1310.0955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bijective-mappings-of-meshes-with-boundary-and-the-degree-in-mesh-processing-1310.0955"/></url>
<url><loc>https://scifaro.com/en/abs/flipping-edge-labelled-triangulations-1310.1166</loc><lastmod>2016-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flipping-edge-labelled-triangulations-1310.1166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flipping-edge-labelled-triangulations-1310.1166"/></url>
<url><loc>https://scifaro.com/en/abs/four-connected-triangulations-of-planar-point-sets-1310.1726</loc><lastmod>2013-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/four-connected-triangulations-of-planar-point-sets-1310.1726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/four-connected-triangulations-of-planar-point-sets-1310.1726"/></url>
<url><loc>https://scifaro.com/en/abs/practical-reduction-of-edge-flip-sequences-in-two-dimensional-triangulations-1310.2586</loc><lastmod>2013-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-reduction-of-edge-flip-sequences-in-two-dimensional-triangulations-1310.2586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-reduction-of-edge-flip-sequences-in-two-dimensional-triangulations-1310.2586"/></url>
<url><loc>https://scifaro.com/en/abs/testing-graph-isotopy-on-surfaces-1310.2745</loc><lastmod>2013-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-graph-isotopy-on-surfaces-1310.2745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-graph-isotopy-on-surfaces-1310.2745"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-largest-disk-containing-a-query-point-in-logarithmic-time-with-linear-storage-1310.3388</loc><lastmod>2013-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-largest-disk-containing-a-query-point-in-logarithmic-time-with-linear-storage-1310.3388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-largest-disk-containing-a-query-point-in-logarithmic-time-with-linear-storage-1310.3388"/></url>
<url><loc>https://scifaro.com/en/abs/small-superpatterns-for-dominance-drawing-1310.3770</loc><lastmod>2013-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-superpatterns-for-dominance-drawing-1310.3770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-superpatterns-for-dominance-drawing-1310.3770"/></url>
<url><loc>https://scifaro.com/en/abs/recursively-regular-subdivisions-and-applications-1310.4372</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursively-regular-subdivisions-and-applications-1310.4372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursively-regular-subdivisions-and-applications-1310.4372"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-orthogrids-with-constant-refinement-1310.4561</loc><lastmod>2013-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-orthogrids-with-constant-refinement-1310.4561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-orthogrids-with-constant-refinement-1310.4561"/></url>
<url><loc>https://scifaro.com/en/abs/the-discrete-and-semi-continuous-fr-echet-distance-with-shortcuts-via-approximate-distance-counting-and-selection-techniques-1310.5245</loc><lastmod>2016-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-discrete-and-semi-continuous-fr-echet-distance-with-shortcuts-via-approximate-distance-counting-and-selection-techniques-1310.5245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-discrete-and-semi-continuous-fr-echet-distance-with-shortcuts-via-approximate-distance-counting-and-selection-techniques-1310.5245"/></url>
<url><loc>https://scifaro.com/en/abs/union-of-random-minkowski-sums-and-network-vulnerability-analysis-1310.5647</loc><lastmod>2013-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/union-of-random-minkowski-sums-and-network-vulnerability-analysis-1310.5647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/union-of-random-minkowski-sums-and-network-vulnerability-analysis-1310.5647"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-grid-drawings-of-planar-graphs-1310.6084</loc><lastmod>2013-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-grid-drawings-of-planar-graphs-1310.6084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-grid-drawings-of-planar-graphs-1310.6084"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-place-a-point-to-maximize-angles-1310.6413</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-place-a-point-to-maximize-angles-1310.6413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-place-a-point-to-maximize-angles-1310.6413"/></url>
<url><loc>https://scifaro.com/en/abs/domain-mapping-for-volumetric-parameterization-using-harmonic-functions-1310.6894</loc><lastmod>2013-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-mapping-for-volumetric-parameterization-using-harmonic-functions-1310.6894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-mapping-for-volumetric-parameterization-using-harmonic-functions-1310.6894"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-simultaneous-embedding-of-directed-paths-1310.6955</loc><lastmod>2014-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-simultaneous-embedding-of-directed-paths-1310.6955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-simultaneous-embedding-of-directed-paths-1310.6955"/></url>
<url><loc>https://scifaro.com/en/abs/weak-visibility-queries-of-line-segments-in-simple-polygons-and-polygonal-domains-1310.7197</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-visibility-queries-of-line-segments-in-simple-polygons-and-polygonal-domains-1310.7197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-visibility-queries-of-line-segments-in-simple-polygons-and-polygonal-domains-1310.7197"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-stability-via-perturbations-1310.7696</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-stability-via-perturbations-1310.7696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-stability-via-perturbations-1310.7696"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-complexes-in-multidimensional-persistent-homology-theory-1310.8089</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-complexes-in-multidimensional-persistent-homology-theory-1310.8089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-complexes-in-multidimensional-persistent-homology-theory-1310.8089"/></url>
<url><loc>https://scifaro.com/en/abs/guaranteed-collision-detection-with-toleranced-motions-1310.8097</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guaranteed-collision-detection-with-toleranced-motions-1310.8097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guaranteed-collision-detection-with-toleranced-motions-1310.8097"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-triangulation-of-manifolds-1311.0117</loc><lastmod>2015-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-triangulation-of-manifolds-1311.0117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-triangulation-of-manifolds-1311.0117"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-order-type-isomorphism-1311.0928</loc><lastmod>2013-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-order-type-isomorphism-1311.0928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-order-type-isomorphism-1311.0928"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-edges-of-fan-crossing-free-graphs-1311.1976</loc><lastmod>2013-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-edges-of-fan-crossing-free-graphs-1311.1976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-edges-of-fan-crossing-free-graphs-1311.1976"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-faster-method-for-kinetic-proximity-problems-1311.2032</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-faster-method-for-kinetic-proximity-problems-1311.2032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-faster-method-for-kinetic-proximity-problems-1311.2032"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-generalized-multi-dimensional-scaling-1311.2187</loc><lastmod>2014-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-generalized-multi-dimensional-scaling-1311.2187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-generalized-multi-dimensional-scaling-1311.2187"/></url>
<url><loc>https://scifaro.com/en/abs/local-event-boundary-detection-with-unreliable-sensors-analysis-of-the-majority-vote-scheme-1311.3149</loc><lastmod>2013-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-event-boundary-detection-with-unreliable-sensors-analysis-of-the-majority-vote-scheme-1311.3149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-event-boundary-detection-with-unreliable-sensors-analysis-of-the-majority-vote-scheme-1311.3149"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-farthest-point-sampling-for-approximating-geodesics-in-a-graph-1311.4665</loc><lastmod>2016-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-farthest-point-sampling-for-approximating-geodesics-in-a-graph-1311.4665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-farthest-point-sampling-for-approximating-geodesics-in-a-graph-1311.4665"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-word-cloud-representations-hardness-and-approximation-algorithms-1311.4778</loc><lastmod>2013-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-word-cloud-representations-hardness-and-approximation-algorithms-1311.4778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-word-cloud-representations-hardness-and-approximation-algorithms-1311.4778"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-coverage-of-an-opaque-forest-1311.4854</loc><lastmod>2013-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-coverage-of-an-opaque-forest-1311.4854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-coverage-of-an-opaque-forest-1311.4854"/></url>
<url><loc>https://scifaro.com/en/abs/nucleation-free-3d-rigidity-1311.4859</loc><lastmod>2013-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nucleation-free-3d-rigidity-1311.4859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nucleation-free-3d-rigidity-1311.4859"/></url>
<url><loc>https://scifaro.com/en/abs/computing-covers-of-plane-forests-1311.4860</loc><lastmod>2013-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-covers-of-plane-forests-1311.4860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-covers-of-plane-forests-1311.4860"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-bottleneck-plane-perfect-matching-of-a-point-set-1311.5197</loc><lastmod>2015-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-bottleneck-plane-perfect-matching-of-a-point-set-1311.5197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-bottleneck-plane-perfect-matching-of-a-point-set-1311.5197"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-linear-programs-into-min-max-problems-1311.5447</loc><lastmod>2013-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-linear-programs-into-min-max-problems-1311.5447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-linear-programs-into-min-max-problems-1311.5447"/></url>
<url><loc>https://scifaro.com/en/abs/packing-and-covering-a-polygon-with-geodesic-disks-1311.6033</loc><lastmod>2013-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-and-covering-a-polygon-with-geodesic-disks-1311.6033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-and-covering-a-polygon-with-geodesic-disks-1311.6033"/></url>
<url><loc>https://scifaro.com/en/abs/compact-families-of-jordan-curves-and-convex-hulls-in-three-dimensions-1311.6331</loc><lastmod>2015-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-families-of-jordan-curves-and-convex-hulls-in-three-dimensions-1311.6331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-families-of-jordan-curves-and-convex-hulls-in-three-dimensions-1311.6331"/></url>
<url><loc>https://scifaro.com/en/abs/picking-planar-edges-or-drawing-a-graph-with-a-planar-subgraph-1311.6839</loc><lastmod>2013-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/picking-planar-edges-or-drawing-a-graph-with-a-planar-subgraph-1311.6839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/picking-planar-edges-or-drawing-a-graph-with-a-planar-subgraph-1311.6839"/></url>
<url><loc>https://scifaro.com/en/abs/improved-optimal-and-approximate-power-graph-compression-for-clearer-visualisation-of-dense-graphs-1311.6996</loc><lastmod>2013-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-optimal-and-approximate-power-graph-compression-for-clearer-visualisation-of-dense-graphs-1311.6996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-optimal-and-approximate-power-graph-compression-for-clearer-visualisation-of-dense-graphs-1311.6996"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-disc-covers-and-a-new-characterization-of-the-steiner-center-1312.0233</loc><lastmod>2018-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-disc-covers-and-a-new-characterization-of-the-steiner-center-1312.0233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-disc-covers-and-a-new-characterization-of-the-steiner-center-1312.0233"/></url>
<url><loc>https://scifaro.com/en/abs/the-guillotine-approach-for-tsp-with-neighborhoods-revisited-1312.0378</loc><lastmod>2014-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-guillotine-approach-for-tsp-with-neighborhoods-revisited-1312.0378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-guillotine-approach-for-tsp-with-neighborhoods-revisited-1312.0378"/></url>
<url><loc>https://scifaro.com/en/abs/on-strong-centerpoints-1312.0387</loc><lastmod>2015-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-strong-centerpoints-1312.0387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-strong-centerpoints-1312.0387"/></url>
<url><loc>https://scifaro.com/en/abs/output-sensitive-algorithm-for-covering-many-points-1312.0389</loc><lastmod>2013-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/output-sensitive-algorithm-for-covering-many-points-1312.0389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/output-sensitive-algorithm-for-covering-many-points-1312.0389"/></url>
<url><loc>https://scifaro.com/en/abs/nonlinear-dimensionality-reduction-via-path-based-isometric-mapping-1312.0803</loc><lastmod>2014-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonlinear-dimensionality-reduction-via-path-based-isometric-mapping-1312.0803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonlinear-dimensionality-reduction-via-path-based-isometric-mapping-1312.0803"/></url>
<url><loc>https://scifaro.com/en/abs/linear-transformation-distance-for-bichromatic-matchings-1312.0884</loc><lastmod>2013-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-transformation-distance-for-bichromatic-matchings-1312.0884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-transformation-distance-for-bichromatic-matchings-1312.0884"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-detection-of-intersections-between-convex-polyhedra-1312.1001</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-detection-of-intersections-between-convex-polyhedra-1312.1001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-detection-of-intersections-between-convex-polyhedra-1312.1001"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-multi-robot-motion-planning-for-unlabeled-discs-in-simple-polygons-1312.1038</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-multi-robot-motion-planning-for-unlabeled-discs-in-simple-polygons-1312.1038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-multi-robot-motion-planning-for-unlabeled-discs-in-simple-polygons-1312.1038"/></url>
<url><loc>https://scifaro.com/en/abs/study-on-delaunay-tessellations-of-1-irregular-cuboids-for-3d-mixed-element-meshes-1312.1181</loc><lastmod>2013-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-on-delaunay-tessellations-of-1-irregular-cuboids-for-3d-mixed-element-meshes-1312.1181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-on-delaunay-tessellations-of-1-irregular-cuboids-for-3d-mixed-element-meshes-1312.1181"/></url>
<url><loc>https://scifaro.com/en/abs/the-morse-theory-of-v-c-ech-and-delaunay-complexes-1312.1231</loc><lastmod>2017-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-morse-theory-of-v-c-ech-and-delaunay-complexes-1312.1231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-morse-theory-of-v-c-ech-and-delaunay-complexes-1312.1231"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-polynomial-time-approximation-scheme-for-sparse-subsets-of-polygons-1312.1369</loc><lastmod>2013-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-polynomial-time-approximation-scheme-for-sparse-subsets-of-polygons-1312.1369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-polynomial-time-approximation-scheme-for-sparse-subsets-of-polygons-1312.1369"/></url>
<url><loc>https://scifaro.com/en/abs/fast-subspace-approximation-via-greedy-least-squares-1312.1413</loc><lastmod>2013-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-subspace-approximation-via-greedy-least-squares-1312.1413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-subspace-approximation-via-greedy-least-squares-1312.1413"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-and-robust-algorithm-to-count-topologically-persistent-holes-in-noisy-clouds-1312.1492</loc><lastmod>2016-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-and-robust-algorithm-to-count-topologically-persistent-holes-in-noisy-clouds-1312.1492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-and-robust-algorithm-to-count-topologically-persistent-holes-in-noisy-clouds-1312.1492"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-persistent-homology-for-a-cloud-of-n-points-in-a-subquadratic-time-1312.1494</loc><lastmod>2017-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-persistent-homology-for-a-cloud-of-n-points-in-a-subquadratic-time-1312.1494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-persistent-homology-for-a-cloud-of-n-points-in-a-subquadratic-time-1312.1494"/></url>
<url><loc>https://scifaro.com/en/abs/book-embeddings-of-reeb-graphs-1312.1725</loc><lastmod>2013-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/book-embeddings-of-reeb-graphs-1312.1725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/book-embeddings-of-reeb-graphs-1312.1725"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-graphs-on-convex-point-sets-1312.2185</loc><lastmod>2013-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-graphs-on-convex-point-sets-1312.2185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-graphs-on-convex-point-sets-1312.2185"/></url>
<url><loc>https://scifaro.com/en/abs/on-kinetic-delaunay-triangulations-a-near-quadratic-bound-for-unit-speed-motions-1312.2194</loc><lastmod>2013-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-kinetic-delaunay-triangulations-a-near-quadratic-bound-for-unit-speed-motions-1312.2194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-kinetic-delaunay-triangulations-a-near-quadratic-bound-for-unit-speed-motions-1312.2194"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-recognition-and-tagging-of-topologically-different-regimes-in-dynamical-systems-1312.2482</loc><lastmod>2014-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-recognition-and-tagging-of-topologically-different-regimes-in-dynamical-systems-1312.2482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-recognition-and-tagging-of-topologically-different-regimes-in-dynamical-systems-1312.2482"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-approximability-of-covering-points-by-lines-and-related-problems-1312.2549</loc><lastmod>2013-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-approximability-of-covering-points-by-lines-and-related-problems-1312.2549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-approximability-of-covering-points-by-lines-and-related-problems-1312.2549"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-random-walk-methods-for-approximating-polytope-volume-1312.2873</loc><lastmod>2021-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-random-walk-methods-for-approximating-polytope-volume-1312.2873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-random-walk-methods-for-approximating-polytope-volume-1312.2873"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-sweep-line-algorithm-for-counting-triangulations-and-pseudo-triangulations-1312.3188</loc><lastmod>2013-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-sweep-line-algorithm-for-counting-triangulations-and-pseudo-triangulations-1312.3188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-sweep-line-algorithm-for-counting-triangulations-and-pseudo-triangulations-1312.3188"/></url>
<url><loc>https://scifaro.com/en/abs/smooth-orthogonal-drawings-of-planar-graphs-1312.3538</loc><lastmod>2013-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smooth-orthogonal-drawings-of-planar-graphs-1312.3538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smooth-orthogonal-drawings-of-planar-graphs-1312.3538"/></url>
<url><loc>https://scifaro.com/en/abs/a-closed-form-solution-for-the-flat-state-geometry-of-cylindrical-surface-intersections-bounded-on-all-sides-by-orthogonal-planes-1312.3604</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-closed-form-solution-for-the-flat-state-geometry-of-cylindrical-surface-intersections-bounded-on-all-sides-by-orthogonal-planes-1312.3604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-closed-form-solution-for-the-flat-state-geometry-of-cylindrical-surface-intersections-bounded-on-all-sides-by-orthogonal-planes-1312.3604"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-l-1-geodesic-diameter-and-center-of-a-simple-polygon-in-linear-time-1312.3711</loc><lastmod>2015-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-l-1-geodesic-diameter-and-center-of-a-simple-polygon-in-linear-time-1312.3711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-l-1-geodesic-diameter-and-center-of-a-simple-polygon-in-linear-time-1312.3711"/></url>
<url><loc>https://scifaro.com/en/abs/a-randomized-incremental-algorithm-for-the-hausdorff-voronoi-diagram-of-non-crossing-clusters-1312.3904</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-randomized-incremental-algorithm-for-the-hausdorff-voronoi-diagram-of-non-crossing-clusters-1312.3904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-randomized-incremental-algorithm-for-the-hausdorff-voronoi-diagram-of-non-crossing-clusters-1312.3904"/></url>
<url><loc>https://scifaro.com/en/abs/indecomposable-coverings-with-homothetic-polygons-1312.4597</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indecomposable-coverings-with-homothetic-polygons-1312.4597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indecomposable-coverings-with-homothetic-polygons-1312.4597"/></url>
<url><loc>https://scifaro.com/en/abs/counting-triangulations-and-other-crossing-free-structures-via-onion-layers-1312.4628</loc><lastmod>2013-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-triangulations-and-other-crossing-free-structures-via-onion-layers-1312.4628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-triangulations-and-other-crossing-free-structures-via-onion-layers-1312.4628"/></url>
<url><loc>https://scifaro.com/en/abs/output-sensitive-tools-for-range-searching-in-higher-dimensions-1312.6305</loc><lastmod>2013-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/output-sensitive-tools-for-range-searching-in-higher-dimensions-1312.6305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/output-sensitive-tools-for-range-searching-in-higher-dimensions-1312.6305"/></url>
<url><loc>https://scifaro.com/en/abs/dihedral-angles-and-orthogonal-polyhedra-1312.6824</loc><lastmod>2013-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dihedral-angles-and-orthogonal-polyhedra-1312.6824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dihedral-angles-and-orthogonal-polyhedra-1312.6824"/></url>
<url><loc>https://scifaro.com/en/abs/how-beta-skeletons-lose-their-edges-1312.7363</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-beta-skeletons-lose-their-edges-1312.7363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-beta-skeletons-lose-their-edges-1312.7363"/></url>
<url><loc>https://scifaro.com/en/abs/on-packing-almost-half-of-a-square-with-anchored-rectangles-a-constructive-approach-1401.0108</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-packing-almost-half-of-a-square-with-anchored-rectangles-a-constructive-approach-1401.0108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-packing-almost-half-of-a-square-with-anchored-rectangles-a-constructive-approach-1401.0108"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-and-practical-method-to-estimate-volumes-of-convex-polytopes-1401.0120</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-and-practical-method-to-estimate-volumes-of-convex-polytopes-1401.0120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-and-practical-method-to-estimate-volumes-of-convex-polytopes-1401.0120"/></url>
<url><loc>https://scifaro.com/en/abs/separating-a-voronoi-diagram-via-local-search-1401.0174</loc><lastmod>2014-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-a-voronoi-diagram-via-local-search-1401.0174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-a-voronoi-diagram-via-local-search-1401.0174"/></url>
<url><loc>https://scifaro.com/en/abs/selection-lemmas-for-various-geometric-objects-1401.0443</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/selection-lemmas-for-various-geometric-objects-1401.0443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/selection-lemmas-for-various-geometric-objects-1401.0443"/></url>
<url><loc>https://scifaro.com/en/abs/sphere-packing-with-limited-overlap-1401.0468</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sphere-packing-with-limited-overlap-1401.0468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sphere-packing-with-limited-overlap-1401.0468"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-sensitive-construction-of-the-greedy-spanner-1401.1085</loc><lastmod>2014-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-sensitive-construction-of-the-greedy-spanner-1401.1085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-sensitive-construction-of-the-greedy-spanner-1401.1085"/></url>
<url><loc>https://scifaro.com/en/abs/computational-aspects-of-the-hausdorff-distance-in-unbounded-dimension-1401.1434</loc><lastmod>2014-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-aspects-of-the-hausdorff-distance-in-unbounded-dimension-1401.1434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-aspects-of-the-hausdorff-distance-in-unbounded-dimension-1401.1434"/></url>
<url><loc>https://scifaro.com/en/abs/robust-proximity-search-for-balls-using-sublinear-space-1401.1472</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-proximity-search-for-balls-using-sublinear-space-1401.1472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-proximity-search-for-balls-using-sublinear-space-1401.1472"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-randomly-weighted-voronoi-diagrams-1401.1477</loc><lastmod>2015-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-randomly-weighted-voronoi-diagrams-1401.1477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-randomly-weighted-voronoi-diagrams-1401.1477"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-properties-of-yao-and-theta-graphs-in-the-presence-of-constraints-1401.2127</loc><lastmod>2019-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-properties-of-yao-and-theta-graphs-in-the-presence-of-constraints-1401.2127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-properties-of-yao-and-theta-graphs-in-the-presence-of-constraints-1401.2127"/></url>
<url><loc>https://scifaro.com/en/abs/a-leapfrog-strategy-for-pursuit-evasion-in-a-polygonal-environment-1401.2960</loc><lastmod>2014-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-leapfrog-strategy-for-pursuit-evasion-in-a-polygonal-environment-1401.2960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-leapfrog-strategy-for-pursuit-evasion-in-a-polygonal-environment-1401.2960"/></url>
<url><loc>https://scifaro.com/en/abs/computational-topology-for-approximations-of-knots-1401.3370</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-topology-for-approximations-of-knots-1401.3370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-topology-for-approximations-of-knots-1401.3370"/></url>
<url><loc>https://scifaro.com/en/abs/a-programme-to-determine-the-exact-interior-of-any-connected-digital-picture-1401.3385</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-programme-to-determine-the-exact-interior-of-any-connected-digital-picture-1401.3385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-programme-to-determine-the-exact-interior-of-any-connected-digital-picture-1401.3385"/></url>
<url><loc>https://scifaro.com/en/abs/theta-any-angle-path-planning-on-grids-1401.3843</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theta-any-angle-path-planning-on-grids-1401.3843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theta-any-angle-path-planning-on-grids-1401.3843"/></url>
<url><loc>https://scifaro.com/en/abs/packing-circles-within-circular-containers-a-new-heuristic-algorithm-for-the-balance-constraints-case-1401.4952</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-circles-within-circular-containers-a-new-heuristic-algorithm-for-the-balance-constraints-case-1401.4952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-circles-within-circular-containers-a-new-heuristic-algorithm-for-the-balance-constraints-case-1401.4952"/></url>
<url><loc>https://scifaro.com/en/abs/light-spanners-for-snowflake-metrics-1401.5014</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-spanners-for-snowflake-metrics-1401.5014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-spanners-for-snowflake-metrics-1401.5014"/></url>
<url><loc>https://scifaro.com/en/abs/study-of-neural-network-algorithm-for-straight-line-drawings-of-planar-graphs-1401.5330</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-of-neural-network-algorithm-for-straight-line-drawings-of-planar-graphs-1401.5330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-of-neural-network-algorithm-for-straight-line-drawings-of-planar-graphs-1401.5330"/></url>
<url><loc>https://scifaro.com/en/abs/improved-online-square-into-square-packing-1401.5583</loc><lastmod>2014-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-online-square-into-square-packing-1401.5583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-online-square-into-square-packing-1401.5583"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-walk-your-dog-in-the-mountains-with-no-magic-leash-1401.7042</loc><lastmod>2015-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-walk-your-dog-in-the-mountains-with-no-magic-leash-1401.7042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-walk-your-dog-in-the-mountains-with-no-magic-leash-1401.7042"/></url>
<url><loc>https://scifaro.com/en/abs/bases-of-t-meshes-and-the-refinement-of-hierarchical-b-splines-1401.7076</loc><lastmod>2021-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bases-of-t-meshes-and-the-refinement-of-hierarchical-b-splines-1401.7076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bases-of-t-meshes-and-the-refinement-of-hierarchical-b-splines-1401.7076"/></url>
<url><loc>https://scifaro.com/en/abs/large-deformation-diffeomorphic-metric-mapping-and-fast-multipole-boundary-element-method-provide-new-insights-for-binaural-acoustics-1401.7100</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-deformation-diffeomorphic-metric-mapping-and-fast-multipole-boundary-element-method-provide-new-insights-for-binaural-acoustics-1401.7100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-deformation-diffeomorphic-metric-mapping-and-fast-multipole-boundary-element-method-provide-new-insights-for-binaural-acoustics-1401.7100"/></url>
<url><loc>https://scifaro.com/en/abs/polynomials-vanishing-on-grids-the-elekes-r-onyai-problem-revisited-1401.7419</loc><lastmod>2014-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomials-vanishing-on-grids-the-elekes-r-onyai-problem-revisited-1401.7419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomials-vanishing-on-grids-the-elekes-r-onyai-problem-revisited-1401.7419"/></url>
<url><loc>https://scifaro.com/en/abs/counting-euclidean-embeddings-of-rigid-graphs-1402.1484</loc><lastmod>2017-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-euclidean-embeddings-of-rigid-graphs-1402.1484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-euclidean-embeddings-of-rigid-graphs-1402.1484"/></url>
<url><loc>https://scifaro.com/en/abs/a-duality-transform-for-constructing-small-grid-embeddings-of-3d-polytopes-1402.1660</loc><lastmod>2016-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-duality-transform-for-constructing-small-grid-embeddings-of-3d-polytopes-1402.1660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-duality-transform-for-constructing-small-grid-embeddings-of-3d-polytopes-1402.1660"/></url>
<url><loc>https://scifaro.com/en/abs/recurrence-for-pandimensional-space-filling-functions-1402.1807</loc><lastmod>2015-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recurrence-for-pandimensional-space-filling-functions-1402.1807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recurrence-for-pandimensional-space-filling-functions-1402.1807"/></url>
<url><loc>https://scifaro.com/en/abs/surfaces-representation-with-sharp-features-using-sqrt-3-and-loop-subdivision-schemes-1402.2190</loc><lastmod>2014-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surfaces-representation-with-sharp-features-using-sqrt-3-and-loop-subdivision-schemes-1402.2190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surfaces-representation-with-sharp-features-using-sqrt-3-and-loop-subdivision-schemes-1402.2190"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-dynamic-reeb-graphs-1402.2812</loc><lastmod>2015-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-dynamic-reeb-graphs-1402.2812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-dynamic-reeb-graphs-1402.2812"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-theoretical-approach-for-the-computation-of-connected-iso-surfaces-based-on-volumetric-data-1402.3236</loc><lastmod>2014-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-theoretical-approach-for-the-computation-of-connected-iso-surfaces-based-on-volumetric-data-1402.3236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-theoretical-approach-for-the-computation-of-connected-iso-surfaces-based-on-volumetric-data-1402.3236"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-in-intersection-graphs-of-unit-disks-1402.4855</loc><lastmod>2014-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-in-intersection-graphs-of-unit-disks-1402.4855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-in-intersection-graphs-of-unit-disks-1402.4855"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-reconstruction-of-convex-sets-from-random-normal-measurements-1402.5010</loc><lastmod>2014-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-reconstruction-of-convex-sets-from-random-normal-measurements-1402.5010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-reconstruction-of-convex-sets-from-random-normal-measurements-1402.5010"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparison-and-evaluation-of-map-construction-algorithms-1402.5138</loc><lastmod>2014-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparison-and-evaluation-of-map-construction-algorithms-1402.5138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparison-and-evaluation-of-map-construction-algorithms-1402.5138"/></url>
<url><loc>https://scifaro.com/en/abs/diffuse-reflection-radius-in-a-simple-polygon-1402.5303</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diffuse-reflection-radius-in-a-simple-polygon-1402.5303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diffuse-reflection-radius-in-a-simple-polygon-1402.5303"/></url>
<url><loc>https://scifaro.com/en/abs/region-based-approximation-of-probability-distributions-for-visibility-between-imprecise-points-among-obstacles-1402.5681</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/region-based-approximation-of-probability-distributions-for-visibility-between-imprecise-points-among-obstacles-1402.5681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/region-based-approximation-of-probability-distributions-for-visibility-between-imprecise-points-among-obstacles-1402.5681"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-angle-spanning-tree-modeling-networks-with-angular-constraints-1402.6096</loc><lastmod>2014-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-angle-spanning-tree-modeling-networks-with-angular-constraints-1402.6096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-angle-spanning-tree-modeling-networks-with-angular-constraints-1402.6096"/></url>
<url><loc>https://scifaro.com/en/abs/landmark-matching-transformation-with-large-deformation-via-n-dimensional-quasi-conformal-maps-1402.6908</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/landmark-matching-transformation-with-large-deformation-via-n-dimensional-quasi-conformal-maps-1402.6908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/landmark-matching-transformation-with-large-deformation-via-n-dimensional-quasi-conformal-maps-1402.6908"/></url>
<url><loc>https://scifaro.com/en/abs/cayley-analysis-of-mechanism-configuration-spaces-using-caymos-software-functionalities-and-architecture-1402.7347</loc><lastmod>2014-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cayley-analysis-of-mechanism-configuration-spaces-using-caymos-software-functionalities-and-architecture-1402.7347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cayley-analysis-of-mechanism-configuration-spaces-using-caymos-software-functionalities-and-architecture-1402.7347"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-of-paraboloids-and-application-to-minkowski-type-problems-1403.0062</loc><lastmod>2014-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-of-paraboloids-and-application-to-minkowski-type-problems-1403.0062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-of-paraboloids-and-application-to-minkowski-type-problems-1403.0062"/></url>
<url><loc>https://scifaro.com/en/abs/qptas-for-geometric-set-cover-problems-via-optimal-separators-1403.0835</loc><lastmod>2014-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qptas-for-geometric-set-cover-problems-via-optimal-separators-1403.0835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qptas-for-geometric-set-cover-problems-via-optimal-separators-1403.0835"/></url>
<url><loc>https://scifaro.com/en/abs/querying-geometric-figures-using-a-controlled-language-ontological-graphs-and-dependency-lattices-1403.2194</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-geometric-figures-using-a-controlled-language-ontological-graphs-and-dependency-lattices-1403.2194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-geometric-figures-using-a-controlled-language-ontological-graphs-and-dependency-lattices-1403.2194"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-general-chromatic-art-gallery-problem-1403.2972</loc><lastmod>2014-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-general-chromatic-art-gallery-problem-1403.2972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-general-chromatic-art-gallery-problem-1403.2972"/></url>
<url><loc>https://scifaro.com/en/abs/two-point-l-1-shortest-path-queries-in-the-plane-1403.3458</loc><lastmod>2014-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-point-l-1-shortest-path-queries-in-the-plane-1403.3458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-point-l-1-shortest-path-queries-in-the-plane-1403.3458"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-continuous-fermat-weber-problem-for-a-convex-polygon-using-euclidean-distance-1403.3715</loc><lastmod>2014-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-continuous-fermat-weber-problem-for-a-convex-polygon-using-euclidean-distance-1403.3715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-continuous-fermat-weber-problem-for-a-convex-polygon-using-euclidean-distance-1403.3715"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-opaque-sets-1403.3894</loc><lastmod>2014-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-opaque-sets-1403.3894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-opaque-sets-1403.3894"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-visibility-polygons-1403.3905</loc><lastmod>2014-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-visibility-polygons-1403.3905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-visibility-polygons-1403.3905"/></url>
<url><loc>https://scifaro.com/en/abs/there-are-plane-spanners-of-maximum-degree-4-1403.5350</loc><lastmod>2014-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/there-are-plane-spanners-of-maximum-degree-4-1403.5350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/there-are-plane-spanners-of-maximum-degree-4-1403.5350"/></url>
<url><loc>https://scifaro.com/en/abs/qcmc-quasi-conformal-parameterizations-for-multiply-connected-domains-1403.6614</loc><lastmod>2014-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qcmc-quasi-conformal-parameterizations-for-multiply-connected-domains-1403.6614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qcmc-quasi-conformal-parameterizations-for-multiply-connected-domains-1403.6614"/></url>
<url><loc>https://scifaro.com/en/abs/probably-approximately-symmetric-fast-rigid-symmetry-detection-with-global-guarantees-1403.6637</loc><lastmod>2016-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probably-approximately-symmetric-fast-rigid-symmetry-detection-with-global-guarantees-1403.6637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probably-approximately-symmetric-fast-rigid-symmetry-detection-with-global-guarantees-1403.6637"/></url>
<url><loc>https://scifaro.com/en/abs/defining-and-computing-persistent-z-homology-in-the-general-case-1403.7086</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defining-and-computing-persistent-z-homology-in-the-general-case-1403.7086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defining-and-computing-persistent-z-homology-in-the-general-case-1403.7086"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-configurations-building-blocks-for-point-line-configurations-1403.7939</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-configurations-building-blocks-for-point-line-configurations-1403.7939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-configurations-building-blocks-for-point-line-configurations-1403.7939"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-stacked-polytopes-on-a-polynomial-size-grid-1403.7980</loc><lastmod>2017-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-stacked-polytopes-on-a-polynomial-size-grid-1403.7980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-stacked-polytopes-on-a-polynomial-size-grid-1403.7980"/></url>
<url><loc>https://scifaro.com/en/abs/implementation-of-interaction-between-soft-tissues-and-foreign-bodies-using-modified-voxel-model-1403.7987</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementation-of-interaction-between-soft-tissues-and-foreign-bodies-using-modified-voxel-model-1403.7987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementation-of-interaction-between-soft-tissues-and-foreign-bodies-using-modified-voxel-model-1403.7987"/></url>
<url><loc>https://scifaro.com/en/abs/covering-nearly-surface-embedded-graphs-with-a-fixed-number-of-balls-1403.8086</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-nearly-surface-embedded-graphs-with-a-fixed-number-of-balls-1403.8086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-nearly-surface-embedded-graphs-with-a-fixed-number-of-balls-1403.8086"/></url>
<url><loc>https://scifaro.com/en/abs/a-computational-framework-for-boundary-representation-of-solid-sweeps-1404.0119</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computational-framework-for-boundary-representation-of-solid-sweeps-1404.0119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computational-framework-for-boundary-representation-of-solid-sweeps-1404.0119"/></url>
<url><loc>https://scifaro.com/en/abs/counting-triangulations-and-other-crossing-free-structures-approximately-1404.0261</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-triangulations-and-other-crossing-free-structures-approximately-1404.0261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-triangulations-and-other-crossing-free-structures-approximately-1404.0261"/></url>
<url><loc>https://scifaro.com/en/abs/a-directed-isoperimetric-inequality-with-application-to-bregman-near-neighbor-lower-bounds-1404.1191</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-directed-isoperimetric-inequality-with-application-to-bregman-near-neighbor-lower-bounds-1404.1191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-directed-isoperimetric-inequality-with-application-to-bregman-near-neighbor-lower-bounds-1404.1191"/></url>
<url><loc>https://scifaro.com/en/abs/why-walking-the-dog-takes-time-frechet-distance-has-no-strongly-subquadratic-algorithms-unless-seth-fails-1404.1448</loc><lastmod>2014-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/why-walking-the-dog-takes-time-frechet-distance-has-no-strongly-subquadratic-algorithms-unless-seth-fails-1404.1448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/why-walking-the-dog-takes-time-frechet-distance-has-no-strongly-subquadratic-algorithms-unless-seth-fails-1404.1448"/></url>
<url><loc>https://scifaro.com/en/abs/proximal-navigation-graphs-and-t-spanners-1404.1646</loc><lastmod>2022-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proximal-navigation-graphs-and-t-spanners-1404.1646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proximal-navigation-graphs-and-t-spanners-1404.1646"/></url>
<url><loc>https://scifaro.com/en/abs/fun-with-fonts-algorithmic-typography-1404.1775</loc><lastmod>2014-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fun-with-fonts-algorithmic-typography-1404.1775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fun-with-fonts-algorithmic-typography-1404.1775"/></url>
<url><loc>https://scifaro.com/en/abs/evaluation-of-labeling-strategies-for-rotating-maps-1404.1849</loc><lastmod>2014-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluation-of-labeling-strategies-for-rotating-maps-1404.1849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluation-of-labeling-strategies-for-rotating-maps-1404.1849"/></url>
<url><loc>https://scifaro.com/en/abs/from-proximity-to-utility-a-voronoi-partition-of-pareto-optima-1404.3403</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-proximity-to-utility-a-voronoi-partition-of-pareto-optima-1404.3403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-proximity-to-utility-a-voronoi-partition-of-pareto-optima-1404.3403"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-schemes-for-partitioning-convex-decomposition-and-surface-approximation-1404.3776</loc><lastmod>2014-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-schemes-for-partitioning-convex-decomposition-and-surface-approximation-1404.3776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-schemes-for-partitioning-convex-decomposition-and-surface-approximation-1404.3776"/></url>
<url><loc>https://scifaro.com/en/abs/on-level-persistence-relevant-level-persistence-numbers-1404.4312</loc><lastmod>2014-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-level-persistence-relevant-level-persistence-numbers-1404.4312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-level-persistence-relevant-level-persistence-numbers-1404.4312"/></url>
<url><loc>https://scifaro.com/en/abs/three-monotone-interpolation-1404.4731</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-monotone-interpolation-1404.4731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-monotone-interpolation-1404.4731"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-voronoi-diagrams-and-delaunay-triangulations-under-polygonal-distance-functions-1404.4851</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-voronoi-diagrams-and-delaunay-triangulations-under-polygonal-distance-functions-1404.4851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-voronoi-diagrams-and-delaunay-triangulations-under-polygonal-distance-functions-1404.4851"/></url>
<url><loc>https://scifaro.com/en/abs/matching-curves-to-imprecise-point-sets-using-fr-echet-distance-1404.4859</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-curves-to-imprecise-point-sets-using-fr-echet-distance-1404.4859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-curves-to-imprecise-point-sets-using-fr-echet-distance-1404.4859"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-vertex-enumeration-of-convex-polytopes-of-bounded-branch-width-1404.5584</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-vertex-enumeration-of-convex-polytopes-of-bounded-branch-width-1404.5584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-vertex-enumeration-of-convex-polytopes-of-bounded-branch-width-1404.5584"/></url>
<url><loc>https://scifaro.com/en/abs/straightening-out-planar-poly-line-drawings-1404.5892</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straightening-out-planar-poly-line-drawings-1404.5892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straightening-out-planar-poly-line-drawings-1404.5892"/></url>
<url><loc>https://scifaro.com/en/abs/reflections-on-tiles-in-self-assembly-1404.5985</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflections-on-tiles-in-self-assembly-1404.5985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflections-on-tiles-in-self-assembly-1404.5985"/></url>
<url><loc>https://scifaro.com/en/abs/the-fshape-framework-for-the-variability-analysis-of-functional-shapes-1404.6039</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fshape-framework-for-the-variability-analysis-of-functional-shapes-1404.6039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fshape-framework-for-the-variability-analysis-of-functional-shapes-1404.6039"/></url>
<url><loc>https://scifaro.com/en/abs/towards-tight-bounds-on-theta-graphs-1404.6233</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-tight-bounds-on-theta-graphs-1404.6233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-tight-bounds-on-theta-graphs-1404.6233"/></url>
<url><loc>https://scifaro.com/en/abs/ilato-project-fusion-of-optical-surface-models-and-volumetric-ct-data-1404.6583</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ilato-project-fusion-of-optical-surface-models-and-volumetric-ct-data-1404.6583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ilato-project-fusion-of-optical-surface-models-and-volumetric-ct-data-1404.6583"/></url>
<url><loc>https://scifaro.com/en/abs/theta-3-is-connected-1404.7186</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theta-3-is-connected-1404.7186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theta-3-is-connected-1404.7186"/></url>
<url><loc>https://scifaro.com/en/abs/size-separable-tile-self-assembly-a-tight-bound-for-temperature-1-mismatch-free-systems-1404.7410</loc><lastmod>2014-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-separable-tile-self-assembly-a-tight-bound-for-temperature-1-mismatch-free-systems-1404.7410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-separable-tile-self-assembly-a-tight-bound-for-temperature-1-mismatch-free-systems-1404.7410"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-curve-in-a-point-set-1405.0762</loc><lastmod>2014-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-curve-in-a-point-set-1405.0762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-curve-in-a-point-set-1405.0762"/></url>
<url><loc>https://scifaro.com/en/abs/bottleneck-partial-matching-voronoi-diagrams-and-applications-1405.0900</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottleneck-partial-matching-voronoi-diagrams-and-applications-1405.0900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottleneck-partial-matching-voronoi-diagrams-and-applications-1405.0900"/></url>
<url><loc>https://scifaro.com/en/abs/finding-largest-rectangles-in-convex-polygons-1405.1223</loc><lastmod>2014-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-largest-rectangles-in-convex-polygons-1405.1223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-largest-rectangles-in-convex-polygons-1405.1223"/></url>
<url><loc>https://scifaro.com/en/abs/halving-balls-in-deterministic-linear-time-1405.1894</loc><lastmod>2014-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/halving-balls-in-deterministic-linear-time-1405.1894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/halving-balls-in-deterministic-linear-time-1405.1894"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-higher-degree-orthogonal-graph-embedding-in-the-kandinsky-model-1405.2300</loc><lastmod>2014-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-higher-degree-orthogonal-graph-embedding-in-the-kandinsky-model-1405.2300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-higher-degree-orthogonal-graph-embedding-in-the-kandinsky-model-1405.2300"/></url>
<url><loc>https://scifaro.com/en/abs/covering-folded-shapes-1405.2378</loc><lastmod>2014-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-folded-shapes-1405.2378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-folded-shapes-1405.2378"/></url>
<url><loc>https://scifaro.com/en/abs/a-straightforward-preprocessing-approach-for-accelerating-convex-hull-computations-on-the-gpu-1405.3454</loc><lastmod>2014-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-straightforward-preprocessing-approach-for-accelerating-convex-hull-computations-on-the-gpu-1405.3454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-straightforward-preprocessing-approach-for-accelerating-convex-hull-computations-on-the-gpu-1405.3454"/></url>
<url><loc>https://scifaro.com/en/abs/dimension-detection-with-local-homology-1405.3534</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimension-detection-with-local-homology-1405.3534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimension-detection-with-local-homology-1405.3534"/></url>
<url><loc>https://scifaro.com/en/abs/the-higher-order-voronoi-diagram-of-line-segments-1405.3806</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-higher-order-voronoi-diagram-of-line-segments-1405.3806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-higher-order-voronoi-diagram-of-line-segments-1405.3806"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-algorithm-for-computing-straight-skeletons-1405.4691</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-algorithm-for-computing-straight-skeletons-1405.4691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-algorithm-for-computing-straight-skeletons-1405.4691"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithm-for-computing-separating-linear-forms-for-bivariate-systems-1405.4740</loc><lastmod>2014-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithm-for-computing-separating-linear-forms-for-bivariate-systems-1405.4740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithm-for-computing-separating-linear-forms-for-bivariate-systems-1405.4740"/></url>
<url><loc>https://scifaro.com/en/abs/faster-reductions-for-straight-skeletons-to-motorcycle-graphs-1405.6260</loc><lastmod>2014-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-reductions-for-straight-skeletons-to-motorcycle-graphs-1405.6260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-reductions-for-straight-skeletons-to-motorcycle-graphs-1405.6260"/></url>
<url><loc>https://scifaro.com/en/abs/a-ptas-for-the-continuous-1-5d-terrain-guarding-problem-1405.6564</loc><lastmod>2014-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ptas-for-the-continuous-1-5d-terrain-guarding-problem-1405.6564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ptas-for-the-continuous-1-5d-terrain-guarding-problem-1405.6564"/></url>
<url><loc>https://scifaro.com/en/abs/collection-of-abstracts-of-the-workshop-on-triangulations-in-geometry-and-topology-at-cg-week-2014-in-kyoto-1406.0333</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collection-of-abstracts-of-the-workshop-on-triangulations-in-geometry-and-topology-at-cg-week-2014-in-kyoto-1406.0333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collection-of-abstracts-of-the-workshop-on-triangulations-in-geometry-and-topology-at-cg-week-2014-in-kyoto-1406.0333"/></url>
<url><loc>https://scifaro.com/en/abs/peeling-potatoes-near-optimally-in-near-linear-time-1406.1368</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peeling-potatoes-near-optimally-in-near-linear-time-1406.1368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peeling-potatoes-near-optimally-in-near-linear-time-1406.1368"/></url>
<url><loc>https://scifaro.com/en/abs/smooth-parametrizations-in-dynamics-analysis-diophantine-and-computational-geometry-1406.1719</loc><lastmod>2014-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smooth-parametrizations-in-dynamics-analysis-diophantine-and-computational-geometry-1406.1719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smooth-parametrizations-in-dynamics-analysis-diophantine-and-computational-geometry-1406.1719"/></url>
<url><loc>https://scifaro.com/en/abs/point-visibility-graph-recognition-is-np-hard-1406.2428</loc><lastmod>2016-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-visibility-graph-recognition-is-np-hard-1406.2428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-visibility-graph-recognition-is-np-hard-1406.2428"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-graphs-of-segments-and-exists-mathbb-r-1406.2636</loc><lastmod>2014-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-graphs-of-segments-and-exists-mathbb-r-1406.2636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-graphs-of-segments-and-exists-mathbb-r-1406.2636"/></url>
<url><loc>https://scifaro.com/en/abs/on-largest-volume-simplices-and-sub-determinants-1406.3512</loc><lastmod>2014-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-largest-volume-simplices-and-sub-determinants-1406.3512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-largest-volume-simplices-and-sub-determinants-1406.3512"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-25-6-approximation-for-the-minimum-unit-disk-cover-problem-1406.3838</loc><lastmod>2014-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-25-6-approximation-for-the-minimum-unit-disk-cover-problem-1406.3838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-25-6-approximation-for-the-minimum-unit-disk-cover-problem-1406.3838"/></url>
<url><loc>https://scifaro.com/en/abs/the-minimum-bends-in-a-polyline-drawing-with-fixed-vertex-locations-1406.3860</loc><lastmod>2014-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-minimum-bends-in-a-polyline-drawing-with-fixed-vertex-locations-1406.3860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-minimum-bends-in-a-polyline-drawing-with-fixed-vertex-locations-1406.3860"/></url>
<url><loc>https://scifaro.com/en/abs/maintaining-contour-trees-of-dynamic-terrains-1406.4005</loc><lastmod>2014-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maintaining-contour-trees-of-dynamic-terrains-1406.4005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maintaining-contour-trees-of-dynamic-terrains-1406.4005"/></url>
<url><loc>https://scifaro.com/en/abs/scaled-pier-fractals-do-not-strictly-self-assemble-1406.4197</loc><lastmod>2014-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scaled-pier-fractals-do-not-strictly-self-assemble-1406.4197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scaled-pier-fractals-do-not-strictly-self-assemble-1406.4197"/></url>
<url><loc>https://scifaro.com/en/abs/local-doubling-dimension-of-point-sets-1406.4822</loc><lastmod>2014-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-doubling-dimension-of-point-sets-1406.4822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-doubling-dimension-of-point-sets-1406.4822"/></url>
<url><loc>https://scifaro.com/en/abs/properties-and-complexity-of-fan-planarity-1406.5299</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-and-complexity-of-fan-planarity-1406.5299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-and-complexity-of-fan-planarity-1406.5299"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-reverse-k-nearest-neighbor-problem-1406.5554</loc><lastmod>2014-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-reverse-k-nearest-neighbor-problem-1406.5554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-reverse-k-nearest-neighbor-problem-1406.5554"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-maximum-overlap-of-polygons-under-translation-1406.5778</loc><lastmod>2014-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-maximum-overlap-of-polygons-under-translation-1406.5778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-maximum-overlap-of-polygons-under-translation-1406.5778"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hulls-under-uncertainty-1406.6599</loc><lastmod>2014-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hulls-under-uncertainty-1406.6599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hulls-under-uncertainty-1406.6599"/></url>
<url><loc>https://scifaro.com/en/abs/noncooperative-algorithms-in-self-assembly-1406.6889</loc><lastmod>2014-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noncooperative-algorithms-in-self-assembly-1406.6889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noncooperative-algorithms-in-self-assembly-1406.6889"/></url>
<url><loc>https://scifaro.com/en/abs/interference-minimization-in-asymmetric-sensor-networks-1406.7753</loc><lastmod>2014-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interference-minimization-in-asymmetric-sensor-networks-1406.7753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interference-minimization-in-asymmetric-sensor-networks-1406.7753"/></url>
<url><loc>https://scifaro.com/en/abs/covering-the-boundary-of-a-simple-polygon-with-geodesic-unit-disks-1407.0614</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-the-boundary-of-a-simple-polygon-with-geodesic-unit-disks-1407.0614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-the-boundary-of-a-simple-polygon-with-geodesic-unit-disks-1407.0614"/></url>
<url><loc>https://scifaro.com/en/abs/the-convex-configurations-of-sei-shonagon-chie-no-ita-and-other-dissection-puzzles-1407.1923</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-convex-configurations-of-sei-shonagon-chie-no-ita-and-other-dissection-puzzles-1407.1923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-convex-configurations-of-sei-shonagon-chie-no-ita-and-other-dissection-puzzles-1407.1923"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-and-streaming-algorithms-for-projective-clustering-via-random-projections-1407.2063</loc><lastmod>2015-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-and-streaming-algorithms-for-projective-clustering-via-random-projections-1407.2063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-and-streaming-algorithms-for-projective-clustering-via-random-projections-1407.2063"/></url>
<url><loc>https://scifaro.com/en/abs/multicore-homology-via-mayer-vietoris-1407.2275</loc><lastmod>2014-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multicore-homology-via-mayer-vietoris-1407.2275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multicore-homology-via-mayer-vietoris-1407.2275"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-over-directed-acyclic-graphs-1407.2523</loc><lastmod>2019-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-over-directed-acyclic-graphs-1407.2523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-over-directed-acyclic-graphs-1407.2523"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-weakly-simple-polygons-1407.3340</loc><lastmod>2015-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-weakly-simple-polygons-1407.3340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-weakly-simple-polygons-1407.3340"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-properties-of-theta-theta-graphs-1407.3507</loc><lastmod>2014-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-properties-of-theta-theta-graphs-1407.3507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-properties-of-theta-theta-graphs-1407.3507"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-factor-approximation-for-multi-covering-with-disks-1407.5674</loc><lastmod>2014-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-multi-covering-with-disks-1407.5674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-multi-covering-with-disks-1407.5674"/></url>
<url><loc>https://scifaro.com/en/abs/the-offset-filtration-of-convex-objects-1407.6132</loc><lastmod>2015-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-offset-filtration-of-convex-objects-1407.6132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-offset-filtration-of-convex-objects-1407.6132"/></url>
<url><loc>https://scifaro.com/en/abs/topological-similarity-of-random-cell-complexes-and-applications-1407.6989</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-similarity-of-random-cell-complexes-and-applications-1407.6989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-similarity-of-random-cell-complexes-and-applications-1407.6989"/></url>
<url><loc>https://scifaro.com/en/abs/strict-self-assembly-of-fractals-using-multiple-hands-1407.7900</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-self-assembly-of-fractals-using-multiple-hands-1407.7900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-self-assembly-of-fractals-using-multiple-hands-1407.7900"/></url>
<url><loc>https://scifaro.com/en/abs/fence-patrolling-by-mobile-agents-with-distinct-speeds-1407.8194</loc><lastmod>2014-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fence-patrolling-by-mobile-agents-with-distinct-speeds-1407.8194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fence-patrolling-by-mobile-agents-with-distinct-speeds-1407.8194"/></url>
<url><loc>https://scifaro.com/en/abs/normal-variation-for-adaptive-feature-size-1408.0314</loc><lastmod>2014-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-variation-for-adaptive-feature-size-1408.0314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-variation-for-adaptive-feature-size-1408.0314"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-for-fr-echet-distance-on-c-packed-curves-matching-conditional-lower-bounds-1408.1340</loc><lastmod>2014-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-for-fr-echet-distance-on-c-packed-curves-matching-conditional-lower-bounds-1408.1340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-for-fr-echet-distance-on-c-packed-curves-matching-conditional-lower-bounds-1408.1340"/></url>
<url><loc>https://scifaro.com/en/abs/the-galois-complexity-of-graph-drawing-why-numerical-solutions-are-ubiquitous-for-force-directed-spectral-and-circle-packing-drawings-1408.1422</loc><lastmod>2016-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-galois-complexity-of-graph-drawing-why-numerical-solutions-are-ubiquitous-for-force-directed-spectral-and-circle-packing-drawings-1408.1422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-galois-complexity-of-graph-drawing-why-numerical-solutions-are-ubiquitous-for-force-directed-spectral-and-circle-packing-drawings-1408.1422"/></url>
<url><loc>https://scifaro.com/en/abs/dimension-reduction-techniques-for-ell-p-1-le-p-le-2-with-applications-1408.1789</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimension-reduction-techniques-for-ell-p-1-le-p-le-2-with-applications-1408.1789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimension-reduction-techniques-for-ell-p-1-le-p-le-2-with-applications-1408.1789"/></url>
<url><loc>https://scifaro.com/en/abs/a-point-counting-algorithm-for-cyclic-covers-of-the-projective-line-1408.2095</loc><lastmod>2014-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-point-counting-algorithm-for-cyclic-covers-of-the-projective-line-1408.2095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-point-counting-algorithm-for-cyclic-covers-of-the-projective-line-1408.2095"/></url>
<url><loc>https://scifaro.com/en/abs/compatible-connectivity-augmentation-of-planar-disconnected-graphs-1408.2436</loc><lastmod>2014-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatible-connectivity-augmentation-of-planar-disconnected-graphs-1408.2436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatible-connectivity-augmentation-of-planar-disconnected-graphs-1408.2436"/></url>
<url><loc>https://scifaro.com/en/abs/increasing-chord-graphs-on-point-sets-1408.2592</loc><lastmod>2014-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/increasing-chord-graphs-on-point-sets-1408.2592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/increasing-chord-graphs-on-point-sets-1408.2592"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-drawing-of-planar-graphs-with-right-angle-crossings-and-few-bends-1408.3325</loc><lastmod>2016-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-drawing-of-planar-graphs-with-right-angle-crossings-and-few-bends-1408.3325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-drawing-of-planar-graphs-with-right-angle-crossings-and-few-bends-1408.3325"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-yao-graphs-1408.4099</loc><lastmod>2014-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-yao-graphs-1408.4099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-yao-graphs-1408.4099"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-circle-packings-for-planar-graphs-1408.4902</loc><lastmod>2014-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-circle-packings-for-planar-graphs-1408.4902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-circle-packings-for-planar-graphs-1408.4902"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-four-directional-paths-on-convex-point-sets-1408.4933</loc><lastmod>2014-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-four-directional-paths-on-convex-point-sets-1408.4933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-four-directional-paths-on-convex-point-sets-1408.4933"/></url>
<url><loc>https://scifaro.com/en/abs/gradient-of-the-objective-function-for-an-anisotropic-centroidal-voronoi-tessellation-cvt-a-revised-detailed-derivation-1408.5622</loc><lastmod>2014-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gradient-of-the-objective-function-for-an-anisotropic-centroidal-voronoi-tessellation-cvt-a-revised-detailed-derivation-1408.5622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gradient-of-the-objective-function-for-an-anisotropic-centroidal-voronoi-tessellation-cvt-a-revised-detailed-derivation-1408.5622"/></url>
<url><loc>https://scifaro.com/en/abs/planar-induced-subgraphs-of-sparse-graphs-1408.5939</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-induced-subgraphs-of-sparse-graphs-1408.5939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-induced-subgraphs-of-sparse-graphs-1408.5939"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-embeddability-of-two-partitions-1408.6019</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-embeddability-of-two-partitions-1408.6019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-embeddability-of-two-partitions-1408.6019"/></url>
<url><loc>https://scifaro.com/en/abs/robust-geometry-estimation-using-the-generalized-voronoi-covariance-measure-1408.6210</loc><lastmod>2015-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-geometry-estimation-using-the-generalized-voronoi-covariance-measure-1408.6210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-geometry-estimation-using-the-generalized-voronoi-covariance-measure-1408.6210"/></url>
<url><loc>https://scifaro.com/en/abs/flat-foldings-of-plane-graphs-with-prescribed-angles-and-edge-lengths-1408.6771</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flat-foldings-of-plane-graphs-with-prescribed-angles-and-edge-lengths-1408.6771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flat-foldings-of-plane-graphs-with-prescribed-angles-and-edge-lengths-1408.6771"/></url>
<url><loc>https://scifaro.com/en/abs/fast-disk-conformal-parameterization-of-simply-connected-open-surfaces-1408.6974</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-disk-conformal-parameterization-of-simply-connected-open-surfaces-1408.6974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-disk-conformal-parameterization-of-simply-connected-open-surfaces-1408.6974"/></url>
<url><loc>https://scifaro.com/en/abs/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-1409.0315</loc><lastmod>2014-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-1409.0315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-self-approaching-and-increasing-chord-drawings-of-3-connected-planar-graphs-1409.0315"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-recognition-of-fan-planar-and-maximal-outer-fan-planar-graphs-1409.0461</loc><lastmod>2014-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-recognition-of-fan-planar-and-maximal-outer-fan-planar-graphs-1409.0461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-recognition-of-fan-planar-and-maximal-outer-fan-planar-graphs-1409.0461"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-graphs-within-restricted-area-1409.0499</loc><lastmod>2014-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-graphs-within-restricted-area-1409.0499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-graphs-within-restricted-area-1409.0499"/></url>
<url><loc>https://scifaro.com/en/abs/a-danzer-set-for-axis-parallel-boxes-1409.0926</loc><lastmod>2015-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-danzer-set-for-axis-parallel-boxes-1409.0926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-danzer-set-for-axis-parallel-boxes-1409.0926"/></url>
<url><loc>https://scifaro.com/en/abs/a-variant-of-the-hadwiger-debrunner-p-q-problem-in-the-plane-1409.1194</loc><lastmod>2015-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-variant-of-the-hadwiger-debrunner-p-q-problem-in-the-plane-1409.1194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-variant-of-the-hadwiger-debrunner-p-q-problem-in-the-plane-1409.1194"/></url>
<url><loc>https://scifaro.com/en/abs/intermittent-map-matching-with-the-discrete-fr-echet-distance-1409.2456</loc><lastmod>2016-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intermittent-map-matching-with-the-discrete-fr-echet-distance-1409.2456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intermittent-map-matching-with-the-discrete-fr-echet-distance-1409.2456"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-chain-pair-simplification-problem-1409.2457</loc><lastmod>2014-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-chain-pair-simplification-problem-1409.2457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-chain-pair-simplification-problem-1409.2457"/></url>
<url><loc>https://scifaro.com/en/abs/planar-embeddings-with-small-and-uniform-faces-1409.4299</loc><lastmod>2014-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-embeddings-with-small-and-uniform-faces-1409.4299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-embeddings-with-small-and-uniform-faces-1409.4299"/></url>
<url><loc>https://scifaro.com/en/abs/a-bound-on-a-convexity-measure-for-point-sets-1409.4344</loc><lastmod>2014-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bound-on-a-convexity-measure-for-point-sets-1409.4344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bound-on-a-convexity-measure-for-point-sets-1409.4344"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-rectangle-covering-with-congruent-disks-1409.4545</loc><lastmod>2016-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-rectangle-covering-with-congruent-disks-1409.4545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-rectangle-covering-with-congruent-disks-1409.4545"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-of-closed-polygonal-curves-in-frechet-metric-1409.4613</loc><lastmod>2014-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-of-closed-polygonal-curves-in-frechet-metric-1409.4613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-of-closed-polygonal-curves-in-frechet-metric-1409.4613"/></url>
<url><loc>https://scifaro.com/en/abs/approximability-of-guarding-weak-visibility-polygons-1409.4621</loc><lastmod>2016-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximability-of-guarding-weak-visibility-polygons-1409.4621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximability-of-guarding-weak-visibility-polygons-1409.4621"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-triangular-distance-delaunay-graphs-graph-theoretical-properties-1409.5466</loc><lastmod>2014-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-triangular-distance-delaunay-graphs-graph-theoretical-properties-1409.5466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-triangular-distance-delaunay-graphs-graph-theoretical-properties-1409.5466"/></url>
<url><loc>https://scifaro.com/en/abs/1-string-cz-representation-of-planar-graphs-1409.5816</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-string-cz-representation-of-planar-graphs-1409.5816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-string-cz-representation-of-planar-graphs-1409.5816"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-local-routing-on-delaunay-triangulations-defined-by-empty-equilateral-triangles-1409.6397</loc><lastmod>2014-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-local-routing-on-delaunay-triangulations-defined-by-empty-equilateral-triangles-1409.6397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-local-routing-on-delaunay-triangulations-defined-by-empty-equilateral-triangles-1409.6397"/></url>
<url><loc>https://scifaro.com/en/abs/net-and-prune-a-linear-time-algorithm-for-euclidean-distance-problems-1409.7425</loc><lastmod>2026-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/net-and-prune-a-linear-time-algorithm-for-euclidean-distance-problems-1409.7425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/net-and-prune-a-linear-time-algorithm-for-euclidean-distance-problems-1409.7425"/></url>
<url><loc>https://scifaro.com/en/abs/10-gabriel-graphs-are-hamiltonian-1410.0309</loc><lastmod>2015-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/10-gabriel-graphs-are-hamiltonian-1410.0309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/10-gabriel-graphs-are-hamiltonian-1410.0309"/></url>
<url><loc>https://scifaro.com/en/abs/matching-in-gabriel-graphs-1410.0540</loc><lastmod>2014-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-in-gabriel-graphs-1410.0540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-in-gabriel-graphs-1410.0540"/></url>
<url><loc>https://scifaro.com/en/abs/the-unreasonable-success-of-local-search-geometric-optimization-1410.0553</loc><lastmod>2015-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-unreasonable-success-of-local-search-geometric-optimization-1410.0553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-unreasonable-success-of-local-search-geometric-optimization-1410.0553"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-small-area-planar-graph-drawing-1410.1006</loc><lastmod>2014-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-small-area-planar-graph-drawing-1410.1006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-small-area-planar-graph-drawing-1410.1006"/></url>
<url><loc>https://scifaro.com/en/abs/further-results-on-the-hyperbolic-voronoi-diagrams-1410.1036</loc><lastmod>2014-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-results-on-the-hyperbolic-voronoi-diagrams-1410.1036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-results-on-the-hyperbolic-voronoi-diagrams-1410.1036"/></url>
<url><loc>https://scifaro.com/en/abs/fast-approximation-and-randomized-algorithms-for-diameter-1410.2195</loc><lastmod>2014-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-approximation-and-randomized-algorithms-for-diameter-1410.2195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-approximation-and-randomized-algorithms-for-diameter-1410.2195"/></url>
<url><loc>https://scifaro.com/en/abs/computing-minimum-area-homologies-1410.2320</loc><lastmod>2014-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-minimum-area-homologies-1410.2320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-minimum-area-homologies-1410.2320"/></url>
<url><loc>https://scifaro.com/en/abs/toward-the-hanani-tutte-theorem-for-clustered-graphs-1410.3022</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-the-hanani-tutte-theorem-for-clustered-graphs-1410.3022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-the-hanani-tutte-theorem-for-clustered-graphs-1410.3022"/></url>
<url><loc>https://scifaro.com/en/abs/epsilon-nets-for-halfspaces-revisited-1410.3154</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epsilon-nets-for-halfspaces-revisited-1410.3154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epsilon-nets-for-halfspaces-revisited-1410.3154"/></url>
<url><loc>https://scifaro.com/en/abs/multi-scale-local-shape-analysis-and-feature-selection-in-machine-learning-applications-1410.3169</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-scale-local-shape-analysis-and-feature-selection-in-machine-learning-applications-1410.3169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-scale-local-shape-analysis-and-feature-selection-in-machine-learning-applications-1410.3169"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-triangle-algorithms-for-convex-hull-membership-1410.3564</loc><lastmod>2014-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-triangle-algorithms-for-convex-hull-membership-1410.3564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-triangle-algorithms-for-convex-hull-membership-1410.3564"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-on-the-k-modem-illumination-problem-1410.4099</loc><lastmod>2019-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-on-the-k-modem-illumination-problem-1410.4099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-on-the-k-modem-illumination-problem-1410.4099"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-randomized-incremental-construction-for-guaranteed-logarithmic-planar-point-location-1410.5602</loc><lastmod>2014-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-randomized-incremental-construction-for-guaranteed-logarithmic-planar-point-location-1410.5602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-randomized-incremental-construction-for-guaranteed-logarithmic-planar-point-location-1410.5602"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-art-gallery-illumination-1410.5952</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-art-gallery-illumination-1410.5952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-art-gallery-illumination-1410.5952"/></url>
<url><loc>https://scifaro.com/en/abs/filling-a-hole-in-a-crease-pattern-isometric-mapping-from-prescribed-boundary-folding-1410.6520</loc><lastmod>2014-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filling-a-hole-in-a-crease-pattern-isometric-mapping-from-prescribed-boundary-folding-1410.6520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filling-a-hole-in-a-crease-pattern-isometric-mapping-from-prescribed-boundary-folding-1410.6520"/></url>
<url><loc>https://scifaro.com/en/abs/only-distances-are-required-to-reconstruct-submanifolds-1410.7012</loc><lastmod>2017-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/only-distances-are-required-to-reconstruct-submanifolds-1410.7012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/only-distances-are-required-to-reconstruct-submanifolds-1410.7012"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-partially-embedded-and-simultaneously-planar-graphs-1410.8205</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-partially-embedded-and-simultaneously-planar-graphs-1410.8205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-partially-embedded-and-simultaneously-planar-graphs-1410.8205"/></url>
<url><loc>https://scifaro.com/en/abs/engineering-art-galleries-1410.8720</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/engineering-art-galleries-1410.8720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/engineering-art-galleries-1410.8720"/></url>
<url><loc>https://scifaro.com/en/abs/low-rank-matrix-approximation-in-linear-time-1410.8802</loc><lastmod>2014-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-rank-matrix-approximation-in-linear-time-1410.8802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-rank-matrix-approximation-in-linear-time-1410.8802"/></url>
<url><loc>https://scifaro.com/en/abs/a-qptas-for-the-base-of-the-number-of-triangulations-of-a-planar-point-set-1411.0544</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-qptas-for-the-base-of-the-number-of-triangulations-of-a-planar-point-set-1411.0544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-qptas-for-the-base-of-the-number-of-triangulations-of-a-planar-point-set-1411.0544"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-program-size-complexity-for-self-assembly-at-temperature-1-in-3d-1411.1122</loc><lastmod>2014-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-program-size-complexity-for-self-assembly-at-temperature-1-in-3d-1411.1122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-program-size-complexity-for-self-assembly-at-temperature-1-in-3d-1411.1122"/></url>
<url><loc>https://scifaro.com/en/abs/on-covering-a-solid-sphere-with-concentric-spheres-in-mathbb-z-3-1411.1395</loc><lastmod>2014-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-covering-a-solid-sphere-with-concentric-spheres-in-mathbb-z-3-1411.1395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-covering-a-solid-sphere-with-concentric-spheres-in-mathbb-z-3-1411.1395"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-k-flat-nearest-neighbor-search-1411.1519</loc><lastmod>2014-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-k-flat-nearest-neighbor-search-1411.1519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-k-flat-nearest-neighbor-search-1411.1519"/></url>
<url><loc>https://scifaro.com/en/abs/the-edit-distance-for-reeb-graphs-of-surfaces-1411.1544</loc><lastmod>2014-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-edit-distance-for-reeb-graphs-of-surfaces-1411.1544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-edit-distance-for-reeb-graphs-of-surfaces-1411.1544"/></url>
<url><loc>https://scifaro.com/en/abs/on-chord-and-sagitta-in-mathbb-z-2-an-analysis-towards-fast-and-robust-circular-arc-detection-1411.1668</loc><lastmod>2014-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-chord-and-sagitta-in-mathbb-z-2-an-analysis-towards-fast-and-robust-circular-arc-detection-1411.1668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-chord-and-sagitta-in-mathbb-z-2-an-analysis-towards-fast-and-robust-circular-arc-detection-1411.1668"/></url>
<url><loc>https://scifaro.com/en/abs/independent-sets-and-hitting-sets-of-bicolored-rectangular-families-1411.2311</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independent-sets-and-hitting-sets-of-bicolored-rectangular-families-1411.2311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independent-sets-and-hitting-sets-of-bicolored-rectangular-families-1411.2311"/></url>
<url><loc>https://scifaro.com/en/abs/avoiding-the-global-sort-a-faster-contour-tree-algorithm-1411.2689</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoiding-the-global-sort-a-faster-contour-tree-algorithm-1411.2689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoiding-the-global-sort-a-faster-contour-tree-algorithm-1411.2689"/></url>
<url><loc>https://scifaro.com/en/abs/tiling-rectangles-with-holey-polyominoes-1411.2699</loc><lastmod>2015-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tiling-rectangles-with-holey-polyominoes-1411.2699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tiling-rectangles-with-holey-polyominoes-1411.2699"/></url>
<url><loc>https://scifaro.com/en/abs/an-expected-linear-time-algorithm-for-the-farthest-segment-voronoi-diagram-1411.2816</loc><lastmod>2017-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-expected-linear-time-algorithm-for-the-farthest-segment-voronoi-diagram-1411.2816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-expected-linear-time-algorithm-for-the-farthest-segment-voronoi-diagram-1411.2816"/></url>
<url><loc>https://scifaro.com/en/abs/scaled-tree-fractals-do-not-strictly-self-assemble-1411.3044</loc><lastmod>2014-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scaled-tree-fractals-do-not-strictly-self-assemble-1411.3044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scaled-tree-fractals-do-not-strictly-self-assemble-1411.3044"/></url>
<url><loc>https://scifaro.com/en/abs/numeric-invariants-from-multidimensional-persistence-1411.4022</loc><lastmod>2015-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/numeric-invariants-from-multidimensional-persistence-1411.4022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/numeric-invariants-from-multidimensional-persistence-1411.4022"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-tracking-of-representative-cycles-in-regular-and-zigzag-persistent-homology-1411.5442</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-tracking-of-representative-cycles-in-regular-and-zigzag-persistent-homology-1411.5442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-tracking-of-representative-cycles-in-regular-and-zigzag-persistent-homology-1411.5442"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-beta-skeletons-1411.5455</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-beta-skeletons-1411.5455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-beta-skeletons-1411.5455"/></url>
<url><loc>https://scifaro.com/en/abs/beta-skeletons-for-a-set-of-line-segments-in-r-2-1411.5457</loc><lastmod>2015-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beta-skeletons-for-a-set-of-line-segments-in-r-2-1411.5457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beta-skeletons-for-a-set-of-line-segments-in-r-2-1411.5457"/></url>
<url><loc>https://scifaro.com/en/abs/planar-beta-skeletons-via-point-location-in-monotone-subdivisions-of-subset-of-lunes-1411.5459</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-beta-skeletons-via-point-location-in-monotone-subdivisions-of-subset-of-lunes-1411.5459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-beta-skeletons-via-point-location-in-monotone-subdivisions-of-subset-of-lunes-1411.5459"/></url>
<url><loc>https://scifaro.com/en/abs/multidimensional-beta-skeletons-in-l-1-and-l-infty-metric-1411.5472</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multidimensional-beta-skeletons-in-l-1-and-l-infty-metric-1411.5472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multidimensional-beta-skeletons-in-l-1-and-l-infty-metric-1411.5472"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-planar-graph-drawings-with-unidirectional-moves-1411.6185</loc><lastmod>2014-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-planar-graph-drawings-with-unidirectional-moves-1411.6185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-planar-graph-drawings-with-unidirectional-moves-1411.6185"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-schnyder-drawings-of-planar-triangulations-1411.6186</loc><lastmod>2014-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-schnyder-drawings-of-planar-triangulations-1411.6186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-schnyder-drawings-of-planar-triangulations-1411.6186"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-overlap-implies-runaway-growth-in-hierarchical-tile-systems-1411.6672</loc><lastmod>2014-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-overlap-implies-runaway-growth-in-hierarchical-tile-systems-1411.6672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-overlap-implies-runaway-growth-in-hierarchical-tile-systems-1411.6672"/></url>
<url><loc>https://scifaro.com/en/abs/discretization-of-planar-geometric-cover-problems-1411.6810</loc><lastmod>2014-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discretization-of-planar-geometric-cover-problems-1411.6810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discretization-of-planar-geometric-cover-problems-1411.6810"/></url>
<url><loc>https://scifaro.com/en/abs/all-pairs-minimum-cuts-in-near-linear-time-for-surface-embedded-graphs-1411.7055</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-pairs-minimum-cuts-in-near-linear-time-for-surface-embedded-graphs-1411.7055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-pairs-minimum-cuts-in-near-linear-time-for-surface-embedded-graphs-1411.7055"/></url>
<url><loc>https://scifaro.com/en/abs/partial-matching-and-hausdorff-rms-distance-under-translation-combinatorics-and-algorithms-1411.7273</loc><lastmod>2014-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-matching-and-hausdorff-rms-distance-under-translation-combinatorics-and-algorithms-1411.7273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-matching-and-hausdorff-rms-distance-under-translation-combinatorics-and-algorithms-1411.7273"/></url>
<url><loc>https://scifaro.com/en/abs/1-string-b-2-vpg-representation-of-planar-graphs-1411.7277</loc><lastmod>2015-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-string-b-2-vpg-representation-of-planar-graphs-1411.7277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-string-b-2-vpg-representation-of-planar-graphs-1411.7277"/></url>
<url><loc>https://scifaro.com/en/abs/coordinate-free-quantification-of-coverage-in-dynamic-sensor-networks-1411.7337</loc><lastmod>2014-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coordinate-free-quantification-of-coverage-in-dynamic-sensor-networks-1411.7337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coordinate-free-quantification-of-coverage-in-dynamic-sensor-networks-1411.7337"/></url>
<url><loc>https://scifaro.com/en/abs/on-low-discrepancy-samplings-in-product-spaces-of-motion-groups-1411.7753</loc><lastmod>2014-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-low-discrepancy-samplings-in-product-spaces-of-motion-groups-1411.7753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-low-discrepancy-samplings-in-product-spaces-of-motion-groups-1411.7753"/></url>
<url><loc>https://scifaro.com/en/abs/uniformity-of-point-samples-in-metric-spaces-using-gap-ratio-1411.7819</loc><lastmod>2015-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniformity-of-point-samples-in-metric-spaces-using-gap-ratio-1411.7819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniformity-of-point-samples-in-metric-spaces-using-gap-ratio-1411.7819"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-rounding-for-the-largest-simplex-problem-1412.0036</loc><lastmod>2015-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-rounding-for-the-largest-simplex-problem-1412.0036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-rounding-for-the-largest-simplex-problem-1412.0036"/></url>
<url><loc>https://scifaro.com/en/abs/topology-preserving-representations-of-compact-2d-manifolds-by-digital-2-surfaces-compressed-digital-models-and-digital-weights-of-compact-2d-manifolds-classification-of-closed-surfaces-by-digital-tools-1412.0143</loc><lastmod>2014-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-preserving-representations-of-compact-2d-manifolds-by-digital-2-surfaces-compressed-digital-models-and-digital-weights-of-compact-2d-manifolds-classification-of-closed-surfaces-by-digital-tools-1412.0143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-preserving-representations-of-compact-2d-manifolds-by-digital-2-surfaces-compressed-digital-models-and-digital-weights-of-compact-2d-manifolds-classification-of-closed-surfaces-by-digital-tools-1412.0143"/></url>
<url><loc>https://scifaro.com/en/abs/competitive-local-routing-with-constraints-1412.0760</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/competitive-local-routing-with-constraints-1412.0760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/competitive-local-routing-with-constraints-1412.0760"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-path-in-a-polygon-using-sublinear-space-1412.0779</loc><lastmod>2015-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-path-in-a-polygon-using-sublinear-space-1412.0779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-path-in-a-polygon-using-sublinear-space-1412.0779"/></url>
<url><loc>https://scifaro.com/en/abs/batched-point-location-in-sinr-diagrams-via-algebraic-tools-1412.0962</loc><lastmod>2017-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/batched-point-location-in-sinr-diagrams-via-algebraic-tools-1412.0962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/batched-point-location-in-sinr-diagrams-via-algebraic-tools-1412.0962"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-algorithms-for-faster-computational-geometry-1412.1001</loc><lastmod>2016-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-algorithms-for-faster-computational-geometry-1412.1001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-algorithms-for-faster-computational-geometry-1412.1001"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hull-for-probabilistic-points-1412.1039</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hull-for-probabilistic-points-1412.1039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hull-for-probabilistic-points-1412.1039"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-redundancy-detection-1412.1241</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-redundancy-detection-1412.1241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-redundancy-detection-1412.1241"/></url>
<url><loc>https://scifaro.com/en/abs/space-exploration-via-proximity-search-1412.1398</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-exploration-via-proximity-search-1412.1398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-exploration-via-proximity-search-1412.1398"/></url>
<url><loc>https://scifaro.com/en/abs/throat-finding-algorithms-based-on-throat-types-1412.1401</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/throat-finding-algorithms-based-on-throat-types-1412.1401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/throat-finding-algorithms-based-on-throat-types-1412.1401"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-to-decide-tightness-1412.1547</loc><lastmod>2018-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-to-decide-tightness-1412.1547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-to-decide-tightness-1412.1547"/></url>
<url><loc>https://scifaro.com/en/abs/topological-analysis-of-scalar-fields-with-outliers-1412.1680</loc><lastmod>2015-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-analysis-of-scalar-fields-with-outliers-1412.1680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-analysis-of-scalar-fields-with-outliers-1412.1680"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-embeddings-with-slack-and-high-dimensional-approximate-nearest-neighbor-1412.1683</loc><lastmod>2016-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-embeddings-with-slack-and-high-dimensional-approximate-nearest-neighbor-1412.1683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-embeddings-with-slack-and-high-dimensional-approximate-nearest-neighbor-1412.1683"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-aggregate-movements-for-interval-coverage-1412.2300</loc><lastmod>2014-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-aggregate-movements-for-interval-coverage-1412.2300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-aggregate-movements-for-interval-coverage-1412.2300"/></url>
<url><loc>https://scifaro.com/en/abs/minkowski-sum-of-hv-polytopes-in-rn-1412.2562</loc><lastmod>2014-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minkowski-sum-of-hv-polytopes-in-rn-1412.2562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minkowski-sum-of-hv-polytopes-in-rn-1412.2562"/></url>
<url><loc>https://scifaro.com/en/abs/minkowski-sum-of-polytopes-defined-by-their-vertices-1412.2564</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minkowski-sum-of-polytopes-defined-by-their-vertices-1412.2564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minkowski-sum-of-polytopes-defined-by-their-vertices-1412.2564"/></url>
<url><loc>https://scifaro.com/en/abs/numeric-certified-algorithm-for-the-topology-of-resultant-and-discriminant-curves-1412.3290</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/numeric-certified-algorithm-for-the-topology-of-resultant-and-discriminant-curves-1412.3290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/numeric-certified-algorithm-for-the-topology-of-resultant-and-discriminant-curves-1412.3290"/></url>
<url><loc>https://scifaro.com/en/abs/computational-aspects-of-the-colorful-carath-eodory-theorem-1412.3347</loc><lastmod>2018-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-aspects-of-the-colorful-carath-eodory-theorem-1412.3347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-aspects-of-the-colorful-carath-eodory-theorem-1412.3347"/></url>
<url><loc>https://scifaro.com/en/abs/the-rank-invariant-stability-via-interleavings-1412.3374</loc><lastmod>2014-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rank-invariant-stability-via-interleavings-1412.3374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rank-invariant-stability-via-interleavings-1412.3374"/></url>
<url><loc>https://scifaro.com/en/abs/almost-tight-bounds-for-conflict-free-chromatic-guarding-of-orthogonal-galleries-1412.3984</loc><lastmod>2014-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-tight-bounds-for-conflict-free-chromatic-guarding-of-orthogonal-galleries-1412.3984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-tight-bounds-for-conflict-free-chromatic-guarding-of-orthogonal-galleries-1412.3984"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-edge-skeleton-computation-for-polytopes-defined-by-oracles-1412.3987</loc><lastmod>2021-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-edge-skeleton-computation-for-polytopes-defined-by-oracles-1412.3987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-edge-skeleton-computation-for-polytopes-defined-by-oracles-1412.3987"/></url>
<url><loc>https://scifaro.com/en/abs/spiral-toolpaths-for-high-speed-machining-of-2d-pockets-with-or-without-islands-1412.5034</loc><lastmod>2015-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spiral-toolpaths-for-high-speed-machining-of-2d-pockets-with-or-without-islands-1412.5034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spiral-toolpaths-for-high-speed-machining-of-2d-pockets-with-or-without-islands-1412.5034"/></url>
<url><loc>https://scifaro.com/en/abs/area-and-perimeter-of-the-convex-hull-of-stochastic-points-1412.5153</loc><lastmod>2015-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/area-and-perimeter-of-the-convex-hull-of-stochastic-points-1412.5153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/area-and-perimeter-of-the-convex-hull-of-stochastic-points-1412.5153"/></url>
<url><loc>https://scifaro.com/en/abs/shallow-packings-in-geometry-1412.5215</loc><lastmod>2014-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shallow-packings-in-geometry-1412.5215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shallow-packings-in-geometry-1412.5215"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-k-semi-yao-graph-and-its-applications-1412.5697</loc><lastmod>2014-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-k-semi-yao-graph-and-its-applications-1412.5697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-k-semi-yao-graph-and-its-applications-1412.5697"/></url>
<url><loc>https://scifaro.com/en/abs/a-fire-fighter-s-problem-1412.6065</loc><lastmod>2016-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fire-fighter-s-problem-1412.6065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fire-fighter-s-problem-1412.6065"/></url>
<url><loc>https://scifaro.com/en/abs/planar-lower-envelope-of-monotone-polygonal-chains-1412.6619</loc><lastmod>2015-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-lower-envelope-of-monotone-polygonal-chains-1412.6619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-lower-envelope-of-monotone-polygonal-chains-1412.6619"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-conformal-deformation-algorithm-and-experiments-1412.6892</loc><lastmod>2014-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-conformal-deformation-algorithm-and-experiments-1412.6892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-conformal-deformation-algorithm-and-experiments-1412.6892"/></url>
<url><loc>https://scifaro.com/en/abs/a-persistence-landscapes-toolbox-for-topological-statistics-1501.00179</loc><lastmod>2017-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-persistence-landscapes-toolbox-for-topological-statistics-1501.00179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-persistence-landscapes-toolbox-for-topological-statistics-1501.00179"/></url>
<url><loc>https://scifaro.com/en/abs/contact-representations-of-graphs-in-3d-1501.00304</loc><lastmod>2015-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contact-representations-of-graphs-in-3d-1501.00304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contact-representations-of-graphs-in-3d-1501.00304"/></url>
<url><loc>https://scifaro.com/en/abs/contact-representations-of-sparse-planar-graphs-1501.00318</loc><lastmod>2015-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contact-representations-of-sparse-planar-graphs-1501.00318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contact-representations-of-sparse-planar-graphs-1501.00318"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-an-approximate-weighted-shortest-path-1501.00340</loc><lastmod>2016-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-an-approximate-weighted-shortest-path-1501.00340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-an-approximate-weighted-shortest-path-1501.00340"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-geodesic-center-of-a-simple-polygon-1501.00561</loc><lastmod>2015-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-geodesic-center-of-a-simple-polygon-1501.00561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-geodesic-center-of-a-simple-polygon-1501.00561"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-polynomial-expansion-and-low-density-graphs-1501.00721</loc><lastmod>2016-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-polynomial-expansion-and-low-density-graphs-1501.00721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-polynomial-expansion-and-low-density-graphs-1501.00721"/></url>
<url><loc>https://scifaro.com/en/abs/two-level-rectilinear-steiner-trees-1501.00933</loc><lastmod>2015-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-level-rectilinear-steiner-trees-1501.00933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-level-rectilinear-steiner-trees-1501.00933"/></url>
<url><loc>https://scifaro.com/en/abs/derivative-coordinates-for-analytic-tree-fractals-and-fractal-engineering-1501.01675</loc><lastmod>2015-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derivative-coordinates-for-analytic-tree-fractals-and-fractal-engineering-1501.01675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derivative-coordinates-for-analytic-tree-fractals-and-fractal-engineering-1501.01675"/></url>
<url><loc>https://scifaro.com/en/abs/upper-and-lower-bounds-for-competitive-online-routing-on-delaunay-triangulations-1501.01783</loc><lastmod>2015-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-and-lower-bounds-for-competitive-online-routing-on-delaunay-triangulations-1501.01783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-and-lower-bounds-for-competitive-online-routing-on-delaunay-triangulations-1501.01783"/></url>
<url><loc>https://scifaro.com/en/abs/central-trajectories-1501.01822</loc><lastmod>2015-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/central-trajectories-1501.01822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/central-trajectories-1501.01822"/></url>
<url><loc>https://scifaro.com/en/abs/range-queries-on-uncertain-data-1501.02309</loc><lastmod>2015-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-queries-on-uncertain-data-1501.02309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-queries-on-uncertain-data-1501.02309"/></url>
<url><loc>https://scifaro.com/en/abs/tighter-estimates-for-epsilon-nets-for-disks-1501.03246</loc><lastmod>2015-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tighter-estimates-for-epsilon-nets-for-disks-1501.03246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tighter-estimates-for-epsilon-nets-for-disks-1501.03246"/></url>
<url><loc>https://scifaro.com/en/abs/bits-tree-an-efficient-data-structure-for-segment-storage-and-query-processing-1501.03435</loc><lastmod>2015-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bits-tree-an-efficient-data-structure-for-segment-storage-and-query-processing-1501.03435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bits-tree-an-efficient-data-structure-for-segment-storage-and-query-processing-1501.03435"/></url>
<url><loc>https://scifaro.com/en/abs/packing-plane-perfect-matchings-into-a-point-set-1501.03686</loc><lastmod>2015-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-plane-perfect-matchings-into-a-point-set-1501.03686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-plane-perfect-matchings-into-a-point-set-1501.03686"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-algorithm-for-the-discrete-fr-echet-distance-under-translation-1501.03724</loc><lastmod>2015-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-algorithm-for-the-discrete-fr-echet-distance-under-translation-1501.03724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-algorithm-for-the-discrete-fr-echet-distance-under-translation-1501.03724"/></url>
<url><loc>https://scifaro.com/en/abs/size-optimal-steiner-points-for-delaunay-refinement-on-curved-surfaces-1501.04002</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-optimal-steiner-points-for-delaunay-refinement-on-curved-surfaces-1501.04002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-optimal-steiner-points-for-delaunay-refinement-on-curved-surfaces-1501.04002"/></url>
<url><loc>https://scifaro.com/en/abs/categorified-reeb-graphs-1501.04147</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorified-reeb-graphs-1501.04147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorified-reeb-graphs-1501.04147"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-implementation-of-quickhull-algorithm-on-the-gpu-1501.04706</loc><lastmod>2018-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-implementation-of-quickhull-algorithm-on-the-gpu-1501.04706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-implementation-of-quickhull-algorithm-on-the-gpu-1501.04706"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-voronoi-games-and-epsilon-nets-in-two-and-three-dimensions-1501.04843</loc><lastmod>2015-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-voronoi-games-and-epsilon-nets-in-two-and-three-dimensions-1501.04843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-voronoi-games-and-epsilon-nets-in-two-and-three-dimensions-1501.04843"/></url>
<url><loc>https://scifaro.com/en/abs/mixed-map-labeling-1501.06813</loc><lastmod>2015-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixed-map-labeling-1501.06813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixed-map-labeling-1501.06813"/></url>
<url><loc>https://scifaro.com/en/abs/label-placement-in-road-maps-1501.07188</loc><lastmod>2015-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/label-placement-in-road-maps-1501.07188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/label-placement-in-road-maps-1501.07188"/></url>
<url><loc>https://scifaro.com/en/abs/the-number-of-holes-in-the-union-of-translates-of-a-convex-set-in-three-dimensions-1502.01779</loc><lastmod>2019-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-number-of-holes-in-the-union-of-translates-of-a-convex-set-in-three-dimensions-1502.01779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-number-of-holes-in-the-union-of-translates-of-a-convex-set-in-three-dimensions-1502.01779"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-approach-for-the-upper-bound-theorem-for-minkowski-sums-of-convex-polytopes-1502.02265</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-approach-for-the-upper-bound-theorem-for-minkowski-sums-of-convex-polytopes-1502.02265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-approach-for-the-upper-bound-theorem-for-minkowski-sums-of-convex-polytopes-1502.02265"/></url>
<url><loc>https://scifaro.com/en/abs/ideal-tree-drawings-of-approximately-optimal-width-and-small-height-1502.02753</loc><lastmod>2016-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ideal-tree-drawings-of-approximately-optimal-width-and-small-height-1502.02753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ideal-tree-drawings-of-approximately-optimal-width-and-small-height-1502.02753"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-of-curved-creases-and-rulings-design-and-analysis-of-lens-tessellations-1502.03191</loc><lastmod>2015-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-of-curved-creases-and-rulings-design-and-analysis-of-lens-tessellations-1502.03191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-of-curved-creases-and-rulings-design-and-analysis-of-lens-tessellations-1502.03191"/></url>
<url><loc>https://scifaro.com/en/abs/semi-dynamic-connectivity-in-the-plane-1502.03690</loc><lastmod>2015-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-dynamic-connectivity-in-the-plane-1502.03690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-dynamic-connectivity-in-the-plane-1502.03690"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-factor-approximation-for-orthogonal-order-preserving-layout-adjustment-1502.03847</loc><lastmod>2015-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-orthogonal-order-preserving-layout-adjustment-1502.03847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-orthogonal-order-preserving-layout-adjustment-1502.03847"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-spanning-cycles-in-bichromatic-point-sets-1502.04328</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-spanning-cycles-in-bichromatic-point-sets-1502.04328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-spanning-cycles-in-bichromatic-point-sets-1502.04328"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-cost-range-assignment-problem-1502.04533</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-cost-range-assignment-problem-1502.04533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-cost-range-assignment-problem-1502.04533"/></url>
<url><loc>https://scifaro.com/en/abs/a-ptas-for-the-weighted-unit-disk-cover-problem-1502.04918</loc><lastmod>2016-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ptas-for-the-weighted-unit-disk-cover-problem-1502.04918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ptas-for-the-weighted-unit-disk-cover-problem-1502.04918"/></url>
<url><loc>https://scifaro.com/en/abs/point-sets-with-many-non-crossing-matchings-1502.04925</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-sets-with-many-non-crossing-matchings-1502.04925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-sets-with-many-non-crossing-matchings-1502.04925"/></url>
<url><loc>https://scifaro.com/en/abs/the-number-of-non-crossing-perfect-plane-matchings-is-minimized-almost-only-by-point-sets-in-convex-position-1502.05332</loc><lastmod>2015-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-number-of-non-crossing-perfect-plane-matchings-is-minimized-almost-only-by-point-sets-in-convex-position-1502.05332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-number-of-non-crossing-perfect-plane-matchings-is-minimized-almost-only-by-point-sets-in-convex-position-1502.05332"/></url>
<url><loc>https://scifaro.com/en/abs/it-s-a-tough-nanoworld-in-tile-assembly-cooperation-is-not-strictly-more-powerful-than-competition-1502.05558</loc><lastmod>2015-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-s-a-tough-nanoworld-in-tile-assembly-cooperation-is-not-strictly-more-powerful-than-competition-1502.05558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-s-a-tough-nanoworld-in-tile-assembly-cooperation-is-not-strictly-more-powerful-than-competition-1502.05558"/></url>
<url><loc>https://scifaro.com/en/abs/new-separation-theorems-and-sub-exponential-time-algorithms-for-packing-and-piercing-of-fat-objects-1502.06176</loc><lastmod>2015-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-separation-theorems-and-sub-exponential-time-algorithms-for-packing-and-piercing-of-fat-objects-1502.06176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-separation-theorems-and-sub-exponential-time-algorithms-for-packing-and-piercing-of-fat-objects-1502.06176"/></url>
<url><loc>https://scifaro.com/en/abs/exact-minkowski-sums-of-polygons-with-holes-1502.06195</loc><lastmod>2015-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-minkowski-sums-of-polygons-with-holes-1502.06195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-minkowski-sums-of-polygons-with-holes-1502.06195"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-nearest-neighbor-distances-1502.08048</loc><lastmod>2015-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-nearest-neighbor-distances-1502.08048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-nearest-neighbor-distances-1502.08048"/></url>
<url><loc>https://scifaro.com/en/abs/computing-in-continuous-space-with-self-assembling-polygonal-tiles-1503.00327</loc><lastmod>2015-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-in-continuous-space-with-self-assembling-polygonal-tiles-1503.00327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-in-continuous-space-with-self-assembling-polygonal-tiles-1503.00327"/></url>
<url><loc>https://scifaro.com/en/abs/saturated-simple-and-2-simple-topological-graphs-with-few-edges-1503.01386</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/saturated-simple-and-2-simple-topological-graphs-with-few-edges-1503.01386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/saturated-simple-and-2-simple-topological-graphs-with-few-edges-1503.01386"/></url>
<url><loc>https://scifaro.com/en/abs/on-flattenability-of-graphs-1503.01489</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-flattenability-of-graphs-1503.01489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-flattenability-of-graphs-1503.01489"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-rigidity-and-independence-of-generalized-pinned-subspace-incidence-constraint-systems-1503.01837</loc><lastmod>2015-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-rigidity-and-independence-of-generalized-pinned-subspace-incidence-constraint-systems-1503.01837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-rigidity-and-independence-of-generalized-pinned-subspace-incidence-constraint-systems-1503.01837"/></url>
<url><loc>https://scifaro.com/en/abs/ham-sandwich-cuts-for-abstract-order-types-1503.02970</loc><lastmod>2015-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ham-sandwich-cuts-for-abstract-order-types-1503.02970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ham-sandwich-cuts-for-abstract-order-types-1503.02970"/></url>
<url><loc>https://scifaro.com/en/abs/min-morse-approximability-applications-1503.03170</loc><lastmod>2022-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-morse-approximability-applications-1503.03170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-morse-approximability-applications-1503.03170"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-zone-of-a-circle-in-an-arrangement-of-lines-1503.03462</loc><lastmod>2017-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-zone-of-a-circle-in-an-arrangement-of-lines-1503.03462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-zone-of-a-circle-in-an-arrangement-of-lines-1503.03462"/></url>
<url><loc>https://scifaro.com/en/abs/the-simulation-powers-and-limitations-of-higher-temperature-hierarchical-self-assembly-systems-1503.04502</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simulation-powers-and-limitations-of-higher-temperature-hierarchical-self-assembly-systems-1503.04502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simulation-powers-and-limitations-of-higher-temperature-hierarchical-self-assembly-systems-1503.04502"/></url>
<url><loc>https://scifaro.com/en/abs/varilets-additive-decomposition-topological-total-variation-and-filtering-of-scalar-fields-1503.04867</loc><lastmod>2016-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/varilets-additive-decomposition-topological-total-variation-and-filtering-of-scalar-fields-1503.04867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/varilets-additive-decomposition-topological-total-variation-and-filtering-of-scalar-fields-1503.04867"/></url>
<url><loc>https://scifaro.com/en/abs/strong-matching-of-points-with-geometric-shapes-1503.04871</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-matching-of-points-with-geometric-shapes-1503.04871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-matching-of-points-with-geometric-shapes-1503.04871"/></url>
<url><loc>https://scifaro.com/en/abs/modem-illumination-of-monotone-polygons-1503.05062</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modem-illumination-of-monotone-polygons-1503.05062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modem-illumination-of-monotone-polygons-1503.05062"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorics-and-complexity-of-guarding-polygons-with-edge-and-point-2-transmitters-1503.05681</loc><lastmod>2020-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorics-and-complexity-of-guarding-polygons-with-edge-and-point-2-transmitters-1503.05681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorics-and-complexity-of-guarding-polygons-with-edge-and-point-2-transmitters-1503.05681"/></url>
<url><loc>https://scifaro.com/en/abs/straight-line-triangle-representations-1503.06970</loc><lastmod>2015-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straight-line-triangle-representations-1503.06970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straight-line-triangle-representations-1503.06970"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-and-complexity-of-point-visibility-graphs-1503.07082</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-and-complexity-of-point-visibility-graphs-1503.07082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-and-complexity-of-point-visibility-graphs-1503.07082"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-graphs-via-persistence-distortion-1503.07414</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-graphs-via-persistence-distortion-1503.07414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-graphs-via-persistence-distortion-1503.07414"/></url>
<url><loc>https://scifaro.com/en/abs/building-efficient-and-compact-data-structures-for-simplicial-complexes-1503.07444</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-efficient-and-compact-data-structures-for-simplicial-complexes-1503.07444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-efficient-and-compact-data-structures-for-simplicial-complexes-1503.07444"/></url>
<url><loc>https://scifaro.com/en/abs/a-robust-and-efficient-method-for-solving-point-distance-problems-by-homotopy-1503.07901</loc><lastmod>2016-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-robust-and-efficient-method-for-solving-point-distance-problems-by-homotopy-1503.07901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-robust-and-efficient-method-for-solving-point-distance-problems-by-homotopy-1503.07901"/></url>
<url><loc>https://scifaro.com/en/abs/on-limits-of-dense-packing-of-equal-spheres-in-a-cube-1503.07933</loc><lastmod>2015-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-limits-of-dense-packing-of-equal-spheres-in-a-cube-1503.07933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-limits-of-dense-packing-of-equal-spheres-in-a-cube-1503.07933"/></url>
<url><loc>https://scifaro.com/en/abs/the-dual-diameter-of-triangulations-1503.08518</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dual-diameter-of-triangulations-1503.08518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dual-diameter-of-triangulations-1503.08518"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-morphs-of-convex-drawings-1503.09021</loc><lastmod>2015-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-morphs-of-convex-drawings-1503.09021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-morphs-of-convex-drawings-1503.09021"/></url>
<url><loc>https://scifaro.com/en/abs/mutiscale-mapper-a-framework-for-topological-summarization-of-data-and-maps-1504.03763</loc><lastmod>2016-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutiscale-mapper-a-framework-for-topological-summarization-of-data-and-maps-1504.03763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutiscale-mapper-a-framework-for-topological-summarization-of-data-and-maps-1504.03763"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-separation-theorem-with-geometric-applications-1504.04938</loc><lastmod>2015-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-separation-theorem-with-geometric-applications-1504.04938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-separation-theorem-with-geometric-applications-1504.04938"/></url>
<url><loc>https://scifaro.com/en/abs/motion-planning-for-unlabeled-discs-with-optimality-guarantees-1504.05218</loc><lastmod>2015-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/motion-planning-for-unlabeled-discs-with-optimality-guarantees-1504.05218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/motion-planning-for-unlabeled-discs-with-optimality-guarantees-1504.05218"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-visibility-graphs-for-pseudo-polygons-1504.06350</loc><lastmod>2015-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-visibility-graphs-for-pseudo-polygons-1504.06350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-visibility-graphs-for-pseudo-polygons-1504.06350"/></url>
<url><loc>https://scifaro.com/en/abs/straight-line-drawability-of-a-planar-graph-plus-an-edge-1504.06540</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straight-line-drawability-of-a-planar-graph-plus-an-edge-1504.06540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straight-line-drawability-of-a-planar-graph-plus-an-edge-1504.06540"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-fitting-of-a-circular-arc-when-two-points-are-known-1504.06582</loc><lastmod>2018-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-fitting-of-a-circular-arc-when-two-points-are-known-1504.06582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-fitting-of-a-circular-arc-when-two-points-are-known-1504.06582"/></url>
<url><loc>https://scifaro.com/en/abs/searching-for-a-compressed-polyline-with-a-minimum-number-of-vertices-1504.06584</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-for-a-compressed-polyline-with-a-minimum-number-of-vertices-1504.06584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-for-a-compressed-polyline-with-a-minimum-number-of-vertices-1504.06584"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-minimum-link-rectilinear-paths-in-triangulated-rectilinear-domains-1504.06842</loc><lastmod>2015-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-minimum-link-rectilinear-paths-in-triangulated-rectilinear-domains-1504.06842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-minimum-link-rectilinear-paths-in-triangulated-rectilinear-domains-1504.06842"/></url>
<url><loc>https://scifaro.com/en/abs/stable-delaunay-graphs-1504.06851</loc><lastmod>2015-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-delaunay-graphs-1504.06851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-delaunay-graphs-1504.06851"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-consistent-digital-line-segments-in-two-dimensions-1504.07661</loc><lastmod>2015-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-consistent-digital-line-segments-in-two-dimensions-1504.07661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-consistent-digital-line-segments-in-two-dimensions-1504.07661"/></url>
<url><loc>https://scifaro.com/en/abs/fr-echet-distance-for-curves-revisited-1504.07685</loc><lastmod>2015-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-echet-distance-for-curves-revisited-1504.07685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-echet-distance-for-curves-revisited-1504.07685"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-tiling-the-plane-with-a-translated-polyomino-1504.07883</loc><lastmod>2015-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-tiling-the-plane-with-a-translated-polyomino-1504.07883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-tiling-the-plane-with-a-translated-polyomino-1504.07883"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-framework-for-labeling-network-maps-1505.00164</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-framework-for-labeling-network-maps-1505.00164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-framework-for-labeling-network-maps-1505.00164"/></url>
<url><loc>https://scifaro.com/en/abs/instance-optimal-geometric-algorithms-1505.00184</loc><lastmod>2015-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instance-optimal-geometric-algorithms-1505.00184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instance-optimal-geometric-algorithms-1505.00184"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-an-unregulated-traffic-crossing-1505.00874</loc><lastmod>2015-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-an-unregulated-traffic-crossing-1505.00874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-an-unregulated-traffic-crossing-1505.00874"/></url>
<url><loc>https://scifaro.com/en/abs/an-empirical-evaluation-of-preconditioning-data-for-accelerating-convex-hull-computations-1505.00914</loc><lastmod>2015-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-empirical-evaluation-of-preconditioning-data-for-accelerating-convex-hull-computations-1505.00914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-empirical-evaluation-of-preconditioning-data-for-accelerating-convex-hull-computations-1505.00914"/></url>
<url><loc>https://scifaro.com/en/abs/on-monotone-drawings-of-trees-1505.01410</loc><lastmod>2016-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-monotone-drawings-of-trees-1505.01410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-monotone-drawings-of-trees-1505.01410"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-morse-functions-and-h-mathcal-m-2-mathbb-a-in-tilde-o-n-time-1505.02230</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-morse-functions-and-h-mathcal-m-2-mathbb-a-in-tilde-o-n-time-1505.02230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-morse-functions-and-h-mathcal-m-2-mathbb-a-in-tilde-o-n-time-1505.02230"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-approximation-schemes-for-geometric-maximum-coverage-1505.02591</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-approximation-schemes-for-geometric-maximum-coverage-1505.02591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-approximation-schemes-for-geometric-maximum-coverage-1505.02591"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-straight-line-drawing-of-a-planar-graph-and-its-rectangular-dual-1505.02708</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-straight-line-drawing-of-a-planar-graph-and-its-rectangular-dual-1505.02708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-straight-line-drawing-of-a-planar-graph-and-its-rectangular-dual-1505.02708"/></url>
<url><loc>https://scifaro.com/en/abs/on-integer-programing-with-bounded-determinants-1505.03132</loc><lastmod>2022-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-integer-programing-with-bounded-determinants-1505.03132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-integer-programing-with-bounded-determinants-1505.03132"/></url>
<url><loc>https://scifaro.com/en/abs/relaxed-disk-packing-1505.03402</loc><lastmod>2015-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relaxed-disk-packing-1505.03402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relaxed-disk-packing-1505.03402"/></url>
<url><loc>https://scifaro.com/en/abs/some-analytics-for-steiner-minimal-tree-problem-for-four-terminals-1505.03564</loc><lastmod>2015-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-analytics-for-steiner-minimal-tree-problem-for-four-terminals-1505.03564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-analytics-for-steiner-minimal-tree-problem-for-four-terminals-1505.03564"/></url>
<url><loc>https://scifaro.com/en/abs/a-light-metric-spanner-1505.03681</loc><lastmod>2015-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-light-metric-spanner-1505.03681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-light-metric-spanner-1505.03681"/></url>
<url><loc>https://scifaro.com/en/abs/frechet-similarity-of-closed-polygonal-curves-1505.04093</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frechet-similarity-of-closed-polygonal-curves-1505.04093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frechet-similarity-of-closed-polygonal-curves-1505.04093"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-visibility-representations-of-plane-st-graphs-using-l-shapes-1505.04388</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-visibility-representations-of-plane-st-graphs-using-l-shapes-1505.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-visibility-representations-of-plane-st-graphs-using-l-shapes-1505.04388"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-the-number-of-discontinuities-of-morton-type-space-filling-curves-1505.05055</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-the-number-of-discontinuities-of-morton-type-space-filling-curves-1505.05055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-the-number-of-discontinuities-of-morton-type-space-filling-curves-1505.05055"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-beacon-based-coverage-and-routing-in-simple-rectilinear-polygons-1505.05106</loc><lastmod>2015-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-beacon-based-coverage-and-routing-in-simple-rectilinear-polygons-1505.05106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-beacon-based-coverage-and-routing-in-simple-rectilinear-polygons-1505.05106"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-approach-to-reducing-the-algebraic-complexity-of-computing-delaunay-triangulations-1505.05454</loc><lastmod>2015-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-approach-to-reducing-the-algebraic-complexity-of-computing-delaunay-triangulations-1505.05454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-approach-to-reducing-the-algebraic-complexity-of-computing-delaunay-triangulations-1505.05454"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-intrinsic-delaunay-triangulations-from-the-dual-of-geodesic-voronoi-diagrams-1505.05590</loc><lastmod>2015-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-intrinsic-delaunay-triangulations-from-the-dual-of-geodesic-voronoi-diagrams-1505.05590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-intrinsic-delaunay-triangulations-from-the-dual-of-geodesic-voronoi-diagrams-1505.05590"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-free-topology-inference-and-sparsification-for-data-on-manifolds-1505.06462</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-free-topology-inference-and-sparsification-for-data-on-manifolds-1505.06462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-free-topology-inference-and-sparsification-for-data-on-manifolds-1505.06462"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-interpretation-of-the-boolean-gilbert-johnson-keerthi-algorithm-1505.07873</loc><lastmod>2015-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-interpretation-of-the-boolean-gilbert-johnson-keerthi-algorithm-1505.07873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-interpretation-of-the-boolean-gilbert-johnson-keerthi-algorithm-1505.07873"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-euclidean-shortest-paths-in-polygonal-domains-1506.01769</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-euclidean-shortest-paths-in-polygonal-domains-1506.01769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-euclidean-shortest-paths-in-polygonal-domains-1506.01769"/></url>
<url><loc>https://scifaro.com/en/abs/optimum-width-upward-drawings-of-trees-1506.02096</loc><lastmod>2015-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimum-width-upward-drawings-of-trees-1506.02096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimum-width-upward-drawings-of-trees-1506.02096"/></url>
<url><loc>https://scifaro.com/en/abs/probing-convex-polygons-with-a-wedge-1506.02572</loc><lastmod>2016-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probing-convex-polygons-with-a-wedge-1506.02572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probing-convex-polygons-with-a-wedge-1506.02572"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-perspective-on-sparse-filtrations-1506.03797</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-perspective-on-sparse-filtrations-1506.03797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-perspective-on-sparse-filtrations-1506.03797"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-for-the-2-approximation-of-finding-partitions-of-rectilinear-polygons-with-minimum-stabbing-number-1506.03865</loc><lastmod>2015-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-for-the-2-approximation-of-finding-partitions-of-rectilinear-polygons-with-minimum-stabbing-number-1506.03865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-for-the-2-approximation-of-finding-partitions-of-rectilinear-polygons-with-minimum-stabbing-number-1506.03865"/></url>
<url><loc>https://scifaro.com/en/abs/the-utility-of-untangling-1506.04092</loc><lastmod>2015-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-utility-of-untangling-1506.04092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-utility-of-untangling-1506.04092"/></url>
<url><loc>https://scifaro.com/en/abs/graph-drawings-with-one-bend-and-few-slopes-1506.04423</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-drawings-with-one-bend-and-few-slopes-1506.04423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-drawings-with-one-bend-and-few-slopes-1506.04423"/></url>
<url><loc>https://scifaro.com/en/abs/the-discrete-fr-echet-gap-1506.04861</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-discrete-fr-echet-gap-1506.04861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-discrete-fr-echet-gap-1506.04861"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-the-horton-set-in-an-integer-grid-of-minimum-size-1506.05505</loc><lastmod>2019-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-the-horton-set-in-an-integer-grid-of-minimum-size-1506.05505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-the-horton-set-in-an-integer-grid-of-minimum-size-1506.05505"/></url>
<url><loc>https://scifaro.com/en/abs/certified-computation-of-planar-morse-smale-complexes-1506.06265</loc><lastmod>2015-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-computation-of-planar-morse-smale-complexes-1506.06265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-computation-of-planar-morse-smale-complexes-1506.06265"/></url>
<url><loc>https://scifaro.com/en/abs/an-elementary-approach-to-tangent-space-variation-on-riemannian-submanifolds-1506.06346</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-elementary-approach-to-tangent-space-variation-on-riemannian-submanifolds-1506.06346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-elementary-approach-to-tangent-space-variation-on-riemannian-submanifolds-1506.06346"/></url>
<url><loc>https://scifaro.com/en/abs/1-string-b-1-vpg-representations-of-planar-partial-3-trees-and-some-subclasses-1506.07246</loc><lastmod>2015-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-string-b-1-vpg-representations-of-planar-partial-3-trees-and-some-subclasses-1506.07246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-string-b-1-vpg-representations-of-planar-partial-3-trees-and-some-subclasses-1506.07246"/></url>
<url><loc>https://scifaro.com/en/abs/constant-factor-approximation-for-tsp-with-disks-1506.07903</loc><lastmod>2016-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-factor-approximation-for-tsp-with-disks-1506.07903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-factor-approximation-for-tsp-with-disks-1506.07903"/></url>
<url><loc>https://scifaro.com/en/abs/improved-spanning-ratio-for-low-degree-plane-spanners-1506.09061</loc><lastmod>2015-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-spanning-ratio-for-low-degree-plane-spanners-1506.09061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-spanning-ratio-for-low-degree-plane-spanners-1506.09061"/></url>
<url><loc>https://scifaro.com/en/abs/compressed-manifold-modes-fast-calculation-and-natural-ordering-1507.00644</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compressed-manifold-modes-fast-calculation-and-natural-ordering-1507.00644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compressed-manifold-modes-fast-calculation-and-natural-ordering-1507.00644"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-decomposition-and-recombination-of-isostatic-geometric-constraint-systems-for-designing-layered-materials-1507.01158</loc><lastmod>2015-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-decomposition-and-recombination-of-isostatic-geometric-constraint-systems-for-designing-layered-materials-1507.01158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-decomposition-and-recombination-of-isostatic-geometric-constraint-systems-for-designing-layered-materials-1507.01158"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-greedy-clustering-and-distance-selection-for-graph-metrics-1507.01555</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-greedy-clustering-and-distance-selection-for-graph-metrics-1507.01555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-greedy-clustering-and-distance-selection-for-graph-metrics-1507.01555"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalised-isodiametric-problem-1507.01631</loc><lastmod>2015-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalised-isodiametric-problem-1507.01631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalised-isodiametric-problem-1507.01631"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-size-of-the-largest-empty-box-amidst-a-point-set-1507.02067</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-size-of-the-largest-empty-box-amidst-a-point-set-1507.02067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-size-of-the-largest-empty-box-amidst-a-point-set-1507.02067"/></url>
<url><loc>https://scifaro.com/en/abs/on-interference-among-moving-sensors-and-related-problems-1507.02130</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-interference-among-moving-sensors-and-related-problems-1507.02130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-interference-among-moving-sensors-and-related-problems-1507.02130"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-clustering-via-metric-partitioning-1507.02222</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-clustering-via-metric-partitioning-1507.02222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-clustering-via-metric-partitioning-1507.02222"/></url>
<url><loc>https://scifaro.com/en/abs/the-shadows-of-a-cycle-cannot-all-be-paths-1507.02355</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-shadows-of-a-cycle-cannot-all-be-paths-1507.02355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-shadows-of-a-cycle-cannot-all-be-paths-1507.02355"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-approximation-via-generating-point-sets-1507.02574</loc><lastmod>2017-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-approximation-via-generating-point-sets-1507.02574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-approximation-via-generating-point-sets-1507.02574"/></url>
<url><loc>https://scifaro.com/en/abs/a-quasilinear-time-algorithm-for-tiling-the-plane-isohedrally-with-a-polyomino-1507.02762</loc><lastmod>2016-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quasilinear-time-algorithm-for-tiling-the-plane-isohedrally-with-a-polyomino-1507.02762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quasilinear-time-algorithm-for-tiling-the-plane-isohedrally-with-a-polyomino-1507.02762"/></url>
<url><loc>https://scifaro.com/en/abs/space-filling-curves-for-3d-sensor-networks-with-complex-topology-1507.02931</loc><lastmod>2015-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-filling-curves-for-3d-sensor-networks-with-complex-topology-1507.02931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-filling-curves-for-3d-sensor-networks-with-complex-topology-1507.02931"/></url>
<url><loc>https://scifaro.com/en/abs/aren-t-we-all-nearest-neighbors-spatial-trees-high-dimensional-reductions-and-batch-nearest-neighbor-search-1507.03338</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aren-t-we-all-nearest-neighbors-spatial-trees-high-dimensional-reductions-and-batch-nearest-neighbor-search-1507.03338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aren-t-we-all-nearest-neighbors-spatial-trees-high-dimensional-reductions-and-batch-nearest-neighbor-search-1507.03338"/></url>
<url><loc>https://scifaro.com/en/abs/time-space-trade-offs-for-triangulations-and-voronoi-diagrams-1507.03403</loc><lastmod>2020-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-space-trade-offs-for-triangulations-and-voronoi-diagrams-1507.03403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-space-trade-offs-for-triangulations-and-voronoi-diagrams-1507.03403"/></url>
<url><loc>https://scifaro.com/en/abs/a-combinatorial-bound-for-beacon-based-routing-in-orthogonal-polygons-1507.03509</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-combinatorial-bound-for-beacon-based-routing-in-orthogonal-polygons-1507.03509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-combinatorial-bound-for-beacon-based-routing-in-orthogonal-polygons-1507.03509"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-method-for-triangular-mesh-generation-1507.03699</loc><lastmod>2015-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-method-for-triangular-mesh-generation-1507.03699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-method-for-triangular-mesh-generation-1507.03699"/></url>
<url><loc>https://scifaro.com/en/abs/new-variational-method-of-grid-generation-with-prescribed-jacobian-determinant-and-prescribed-curl-1507.03715</loc><lastmod>2016-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-variational-method-of-grid-generation-with-prescribed-jacobian-determinant-and-prescribed-curl-1507.03715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-variational-method-of-grid-generation-with-prescribed-jacobian-determinant-and-prescribed-curl-1507.03715"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-similarity-between-moving-curves-1507.03819</loc><lastmod>2015-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-similarity-between-moving-curves-1507.03819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-similarity-between-moving-curves-1507.03819"/></url>
<url><loc>https://scifaro.com/en/abs/persistence-images-a-stable-vector-representation-of-persistent-homology-1507.06217</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistence-images-a-stable-vector-representation-of-persistent-homology-1507.06217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistence-images-a-stable-vector-representation-of-persistent-homology-1507.06217"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-self-assembly-of-finite-shapes-at-temperature-1-in-3d-1507.06365</loc><lastmod>2015-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-self-assembly-of-finite-shapes-at-temperature-1-in-3d-1507.06365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-self-assembly-of-finite-shapes-at-temperature-1-in-3d-1507.06365"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-stretch-factor-of-convex-polyhedra-whose-vertices-are-almost-on-a-sphere-1507.06856</loc><lastmod>2016-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-convex-polyhedra-whose-vertices-are-almost-on-a-sphere-1507.06856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-convex-polyhedra-whose-vertices-are-almost-on-a-sphere-1507.06856"/></url>
<url><loc>https://scifaro.com/en/abs/a-hyperelastic-two-scale-optimization-model-for-shape-matching-1507.07760</loc><lastmod>2015-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hyperelastic-two-scale-optimization-model-for-shape-matching-1507.07760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hyperelastic-two-scale-optimization-model-for-shape-matching-1507.07760"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-reconstructing-point-set-order-types-from-radial-orderings-1507.08080</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-reconstructing-point-set-order-types-from-radial-orderings-1507.08080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-reconstructing-point-set-order-types-from-radial-orderings-1507.08080"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-and-construction-of-a-family-of-highly-symmetric-spherical-polyhedra-with-application-in-modeling-self-assembling-structures-1507.08374</loc><lastmod>2015-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-and-construction-of-a-family-of-highly-symmetric-spherical-polyhedra-with-application-in-modeling-self-assembling-structures-1507.08374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-and-construction-of-a-family-of-highly-symmetric-spherical-polyhedra-with-application-in-modeling-self-assembling-structures-1507.08374"/></url>
<url><loc>https://scifaro.com/en/abs/about-embedded-quarters-and-points-at-infinity-in-the-hyperbolic-plane-1507.08495</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-embedded-quarters-and-points-at-infinity-in-the-hyperbolic-plane-1507.08495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-embedded-quarters-and-points-at-infinity-in-the-hyperbolic-plane-1507.08495"/></url>
<url><loc>https://scifaro.com/en/abs/l-visibility-drawings-of-ic-planar-graphs-1507.08879</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-visibility-drawings-of-ic-planar-graphs-1507.08879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-visibility-drawings-of-ic-planar-graphs-1507.08879"/></url>
<url><loc>https://scifaro.com/en/abs/snow-globe-an-advancing-front-3d-delaunay-mesh-refinement-algorithm-1508.00060</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/snow-globe-an-advancing-front-3d-delaunay-mesh-refinement-algorithm-1508.00060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/snow-globe-an-advancing-front-3d-delaunay-mesh-refinement-algorithm-1508.00060"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-formulation-for-disk-conformal-parameterization-of-simply-connected-open-surfaces-1508.00396</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-formulation-for-disk-conformal-parameterization-of-simply-connected-open-surfaces-1508.00396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-formulation-for-disk-conformal-parameterization-of-simply-connected-open-surfaces-1508.00396"/></url>
<url><loc>https://scifaro.com/en/abs/proving-the-turing-universality-of-oritatami-co-transcriptional-folding-full-text-1508.00510</loc><lastmod>2018-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-the-turing-universality-of-oritatami-co-transcriptional-folding-full-text-1508.00510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-the-turing-universality-of-oritatami-co-transcriptional-folding-full-text-1508.00510"/></url>
<url><loc>https://scifaro.com/en/abs/representing-directed-trees-as-straight-skeletons-1508.01076</loc><lastmod>2015-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-directed-trees-as-straight-skeletons-1508.01076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-directed-trees-as-straight-skeletons-1508.01076"/></url>
<url><loc>https://scifaro.com/en/abs/finding-points-in-general-position-1508.01097</loc><lastmod>2017-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-points-in-general-position-1508.01097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-points-in-general-position-1508.01097"/></url>
<url><loc>https://scifaro.com/en/abs/computing-maximal-layers-of-points-in-e-f-n-1508.02477</loc><lastmod>2015-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-maximal-layers-of-points-in-e-f-n-1508.02477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-maximal-layers-of-points-in-e-f-n-1508.02477"/></url>
<url><loc>https://scifaro.com/en/abs/hyperorthogonal-well-folded-hilbert-curves-1508.02517</loc><lastmod>2017-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperorthogonal-well-folded-hilbert-curves-1508.02517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperorthogonal-well-folded-hilbert-curves-1508.02517"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-comparing-similarity-between-two-trees-1508.03381</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-comparing-similarity-between-two-trees-1508.03381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-comparing-similarity-between-two-trees-1508.03381"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-the-diameter-of-the-flip-graph-1508.03473</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-the-diameter-of-the-flip-graph-1508.03473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-the-diameter-of-the-flip-graph-1508.03473"/></url>
<url><loc>https://scifaro.com/en/abs/no-acute-tetrahedron-is-an-8-reptile-1508.03773</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-acute-tetrahedron-is-an-8-reptile-1508.03773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-acute-tetrahedron-is-an-8-reptile-1508.03773"/></url>
<url><loc>https://scifaro.com/en/abs/knuthian-drawings-of-series-parallel-flowcharts-1508.03931</loc><lastmod>2015-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knuthian-drawings-of-series-parallel-flowcharts-1508.03931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knuthian-drawings-of-series-parallel-flowcharts-1508.03931"/></url>
<url><loc>https://scifaro.com/en/abs/cudachain-a-practical-gpu-accelerated-2d-convex-hull-algorithm-1508.05488</loc><lastmod>2016-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cudachain-a-practical-gpu-accelerated-2d-convex-hull-algorithm-1508.05488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cudachain-a-practical-gpu-accelerated-2d-convex-hull-algorithm-1508.05488"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-point-set-for-2-outerplanar-graphs-1508.05784</loc><lastmod>2015-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-point-set-for-2-outerplanar-graphs-1508.05784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-point-set-for-2-outerplanar-graphs-1508.05784"/></url>
<url><loc>https://scifaro.com/en/abs/gscan-accelerating-graham-scan-on-the-gpu-1508.05931</loc><lastmod>2015-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gscan-accelerating-graham-scan-on-the-gpu-1508.05931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gscan-accelerating-graham-scan-on-the-gpu-1508.05931"/></url>
<url><loc>https://scifaro.com/en/abs/on-embeddability-of-buses-in-point-sets-1508.06760</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-embeddability-of-buses-in-point-sets-1508.06760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-embeddability-of-buses-in-point-sets-1508.06760"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-conformal-parameterization-of-genus-0-point-clouds-for-meshing-1508.07569</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-conformal-parameterization-of-genus-0-point-clouds-for-meshing-1508.07569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-conformal-parameterization-of-genus-0-point-clouds-for-meshing-1508.07569"/></url>
<url><loc>https://scifaro.com/en/abs/line-of-sight-pursuit-in-monotone-and-scallop-polygons-1508.07603</loc><lastmod>2020-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-of-sight-pursuit-in-monotone-and-scallop-polygons-1508.07603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-of-sight-pursuit-in-monotone-and-scallop-polygons-1508.07603"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-embeddings-with-few-bends-and-crossings-1508.07921</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-embeddings-with-few-bends-and-crossings-1508.07921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-embeddings-with-few-bends-and-crossings-1508.07921"/></url>
<url><loc>https://scifaro.com/en/abs/some-triangulated-surfaces-without-balanced-splitting-1509.00269</loc><lastmod>2015-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-triangulated-surfaces-without-balanced-splitting-1509.00269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-triangulated-surfaces-without-balanced-splitting-1509.00269"/></url>
<url><loc>https://scifaro.com/en/abs/spiral-unfoldings-of-convex-polyhedra-1509.00321</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spiral-unfoldings-of-convex-polyhedra-1509.00321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spiral-unfoldings-of-convex-polyhedra-1509.00321"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-readability-of-boundary-labeling-1509.00379</loc><lastmod>2015-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-readability-of-boundary-labeling-1509.00379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-readability-of-boundary-labeling-1509.00379"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-and-drawing-ic-planar-graphs-1509.00388</loc><lastmod>2016-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-and-drawing-ic-planar-graphs-1509.00388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-and-drawing-ic-planar-graphs-1509.00388"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-weighted-disk-contact-graphs-1509.00720</loc><lastmod>2015-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-weighted-disk-contact-graphs-1509.00720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-weighted-disk-contact-graphs-1509.00720"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem-1509.00835</loc><lastmod>2015-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem-1509.00835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-properties-of-triangle-free-rectangle-arrangements-and-the-squarability-problem-1509.00835"/></url>
<url><loc>https://scifaro.com/en/abs/improved-and-simplified-inapproximability-for-k-means-1509.00916</loc><lastmod>2015-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-and-simplified-inapproximability-for-k-means-1509.00916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-and-simplified-inapproximability-for-k-means-1509.00916"/></url>
<url><loc>https://scifaro.com/en/abs/flips-and-spanners-1509.02563</loc><lastmod>2015-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flips-and-spanners-1509.02563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flips-and-spanners-1509.02563"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-algorithms-for-the-discrete-fr-echet-distance-upper-bound-with-imprecise-input-1509.02576</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-algorithms-for-the-discrete-fr-echet-distance-upper-bound-with-imprecise-input-1509.02576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-algorithms-for-the-discrete-fr-echet-distance-upper-bound-with-imprecise-input-1509.02576"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-o-beta-hull-of-a-planar-point-set-1509.02601</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-o-beta-hull-of-a-planar-point-set-1509.02601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-o-beta-hull-of-a-planar-point-set-1509.02601"/></url>
<url><loc>https://scifaro.com/en/abs/rectilinear-convex-hull-with-minimum-area-1509.02627</loc><lastmod>2017-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectilinear-convex-hull-with-minimum-area-1509.02627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectilinear-convex-hull-with-minimum-area-1509.02627"/></url>
<url><loc>https://scifaro.com/en/abs/on-4-map-graphs-and-1-planar-graphs-and-their-recognition-problem-1509.03447</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-4-map-graphs-and-1-planar-graphs-and-their-recognition-problem-1509.03447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-4-map-graphs-and-1-planar-graphs-and-their-recognition-problem-1509.03447"/></url>
<url><loc>https://scifaro.com/en/abs/improving-lower-bound-on-opaque-set-for-equilateral-triangle-1509.03846</loc><lastmod>2015-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-lower-bound-on-opaque-set-for-equilateral-triangle-1509.03846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-lower-bound-on-opaque-set-for-equilateral-triangle-1509.03846"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-size-sensitive-packing-lemma-1509.04020</loc><lastmod>2015-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-size-sensitive-packing-lemma-1509.04020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-size-sensitive-packing-lemma-1509.04020"/></url>
<url><loc>https://scifaro.com/en/abs/multivariate-topology-simplification-1509.04465</loc><lastmod>2015-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multivariate-topology-simplification-1509.04465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multivariate-topology-simplification-1509.04465"/></url>
<url><loc>https://scifaro.com/en/abs/caratheodory-s-theorem-in-depth-1509.04575</loc><lastmod>2017-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/caratheodory-s-theorem-in-depth-1509.04575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/caratheodory-s-theorem-in-depth-1509.04575"/></url>
<url><loc>https://scifaro.com/en/abs/sync-and-burst-force-directed-graph-drawing-with-uniform-force-magnitudes-1509.05265</loc><lastmod>2015-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sync-and-burst-force-directed-graph-drawing-with-uniform-force-magnitudes-1509.05265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sync-and-burst-force-directed-graph-drawing-with-uniform-force-magnitudes-1509.05265"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-rectilinear-center-of-uncertain-points-in-the-plane-1509.05377</loc><lastmod>2015-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-rectilinear-center-of-uncertain-points-in-the-plane-1509.05377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-rectilinear-center-of-uncertain-points-in-the-plane-1509.05377"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-1509.05635</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-1509.05635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-graph-drawings-and-triangulated-simple-polygons-into-greedily-routable-regions-1509.05635"/></url>
<url><loc>https://scifaro.com/en/abs/colored-non-crossing-euclidean-steiner-forest-1509.05681</loc><lastmod>2016-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-non-crossing-euclidean-steiner-forest-1509.05681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-non-crossing-euclidean-steiner-forest-1509.05681"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-gromov-hausdorff-distance-for-metric-trees-1509.05751</loc><lastmod>2017-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-gromov-hausdorff-distance-for-metric-trees-1509.05751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-gromov-hausdorff-distance-for-metric-trees-1509.05751"/></url>
<url><loc>https://scifaro.com/en/abs/size-dependent-tile-self-assembly-constant-height-rectangles-and-stability-1509.06898</loc><lastmod>2015-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-dependent-tile-self-assembly-constant-height-rectangles-and-stability-1509.06898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-dependent-tile-self-assembly-constant-height-rectangles-and-stability-1509.06898"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-on-the-dilation-of-plane-spanners-1509.07181</loc><lastmod>2016-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-on-the-dilation-of-plane-spanners-1509.07181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-on-the-dilation-of-plane-spanners-1509.07181"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-geodesic-centers-of-a-polygonal-domain-1509.07214</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-geodesic-centers-of-a-polygonal-domain-1509.07214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-geodesic-centers-of-a-polygonal-domain-1509.07214"/></url>
<url><loc>https://scifaro.com/en/abs/time-space-trade-off-algorithms-for-triangulating-a-simple-polygon-1509.07669</loc><lastmod>2017-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-space-trade-off-algorithms-for-triangulating-a-simple-polygon-1509.07669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-space-trade-off-algorithms-for-triangulating-a-simple-polygon-1509.07669"/></url>
<url><loc>https://scifaro.com/en/abs/external-memory-three-sided-range-reporting-and-top-k-queries-with-sublogarithmic-updates-1509.08240</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/external-memory-three-sided-range-reporting-and-top-k-queries-with-sublogarithmic-updates-1509.08240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/external-memory-three-sided-range-reporting-and-top-k-queries-with-sublogarithmic-updates-1509.08240"/></url>
<url><loc>https://scifaro.com/en/abs/the-continuous-1-5d-terrain-guarding-problem-discretization-optimal-solutions-and-ptas-1509.08285</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-continuous-1-5d-terrain-guarding-problem-discretization-optimal-solutions-and-ptas-1509.08285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-continuous-1-5d-terrain-guarding-problem-discretization-optimal-solutions-and-ptas-1509.08285"/></url>
<url><loc>https://scifaro.com/en/abs/kempe-s-universality-theorem-for-rational-space-curves-1509.08690</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kempe-s-universality-theorem-for-rational-space-curves-1509.08690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kempe-s-universality-theorem-for-rational-space-curves-1509.08690"/></url>
<url><loc>https://scifaro.com/en/abs/a-non-iterative-method-of-separation-of-points-by-planes-in-n-dimensions-and-its-application-1509.08742</loc><lastmod>2015-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-non-iterative-method-of-separation-of-points-by-planes-in-n-dimensions-and-its-application-1509.08742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-non-iterative-method-of-separation-of-points-by-planes-in-n-dimensions-and-its-application-1509.08742"/></url>
<url><loc>https://scifaro.com/en/abs/tolerance-analysis-by-polytopes-1509.08763</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tolerance-analysis-by-polytopes-1509.08763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tolerance-analysis-by-polytopes-1509.08763"/></url>
<url><loc>https://scifaro.com/en/abs/electrical-reduction-homotopy-moves-and-defect-1510.00571</loc><lastmod>2015-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/electrical-reduction-homotopy-moves-and-defect-1510.00571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/electrical-reduction-homotopy-moves-and-defect-1510.00571"/></url>
<url><loc>https://scifaro.com/en/abs/routing-in-unit-disk-graphs-1510.01072</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-in-unit-disk-graphs-1510.01072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-in-unit-disk-graphs-1510.01072"/></url>
<url><loc>https://scifaro.com/en/abs/deconstructing-bataknese-gorga-computationally-1510.01140</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deconstructing-bataknese-gorga-computationally-1510.01140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deconstructing-bataknese-gorga-computationally-1510.01140"/></url>
<url><loc>https://scifaro.com/en/abs/shoreline-and-bathymetry-approximation-in-mesh-generation-for-tidal-renewable-simulations-1510.01560</loc><lastmod>2015-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shoreline-and-bathymetry-approximation-in-mesh-generation-for-tidal-renewable-simulations-1510.01560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shoreline-and-bathymetry-approximation-in-mesh-generation-for-tidal-renewable-simulations-1510.01560"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-islands-in-two-colored-point-sets-in-the-plane-1510.01819</loc><lastmod>2018-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-islands-in-two-colored-point-sets-in-the-plane-1510.01819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-islands-in-two-colored-point-sets-in-the-plane-1510.01819"/></url>
<url><loc>https://scifaro.com/en/abs/small-area-orthogonal-drawings-of-3-connected-graphs-1510.02322</loc><lastmod>2015-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-area-orthogonal-drawings-of-3-connected-graphs-1510.02322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-area-orthogonal-drawings-of-3-connected-graphs-1510.02322"/></url>
<url><loc>https://scifaro.com/en/abs/on-contact-graphs-with-cubes-and-proportional-boxes-1510.02484</loc><lastmod>2015-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-contact-graphs-with-cubes-and-proportional-boxes-1510.02484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-contact-graphs-with-cubes-and-proportional-boxes-1510.02484"/></url>
<url><loc>https://scifaro.com/en/abs/windrose-planarity-embedding-graphs-with-direction-constrained-edges-1510.02659</loc><lastmod>2019-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/windrose-planarity-embedding-graphs-with-direction-constrained-edges-1510.02659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/windrose-planarity-embedding-graphs-with-direction-constrained-edges-1510.02659"/></url>
<url><loc>https://scifaro.com/en/abs/treetopes-and-their-graphs-1510.03152</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/treetopes-and-their-graphs-1510.03152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/treetopes-and-their-graphs-1510.03152"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-staged-self-assembly-of-general-shapes-1510.03919</loc><lastmod>2016-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-staged-self-assembly-of-general-shapes-1510.03919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-staged-self-assembly-of-general-shapes-1510.03919"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-triangulations-of-degenerate-point-sets-1510.04608</loc><lastmod>2015-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-triangulations-of-degenerate-point-sets-1510.04608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-triangulations-of-degenerate-point-sets-1510.04608"/></url>
<url><loc>https://scifaro.com/en/abs/the-theory-of-computational-quasi-conformal-geometry-on-point-clouds-1510.05104</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theory-of-computational-quasi-conformal-geometry-on-point-clouds-1510.05104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theory-of-computational-quasi-conformal-geometry-on-point-clouds-1510.05104"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-book-thickness-of-1-planar-graphs-1510.05891</loc><lastmod>2015-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-book-thickness-of-1-planar-graphs-1510.05891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-book-thickness-of-1-planar-graphs-1510.05891"/></url>
<url><loc>https://scifaro.com/en/abs/an-example-of-geometric-origami-design-with-benefit-of-graph-enumeration-algorithms-1510.07499</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-example-of-geometric-origami-design-with-benefit-of-graph-enumeration-algorithms-1510.07499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-example-of-geometric-origami-design-with-benefit-of-graph-enumeration-algorithms-1510.07499"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-hyperplane-based-minimum-volume-enclosing-simplex-algorithm-for-blind-hyperspectral-unmixing-1510.08917</loc><lastmod>2016-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-hyperplane-based-minimum-volume-enclosing-simplex-algorithm-for-blind-hyperspectral-unmixing-1510.08917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-hyperplane-based-minimum-volume-enclosing-simplex-algorithm-for-blind-hyperspectral-unmixing-1510.08917"/></url>
<url><loc>https://scifaro.com/en/abs/subsampling-in-smoothed-range-spaces-1510.09123</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subsampling-in-smoothed-range-spaces-1510.09123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subsampling-in-smoothed-range-spaces-1510.09123"/></url>
<url><loc>https://scifaro.com/en/abs/computational-network-design-from-functional-specifications-1510.09203</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-network-design-from-functional-specifications-1510.09203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-network-design-from-functional-specifications-1510.09203"/></url>
<url><loc>https://scifaro.com/en/abs/the-3-1-ordering-for-4-connected-planar-triangulations-1511.00873</loc><lastmod>2015-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-3-1-ordering-for-4-connected-planar-triangulations-1511.00873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-3-1-ordering-for-4-connected-planar-triangulations-1511.00873"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-spanners-for-points-on-a-polyhedral-terrain-1511.01612</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-spanners-for-points-on-a-polyhedral-terrain-1511.01612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-spanners-for-points-on-a-polyhedral-terrain-1511.01612"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-the-separating-common-tangents-of-two-polygons-1511.04036</loc><lastmod>2015-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-the-separating-common-tangents-of-two-polygons-1511.04036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-the-separating-common-tangents-of-two-polygons-1511.04036"/></url>
<url><loc>https://scifaro.com/en/abs/weight-balancing-on-boundaries-1511.04123</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weight-balancing-on-boundaries-1511.04123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weight-balancing-on-boundaries-1511.04123"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-matching-algorithm-for-multidimensional-persistence-1511.05427</loc><lastmod>2017-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-matching-algorithm-for-multidimensional-persistence-1511.05427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-matching-algorithm-for-multidimensional-persistence-1511.05427"/></url>
<url><loc>https://scifaro.com/en/abs/declutter-and-resample-towards-parameter-free-denoising-1511.05479</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/declutter-and-resample-towards-parameter-free-denoising-1511.05479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/declutter-and-resample-towards-parameter-free-denoising-1511.05479"/></url>
<url><loc>https://scifaro.com/en/abs/tempo-feature-endowed-teichm-uller-extremal-mappings-of-point-clouds-1511.06624</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tempo-feature-endowed-teichm-uller-extremal-mappings-of-point-clouds-1511.06624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tempo-feature-endowed-teichm-uller-extremal-mappings-of-point-clouds-1511.06624"/></url>
<url><loc>https://scifaro.com/en/abs/on-partitioning-the-edges-of-1-plane-graphs-1511.07303</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-partitioning-the-edges-of-1-plane-graphs-1511.07303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-partitioning-the-edges-of-1-plane-graphs-1511.07303"/></url>
<url><loc>https://scifaro.com/en/abs/proximity-in-the-age-of-distraction-robust-approximate-nearest-neighbor-search-1511.07357</loc><lastmod>2015-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proximity-in-the-age-of-distraction-robust-approximate-nearest-neighbor-search-1511.07357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proximity-in-the-age-of-distraction-robust-approximate-nearest-neighbor-search-1511.07357"/></url>
<url><loc>https://scifaro.com/en/abs/on-visibility-representations-of-non-planar-graphs-1511.08592</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-visibility-representations-of-non-planar-graphs-1511.08592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-visibility-representations-of-non-planar-graphs-1511.08592"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-storage-and-retrieval-of-primes-and-other-random-numbers-using-n-dimensional-geometry-1511.08941</loc><lastmod>2015-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-storage-and-retrieval-of-primes-and-other-random-numbers-using-n-dimensional-geometry-1511.08941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-storage-and-retrieval-of-primes-and-other-random-numbers-using-n-dimensional-geometry-1511.08941"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-geometric-intersection-number-of-curves-1511.09327</loc><lastmod>2019-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-geometric-intersection-number-of-curves-1511.09327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-geometric-intersection-number-of-curves-1511.09327"/></url>
<url><loc>https://scifaro.com/en/abs/the-partial-visibility-representation-extension-problem-1512.00174</loc><lastmod>2021-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-partial-visibility-representation-extension-problem-1512.00174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-partial-visibility-representation-extension-problem-1512.00174"/></url>
<url><loc>https://scifaro.com/en/abs/almost-tight-bounds-for-eliminating-depth-cycles-in-three-dimensions-1512.00358</loc><lastmod>2016-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-tight-bounds-for-eliminating-depth-cycles-in-three-dimensions-1512.00358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-tight-bounds-for-eliminating-depth-cycles-in-three-dimensions-1512.00358"/></url>
<url><loc>https://scifaro.com/en/abs/flips-in-edge-labelled-pseudo-triangulations-1512.01485</loc><lastmod>2015-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flips-in-edge-labelled-pseudo-triangulations-1512.01485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flips-in-edge-labelled-pseudo-triangulations-1512.01485"/></url>
<url><loc>https://scifaro.com/en/abs/pruning-algorithms-for-pretropisms-of-newton-polytopes-1512.01594</loc><lastmod>2016-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pruning-algorithms-for-pretropisms-of-newton-polytopes-1512.01594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pruning-algorithms-for-pretropisms-of-newton-polytopes-1512.01594"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-approximating-2-transmitters-1512.01699</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-approximating-2-transmitters-1512.01699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-approximating-2-transmitters-1512.01699"/></url>
<url><loc>https://scifaro.com/en/abs/stabilizing-the-unstable-output-of-persistent-homology-computations-1512.01700</loc><lastmod>2021-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabilizing-the-unstable-output-of-persistent-homology-computations-1512.01700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabilizing-the-unstable-output-of-persistent-homology-computations-1512.01700"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-range-counting-revisited-1512.01713</loc><lastmod>2017-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-range-counting-revisited-1512.01713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-range-counting-revisited-1512.01713"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-ell-p-spaces-2-p-infty-via-embeddings-1512.01775</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-ell-p-spaces-2-p-infty-via-embeddings-1512.01775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-ell-p-spaces-2-p-infty-via-embeddings-1512.01775"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-strategy-for-walking-in-streets-for-a-simple-robot-1512.01784</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-strategy-for-walking-in-streets-for-a-simple-robot-1512.01784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-strategy-for-walking-in-streets-for-a-simple-robot-1512.01784"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-dynamic-time-warping-and-edit-distance-for-a-pair-of-point-sequences-1512.01876</loc><lastmod>2016-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-dynamic-time-warping-and-edit-distance-for-a-pair-of-point-sequences-1512.01876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-dynamic-time-warping-and-edit-distance-for-a-pair-of-point-sequences-1512.01876"/></url>
<url><loc>https://scifaro.com/en/abs/hypercube-unfoldings-that-tile-r-3-and-r-2-1512.02086</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercube-unfoldings-that-tile-r-3-and-r-2-1512.02086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercube-unfoldings-that-tile-r-3-and-r-2-1512.02086"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-continuous-diameter-when-augmenting-paths-and-cycles-with-shortcuts-1512.02257</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-continuous-diameter-when-augmenting-paths-and-cycles-with-shortcuts-1512.02257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-continuous-diameter-when-augmenting-paths-and-cycles-with-shortcuts-1512.02257"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-two-center-problem-of-convex-polygon-1512.02356</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-two-center-problem-of-convex-polygon-1512.02356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-two-center-problem-of-convex-polygon-1512.02356"/></url>
<url><loc>https://scifaro.com/en/abs/plane-bichromatic-trees-of-low-degree-1512.02730</loc><lastmod>2015-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-bichromatic-trees-of-low-degree-1512.02730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-bichromatic-trees-of-low-degree-1512.02730"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-the-minkowski-difference-of-zonotopes-1512.02794</loc><lastmod>2022-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-the-minkowski-difference-of-zonotopes-1512.02794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-the-minkowski-difference-of-zonotopes-1512.02794"/></url>
<url><loc>https://scifaro.com/en/abs/an-extension-of-moebius-lie-geometry-with-conformal-ensembles-of-cycles-and-its-implementation-in-a-ginac-library-1512.02960</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extension-of-moebius-lie-geometry-with-conformal-ensembles-of-cycles-and-its-implementation-in-a-ginac-library-1512.02960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extension-of-moebius-lie-geometry-with-conformal-ensembles-of-cycles-and-its-implementation-in-a-ginac-library-1512.02960"/></url>
<url><loc>https://scifaro.com/en/abs/on-variants-of-k-means-clustering-1512.02985</loc><lastmod>2015-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-variants-of-k-means-clustering-1512.02985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-variants-of-k-means-clustering-1512.02985"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-integral-fr-echet-distance-1512.03359</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-integral-fr-echet-distance-1512.03359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-integral-fr-echet-distance-1512.03359"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-embeddability-of-delaunay-triangulations-in-anisotropic-normed-and-bregman-spaces-1512.03589</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-embeddability-of-delaunay-triangulations-in-anisotropic-normed-and-bregman-spaces-1512.03589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-embeddability-of-delaunay-triangulations-in-anisotropic-normed-and-bregman-spaces-1512.03589"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-structure-associated-with-the-convex-polygon-1512.03897</loc><lastmod>2019-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-structure-associated-with-the-convex-polygon-1512.03897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-structure-associated-with-the-convex-polygon-1512.03897"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-between-categorical-representations-of-reeb-space-and-mapper-1512.04108</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-between-categorical-representations-of-reeb-space-and-mapper-1512.04108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-between-categorical-representations-of-reeb-space-and-mapper-1512.04108"/></url>
<url><loc>https://scifaro.com/en/abs/random-sampling-with-removal-1512.04226</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-sampling-with-removal-1512.04226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-sampling-with-removal-1512.04226"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-clustering-of-points-on-the-line-1512.04303</loc><lastmod>2015-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-clustering-of-points-on-the-line-1512.04303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-clustering-of-points-on-the-line-1512.04303"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-time-series-under-the-fr-echet-distance-1512.04349</loc><lastmod>2015-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-time-series-under-the-fr-echet-distance-1512.04349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-time-series-under-the-fr-echet-distance-1512.04349"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-and-reconstruction-of-shapes-with-algebraic-boundaries-1512.04388</loc><lastmod>2016-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-and-reconstruction-of-shapes-with-algebraic-boundaries-1512.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-and-reconstruction-of-shapes-with-algebraic-boundaries-1512.04388"/></url>
<url><loc>https://scifaro.com/en/abs/admissible-colourings-of-3-manifold-triangulations-for-turaev-viro-type-invariants-1512.04648</loc><lastmod>2018-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/admissible-colourings-of-3-manifold-triangulations-for-turaev-viro-type-invariants-1512.04648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/admissible-colourings-of-3-manifold-triangulations-for-turaev-viro-type-invariants-1512.04648"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-simplicial-depth-1512.04856</loc><lastmod>2015-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-simplicial-depth-1512.04856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-simplicial-depth-1512.04856"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-total-number-of-bends-for-planar-octilinear-drawings-1512.04866</loc><lastmod>2015-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-total-number-of-bends-for-planar-octilinear-drawings-1512.04866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-total-number-of-bends-for-planar-octilinear-drawings-1512.04866"/></url>
<url><loc>https://scifaro.com/en/abs/small-model-2-complexes-in-4-space-and-applications-1512.05152</loc><lastmod>2016-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-model-2-complexes-in-4-space-and-applications-1512.05152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-model-2-complexes-in-4-space-and-applications-1512.05152"/></url>
<url><loc>https://scifaro.com/en/abs/on-links-of-vertices-in-simplicial-d-complexes-embeddable-in-the-euclidean-2d-space-1512.05164</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-links-of-vertices-in-simplicial-d-complexes-embeddable-in-the-euclidean-2d-space-1512.05164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-links-of-vertices-in-simplicial-d-complexes-embeddable-in-the-euclidean-2d-space-1512.05164"/></url>
<url><loc>https://scifaro.com/en/abs/dissection-with-the-fewest-pieces-is-hard-even-to-approximate-1512.06706</loc><lastmod>2015-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dissection-with-the-fewest-pieces-is-hard-even-to-approximate-1512.06706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dissection-with-the-fewest-pieces-is-hard-even-to-approximate-1512.06706"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-l-1-geodesic-diameter-and-center-of-a-polygonal-domain-1512.07160</loc><lastmod>2016-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-l-1-geodesic-diameter-and-center-of-a-polygonal-domain-1512.07160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-l-1-geodesic-diameter-and-center-of-a-polygonal-domain-1512.07160"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-k-center-problems-with-centers-constrained-to-two-lines-1512.07533</loc><lastmod>2016-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-k-center-problems-with-centers-constrained-to-two-lines-1512.07533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-k-center-problems-with-centers-constrained-to-two-lines-1512.07533"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-fitting-of-a-k-step-function-1512.07537</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-fitting-of-a-k-step-function-1512.07537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-fitting-of-a-k-step-function-1512.07537"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-diameter-of-lattice-polytopes-1512.07872</loc><lastmod>2015-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-diameter-of-lattice-polytopes-1512.07872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-diameter-of-lattice-polytopes-1512.07872"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-the-vertices-of-an-orthogonal-terrain-using-vertex-guards-1512.08292</loc><lastmod>2015-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-the-vertices-of-an-orthogonal-terrain-using-vertex-guards-1512.08292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-the-vertices-of-an-orthogonal-terrain-using-vertex-guards-1512.08292"/></url>
<url><loc>https://scifaro.com/en/abs/apollonius-solutions-in-rd-1512.08846</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/apollonius-solutions-in-rd-1512.08846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/apollonius-solutions-in-rd-1512.08846"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-and-sketches-1601.00617</loc><lastmod>2016-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-and-sketches-1601.00617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-and-sketches-1601.00617"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-graphs-dismantlability-and-the-cops-and-robbers-game-1601.01298</loc><lastmod>2016-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-graphs-dismantlability-and-the-cops-and-robbers-game-1601.01298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-graphs-dismantlability-and-the-cops-and-robbers-game-1601.01298"/></url>
<url><loc>https://scifaro.com/en/abs/strongly-monotone-drawings-of-planar-graphs-1601.01598</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strongly-monotone-drawings-of-planar-graphs-1601.01598"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strongly-monotone-drawings-of-planar-graphs-1601.01598"/></url>
<url><loc>https://scifaro.com/en/abs/common-tangents-of-two-disjoint-polygons-in-linear-time-and-constant-workspace-1601.01816</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-tangents-of-two-disjoint-polygons-in-linear-time-and-constant-workspace-1601.01816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-tangents-of-two-disjoint-polygons-in-linear-time-and-constant-workspace-1601.01816"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-sized-topological-approximations-using-the-permutahedron-1601.02732</loc><lastmod>2016-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-sized-topological-approximations-using-the-permutahedron-1601.02732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-sized-topological-approximations-using-the-permutahedron-1601.02732"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-tverberg-s-theorem-via-centerpoint-theorems-1601.03083</loc><lastmod>2017-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-tverberg-s-theorem-via-centerpoint-theorems-1601.03083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-tverberg-s-theorem-via-centerpoint-theorems-1601.03083"/></url>
<url><loc>https://scifaro.com/en/abs/entity-oriented-spatial-coding-and-discrete-topological-spatial-relations-1601.03817</loc><lastmod>2016-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entity-oriented-spatial-coding-and-discrete-topological-spatial-relations-1601.03817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entity-oriented-spatial-coding-and-discrete-topological-spatial-relations-1601.03817"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-smallest-containers-for-packing-three-dimensional-convex-objects-1601.04585</loc><lastmod>2016-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-smallest-containers-for-packing-three-dimensional-convex-objects-1601.04585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-smallest-containers-for-packing-three-dimensional-convex-objects-1601.04585"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-k-level-in-three-dimensional-plane-arrangements-1601.04755</loc><lastmod>2016-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-k-level-in-three-dimensional-plane-arrangements-1601.04755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-k-level-in-three-dimensional-plane-arrangements-1601.04755"/></url>
<url><loc>https://scifaro.com/en/abs/pachinko-1601.05706</loc><lastmod>2016-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pachinko-1601.05706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pachinko-1601.05706"/></url>
<url><loc>https://scifaro.com/en/abs/folding-flat-crease-patterns-with-thick-materials-1601.05747</loc><lastmod>2016-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-flat-crease-patterns-with-thick-materials-1601.05747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-flat-crease-patterns-with-thick-materials-1601.05747"/></url>
<url><loc>https://scifaro.com/en/abs/convex-arc-drawings-of-pseudolines-1601.06865</loc><lastmod>2016-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-arc-drawings-of-pseudolines-1601.06865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-arc-drawings-of-pseudolines-1601.06865"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-oracles-for-directed-transmission-graphs-1601.07797</loc><lastmod>2020-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-oracles-for-directed-transmission-graphs-1601.07797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-oracles-for-directed-transmission-graphs-1601.07797"/></url>
<url><loc>https://scifaro.com/en/abs/spanners-for-directed-transmission-graphs-1601.07798</loc><lastmod>2020-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanners-for-directed-transmission-graphs-1601.07798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanners-for-directed-transmission-graphs-1601.07798"/></url>
<url><loc>https://scifaro.com/en/abs/the-price-of-order-1602.00399</loc><lastmod>2016-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-price-of-order-1602.00399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-price-of-order-1602.00399"/></url>
<url><loc>https://scifaro.com/en/abs/distance-sensitive-planar-point-location-1602.00767</loc><lastmod>2016-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-sensitive-planar-point-location-1602.00767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-sensitive-planar-point-location-1602.00767"/></url>
<url><loc>https://scifaro.com/en/abs/c-planarity-of-embedded-cyclic-c-graphs-1602.01346</loc><lastmod>2016-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/c-planarity-of-embedded-cyclic-c-graphs-1602.01346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/c-planarity-of-embedded-cyclic-c-graphs-1602.01346"/></url>
<url><loc>https://scifaro.com/en/abs/random-distances-associated-with-arbitrary-polygons-an-algorithmic-approach-between-two-random-points-1602.03407</loc><lastmod>2016-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-distances-associated-with-arbitrary-polygons-an-algorithmic-approach-between-two-random-points-1602.03407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-distances-associated-with-arbitrary-polygons-an-algorithmic-approach-between-two-random-points-1602.03407"/></url>
<url><loc>https://scifaro.com/en/abs/higher-signature-delaunay-decompositions-1602.03865</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-signature-delaunay-decompositions-1602.03865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-signature-delaunay-decompositions-1602.03865"/></url>
<url><loc>https://scifaro.com/en/abs/on-metric-multi-covering-problems-1602.04152</loc><lastmod>2017-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-metric-multi-covering-problems-1602.04152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-metric-multi-covering-problems-1602.04152"/></url>
<url><loc>https://scifaro.com/en/abs/a-3d-sweep-hull-algorithm-for-computing-convex-hulls-and-delaunay-triangulation-1602.04707</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-3d-sweep-hull-algorithm-for-computing-convex-hulls-and-delaunay-triangulation-1602.04707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-3d-sweep-hull-algorithm-for-computing-convex-hulls-and-delaunay-triangulation-1602.04707"/></url>
<url><loc>https://scifaro.com/en/abs/faster-bottleneck-non-crossing-matchings-of-points-in-convex-position-1602.04922</loc><lastmod>2016-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-bottleneck-non-crossing-matchings-of-points-in-convex-position-1602.04922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-bottleneck-non-crossing-matchings-of-points-in-convex-position-1602.04922"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-density-of-non-simple-3-planar-graphs-1602.04995</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-density-of-non-simple-3-planar-graphs-1602.04995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-density-of-non-simple-3-planar-graphs-1602.04995"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-on-the-stretch-factor-of-y-4-1602.05481</loc><lastmod>2016-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-on-the-stretch-factor-of-y-4-1602.05481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-on-the-stretch-factor-of-y-4-1602.05481"/></url>
<url><loc>https://scifaro.com/en/abs/scaffoldings-and-spines-organizing-high-dimensional-data-using-cover-trees-local-principal-component-analysis-and-persistent-homology-1602.06245</loc><lastmod>2016-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scaffoldings-and-spines-organizing-high-dimensional-data-using-cover-trees-local-principal-component-analysis-and-persistent-homology-1602.06245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scaffoldings-and-spines-organizing-high-dimensional-data-using-cover-trees-local-principal-component-analysis-and-persistent-homology-1602.06245"/></url>
<url><loc>https://scifaro.com/en/abs/a-reduction-system-for-optimal-1-planar-graphs-1602.06407</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reduction-system-for-optimal-1-planar-graphs-1602.06407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reduction-system-for-optimal-1-planar-graphs-1602.06407"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-path-embeddings-of-graphs-on-surfaces-1602.06778</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-path-embeddings-of-graphs-on-surfaces-1602.06778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-path-embeddings-of-graphs-on-surfaces-1602.06778"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-lod-using-points-ordering-for-processing-and-visualisation-in-point-cloud-servers-1602.06920</loc><lastmod>2018-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-lod-using-points-ordering-for-processing-and-visualisation-in-point-cloud-servers-1602.06920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-lod-using-points-ordering-for-processing-and-visualisation-in-point-cloud-servers-1602.06920"/></url>
<url><loc>https://scifaro.com/en/abs/trapezoidal-diagrams-upward-triangulations-and-prime-catalan-numbers-1602.07235</loc><lastmod>2016-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trapezoidal-diagrams-upward-triangulations-and-prime-catalan-numbers-1602.07235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trapezoidal-diagrams-upward-triangulations-and-prime-catalan-numbers-1602.07235"/></url>
<url><loc>https://scifaro.com/en/abs/computing-pretropisms-for-the-cyclic-n-roots-problem-1602.07348</loc><lastmod>2016-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-pretropisms-for-the-cyclic-n-roots-problem-1602.07348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-pretropisms-for-the-cyclic-n-roots-problem-1602.07348"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-generalized-delaunay-graphs-are-plane-spanners-1602.07365</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-generalized-delaunay-graphs-are-plane-spanners-1602.07365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-generalized-delaunay-graphs-are-plane-spanners-1602.07365"/></url>
<url><loc>https://scifaro.com/en/abs/relating-graph-thickness-to-planar-layers-and-bend-complexity-1602.07816</loc><lastmod>2016-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-graph-thickness-to-planar-layers-and-bend-complexity-1602.07816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-graph-thickness-to-planar-layers-and-bend-complexity-1602.07816"/></url>
<url><loc>https://scifaro.com/en/abs/anchored-rectangle-and-square-packings-1603.00060</loc><lastmod>2016-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anchored-rectangle-and-square-packings-1603.00060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anchored-rectangle-and-square-packings-1603.00060"/></url>
<url><loc>https://scifaro.com/en/abs/colored-spanning-graphs-for-set-visualization-1603.00580</loc><lastmod>2016-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-spanning-graphs-for-set-visualization-1603.00580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-spanning-graphs-for-set-visualization-1603.00580"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-and-convex-hulls-in-2d-complexes-with-non-positive-curvature-1603.00847</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-and-convex-hulls-in-2d-complexes-with-non-positive-curvature-1603.00847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-and-convex-hulls-in-2d-complexes-with-non-positive-curvature-1603.00847"/></url>
<url><loc>https://scifaro.com/en/abs/position-paper-towards-an-observer-oriented-theory-of-shape-comparison-1603.02008</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/position-paper-towards-an-observer-oriented-theory-of-shape-comparison-1603.02008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/position-paper-towards-an-observer-oriented-theory-of-shape-comparison-1603.02008"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-cut-corners-and-get-bounded-convex-curvature-1603.02080</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-cut-corners-and-get-bounded-convex-curvature-1603.02080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-cut-corners-and-get-bounded-convex-curvature-1603.02080"/></url>
<url><loc>https://scifaro.com/en/abs/a-time-space-trade-off-for-computing-the-k-visibility-region-of-a-point-in-a-polygon-1603.02853</loc><lastmod>2019-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-time-space-trade-off-for-computing-the-k-visibility-region-of-a-point-in-a-polygon-1603.02853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-time-space-trade-off-for-computing-the-k-visibility-region-of-a-point-in-a-polygon-1603.02853"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-approximation-algorithms-for-polynomial-expansion-and-low-density-graphs-1603.03098</loc><lastmod>2016-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-approximation-algorithms-for-polynomial-expansion-and-low-density-graphs-1603.03098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-approximation-algorithms-for-polynomial-expansion-and-low-density-graphs-1603.03098"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-the-morley-trisector-and-various-theorems-with-realizability-computations-1603.03463</loc><lastmod>2016-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-the-morley-trisector-and-various-theorems-with-realizability-computations-1603.03463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-the-morley-trisector-and-various-theorems-with-realizability-computations-1603.03463"/></url>
<url><loc>https://scifaro.com/en/abs/degree-four-plane-spanners-simpler-and-better-1603.03818</loc><lastmod>2016-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-four-plane-spanners-simpler-and-better-1603.03818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-four-plane-spanners-simpler-and-better-1603.03818"/></url>
<url><loc>https://scifaro.com/en/abs/the-coherent-matching-distance-in-2d-persistent-homology-1603.03886</loc><lastmod>2016-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coherent-matching-distance-in-2d-persistent-homology-1603.03886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coherent-matching-distance-in-2d-persistent-homology-1603.03886"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-rigidity-of-incidence-systems-and-application-to-dictionary-learning-1603.04109</loc><lastmod>2016-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-rigidity-of-incidence-systems-and-application-to-dictionary-learning-1603.04109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-rigidity-of-incidence-systems-and-application-to-dictionary-learning-1603.04109"/></url>
<url><loc>https://scifaro.com/en/abs/the-runaway-rectangle-escape-problem-1603.04210</loc><lastmod>2016-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-runaway-rectangle-escape-problem-1603.04210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-runaway-rectangle-escape-problem-1603.04210"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-approximate-convex-hull-in-high-dimensions-1603.04422</loc><lastmod>2016-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-approximate-convex-hull-in-high-dimensions-1603.04422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-approximate-convex-hull-in-high-dimensions-1603.04422"/></url>
<url><loc>https://scifaro.com/en/abs/extraction-of-cylinders-and-cones-from-minimal-point-sets-1603.04582</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extraction-of-cylinders-and-cones-from-minimal-point-sets-1603.04582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extraction-of-cylinders-and-cones-from-minimal-point-sets-1603.04582"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-of-attractors-for-action-recognition-1603.05310</loc><lastmod>2016-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-of-attractors-for-action-recognition-1603.05310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-of-attractors-for-action-recognition-1603.05310"/></url>
<url><loc>https://scifaro.com/en/abs/abcdepth-efficient-algorithm-for-tukey-depth-1603.05609</loc><lastmod>2016-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abcdepth-efficient-algorithm-for-tukey-depth-1603.05609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abcdepth-efficient-algorithm-for-tukey-depth-1603.05609"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-graph-exploration-using-local-policies-1603.05944</loc><lastmod>2016-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-graph-exploration-using-local-policies-1603.05944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-graph-exploration-using-local-policies-1603.05944"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-hitting-set-for-segments-of-few-orientations-1603.06077</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-hitting-set-for-segments-of-few-orientations-1603.06077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-hitting-set-for-segments-of-few-orientations-1603.06077"/></url>
<url><loc>https://scifaro.com/en/abs/grouping-time-varying-data-for-interactive-exploration-1603.06252</loc><lastmod>2016-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grouping-time-varying-data-for-interactive-exploration-1603.06252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grouping-time-varying-data-for-interactive-exploration-1603.06252"/></url>
<url><loc>https://scifaro.com/en/abs/on-hamiltonian-alternating-cycles-and-paths-1603.06764</loc><lastmod>2017-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-hamiltonian-alternating-cycles-and-paths-1603.06764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-hamiltonian-alternating-cycles-and-paths-1603.06764"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-minimum-link-path-problems-1603.06972</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-minimum-link-path-problems-1603.06972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-minimum-link-path-problems-1603.06972"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-separability-of-stochastic-geometric-objects-with-applications-1603.07021</loc><lastmod>2016-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-separability-of-stochastic-geometric-objects-with-applications-1603.07021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-separability-of-stochastic-geometric-objects-with-applications-1603.07021"/></url>
<url><loc>https://scifaro.com/en/abs/computing-nonsimple-polygons-of-minimum-perimeter-1603.07077</loc><lastmod>2016-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-nonsimple-polygons-of-minimum-perimeter-1603.07077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-nonsimple-polygons-of-minimum-perimeter-1603.07077"/></url>
<url><loc>https://scifaro.com/en/abs/congruence-testing-of-point-sets-in-4-dimensions-1603.07269</loc><lastmod>2016-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congruence-testing-of-point-sets-in-4-dimensions-1603.07269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congruence-testing-of-point-sets-in-4-dimensions-1603.07269"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-incidence-bounds-in-point-covering-problems-1603.07282</loc><lastmod>2016-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-incidence-bounds-in-point-covering-problems-1603.07282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-incidence-bounds-in-point-covering-problems-1603.07282"/></url>
<url><loc>https://scifaro.com/en/abs/peeling-and-nibbling-the-cactus-subexponential-time-algorithms-for-counting-triangulations-and-related-problems-1603.07340</loc><lastmod>2016-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peeling-and-nibbling-the-cactus-subexponential-time-algorithms-for-counting-triangulations-and-related-problems-1603.07340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peeling-and-nibbling-the-cactus-subexponential-time-algorithms-for-counting-triangulations-and-related-problems-1603.07340"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-weakly-simple-polygons-1603.07401</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-weakly-simple-polygons-1603.07401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-weakly-simple-polygons-1603.07401"/></url>
<url><loc>https://scifaro.com/en/abs/the-planar-tree-packing-theorem-1603.07737</loc><lastmod>2016-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-planar-tree-packing-theorem-1603.07737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-planar-tree-packing-theorem-1603.07737"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-hardness-of-art-gallery-problems-1603.08116</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-hardness-of-art-gallery-problems-1603.08116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-hardness-of-art-gallery-problems-1603.08116"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-voronoi-diagrams-1603.08485</loc><lastmod>2016-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-voronoi-diagrams-1603.08485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-voronoi-diagrams-1603.08485"/></url>
<url><loc>https://scifaro.com/en/abs/high-dimensional-approximate-nearest-neighbor-k-d-generalized-randomized-forests-1603.09596</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-dimensional-approximate-nearest-neighbor-k-d-generalized-randomized-forests-1603.09596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-dimensional-approximate-nearest-neighbor-k-d-generalized-randomized-forests-1603.09596"/></url>
<url><loc>https://scifaro.com/en/abs/counting-blanks-in-polygonal-arrangements-1604.00960</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-blanks-in-polygonal-arrangements-1604.00960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-blanks-in-polygonal-arrangements-1604.00960"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-combinatorial-complexity-of-approximating-polytopes-1604.01175</loc><lastmod>2018-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-combinatorial-complexity-of-approximating-polytopes-1604.01175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-combinatorial-complexity-of-approximating-polytopes-1604.01175"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-polytope-membership-queries-1604.01183</loc><lastmod>2018-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-polytope-membership-queries-1604.01183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-polytope-membership-queries-1604.01183"/></url>
<url><loc>https://scifaro.com/en/abs/s-hull-a-fast-radial-sweep-hull-routine-for-delaunay-triangulation-1604.01428</loc><lastmod>2016-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/s-hull-a-fast-radial-sweep-hull-routine-for-delaunay-triangulation-1604.01428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/s-hull-a-fast-radial-sweep-hull-routine-for-delaunay-triangulation-1604.01428"/></url>
<url><loc>https://scifaro.com/en/abs/fast-1-epsilon-approximation-of-the-l-owner-extremal-matrices-of-high-dimensional-symmetric-matrices-1604.01592</loc><lastmod>2016-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-1-epsilon-approximation-of-the-l-owner-extremal-matrices-of-high-dimensional-symmetric-matrices-1604.01592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-1-epsilon-approximation-of-the-l-owner-extremal-matrices-of-high-dimensional-symmetric-matrices-1604.01592"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-equivalence-between-voronoi-medusa-and-delaunay-medusa-1604.03302</loc><lastmod>2016-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-equivalence-between-voronoi-medusa-and-delaunay-medusa-1604.03302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-equivalence-between-voronoi-medusa-and-delaunay-medusa-1604.03302"/></url>
<url><loc>https://scifaro.com/en/abs/straight-skeletons-with-additive-and-multiplicative-weights-and-their-application-to-the-algorithmic-generation-of-roofs-and-terrains-1604.03362</loc><lastmod>2016-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straight-skeletons-with-additive-and-multiplicative-weights-and-their-application-to-the-algorithmic-generation-of-roofs-and-terrains-1604.03362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straight-skeletons-with-additive-and-multiplicative-weights-and-their-application-to-the-algorithmic-generation-of-roofs-and-terrains-1604.03362"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-computation-of-polynomial-amoebas-1604.03603</loc><lastmod>2016-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-computation-of-polynomial-amoebas-1604.03603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-computation-of-polynomial-amoebas-1604.03603"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-planar-voronoi-diagrams-for-general-distance-functions-and-their-algorithmic-applications-1604.03654</loc><lastmod>2020-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-planar-voronoi-diagrams-for-general-distance-functions-and-their-algorithmic-applications-1604.03654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-planar-voronoi-diagrams-for-general-distance-functions-and-their-algorithmic-applications-1604.03654"/></url>
<url><loc>https://scifaro.com/en/abs/a-parallel-solution-to-finding-nodal-neighbors-in-generic-meshes-1604.04689</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parallel-solution-to-finding-nodal-neighbors-in-generic-meshes-1604.04689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parallel-solution-to-finding-nodal-neighbors-in-generic-meshes-1604.04689"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-max-morse-matching-1604.04707</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-max-morse-matching-1604.04707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-max-morse-matching-1604.04707"/></url>
<url><loc>https://scifaro.com/en/abs/counting-and-enumerating-crossing-free-geometric-graphs-1604.05350</loc><lastmod>2016-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-and-enumerating-crossing-free-geometric-graphs-1604.05350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-and-enumerating-crossing-free-geometric-graphs-1604.05350"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-online-escape-path-against-a-certificate-1604.05972</loc><lastmod>2016-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-online-escape-path-against-a-certificate-1604.05972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-online-escape-path-against-a-certificate-1604.05972"/></url>
<url><loc>https://scifaro.com/en/abs/on-guarding-orthogonal-polygons-with-sliding-cameras-1604.07099</loc><lastmod>2016-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-guarding-orthogonal-polygons-with-sliding-cameras-1604.07099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-guarding-orthogonal-polygons-with-sliding-cameras-1604.07099"/></url>
<url><loc>https://scifaro.com/en/abs/on-r-guarding-thin-orthogonal-polygons-1604.07100</loc><lastmod>2016-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-r-guarding-thin-orthogonal-polygons-1604.07100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-r-guarding-thin-orthogonal-polygons-1604.07100"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-compression-of-a-polyline-with-segments-and-arcs-1604.07476</loc><lastmod>2017-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-compression-of-a-polyline-with-segments-and-arcs-1604.07476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-compression-of-a-polyline-with-segments-and-arcs-1604.07476"/></url>
<url><loc>https://scifaro.com/en/abs/relative-convex-hull-determination-from-convex-hulls-in-the-plane-1604.08698</loc><lastmod>2016-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-convex-hull-determination-from-convex-hulls-in-the-plane-1604.08698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-convex-hull-determination-from-convex-hulls-in-the-plane-1604.08698"/></url>
<url><loc>https://scifaro.com/en/abs/ortho-polygon-visibility-representations-of-embedded-graphs-1604.08797</loc><lastmod>2017-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ortho-polygon-visibility-representations-of-embedded-graphs-1604.08797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ortho-polygon-visibility-representations-of-embedded-graphs-1604.08797"/></url>
<url><loc>https://scifaro.com/en/abs/stabbing-line-segments-with-disks-complexity-and-approximation-algorithms-1605.00313</loc><lastmod>2018-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabbing-line-segments-with-disks-complexity-and-approximation-algorithms-1605.00313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabbing-line-segments-with-disks-complexity-and-approximation-algorithms-1605.00313"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchical-modeling-of-multidimensional-data-in-regularly-decomposed-spaces-implementation-on-computer-1605.00967</loc><lastmod>2016-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchical-modeling-of-multidimensional-data-in-regularly-decomposed-spaces-implementation-on-computer-1605.00967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchical-modeling-of-multidimensional-data-in-regularly-decomposed-spaces-implementation-on-computer-1605.00967"/></url>
<url><loc>https://scifaro.com/en/abs/real-time-collision-detection-method-for-deformable-bodies-1605.02245</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-time-collision-detection-method-for-deformable-bodies-1605.02245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-time-collision-detection-method-for-deformable-bodies-1605.02245"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-dominating-set-and-set-cover-via-local-search-1605.02499</loc><lastmod>2022-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-dominating-set-and-set-cover-via-local-search-1605.02499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-dominating-set-and-set-cover-via-local-search-1605.02499"/></url>
<url><loc>https://scifaro.com/en/abs/low-order-continuous-finite-element-spaces-on-hybrid-non-conforming-hexahedral-tetrahedral-meshes-1605.02626</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-order-continuous-finite-element-spaces-on-hybrid-non-conforming-hexahedral-tetrahedral-meshes-1605.02626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-order-continuous-finite-element-spaces-on-hybrid-non-conforming-hexahedral-tetrahedral-meshes-1605.02626"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-2-approximation-algorithm-for-guarding-orthogonal-terrains-1605.03271</loc><lastmod>2016-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-2-approximation-algorithm-for-guarding-orthogonal-terrains-1605.03271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-2-approximation-algorithm-for-guarding-orthogonal-terrains-1605.03271"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-constant-factor-approximation-algorithm-for-planar-visibility-counting-problem-1605.03542</loc><lastmod>2016-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-constant-factor-approximation-algorithm-for-planar-visibility-counting-problem-1605.03542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-constant-factor-approximation-algorithm-for-planar-visibility-counting-problem-1605.03542"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-system-of-coordinates-for-the-tilings-p-3-and-p-2-4-1605.03753</loc><lastmod>2016-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-system-of-coordinates-for-the-tilings-p-3-and-p-2-4-1605.03753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-system-of-coordinates-for-the-tilings-p-3-and-p-2-4-1605.03753"/></url>
<url><loc>https://scifaro.com/en/abs/rational-b-ezier-curves-approximated-by-bernstein-jacobi-hybrid-polynomial-curves-1605.04156</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-b-ezier-curves-approximated-by-bernstein-jacobi-hybrid-polynomial-curves-1605.04156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-b-ezier-curves-approximated-by-bernstein-jacobi-hybrid-polynomial-curves-1605.04156"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-framework-for-labeling-road-maps-1605.04265</loc><lastmod>2016-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-framework-for-labeling-road-maps-1605.04265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-framework-for-labeling-road-maps-1605.04265"/></url>
<url><loc>https://scifaro.com/en/abs/boundary-modeling-in-model-based-calibration-for-automotive-engines-via-the-vertex-representation-of-the-convex-hulls-1605.04552</loc><lastmod>2017-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boundary-modeling-in-model-based-calibration-for-automotive-engines-via-the-vertex-representation-of-the-convex-hulls-1605.04552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boundary-modeling-in-model-based-calibration-for-automotive-engines-via-the-vertex-representation-of-the-convex-hulls-1605.04552"/></url>
<url><loc>https://scifaro.com/en/abs/partitions-of-planar-point-sets-into-polygons-1605.05546</loc><lastmod>2016-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitions-of-planar-point-sets-into-polygons-1605.05546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitions-of-planar-point-sets-into-polygons-1605.05546"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-precision-to-sort-line-quadric-intersections-1605.05629</loc><lastmod>2016-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-precision-to-sort-line-quadric-intersections-1605.05629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-precision-to-sort-line-quadric-intersections-1605.05629"/></url>
<url><loc>https://scifaro.com/en/abs/new-tools-in-geogebra-offering-novel-opportunities-to-teach-loci-and-envelopes-1605.09153</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-tools-in-geogebra-offering-novel-opportunities-to-teach-loci-and-envelopes-1605.09153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-tools-in-geogebra-offering-novel-opportunities-to-teach-loci-and-envelopes-1605.09153"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-area-requirement-of-euclidean-greedy-embeddings-of-christmas-cactus-graphs-1605.09244</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-area-requirement-of-euclidean-greedy-embeddings-of-christmas-cactus-graphs-1605.09244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-area-requirement-of-euclidean-greedy-embeddings-of-christmas-cactus-graphs-1605.09244"/></url>
<url><loc>https://scifaro.com/en/abs/feature-extraction-from-segmentations-of-neuromuscular-junctions-1605.09250</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feature-extraction-from-segmentations-of-neuromuscular-junctions-1605.09250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feature-extraction-from-segmentations-of-neuromuscular-junctions-1605.09250"/></url>
<url><loc>https://scifaro.com/en/abs/nearest-neighbor-searching-under-uncertainty-ii-1606.00112</loc><lastmod>2016-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearest-neighbor-searching-under-uncertainty-ii-1606.00112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearest-neighbor-searching-under-uncertainty-ii-1606.00112"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-morph-planar-graph-drawings-1606.00425</loc><lastmod>2016-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-morph-planar-graph-drawings-1606.00425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-morph-planar-graph-drawings-1606.00425"/></url>
<url><loc>https://scifaro.com/en/abs/conforming-restricted-delaunay-mesh-generation-for-piecewise-smooth-complexes-1606.01289</loc><lastmod>2016-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conforming-restricted-delaunay-mesh-generation-for-piecewise-smooth-complexes-1606.01289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conforming-restricted-delaunay-mesh-generation-for-piecewise-smooth-complexes-1606.01289"/></url>
<url><loc>https://scifaro.com/en/abs/from-constrained-delaunay-triangulations-to-roadmap-graphs-with-arbitrary-clearance-1606.02055</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-constrained-delaunay-triangulations-to-roadmap-graphs-with-arbitrary-clearance-1606.02055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-constrained-delaunay-triangulations-to-roadmap-graphs-with-arbitrary-clearance-1606.02055"/></url>
<url><loc>https://scifaro.com/en/abs/non-aligned-drawings-of-planar-graphs-1606.02220</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-aligned-drawings-of-planar-graphs-1606.02220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-aligned-drawings-of-planar-graphs-1606.02220"/></url>
<url><loc>https://scifaro.com/en/abs/order-preserving-drawings-of-trees-with-approximately-optimal-height-and-small-width-1606.02233</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-preserving-drawings-of-trees-with-approximately-optimal-height-and-small-width-1606.02233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-preserving-drawings-of-trees-with-approximately-optimal-height-and-small-width-1606.02233"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-the-almost-convex-set-in-an-integer-grid-of-minimum-size-1606.02328</loc><lastmod>2016-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-the-almost-convex-set-in-an-integer-grid-of-minimum-size-1606.02328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-the-almost-convex-set-in-an-integer-grid-of-minimum-size-1606.02328"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-helps-to-compare-persistence-diagrams-1606.03357</loc><lastmod>2016-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-helps-to-compare-persistence-diagrams-1606.03357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-helps-to-compare-persistence-diagrams-1606.03357"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-rectilinear-crossing-number-1606.03753</loc><lastmod>2016-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-rectilinear-crossing-number-1606.03753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-rectilinear-crossing-number-1606.03753"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-planar-graphs-with-many-collinear-vertices-1606.03890</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-many-collinear-vertices-1606.03890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-many-collinear-vertices-1606.03890"/></url>
<url><loc>https://scifaro.com/en/abs/problems-on-one-way-road-networks-1606.04334</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/problems-on-one-way-road-networks-1606.04334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/problems-on-one-way-road-networks-1606.04334"/></url>
<url><loc>https://scifaro.com/en/abs/discretized-approaches-to-schematization-1606.06488</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discretized-approaches-to-schematization-1606.06488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discretized-approaches-to-schematization-1606.06488"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-accurate-normalization-of-vectors-and-quaternions-1606.06508</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-accurate-normalization-of-vectors-and-quaternions-1606.06508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-accurate-normalization-of-vectors-and-quaternions-1606.06508"/></url>
<url><loc>https://scifaro.com/en/abs/mapping-polygons-to-the-grid-with-small-hausdorff-and-fr-echet-distance-1606.06660</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mapping-polygons-to-the-grid-with-small-hausdorff-and-fr-echet-distance-1606.06660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mapping-polygons-to-the-grid-with-small-hausdorff-and-fr-echet-distance-1606.06660"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-rectilinear-polygons-for-given-angle-sequences-1606.06940</loc><lastmod>2022-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-rectilinear-polygons-for-given-angle-sequences-1606.06940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-rectilinear-polygons-for-given-angle-sequences-1606.06940"/></url>
<url><loc>https://scifaro.com/en/abs/faster-coreset-construction-for-projective-clustering-via-low-rank-approximation-1606.07992</loc><lastmod>2018-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-coreset-construction-for-projective-clustering-via-low-rank-approximation-1606.07992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-coreset-construction-for-projective-clustering-via-low-rank-approximation-1606.07992"/></url>
<url><loc>https://scifaro.com/en/abs/searching-with-advice-robot-fence-jumping-1606.08023</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-with-advice-robot-fence-jumping-1606.08023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-with-advice-robot-fence-jumping-1606.08023"/></url>
<url><loc>https://scifaro.com/en/abs/towards-plane-spanners-of-degree-3-1606.08824</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-plane-spanners-of-degree-3-1606.08824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-plane-spanners-of-degree-3-1606.08824"/></url>
<url><loc>https://scifaro.com/en/abs/three-dimensional-graph-drawing-with-fixed-vertices-and-one-bend-per-edge-1606.09188</loc><lastmod>2016-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-dimensional-graph-drawing-with-fixed-vertices-and-one-bend-per-edge-1606.09188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-dimensional-graph-drawing-with-fixed-vertices-and-one-bend-per-edge-1606.09188"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-total-movement-for-movement-to-independence-problem-on-a-line-1606.09596</loc><lastmod>2016-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-total-movement-for-movement-to-independence-problem-on-a-line-1606.09596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-total-movement-for-movement-to-independence-problem-on-a-line-1606.09596"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-range-search-on-multidimensional-points-1607.00208</loc><lastmod>2016-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-range-search-on-multidimensional-points-1607.00208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-range-search-on-multidimensional-points-1607.00208"/></url>
<url><loc>https://scifaro.com/en/abs/obstructing-visibilities-with-one-obstacle-1607.00278</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obstructing-visibilities-with-one-obstacle-1607.00278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obstructing-visibilities-with-one-obstacle-1607.00278"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-nets-of-polyhedra-1607.00538</loc><lastmod>2016-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-nets-of-polyhedra-1607.00538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-nets-of-polyhedra-1607.00538"/></url>
<url><loc>https://scifaro.com/en/abs/new-error-measures-and-methods-for-realizing-protein-graphs-from-distance-data-1607.00868</loc><lastmod>2016-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-error-measures-and-methods-for-realizing-protein-graphs-from-distance-data-1607.00868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-error-measures-and-methods-for-realizing-protein-graphs-from-distance-data-1607.00868"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-graphs-on-few-lines-and-few-planes-1607.01196</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-graphs-on-few-lines-and-few-planes-1607.01196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-graphs-on-few-lines-and-few-planes-1607.01196"/></url>
<url><loc>https://scifaro.com/en/abs/singular-persistent-homology-with-geometrically-parallelizable-computation-1607.01257</loc><lastmod>2020-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/singular-persistent-homology-with-geometrically-parallelizable-computation-1607.01257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/singular-persistent-homology-with-geometrically-parallelizable-computation-1607.01257"/></url>
<url><loc>https://scifaro.com/en/abs/essential-constraints-of-edge-constrained-proximity-graphs-1607.01294</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/essential-constraints-of-edge-constrained-proximity-graphs-1607.01294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/essential-constraints-of-edge-constrained-proximity-graphs-1607.01294"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-robust-mesh-generation-on-the-sphere-application-to-coastal-domains-1607.02052</loc><lastmod>2016-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-robust-mesh-generation-on-the-sphere-application-to-coastal-domains-1607.02052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-robust-mesh-generation-on-the-sphere-application-to-coastal-domains-1607.02052"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-the-sum-of-radii-of-disjoint-balls-or-disks-1607.02184</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-the-sum-of-radii-of-disjoint-balls-or-disks-1607.02184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-the-sum-of-radii-of-disjoint-balls-or-disks-1607.02184"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-realizing-facial-cycles-1607.02347</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-realizing-facial-cycles-1607.02347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-realizing-facial-cycles-1607.02347"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-based-bottleneck-pathfinding-with-applications-to-frechet-matching-1607.02770</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-based-bottleneck-pathfinding-with-applications-to-frechet-matching-1607.02770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-based-bottleneck-pathfinding-with-applications-to-frechet-matching-1607.02770"/></url>
<url><loc>https://scifaro.com/en/abs/clearing-an-orthogonal-polygon-using-sliding-robots-1607.03039</loc><lastmod>2016-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clearing-an-orthogonal-polygon-using-sliding-robots-1607.03039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clearing-an-orthogonal-polygon-using-sliding-robots-1607.03039"/></url>
<url><loc>https://scifaro.com/en/abs/rooted-uniform-monotone-minimum-spanning-trees-1607.03338</loc><lastmod>2017-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rooted-uniform-monotone-minimum-spanning-trees-1607.03338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rooted-uniform-monotone-minimum-spanning-trees-1607.03338"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-minimum-length-coordinated-motions-for-two-discs-1607.04005</loc><lastmod>2017-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-minimum-length-coordinated-motions-for-two-discs-1607.04005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-minimum-length-coordinated-motions-for-two-discs-1607.04005"/></url>
<url><loc>https://scifaro.com/en/abs/the-decision-tree-complexity-for-k-sum-is-at-most-nearly-quadratic-1607.04336</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-decision-tree-complexity-for-k-sum-is-at-most-nearly-quadratic-1607.04336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-decision-tree-complexity-for-k-sum-is-at-most-nearly-quadratic-1607.04336"/></url>
<url><loc>https://scifaro.com/en/abs/high-dimensional-approximate-r-nets-1607.04755</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-dimensional-approximate-r-nets-1607.04755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-dimensional-approximate-r-nets-1607.04755"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-k-center-and-j-flat-center-problems-1607.04989</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-k-center-and-j-flat-center-problems-1607.04989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-k-center-and-j-flat-center-problems-1607.04989"/></url>
<url><loc>https://scifaro.com/en/abs/critical-placements-of-a-square-or-circle-amidst-trajectories-for-junction-detection-1607.05347</loc><lastmod>2016-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-placements-of-a-square-or-circle-amidst-trajectories-for-junction-detection-1607.05347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-placements-of-a-square-or-circle-amidst-trajectories-for-junction-detection-1607.05347"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximation-algorithm-for-the-art-gallery-problem-1607.05527</loc><lastmod>2016-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-the-art-gallery-problem-1607.05527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximation-algorithm-for-the-art-gallery-problem-1607.05527"/></url>
<url><loc>https://scifaro.com/en/abs/fast-algorithms-for-diameter-optimally-augmenting-paths-and-trees-1607.05547</loc><lastmod>2016-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-algorithms-for-diameter-optimally-augmenting-paths-and-trees-1607.05547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-algorithms-for-diameter-optimally-augmenting-paths-and-trees-1607.05547"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-of-triangulation-duals-of-simple-polygons-with-and-without-holes-1607.05739</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-of-triangulation-duals-of-simple-polygons-with-and-without-holes-1607.05739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-of-triangulation-duals-of-simple-polygons-with-and-without-holes-1607.05739"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-uncertainty-through-sensor-placement-with-angle-constraints-1607.05791</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-uncertainty-through-sensor-placement-with-angle-constraints-1607.05791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-uncertainty-through-sensor-placement-with-angle-constraints-1607.05791"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-geodesic-centers-of-polygonal-domains-1607.05824</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-geodesic-centers-of-polygonal-domains-1607.05824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-geodesic-centers-of-polygonal-domains-1607.05824"/></url>
<url><loc>https://scifaro.com/en/abs/eliminating-depth-cycles-among-triangles-in-three-dimensions-1607.06136</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eliminating-depth-cycles-among-triangles-in-three-dimensions-1607.06136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eliminating-depth-cycles-among-triangles-in-three-dimensions-1607.06136"/></url>
<url><loc>https://scifaro.com/en/abs/topological-data-analysis-with-bregman-divergences-1607.06274</loc><lastmod>2016-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-data-analysis-with-bregman-divergences-1607.06274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-data-analysis-with-bregman-divergences-1607.06274"/></url>
<url><loc>https://scifaro.com/en/abs/solving-equations-and-optimization-problems-with-uncertainty-1607.06344</loc><lastmod>2017-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-equations-and-optimization-problems-with-uncertainty-1607.06344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-equations-and-optimization-problems-with-uncertainty-1607.06344"/></url>
<url><loc>https://scifaro.com/en/abs/an-interesting-gadget-for-chain-pair-simplification-1607.06539</loc><lastmod>2016-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interesting-gadget-for-chain-pair-simplification-1607.06539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interesting-gadget-for-chain-pair-simplification-1607.06539"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-schemes-for-geometric-coverage-problems-1607.06665</loc><lastmod>2017-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-schemes-for-geometric-coverage-problems-1607.06665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-schemes-for-geometric-coverage-problems-1607.06665"/></url>
<url><loc>https://scifaro.com/en/abs/covering-segments-with-unit-squares-1607.07256</loc><lastmod>2016-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-segments-with-unit-squares-1607.07256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-segments-with-unit-squares-1607.07256"/></url>
<url><loc>https://scifaro.com/en/abs/sliding-k-transmitters-hardness-and-approximation-1607.07364</loc><lastmod>2016-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sliding-k-transmitters-hardness-and-approximation-1607.07364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sliding-k-transmitters-hardness-and-approximation-1607.07364"/></url>
<url><loc>https://scifaro.com/en/abs/unique-set-cover-on-unit-disks-and-unit-squares-1607.07378</loc><lastmod>2016-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-set-cover-on-unit-disks-and-unit-squares-1607.07378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-set-cover-on-unit-disks-and-unit-squares-1607.07378"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-convex-polyhedra-via-radially-monotone-cut-trees-1607.07421</loc><lastmod>2016-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-convex-polyhedra-via-radially-monotone-cut-trees-1607.07421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-convex-polyhedra-via-radially-monotone-cut-trees-1607.07421"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-representation-for-filtrations-of-simplicial-complexes-1607.08449</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-representation-for-filtrations-of-simplicial-complexes-1607.08449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-representation-for-filtrations-of-simplicial-complexes-1607.08449"/></url>
<url><loc>https://scifaro.com/en/abs/adapting-polytopes-dimension-for-managing-degrees-of-freedom-in-tolerancing-analysis-1607.08809</loc><lastmod>2016-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adapting-polytopes-dimension-for-managing-degrees-of-freedom-in-tolerancing-analysis-1607.08809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adapting-polytopes-dimension-for-managing-degrees-of-freedom-in-tolerancing-analysis-1607.08809"/></url>
<url><loc>https://scifaro.com/en/abs/an-exact-cache-localized-algorithm-for-the-sub-quadratic-convolution-of-hypercubes-1608.00206</loc><lastmod>2016-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exact-cache-localized-algorithm-for-the-sub-quadratic-convolution-of-hypercubes-1608.00206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exact-cache-localized-algorithm-for-the-sub-quadratic-convolution-of-hypercubes-1608.00206"/></url>
<url><loc>https://scifaro.com/en/abs/universal-shape-replicators-via-self-assembly-with-attractive-and-repulsive-forces-1608.00477</loc><lastmod>2016-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-shape-replicators-via-self-assembly-with-attractive-and-repulsive-forces-1608.00477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-shape-replicators-via-self-assembly-with-attractive-and-repulsive-forces-1608.00477"/></url>
<url><loc>https://scifaro.com/en/abs/fast-spherical-quasiconformal-parameterization-of-genus-0-closed-surfaces-with-application-to-adaptive-remeshing-1608.01140</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-spherical-quasiconformal-parameterization-of-genus-0-closed-surfaces-with-application-to-adaptive-remeshing-1608.01140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-spherical-quasiconformal-parameterization-of-genus-0-closed-surfaces-with-application-to-adaptive-remeshing-1608.01140"/></url>
<url><loc>https://scifaro.com/en/abs/retinal-vessel-segmentation-using-a-new-topological-method-1608.01339</loc><lastmod>2016-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retinal-vessel-segmentation-using-a-new-topological-method-1608.01339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retinal-vessel-segmentation-using-a-new-topological-method-1608.01339"/></url>
<url><loc>https://scifaro.com/en/abs/the-rainbow-at-the-end-of-the-line-a-ppad-formulation-of-the-colorful-carath-eodory-theorem-with-applications-1608.01921</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rainbow-at-the-end-of-the-line-a-ppad-formulation-of-the-colorful-carath-eodory-theorem-with-applications-1608.01921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rainbow-at-the-end-of-the-line-a-ppad-formulation-of-the-colorful-carath-eodory-theorem-with-applications-1608.01921"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-graphs-into-embedded-graphs-1608.02087</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-graphs-into-embedded-graphs-1608.02087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-graphs-into-embedded-graphs-1608.02087"/></url>
<url><loc>https://scifaro.com/en/abs/node-overlap-removal-by-growing-a-tree-1608.02653</loc><lastmod>2016-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/node-overlap-removal-by-growing-a-tree-1608.02653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/node-overlap-removal-by-growing-a-tree-1608.02653"/></url>
<url><loc>https://scifaro.com/en/abs/universal-simulation-of-directed-systems-in-the-abstract-tile-assembly-model-requires-undirectedness-1608.03036</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-simulation-of-directed-systems-in-the-abstract-tile-assembly-model-requires-undirectedness-1608.03036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-simulation-of-directed-systems-in-the-abstract-tile-assembly-model-requires-undirectedness-1608.03036"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-closest-pair-via-polar-pair-of-point-sets-1608.03245</loc><lastmod>2018-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-closest-pair-via-polar-pair-of-point-sets-1608.03245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-closest-pair-via-polar-pair-of-point-sets-1608.03245"/></url>
<url><loc>https://scifaro.com/en/abs/the-1-1-r-centroid-problem-on-the-plane-1608.03680</loc><lastmod>2016-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-1-1-r-centroid-problem-on-the-plane-1608.03680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-1-1-r-centroid-problem-on-the-plane-1608.03680"/></url>
<url><loc>https://scifaro.com/en/abs/self-assembly-of-shapes-at-constant-scale-using-repulsive-forces-1608.04791</loc><lastmod>2016-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-assembly-of-shapes-at-constant-scale-using-repulsive-forces-1608.04791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-assembly-of-shapes-at-constant-scale-using-repulsive-forces-1608.04791"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-paths-in-geometric-triangulations-1608.04812</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-paths-in-geometric-triangulations-1608.04812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-paths-in-geometric-triangulations-1608.04812"/></url>
<url><loc>https://scifaro.com/en/abs/computing-zigzag-persistent-cohomology-1608.06039</loc><lastmod>2016-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-zigzag-persistent-cohomology-1608.06039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-zigzag-persistent-cohomology-1608.06039"/></url>
<url><loc>https://scifaro.com/en/abs/stack-and-queue-layouts-via-layered-separators-1608.06458</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stack-and-queue-layouts-via-layered-separators-1608.06458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stack-and-queue-layouts-via-layered-separators-1608.06458"/></url>
<url><loc>https://scifaro.com/en/abs/multi-colored-spanning-graphs-1608.07056</loc><lastmod>2016-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-colored-spanning-graphs-1608.07056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-colored-spanning-graphs-1608.07056"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-colourful-simplicial-depth-and-medians-in-the-plane-1608.07348</loc><lastmod>2016-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-colourful-simplicial-depth-and-medians-in-the-plane-1608.07348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-colourful-simplicial-depth-and-medians-in-the-plane-1608.07348"/></url>
<url><loc>https://scifaro.com/en/abs/re-embedding-a-1-plane-graph-into-a-straight-line-drawing-in-linear-time-1608.07662</loc><lastmod>2016-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/re-embedding-a-1-plane-graph-into-a-straight-line-drawing-in-linear-time-1608.07662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/re-embedding-a-1-plane-graph-into-a-straight-line-drawing-in-linear-time-1608.07662"/></url>
<url><loc>https://scifaro.com/en/abs/a-direct-proof-of-the-strong-hanani-tutte-theorem-on-the-projective-plane-1608.07855</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-direct-proof-of-the-strong-hanani-tutte-theorem-on-the-projective-plane-1608.07855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-direct-proof-of-the-strong-hanani-tutte-theorem-on-the-projective-plane-1608.07855"/></url>
<url><loc>https://scifaro.com/en/abs/the-bundled-crossing-number-1608.08161</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bundled-crossing-number-1608.08161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bundled-crossing-number-1608.08161"/></url>
<url><loc>https://scifaro.com/en/abs/topological-drawings-of-complete-bipartite-graphs-1608.08324</loc><lastmod>2017-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-drawings-of-complete-bipartite-graphs-1608.08324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-drawings-of-complete-bipartite-graphs-1608.08324"/></url>
<url><loc>https://scifaro.com/en/abs/offline-drawing-of-dynamic-trees-algorithmics-and-document-integration-1608.08385</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/offline-drawing-of-dynamic-trees-algorithmics-and-document-integration-1608.08385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/offline-drawing-of-dynamic-trees-algorithmics-and-document-integration-1608.08385"/></url>
<url><loc>https://scifaro.com/en/abs/1-bend-rac-drawings-of-1-planar-graphs-1608.08418</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-bend-rac-drawings-of-1-planar-graphs-1608.08418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-bend-rac-drawings-of-1-planar-graphs-1608.08418"/></url>
<url><loc>https://scifaro.com/en/abs/1-bend-upward-planar-drawings-of-sp-digraphs-1608.08425</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-bend-upward-planar-drawings-of-sp-digraphs-1608.08425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-bend-upward-planar-drawings-of-sp-digraphs-1608.08425"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-orthogonal-planarity-1608.08427</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-orthogonal-planarity-1608.08427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-orthogonal-planarity-1608.08427"/></url>
<url><loc>https://scifaro.com/en/abs/hanani-tutte-for-radial-planarity-ii-1608.08662</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hanani-tutte-for-radial-planarity-ii-1608.08662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hanani-tutte-for-radial-planarity-ii-1608.08662"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-simultaneous-embeddings-of-paths-in-r-d-1608.08791</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-simultaneous-embeddings-of-paths-in-r-d-1608.08791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-simultaneous-embeddings-of-paths-in-r-d-1608.08791"/></url>
<url><loc>https://scifaro.com/en/abs/snapping-graph-drawings-to-the-grid-optimally-1608.08844</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/snapping-graph-drawings-to-the-grid-optimally-1608.08844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/snapping-graph-drawings-to-the-grid-optimally-1608.08844"/></url>
<url><loc>https://scifaro.com/en/abs/gabriel-triangulations-and-angle-monotone-graphs-local-routing-and-recognition-1608.08892</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gabriel-triangulations-and-angle-monotone-graphs-local-routing-and-recognition-1608.08892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gabriel-triangulations-and-angle-monotone-graphs-local-routing-and-recognition-1608.08892"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-representations-of-boxes-in-2-5-dimensions-1608.08899</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-representations-of-boxes-in-2-5-dimensions-1608.08899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-representations-of-boxes-in-2-5-dimensions-1608.08899"/></url>
<url><loc>https://scifaro.com/en/abs/a-sparse-stress-model-1608.08909</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sparse-stress-model-1608.08909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sparse-stress-model-1608.08909"/></url>
<url><loc>https://scifaro.com/en/abs/computing-nodetrix-representations-of-clustered-graphs-1608.08952</loc><lastmod>2016-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-nodetrix-representations-of-clustered-graphs-1608.08952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-nodetrix-representations-of-clustered-graphs-1608.08952"/></url>
<url><loc>https://scifaro.com/en/abs/block-crossings-in-storyline-visualizations-1609.00321</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/block-crossings-in-storyline-visualizations-1609.00321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/block-crossings-in-storyline-visualizations-1609.00321"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-1-center-of-a-set-of-static-and-mobile-points-1609.00523</loc><lastmod>2016-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-1-center-of-a-set-of-static-and-mobile-points-1609.00523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-1-center-of-a-set-of-static-and-mobile-points-1609.00523"/></url>
<url><loc>https://scifaro.com/en/abs/peacock-bundles-bundle-coloring-for-graphs-with-globality-locality-trade-off-1609.00719</loc><lastmod>2016-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peacock-bundles-bundle-coloring-for-graphs-with-globality-locality-trade-off-1609.00719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peacock-bundles-bundle-coloring-for-graphs-with-globality-locality-trade-off-1609.00719"/></url>
<url><loc>https://scifaro.com/en/abs/updating-the-number-of-crossings-in-rectilinear-drawings-of-the-complete-graph-1609.00867</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/updating-the-number-of-crossings-in-rectilinear-drawings-of-the-complete-graph-1609.00867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/updating-the-number-of-crossings-in-rectilinear-drawings-of-the-complete-graph-1609.00867"/></url>
<url><loc>https://scifaro.com/en/abs/robust-computation-of-a-minimum-area-convex-polygon-stabber-of-a-set-of-isothetic-line-segments-1609.01662</loc><lastmod>2016-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-computation-of-a-minimum-area-convex-polygon-stabber-of-a-set-of-isothetic-line-segments-1609.01662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-computation-of-a-minimum-area-convex-polygon-stabber-of-a-set-of-isothetic-line-segments-1609.01662"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-24th-international-symposium-on-graph-drawing-and-network-visualization-gd-2016-1609.02443</loc><lastmod>2016-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-24th-international-symposium-on-graph-drawing-and-network-visualization-gd-2016-1609.02443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-24th-international-symposium-on-graph-drawing-and-network-visualization-gd-2016-1609.02443"/></url>
<url><loc>https://scifaro.com/en/abs/color-spanning-annulus-square-rectangle-and-equilateral-triangle-1609.04148</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/color-spanning-annulus-square-rectangle-and-equilateral-triangle-1609.04148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/color-spanning-annulus-square-rectangle-and-equilateral-triangle-1609.04148"/></url>
<url><loc>https://scifaro.com/en/abs/every-schnyder-drawing-is-a-greedy-embedding-1609.04173</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/every-schnyder-drawing-is-a-greedy-embedding-1609.04173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/every-schnyder-drawing-is-a-greedy-embedding-1609.04173"/></url>
<url><loc>https://scifaro.com/en/abs/c-planarity-of-overlapping-clusterings-including-unions-of-two-partitions-1609.04606</loc><lastmod>2016-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/c-planarity-of-overlapping-clusterings-including-unions-of-two-partitions-1609.04606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/c-planarity-of-overlapping-clusterings-including-unions-of-two-partitions-1609.04606"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-euclidean-metric-compression-1609.06295</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-euclidean-metric-compression-1609.06295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-euclidean-metric-compression-1609.06295"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-map-labeling-a-new-unified-framework-with-experiments-1609.06327</loc><lastmod>2016-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-map-labeling-a-new-unified-framework-with-experiments-1609.06327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-map-labeling-a-new-unified-framework-with-experiments-1609.06327"/></url>
<url><loc>https://scifaro.com/en/abs/simba-an-efficient-tool-for-approximating-rips-filtration-persistence-via-simplicial-batch-collapse-1609.07517</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simba-an-efficient-tool-for-approximating-rips-filtration-persistence-via-simplicial-batch-collapse-1609.07517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simba-an-efficient-tool-for-approximating-rips-filtration-persistence-via-simplicial-batch-collapse-1609.07517"/></url>
<url><loc>https://scifaro.com/en/abs/depth-contours-in-arrangements-of-halfplanes-1609.07709</loc><lastmod>2016-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/depth-contours-in-arrangements-of-halfplanes-1609.07709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/depth-contours-in-arrangements-of-halfplanes-1609.07709"/></url>
<url><loc>https://scifaro.com/en/abs/separating-overlapped-intervals-on-a-line-1609.07766</loc><lastmod>2017-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-overlapped-intervals-on-a-line-1609.07766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-overlapped-intervals-on-a-line-1609.07766"/></url>
<url><loc>https://scifaro.com/en/abs/order-preserving-1-string-representations-of-planar-graphs-1609.08132</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-preserving-1-string-representations-of-planar-graphs-1609.08132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-preserving-1-string-representations-of-planar-graphs-1609.08132"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-sparse-linear-regression-1609.08739</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-sparse-linear-regression-1609.08739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-sparse-linear-regression-1609.08739"/></url>
<url><loc>https://scifaro.com/en/abs/how-many-three-dimensional-hilbert-curves-are-there-1610.00155</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-many-three-dimensional-hilbert-curves-are-there-1610.00155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-many-three-dimensional-hilbert-curves-are-there-1610.00155"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-algorithms-for-bichromatic-problems-1610.00300</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-bichromatic-problems-1610.00300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-bichromatic-problems-1610.00300"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-weakly-simple-polygons-from-their-edges-1610.00361</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-weakly-simple-polygons-from-their-edges-1610.00361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-weakly-simple-polygons-from-their-edges-1610.00361"/></url>
<url><loc>https://scifaro.com/en/abs/the-topological-shape-of-brexit-1610.00752</loc><lastmod>2016-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-topological-shape-of-brexit-1610.00752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-topological-shape-of-brexit-1610.00752"/></url>
<url><loc>https://scifaro.com/en/abs/on-colouring-point-visibility-graphs-1610.00952</loc><lastmod>2017-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-colouring-point-visibility-graphs-1610.00952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-colouring-point-visibility-graphs-1610.00952"/></url>
<url><loc>https://scifaro.com/en/abs/lr-drawings-of-ordered-rooted-binary-trees-and-near-linear-area-drawings-of-outerplanar-graphs-1610.02841</loc><lastmod>2016-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lr-drawings-of-ordered-rooted-binary-trees-and-near-linear-area-drawings-of-outerplanar-graphs-1610.02841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lr-drawings-of-ordered-rooted-binary-trees-and-near-linear-area-drawings-of-outerplanar-graphs-1610.02841"/></url>
<url><loc>https://scifaro.com/en/abs/finding-small-hitting-sets-in-infinite-range-spaces-of-bounded-vc-dimension-1610.03812</loc><lastmod>2017-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-small-hitting-sets-in-infinite-range-spaces-of-bounded-vc-dimension-1610.03812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-small-hitting-sets-in-infinite-range-spaces-of-bounded-vc-dimension-1610.03812"/></url>
<url><loc>https://scifaro.com/en/abs/matchings-in-geometric-graphs-1610.06457</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matchings-in-geometric-graphs-1610.06457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matchings-in-geometric-graphs-1610.06457"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-embeddings-of-graphs-in-the-plane-1610.07144</loc><lastmod>2016-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-embeddings-of-graphs-in-the-plane-1610.07144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-embeddings-of-graphs-in-the-plane-1610.07144"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-approximation-for-point-set-diameter-in-higher-dimensions-1610.08543</loc><lastmod>2019-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-approximation-for-point-set-diameter-in-higher-dimensions-1610.08543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-approximation-for-point-set-diameter-in-higher-dimensions-1610.08543"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-genus-2-orthogonal-polyhedra-with-linear-refinement-1611.00106</loc><lastmod>2016-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-genus-2-orthogonal-polyhedra-with-linear-refinement-1611.00106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-genus-2-orthogonal-polyhedra-with-linear-refinement-1611.00106"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-unavoidable-tverberg-partitions-1611.01078</loc><lastmod>2017-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-unavoidable-tverberg-partitions-1611.01078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-unavoidable-tverberg-partitions-1611.01078"/></url>
<url><loc>https://scifaro.com/en/abs/stratifying-high-dimensional-data-based-on-proximity-to-the-convex-hull-boundary-1611.01419</loc><lastmod>2016-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stratifying-high-dimensional-data-based-on-proximity-to-the-convex-hull-boundary-1611.01419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stratifying-high-dimensional-data-based-on-proximity-to-the-convex-hull-boundary-1611.01419"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-trees-in-multipartite-geometric-graphs-1611.01661</loc><lastmod>2016-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-trees-in-multipartite-geometric-graphs-1611.01661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-trees-in-multipartite-geometric-graphs-1611.01661"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparison-of-the-triangle-algorithm-and-smo-for-solving-the-hard-margin-problem-1611.01856</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparison-of-the-triangle-algorithm-and-smo-for-solving-the-hard-margin-problem-1611.01856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparison-of-the-triangle-algorithm-and-smo-for-solving-the-hard-margin-problem-1611.01856"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-quasi-physical-quasi-human-algorithm-for-packing-equal-circles-in-a-circular-container-1611.02323</loc><lastmod>2017-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-quasi-physical-quasi-human-algorithm-for-packing-equal-circles-in-a-circular-container-1611.02323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-quasi-physical-quasi-human-algorithm-for-packing-equal-circles-in-a-circular-container-1611.02323"/></url>
<url><loc>https://scifaro.com/en/abs/arc-diagrams-flip-distances-and-hamiltonian-triangulations-1611.02541</loc><lastmod>2016-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arc-diagrams-flip-distances-and-hamiltonian-triangulations-1611.02541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arc-diagrams-flip-distances-and-hamiltonian-triangulations-1611.02541"/></url>
<url><loc>https://scifaro.com/en/abs/universal-hinge-patterns-for-folding-strips-efficiently-into-any-grid-polyhedron-1611.03187</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-hinge-patterns-for-folding-strips-efficiently-into-any-grid-polyhedron-1611.03187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-hinge-patterns-for-folding-strips-efficiently-into-any-grid-polyhedron-1611.03187"/></url>
<url><loc>https://scifaro.com/en/abs/faster-approximation-for-maximum-independent-set-on-unit-disk-graph-1611.03260</loc><lastmod>2016-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-approximation-for-maximum-independent-set-on-unit-disk-graph-1611.03260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-approximation-for-maximum-independent-set-on-unit-disk-graph-1611.03260"/></url>
<url><loc>https://scifaro.com/en/abs/numerically-robust-computation-of-circular-visibility-1611.03356</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/numerically-robust-computation-of-circular-visibility-1611.03356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/numerically-robust-computation-of-circular-visibility-1611.03356"/></url>
<url><loc>https://scifaro.com/en/abs/evaluation-of-spatial-trees-for-simulation-of-biological-tissue-1611.03358</loc><lastmod>2016-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluation-of-spatial-trees-for-simulation-of-biological-tissue-1611.03358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluation-of-spatial-trees-for-simulation-of-biological-tissue-1611.03358"/></url>
<url><loc>https://scifaro.com/en/abs/new-method-of-averaging-diffeomorphisms-based-on-jacobian-determinant-and-curl-vector-1611.03946</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-method-of-averaging-diffeomorphisms-based-on-jacobian-determinant-and-curl-vector-1611.03946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-method-of-averaging-diffeomorphisms-based-on-jacobian-determinant-and-curl-vector-1611.03946"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mathcal-np-hardness-of-gracsim-drawing-and-k-sefe-problems-1611.04178</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mathcal-np-hardness-of-gracsim-drawing-and-k-sefe-problems-1611.04178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mathcal-np-hardness-of-gracsim-drawing-and-k-sefe-problems-1611.04178"/></url>
<url><loc>https://scifaro.com/en/abs/space-efficient-hidden-surface-removal-1611.06915</loc><lastmod>2017-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-efficient-hidden-surface-removal-1611.06915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-efficient-hidden-surface-removal-1611.06915"/></url>
<url><loc>https://scifaro.com/en/abs/squarability-of-rectangle-arrangements-1611.07073</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/squarability-of-rectangle-arrangements-1611.07073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/squarability-of-rectangle-arrangements-1611.07073"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-inter-geodesic-distance-computation-and-fast-classical-scaling-1611.07356</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-inter-geodesic-distance-computation-and-fast-classical-scaling-1611.07356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-inter-geodesic-distance-computation-and-fast-classical-scaling-1611.07356"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-distance-descriptors-1611.07360</loc><lastmod>2016-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-distance-descriptors-1611.07360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-distance-descriptors-1611.07360"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-liar-s-domination-on-unit-disk-graphs-1611.07808</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-liar-s-domination-on-unit-disk-graphs-1611.07808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-liar-s-domination-on-unit-disk-graphs-1611.07808"/></url>
<url><loc>https://scifaro.com/en/abs/universal-guard-problems-1611.08315</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-guard-problems-1611.08315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-guard-problems-1611.08315"/></url>
<url><loc>https://scifaro.com/en/abs/dispersing-points-on-intervals-1611.09485</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dispersing-points-on-intervals-1611.09485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dispersing-points-on-intervals-1611.09485"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-vertex-enumeration-of-two-dimensional-projection-of-polytopes-1611.10059</loc><lastmod>2016-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-vertex-enumeration-of-two-dimensional-projection-of-polytopes-1611.10059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-vertex-enumeration-of-two-dimensional-projection-of-polytopes-1611.10059"/></url>
<url><loc>https://scifaro.com/en/abs/global-minimum-for-a-finsler-elastica-minimal-path-approach-1612.00343</loc><lastmod>2018-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-minimum-for-a-finsler-elastica-minimal-path-approach-1612.00343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-minimum-for-a-finsler-elastica-minimal-path-approach-1612.00343"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-incremental-construction-for-the-hausdorff-voronoi-diagram-of-point-clusters-1612.01335</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-incremental-construction-for-the-hausdorff-voronoi-diagram-of-point-clusters-1612.01335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-incremental-construction-for-the-hausdorff-voronoi-diagram-of-point-clusters-1612.01335"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-continuous-diameter-when-augmenting-a-geometric-tree-with-a-shortcut-1612.01370</loc><lastmod>2017-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-continuous-diameter-when-augmenting-a-geometric-tree-with-a-shortcut-1612.01370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-continuous-diameter-when-augmenting-a-geometric-tree-with-a-shortcut-1612.01370"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-approximate-polytope-membership-1612.01696</loc><lastmod>2018-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-approximate-polytope-membership-1612.01696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-approximate-polytope-membership-1612.01696"/></url>
<url><loc>https://scifaro.com/en/abs/covering-many-points-with-a-small-area-box-1612.02149</loc><lastmod>2019-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-many-points-with-a-small-area-box-1612.02149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-many-points-with-a-small-area-box-1612.02149"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-geometric-representation-through-local-shape-probing-1612.02261</loc><lastmod>2017-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-geometric-representation-through-local-shape-probing-1612.02261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-geometric-representation-through-local-shape-probing-1612.02261"/></url>
<url><loc>https://scifaro.com/en/abs/high-dimensional-consistent-digital-segments-1612.02483</loc><lastmod>2016-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-dimensional-consistent-digital-segments-1612.02483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-dimensional-consistent-digital-segments-1612.02483"/></url>
<url><loc>https://scifaro.com/en/abs/geodesics-using-waves-computing-distances-using-wave-propagation-1612.02509</loc><lastmod>2016-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesics-using-waves-computing-distances-using-wave-propagation-1612.02509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesics-using-waves-computing-distances-using-wave-propagation-1612.02509"/></url>
<url><loc>https://scifaro.com/en/abs/an-obstruction-to-delaunay-triangulations-in-riemannian-manifolds-1612.02905</loc><lastmod>2016-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-obstruction-to-delaunay-triangulations-in-riemannian-manifolds-1612.02905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-obstruction-to-delaunay-triangulations-in-riemannian-manifolds-1612.02905"/></url>
<url><loc>https://scifaro.com/en/abs/dune-curvilineargrid-parallel-dune-grid-manager-for-unstructured-tetrahedral-curvilinear-meshes-1612.02967</loc><lastmod>2016-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dune-curvilineargrid-parallel-dune-grid-manager-for-unstructured-tetrahedral-curvilinear-meshes-1612.02967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dune-curvilineargrid-parallel-dune-grid-manager-for-unstructured-tetrahedral-curvilinear-meshes-1612.02967"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-number-for-graphs-with-bounded-pathwidth-1612.03854</loc><lastmod>2017-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-number-for-graphs-with-bounded-pathwidth-1612.03854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-number-for-graphs-with-bounded-pathwidth-1612.03854"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-weight-connectivity-augmentation-for-planar-straight-line-graphs-1612.04780</loc><lastmod>2016-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-weight-connectivity-augmentation-for-planar-straight-line-graphs-1612.04780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-weight-connectivity-augmentation-for-planar-straight-line-graphs-1612.04780"/></url>
<url><loc>https://scifaro.com/en/abs/some-counterexamples-for-compatible-triangulations-1612.04861</loc><lastmod>2024-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-counterexamples-for-compatible-triangulations-1612.04861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-counterexamples-for-compatible-triangulations-1612.04861"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-closest-pair-problem-and-most-likely-nearest-neighbor-search-in-tree-spaces-1612.04890</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-closest-pair-problem-and-most-likely-nearest-neighbor-search-in-tree-spaces-1612.04890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-closest-pair-problem-and-most-likely-nearest-neighbor-search-in-tree-spaces-1612.04890"/></url>
<url><loc>https://scifaro.com/en/abs/open-problem-on-risk-aware-planning-in-the-plane-1612.05101</loc><lastmod>2017-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-problem-on-risk-aware-planning-in-the-plane-1612.05101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-problem-on-risk-aware-planning-in-the-plane-1612.05101"/></url>
<url><loc>https://scifaro.com/en/abs/on-dominance-free-samples-of-a-colored-stochastic-dataset-1612.06954</loc><lastmod>2020-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-dominance-free-samples-of-a-colored-stochastic-dataset-1612.06954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-dominance-free-samples-of-a-colored-stochastic-dataset-1612.06954"/></url>
<url><loc>https://scifaro.com/en/abs/splitting-b-2-vpg-graphs-into-outer-string-and-co-comparability-graphs-1612.07276</loc><lastmod>2016-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/splitting-b-2-vpg-graphs-into-outer-string-and-co-comparability-graphs-1612.07276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/splitting-b-2-vpg-graphs-into-outer-string-and-co-comparability-graphs-1612.07276"/></url>
<url><loc>https://scifaro.com/en/abs/practical-linear-space-approximate-near-neighbors-in-high-dimension-1612.07405</loc><lastmod>2016-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-linear-space-approximate-near-neighbors-in-high-dimension-1612.07405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-linear-space-approximate-near-neighbors-in-high-dimension-1612.07405"/></url>
<url><loc>https://scifaro.com/en/abs/on-planar-greedy-drawings-of-3-connected-planar-graphs-1612.09277</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-planar-greedy-drawings-of-3-connected-planar-graphs-1612.09277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-planar-greedy-drawings-of-3-connected-planar-graphs-1612.09277"/></url>
<url><loc>https://scifaro.com/en/abs/data-driven-estimation-of-laplace-beltrami-operator-1612.09434</loc><lastmod>2017-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-driven-estimation-of-laplace-beltrami-operator-1612.09434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-driven-estimation-of-laplace-beltrami-operator-1612.09434"/></url>
<url><loc>https://scifaro.com/en/abs/packing-unequal-circles-into-a-square-container-by-partitioning-narrow-action-spaces-and-circle-items-1701.00541</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-unequal-circles-into-a-square-container-by-partitioning-narrow-action-spaces-and-circle-items-1701.00541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-unequal-circles-into-a-square-container-by-partitioning-narrow-action-spaces-and-circle-items-1701.00541"/></url>
<url><loc>https://scifaro.com/en/abs/removing-depth-order-cycles-among-triangles-an-efficient-algorithm-generating-triangular-fragments-1701.00679</loc><lastmod>2017-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/removing-depth-order-cycles-among-triangles-an-efficient-algorithm-generating-triangular-fragments-1701.00679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/removing-depth-order-cycles-among-triangles-an-efficient-algorithm-generating-triangular-fragments-1701.00679"/></url>
<url><loc>https://scifaro.com/en/abs/towards-faithful-graph-visualizations-1701.00921</loc><lastmod>2018-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-faithful-graph-visualizations-1701.00921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-faithful-graph-visualizations-1701.00921"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-a-global-red-blue-proportion-using-local-conditions-1701.02200</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-a-global-red-blue-proportion-using-local-conditions-1701.02200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-a-global-red-blue-proportion-using-local-conditions-1701.02200"/></url>
<url><loc>https://scifaro.com/en/abs/searching-edges-in-the-overlap-of-two-plane-graphs-1701.02229</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-edges-in-the-overlap-of-two-plane-graphs-1701.02229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-edges-in-the-overlap-of-two-plane-graphs-1701.02229"/></url>
<url><loc>https://scifaro.com/en/abs/surface-reconstruction-with-data-driven-exemplar-priors-1701.03230</loc><lastmod>2017-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-reconstruction-with-data-driven-exemplar-priors-1701.03230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-reconstruction-with-data-driven-exemplar-priors-1701.03230"/></url>
<url><loc>https://scifaro.com/en/abs/fully-dynamic-and-kinetic-conflict-free-coloring-of-intervals-with-respect-to-points-1701.03388</loc><lastmod>2019-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-dynamic-and-kinetic-conflict-free-coloring-of-intervals-with-respect-to-points-1701.03388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-dynamic-and-kinetic-conflict-free-coloring-of-intervals-with-respect-to-points-1701.03388"/></url>
<url><loc>https://scifaro.com/en/abs/multivariate-analysis-for-computing-maxima-in-high-dimensions-1701.03693</loc><lastmod>2017-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multivariate-analysis-for-computing-maxima-in-high-dimensions-1701.03693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multivariate-analysis-for-computing-maxima-in-high-dimensions-1701.03693"/></url>
<url><loc>https://scifaro.com/en/abs/the-medial-axis-of-a-multi-layered-environment-and-its-application-as-a-navigation-mesh-1701.05141</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-medial-axis-of-a-multi-layered-environment-and-its-application-as-a-navigation-mesh-1701.05141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-medial-axis-of-a-multi-layered-environment-and-its-application-as-a-navigation-mesh-1701.05141"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-longest-chains-in-pseudo-transitive-graphs-1701.05286</loc><lastmod>2017-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-longest-chains-in-pseudo-transitive-graphs-1701.05286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-longest-chains-in-pseudo-transitive-graphs-1701.05286"/></url>
<url><loc>https://scifaro.com/en/abs/range-efficient-consistent-sampling-and-locality-sensitive-hashing-for-polygons-1701.05290</loc><lastmod>2017-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-efficient-consistent-sampling-and-locality-sensitive-hashing-for-polygons-1701.05290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-efficient-consistent-sampling-and-locality-sensitive-hashing-for-polygons-1701.05290"/></url>
<url><loc>https://scifaro.com/en/abs/irrational-guards-are-sometimes-needed-1701.05475</loc><lastmod>2017-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irrational-guards-are-sometimes-needed-1701.05475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irrational-guards-are-sometimes-needed-1701.05475"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-of-the-minimal-dispersion-via-delta-covers-1701.06430</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-of-the-minimal-dispersion-via-delta-covers-1701.06430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-of-the-minimal-dispersion-via-delta-covers-1701.06430"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-planar-curves-1702.00146</loc><lastmod>2017-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-planar-curves-1702.00146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-planar-curves-1702.00146"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-biplane-graphs-i-maximal-graphs-1702.01275</loc><lastmod>2017-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-biplane-graphs-i-maximal-graphs-1702.01275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-biplane-graphs-i-maximal-graphs-1702.01275"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-biplane-graphs-ii-graph-augmentation-1702.01277</loc><lastmod>2017-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-biplane-graphs-ii-graph-augmentation-1702.01277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-biplane-graphs-ii-graph-augmentation-1702.01277"/></url>
<url><loc>https://scifaro.com/en/abs/edge-n-level-sparse-visibility-graphs-fast-optimal-any-angle-pathfinding-using-hierarchical-taut-paths-1702.01524</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-n-level-sparse-visibility-graphs-fast-optimal-any-angle-pathfinding-using-hierarchical-taut-paths-1702.01524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-n-level-sparse-visibility-graphs-fast-optimal-any-angle-pathfinding-using-hierarchical-taut-paths-1702.01524"/></url>
<url><loc>https://scifaro.com/en/abs/radial-contour-labeling-with-straight-leaders-1702.01799</loc><lastmod>2017-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/radial-contour-labeling-with-straight-leaders-1702.01799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/radial-contour-labeling-with-straight-leaders-1702.01799"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-approximation-schemes-for-geometric-maximum-coverage-1702.01836</loc><lastmod>2017-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-approximation-schemes-for-geometric-maximum-coverage-1702.01836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-approximation-schemes-for-geometric-maximum-coverage-1702.01836"/></url>
<url><loc>https://scifaro.com/en/abs/the-dtm-signature-for-a-geometric-comparison-of-metric-measure-spaces-from-samples-1702.02838</loc><lastmod>2017-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dtm-signature-for-a-geometric-comparison-of-metric-measure-spaces-from-samples-1702.02838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dtm-signature-for-a-geometric-comparison-of-metric-measure-spaces-from-samples-1702.02838"/></url>
<url><loc>https://scifaro.com/en/abs/two-optimization-problems-for-unit-disks-1702.03266</loc><lastmod>2017-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-optimization-problems-for-unit-disks-1702.03266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-optimization-problems-for-unit-disks-1702.03266"/></url>
<url><loc>https://scifaro.com/en/abs/techniques-in-lattice-basis-reduction-1702.03364</loc><lastmod>2017-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/techniques-in-lattice-basis-reduction-1702.03364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/techniques-in-lattice-basis-reduction-1702.03364"/></url>
<url><loc>https://scifaro.com/en/abs/epsilon-approximations-and-epsilon-nets-1702.03676</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epsilon-approximations-and-epsilon-nets-1702.03676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epsilon-approximations-and-epsilon-nets-1702.03676"/></url>
<url><loc>https://scifaro.com/en/abs/filling-missing-data-in-point-clouds-by-merging-structured-and-unstructured-point-clouds-1702.04641</loc><lastmod>2017-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filling-missing-data-in-point-clouds-by-merging-structured-and-unstructured-point-clouds-1702.04641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filling-missing-data-in-point-clouds-by-merging-structured-and-unstructured-point-clouds-1702.04641"/></url>
<url><loc>https://scifaro.com/en/abs/t-shape-visibility-representations-of-1-planar-graphs-1702.05265</loc><lastmod>2018-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/t-shape-visibility-representations-of-1-planar-graphs-1702.05265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/t-shape-visibility-representations-of-1-planar-graphs-1702.05265"/></url>
<url><loc>https://scifaro.com/en/abs/computational-topology-of-graphs-on-surfaces-1702.05358</loc><lastmod>2017-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-topology-of-graphs-on-surfaces-1702.05358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-topology-of-graphs-on-surfaces-1702.05358"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-independence-and-domination-on-b-1-vpg-and-b-1-epg-graphs-1702.05633</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-independence-and-domination-on-b-1-vpg-and-b-1-epg-graphs-1702.05633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-independence-and-domination-on-b-1-vpg-and-b-1-epg-graphs-1702.05633"/></url>
<url><loc>https://scifaro.com/en/abs/delta-greedy-t-spanner-1702.05900</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delta-greedy-t-spanner-1702.05900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delta-greedy-t-spanner-1702.05900"/></url>
<url><loc>https://scifaro.com/en/abs/1-fan-bundle-planar-drawings-of-graphs-1702.06163</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-fan-bundle-planar-drawings-of-graphs-1702.06163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-fan-bundle-planar-drawings-of-graphs-1702.06163"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-convex-layers-algorithm-1702.06829</loc><lastmod>2017-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-convex-layers-algorithm-1702.06829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-convex-layers-algorithm-1702.06829"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-computing-the-spherical-depth-of-points-in-the-plane-1702.07399</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-computing-the-spherical-depth-of-points-in-the-plane-1702.07399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-computing-the-spherical-depth-of-points-in-the-plane-1702.07399"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-crossing-families-1702.07555</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-crossing-families-1702.07555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-crossing-families-1702.07555"/></url>
<url><loc>https://scifaro.com/en/abs/the-persistent-homotopy-type-distance-1702.07893</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-persistent-homotopy-type-distance-1702.07893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-persistent-homotopy-type-distance-1702.07893"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-increasing-chord-paths-and-trees-1702.08380</loc><lastmod>2017-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-increasing-chord-paths-and-trees-1702.08380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-increasing-chord-paths-and-trees-1702.08380"/></url>
<url><loc>https://scifaro.com/en/abs/faster-db-scan-and-hdb-scan-in-low-dimensional-euclidean-spaces-1702.08607</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-db-scan-and-hdb-scan-in-low-dimensional-euclidean-spaces-1702.08607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-db-scan-and-hdb-scan-in-low-dimensional-euclidean-spaces-1702.08607"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-lower-bound-for-general-position-subset-selection-1702.08654</loc><lastmod>2018-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-lower-bound-for-general-position-subset-selection-1702.08654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-lower-bound-for-general-position-subset-selection-1702.08654"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relationship-between-k-planar-and-k-quasi-planar-graphs-1702.08716</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relationship-between-k-planar-and-k-quasi-planar-graphs-1702.08716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relationship-between-k-planar-and-k-quasi-planar-graphs-1702.08716"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-enclosing-circle-of-a-set-of-static-points-with-dynamic-weight-from-one-free-point-1703.00112</loc><lastmod>2017-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-enclosing-circle-of-a-set-of-static-points-with-dynamic-weight-from-one-free-point-1703.00112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-enclosing-circle-of-a-set-of-static-points-with-dynamic-weight-from-one-free-point-1703.00112"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-convex-hulls-sketching-the-convex-hull-using-curvature-1703.01350</loc><lastmod>2017-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-convex-hulls-sketching-the-convex-hull-using-curvature-1703.01350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-convex-hulls-sketching-the-convex-hull-using-curvature-1703.01350"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-set-of-optimal-homeomorphisms-for-the-natural-pseudo-distance-associated-with-the-lie-group-s-1-1703.01439</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-set-of-optimal-homeomorphisms-for-the-natural-pseudo-distance-associated-with-the-lie-group-s-1-1703.01439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-set-of-optimal-homeomorphisms-for-the-natural-pseudo-distance-associated-with-the-lie-group-s-1-1703.01439"/></url>
<url><loc>https://scifaro.com/en/abs/l-graphs-and-monotone-l-graphs-1703.01544</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-graphs-and-monotone-l-graphs-1703.01544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-graphs-and-monotone-l-graphs-1703.01544"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-tsp-with-neighborhoods-in-the-plane-1703.01640</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-tsp-with-neighborhoods-in-the-plane-1703.01640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-tsp-with-neighborhoods-in-the-plane-1703.01640"/></url>
<url><loc>https://scifaro.com/en/abs/a-ptas-for-tsp-with-neighborhoods-among-fat-regions-in-the-plane-1703.01646</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ptas-for-tsp-with-neighborhoods-among-fat-regions-in-the-plane-1703.01646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ptas-for-tsp-with-neighborhoods-among-fat-regions-in-the-plane-1703.01646"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-planar-graphs-with-few-geometric-primitives-1703.01691</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-few-geometric-primitives-1703.01691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-few-geometric-primitives-1703.01691"/></url>
<url><loc>https://scifaro.com/en/abs/an-annotated-bibliography-on-1-planarity-1703.02261</loc><lastmod>2017-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-annotated-bibliography-on-1-planarity-1703.02261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-annotated-bibliography-on-1-planarity-1703.02261"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-assembly-puzzles-are-hard-beyond-a-few-pieces-1703.02671</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-assembly-puzzles-are-hard-beyond-a-few-pieces-1703.02671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-assembly-puzzles-are-hard-beyond-a-few-pieces-1703.02671"/></url>
<url><loc>https://scifaro.com/en/abs/local-equivalence-and-intrinsic-metrics-between-reeb-graphs-1703.02901</loc><lastmod>2017-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-equivalence-and-intrinsic-metrics-between-reeb-graphs-1703.02901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-equivalence-and-intrinsic-metrics-between-reeb-graphs-1703.02901"/></url>
<url><loc>https://scifaro.com/en/abs/quickest-visibility-queries-in-polygonal-domains-1703.03048</loc><lastmod>2017-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quickest-visibility-queries-in-polygonal-domains-1703.03048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quickest-visibility-queries-in-polygonal-domains-1703.03048"/></url>
<url><loc>https://scifaro.com/en/abs/best-laid-plans-of-lions-and-men-1703.03687</loc><lastmod>2021-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-laid-plans-of-lions-and-men-1703.03687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-laid-plans-of-lions-and-men-1703.03687"/></url>
<url><loc>https://scifaro.com/en/abs/locality-sensitive-hashing-of-curves-1703.04040</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locality-sensitive-hashing-of-curves-1703.04040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locality-sensitive-hashing-of-curves-1703.04040"/></url>
<url><loc>https://scifaro.com/en/abs/universal-slope-sets-for-1-bend-planar-drawings-1703.04283</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-slope-sets-for-1-bend-planar-drawings-1703.04283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-slope-sets-for-1-bend-planar-drawings-1703.04283"/></url>
<url><loc>https://scifaro.com/en/abs/stabbing-segments-with-rectilinear-objects-1703.04329</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabbing-segments-with-rectilinear-objects-1703.04329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabbing-segments-with-rectilinear-objects-1703.04329"/></url>
<url><loc>https://scifaro.com/en/abs/bicriteria-rectilinear-shortest-paths-among-rectilinear-obstacles-in-the-plane-1703.04466</loc><lastmod>2017-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bicriteria-rectilinear-shortest-paths-among-rectilinear-obstacles-in-the-plane-1703.04466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bicriteria-rectilinear-shortest-paths-among-rectilinear-obstacles-in-the-plane-1703.04466"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-schemes-for-independent-set-and-sparse-subsets-of-polygons-1703.04758</loc><lastmod>2017-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-schemes-for-independent-set-and-sparse-subsets-of-polygons-1703.04758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-schemes-for-independent-set-and-sparse-subsets-of-polygons-1703.04758"/></url>
<url><loc>https://scifaro.com/en/abs/a-quest-to-unravel-the-metric-structure-behind-perturbed-networks-1703.05475</loc><lastmod>2018-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quest-to-unravel-the-metric-structure-behind-perturbed-networks-1703.05475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quest-to-unravel-the-metric-structure-behind-perturbed-networks-1703.05475"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-perimeter-sum-partitions-in-the-plane-1703.05549</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-perimeter-sum-partitions-in-the-plane-1703.05549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-perimeter-sum-partitions-in-the-plane-1703.05549"/></url>
<url><loc>https://scifaro.com/en/abs/packing-short-plane-spanning-graphs-in-complete-geometric-graphs-1703.05863</loc><lastmod>2019-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-short-plane-spanning-graphs-in-complete-geometric-graphs-1703.05863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-short-plane-spanning-graphs-in-complete-geometric-graphs-1703.05863"/></url>
<url><loc>https://scifaro.com/en/abs/self-approaching-paths-in-simple-polygons-1703.06107</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-approaching-paths-in-simple-polygons-1703.06107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-approaching-paths-in-simple-polygons-1703.06107"/></url>
<url><loc>https://scifaro.com/en/abs/definition-of-geometric-space-around-analytic-fractal-trees-using-derivative-coordinate-funtions-1703.06307</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definition-of-geometric-space-around-analytic-fractal-trees-using-derivative-coordinate-funtions-1703.06307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definition-of-geometric-space-around-analytic-fractal-trees-using-derivative-coordinate-funtions-1703.06307"/></url>
<url><loc>https://scifaro.com/en/abs/anisotropic-triangulations-via-discrete-riemannian-voronoi-diagrams-1703.06487</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anisotropic-triangulations-via-discrete-riemannian-voronoi-diagrams-1703.06487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anisotropic-triangulations-via-discrete-riemannian-voronoi-diagrams-1703.06487"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-2-and-3-planar-graphs-1703.06526</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-2-and-3-planar-graphs-1703.06526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-2-and-3-planar-graphs-1703.06526"/></url>
<url><loc>https://scifaro.com/en/abs/collapsibility-to-a-subcomplex-of-a-given-dimension-is-np-complete-1703.06983</loc><lastmod>2019-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collapsibility-to-a-subcomplex-of-a-given-dimension-is-np-complete-1703.06983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collapsibility-to-a-subcomplex-of-a-given-dimension-is-np-complete-1703.06983"/></url>
<url><loc>https://scifaro.com/en/abs/topological-analysis-of-nerves-reeb-spaces-mappers-and-multiscale-mappers-1703.07387</loc><lastmod>2017-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-analysis-of-nerves-reeb-spaces-mappers-and-multiscale-mappers-1703.07387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-analysis-of-nerves-reeb-spaces-mappers-and-multiscale-mappers-1703.07387"/></url>
<url><loc>https://scifaro.com/en/abs/routing-in-polygonal-domains-1703.09533</loc><lastmod>2019-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-in-polygonal-domains-1703.09533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-in-polygonal-domains-1703.09533"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-varepsilon-kernel-construction-and-related-problems-1703.10868</loc><lastmod>2017-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-varepsilon-kernel-construction-and-related-problems-1703.10868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-varepsilon-kernel-construction-and-related-problems-1703.10868"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-minimum-diameter-1703.10976</loc><lastmod>2017-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-minimum-diameter-1703.10976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-minimum-diameter-1703.10976"/></url>
<url><loc>https://scifaro.com/en/abs/regularized-arrangements-of-cellular-complexes-1704.00142</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regularized-arrangements-of-cellular-complexes-1704.00142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regularized-arrangements-of-cellular-complexes-1704.00142"/></url>
<url><loc>https://scifaro.com/en/abs/big-holes-in-big-data-a-monte-carlo-algorithm-for-detecting-large-hyper-rectangles-in-high-dimensional-data-1704.00683</loc><lastmod>2017-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/big-holes-in-big-data-a-monte-carlo-algorithm-for-detecting-large-hyper-rectangles-in-high-dimensional-data-1704.00683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/big-holes-in-big-data-a-monte-carlo-algorithm-for-detecting-large-hyper-rectangles-in-high-dimensional-data-1704.00683"/></url>
<url><loc>https://scifaro.com/en/abs/computational-determination-of-the-largest-lattice-polytope-diameter-1704.01687</loc><lastmod>2017-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-determination-of-the-largest-lattice-polytope-diameter-1704.01687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-determination-of-the-largest-lattice-polytope-diameter-1704.01687"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-k-center-clustering-when-k-is-a-constant-1704.02515</loc><lastmod>2017-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-k-center-clustering-when-k-is-a-constant-1704.02515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-k-center-clustering-when-k-is-a-constant-1704.02515"/></url>
<url><loc>https://scifaro.com/en/abs/density-equalizing-maps-for-simply-connected-open-surfaces-1704.02525</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/density-equalizing-maps-for-simply-connected-open-surfaces-1704.02525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/density-equalizing-maps-for-simply-connected-open-surfaces-1704.02525"/></url>
<url><loc>https://scifaro.com/en/abs/lsh-on-the-hypercube-revisited-1704.02546</loc><lastmod>2017-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lsh-on-the-hypercube-revisited-1704.02546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lsh-on-the-hypercube-revisited-1704.02546"/></url>
<url><loc>https://scifaro.com/en/abs/odd-yao-yao-graphs-are-not-spanners-1704.03132</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/odd-yao-yao-graphs-are-not-spanners-1704.03132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/odd-yao-yao-graphs-are-not-spanners-1704.03132"/></url>
<url><loc>https://scifaro.com/en/abs/on-plane-constrained-bounded-degree-spanners-1704.03596</loc><lastmod>2018-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-plane-constrained-bounded-degree-spanners-1704.03596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-plane-constrained-bounded-degree-spanners-1704.03596"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-exact-planner-for-thick-non-crossing-2-link-robots-1704.05123</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-exact-planner-for-thick-non-crossing-2-link-robots-1704.05123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-exact-planner-for-thick-non-crossing-2-link-robots-1704.05123"/></url>
<url><loc>https://scifaro.com/en/abs/proximal-nerve-complexes-a-computational-topology-approach-1704.05909</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proximal-nerve-complexes-a-computational-topology-approach-1704.05909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proximal-nerve-complexes-a-computational-topology-approach-1704.05909"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-approximations-for-the-online-dispersion-problem-1704.06823</loc><lastmod>2017-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-approximations-for-the-online-dispersion-problem-1704.06823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-approximations-for-the-online-dispersion-problem-1704.06823"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-covering-multiple-barriers-1704.06870</loc><lastmod>2018-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-covering-multiple-barriers-1704.06870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-covering-multiple-barriers-1704.06870"/></url>
<url><loc>https://scifaro.com/en/abs/the-art-gallery-problem-is-exists-mathbb-r-complete-1704.06969</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-art-gallery-problem-is-exists-mathbb-r-complete-1704.06969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-art-gallery-problem-is-exists-mathbb-r-complete-1704.06969"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expected-diameter-width-and-complexity-of-a-stochastic-convex-hull-1704.07028</loc><lastmod>2017-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expected-diameter-width-and-complexity-of-a-stochastic-convex-hull-1704.07028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expected-diameter-width-and-complexity-of-a-stochastic-convex-hull-1704.07028"/></url>
<url><loc>https://scifaro.com/en/abs/covering-uncertain-points-in-a-tree-1704.07497</loc><lastmod>2017-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-uncertain-points-in-a-tree-1704.07497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-uncertain-points-in-a-tree-1704.07497"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-growing-prioritized-disks-and-rectangles-1704.07580</loc><lastmod>2019-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-growing-prioritized-disks-and-rectangles-1704.07580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-growing-prioritized-disks-and-rectangles-1704.07580"/></url>
<url><loc>https://scifaro.com/en/abs/epsilon-shapes-characterizing-detecting-and-thickening-thin-features-in-geometric-models-1704.08049</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epsilon-shapes-characterizing-detecting-and-thickening-thin-features-in-geometric-models-1704.08049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epsilon-shapes-characterizing-detecting-and-thickening-thin-features-in-geometric-models-1704.08049"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-algorithms-for-visibility-polygons-in-simple-polygons-1704.08219</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-algorithms-for-visibility-polygons-in-simple-polygons-1704.08219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-algorithms-for-visibility-polygons-in-simple-polygons-1704.08219"/></url>
<url><loc>https://scifaro.com/en/abs/composition-operators-matrix-representation-and-the-finite-section-method-a-theoretical-framework-for-maps-between-shapes-1705.00325</loc><lastmod>2017-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/composition-operators-matrix-representation-and-the-finite-section-method-a-theoretical-framework-for-maps-between-shapes-1705.00325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/composition-operators-matrix-representation-and-the-finite-section-method-a-theoretical-framework-for-maps-between-shapes-1705.00325"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-properties-of-discrete-composition-operators-1705.00328</loc><lastmod>2017-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-properties-of-discrete-composition-operators-1705.00328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-properties-of-discrete-composition-operators-1705.00328"/></url>
<url><loc>https://scifaro.com/en/abs/split-packing-algorithms-for-packing-circles-with-optimal-worst-case-density-1705.00924</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/split-packing-algorithms-for-packing-circles-with-optimal-worst-case-density-1705.00924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/split-packing-algorithms-for-packing-circles-with-optimal-worst-case-density-1705.00924"/></url>
<url><loc>https://scifaro.com/en/abs/the-homogeneous-broadcast-problem-in-narrow-and-wide-strips-1705.01465</loc><lastmod>2017-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-homogeneous-broadcast-problem-in-narrow-and-wide-strips-1705.01465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-homogeneous-broadcast-problem-in-narrow-and-wide-strips-1705.01465"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-linear-decision-trees-for-k-sum-and-related-problems-1705.01720</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-linear-decision-trees-for-k-sum-and-related-problems-1705.01720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-linear-decision-trees-for-k-sum-and-related-problems-1705.01720"/></url>
<url><loc>https://scifaro.com/en/abs/exact-vc-dimension-for-l-1-visibility-of-points-in-simple-polygons-1705.01723</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-vc-dimension-for-l-1-visibility-of-points-in-simple-polygons-1705.01723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-vc-dimension-for-l-1-visibility-of-points-in-simple-polygons-1705.01723"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-combinations-of-tetrahedra-into-hexahedra-a-vertex-based-strategy-1705.02451</loc><lastmod>2018-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-combinations-of-tetrahedra-into-hexahedra-a-vertex-based-strategy-1705.02451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-combinations-of-tetrahedra-into-hexahedra-a-vertex-based-strategy-1705.02451"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-of-the-spherical-laguerre-voronoi-diagram-1705.03911</loc><lastmod>2017-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-of-the-spherical-laguerre-voronoi-diagram-1705.03911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-of-the-spherical-laguerre-voronoi-diagram-1705.03911"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximum-crossing-number-1705.05176</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximum-crossing-number-1705.05176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximum-crossing-number-1705.05176"/></url>
<url><loc>https://scifaro.com/en/abs/hanani-tutte-for-approximating-maps-of-graphs-1705.05243</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hanani-tutte-for-approximating-maps-of-graphs-1705.05243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hanani-tutte-for-approximating-maps-of-graphs-1705.05243"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-approach-to-graphmaps-a-system-browsing-large-graphs-as-interactive-maps-1705.05479</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-approach-to-graphmaps-a-system-browsing-large-graphs-as-interactive-maps-1705.05479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-approach-to-graphmaps-a-system-browsing-large-graphs-as-interactive-maps-1705.05479"/></url>
<url><loc>https://scifaro.com/en/abs/two-planar-graphs-are-quasiplanar-1705.05569</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-planar-graphs-are-quasiplanar-1705.05569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-planar-graphs-are-quasiplanar-1705.05569"/></url>
<url><loc>https://scifaro.com/en/abs/tsp-with-locational-uncertainty-the-adversarial-model-1705.06180</loc><lastmod>2017-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tsp-with-locational-uncertainty-the-adversarial-model-1705.06180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tsp-with-locational-uncertainty-the-adversarial-model-1705.06180"/></url>
<url><loc>https://scifaro.com/en/abs/range-clustering-queries-1705.06242</loc><lastmod>2017-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-clustering-queries-1705.06242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-clustering-queries-1705.06242"/></url>
<url><loc>https://scifaro.com/en/abs/range-assignment-of-base-stations-maximizing-coverage-area-without-interference-1705.09346</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-assignment-of-base-stations-maximizing-coverage-area-without-interference-1705.09346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-assignment-of-base-stations-maximizing-coverage-area-without-interference-1705.09346"/></url>
<url><loc>https://scifaro.com/en/abs/one-parameter-tetrahedral-mesh-generation-for-spheroids-1705.09691</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-parameter-tetrahedral-mesh-generation-for-spheroids-1705.09691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-parameter-tetrahedral-mesh-generation-for-spheroids-1705.09691"/></url>
<url><loc>https://scifaro.com/en/abs/depth-distribution-in-high-dimensions-1705.10022</loc><lastmod>2017-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/depth-distribution-in-high-dimensions-1705.10022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/depth-distribution-in-high-dimensions-1705.10022"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-area-triangle-in-a-convex-polygon-revisited-1705.11035</loc><lastmod>2020-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-area-triangle-in-a-convex-polygon-revisited-1705.11035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-area-triangle-in-a-convex-polygon-revisited-1705.11035"/></url>
<url><loc>https://scifaro.com/en/abs/the-constant-of-proportionality-in-lower-bound-constructions-of-point-line-incidences-1706.00091</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-constant-of-proportionality-in-lower-bound-constructions-of-point-line-incidences-1706.00091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-constant-of-proportionality-in-lower-bound-constructions-of-point-line-incidences-1706.00091"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-analysis-and-parameter-selection-for-mapper-1706.00204</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-analysis-and-parameter-selection-for-mapper-1706.00204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-analysis-and-parameter-selection-for-mapper-1706.00204"/></url>
<url><loc>https://scifaro.com/en/abs/computing-simplicial-representatives-of-homotopy-group-elements-1706.00380</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-simplicial-representatives-of-homotopy-group-elements-1706.00380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-simplicial-representatives-of-homotopy-group-elements-1706.00380"/></url>
<url><loc>https://scifaro.com/en/abs/robust-and-efficient-validation-of-the-linear-hexahedral-element-1706.01613</loc><lastmod>2017-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-and-efficient-validation-of-the-linear-hexahedral-element-1706.01613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-and-efficient-validation-of-the-linear-hexahedral-element-1706.01613"/></url>
<url><loc>https://scifaro.com/en/abs/on-separating-points-by-lines-1706.02004</loc><lastmod>2017-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-separating-points-by-lines-1706.02004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-separating-points-by-lines-1706.02004"/></url>
<url><loc>https://scifaro.com/en/abs/on-guarding-orthogonal-polygons-with-bounded-treewidth-1706.02028</loc><lastmod>2017-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-guarding-orthogonal-polygons-with-bounded-treewidth-1706.02028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-guarding-orthogonal-polygons-with-bounded-treewidth-1706.02028"/></url>
<url><loc>https://scifaro.com/en/abs/high-quality-mesh-generation-using-cross-and-asterisk-fields-application-on-coastal-domains-1706.02236</loc><lastmod>2017-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-quality-mesh-generation-using-cross-and-asterisk-fields-application-on-coastal-domains-1706.02236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-quality-mesh-generation-using-cross-and-asterisk-fields-application-on-coastal-domains-1706.02236"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-computing-high-quality-paths-amid-polygonal-obstacles-1706.02939</loc><lastmod>2017-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-computing-high-quality-paths-amid-polygonal-obstacles-1706.02939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-computing-high-quality-paths-amid-polygonal-obstacles-1706.02939"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-maximum-area-inscribed-triangle-in-a-convex-polygon-1706.03049</loc><lastmod>2017-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-maximum-area-inscribed-triangle-in-a-convex-polygon-1706.03049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-maximum-area-inscribed-triangle-in-a-convex-polygon-1706.03049"/></url>
<url><loc>https://scifaro.com/en/abs/a-grid-based-approximation-algorithm-for-the-minimum-weight-triangulation-problem-1706.03263</loc><lastmod>2017-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-grid-based-approximation-algorithm-for-the-minimum-weight-triangulation-problem-1706.03263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-grid-based-approximation-algorithm-for-the-minimum-weight-triangulation-problem-1706.03263"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-area-rectangle-separating-red-and-blue-points-1706.03268</loc><lastmod>2017-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-area-rectangle-separating-red-and-blue-points-1706.03268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-area-rectangle-separating-red-and-blue-points-1706.03268"/></url>
<url><loc>https://scifaro.com/en/abs/sliced-wasserstein-kernel-for-persistence-diagrams-1706.03358</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sliced-wasserstein-kernel-for-persistence-diagrams-1706.03358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sliced-wasserstein-kernel-for-persistence-diagrams-1706.03358"/></url>
<url><loc>https://scifaro.com/en/abs/delta-complexes-in-digital-images-approximating-image-object-shapes-1706.04549</loc><lastmod>2017-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delta-complexes-in-digital-images-approximating-image-object-shapes-1706.04549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delta-complexes-in-digital-images-approximating-image-object-shapes-1706.04549"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-algorithm-for-enumerating-collinear-points-1706.05412</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-algorithm-for-enumerating-collinear-points-1706.05412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-algorithm-for-enumerating-collinear-points-1706.05412"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-properties-and-recognition-of-unit-square-visibility-graphs-1706.05906</loc><lastmod>2017-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-properties-and-recognition-of-unit-square-visibility-graphs-1706.05906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-properties-and-recognition-of-unit-square-visibility-graphs-1706.05906"/></url>
<url><loc>https://scifaro.com/en/abs/guided-depth-upsampling-for-precise-mapping-of-urban-environments-1706.05999</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guided-depth-upsampling-for-precise-mapping-of-urban-environments-1706.05999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guided-depth-upsampling-for-precise-mapping-of-urban-environments-1706.05999"/></url>
<url><loc>https://scifaro.com/en/abs/the-well-separated-pair-decomposition-for-balls-1706.06287</loc><lastmod>2017-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-well-separated-pair-decomposition-for-balls-1706.06287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-well-separated-pair-decomposition-for-balls-1706.06287"/></url>
<url><loc>https://scifaro.com/en/abs/art-gallery-localization-1706.06938</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/art-gallery-localization-1706.06938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/art-gallery-localization-1706.06938"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximate-rips-filtrations-with-shifted-integer-lattices-1706.07399</loc><lastmod>2017-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximate-rips-filtrations-with-shifted-integer-lattices-1706.07399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximate-rips-filtrations-with-shifted-integer-lattices-1706.07399"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-homology-of-basic-semialgebraic-sets-in-weak-exponential-time-1706.07473</loc><lastmod>2023-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-homology-of-basic-semialgebraic-sets-in-weak-exponential-time-1706.07473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-homology-of-basic-semialgebraic-sets-in-weak-exponential-time-1706.07473"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-art-gallery-localization-is-np-hard-1706.08016</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-art-gallery-localization-is-np-hard-1706.08016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-art-gallery-localization-is-np-hard-1706.08016"/></url>
<url><loc>https://scifaro.com/en/abs/compatible-4-holes-in-point-sets-1706.08105</loc><lastmod>2018-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatible-4-holes-in-point-sets-1706.08105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatible-4-holes-in-point-sets-1706.08105"/></url>
<url><loc>https://scifaro.com/en/abs/on-compatible-triangulations-with-a-minimum-number-of-steiner-points-1706.09086</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-compatible-triangulations-with-a-minimum-number-of-steiner-points-1706.09086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-compatible-triangulations-with-a-minimum-number-of-steiner-points-1706.09086"/></url>
<url><loc>https://scifaro.com/en/abs/unconstrained-and-curvature-constrained-shortest-path-distances-and-their-approximation-1706.09441</loc><lastmod>2018-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unconstrained-and-curvature-constrained-shortest-path-distances-and-their-approximation-1706.09441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unconstrained-and-curvature-constrained-shortest-path-distances-and-their-approximation-1706.09441"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-schemes-for-covering-and-packing-in-the-streaming-model-1706.09533</loc><lastmod>2017-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-schemes-for-covering-and-packing-in-the-streaming-model-1706.09533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-schemes-for-covering-and-packing-in-the-streaming-model-1706.09533"/></url>
<url><loc>https://scifaro.com/en/abs/new-integer-linear-programming-models-for-the-vertex-coloring-problem-1706.10191</loc><lastmod>2017-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-integer-linear-programming-models-for-the-vertex-coloring-problem-1706.10191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-integer-linear-programming-models-for-the-vertex-coloring-problem-1706.10191"/></url>
<url><loc>https://scifaro.com/en/abs/angle-monotone-paths-in-non-obtuse-triangulations-1707.00219</loc><lastmod>2017-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angle-monotone-paths-in-non-obtuse-triangulations-1707.00219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angle-monotone-paths-in-non-obtuse-triangulations-1707.00219"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-iga-suitable-planar-parameterization-from-complex-cad-boundary-by-domain-partition-and-global-local-optimization-1707.00607</loc><lastmod>2017-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-iga-suitable-planar-parameterization-from-complex-cad-boundary-by-domain-partition-and-global-local-optimization-1707.00607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-iga-suitable-planar-parameterization-from-complex-cad-boundary-by-domain-partition-and-global-local-optimization-1707.00607"/></url>
<url><loc>https://scifaro.com/en/abs/supporting-ruled-polygons-1707.00826</loc><lastmod>2017-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supporting-ruled-polygons-1707.00826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supporting-ruled-polygons-1707.00826"/></url>
<url><loc>https://scifaro.com/en/abs/edge-unfolding-nearly-flat-convex-caps-1707.01006</loc><lastmod>2021-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-unfolding-nearly-flat-convex-caps-1707.01006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-unfolding-nearly-flat-convex-caps-1707.01006"/></url>
<url><loc>https://scifaro.com/en/abs/hyperbolic-triangulations-and-discrete-random-graphs-1707.01124</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperbolic-triangulations-and-discrete-random-graphs-1707.01124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperbolic-triangulations-and-discrete-random-graphs-1707.01124"/></url>
<url><loc>https://scifaro.com/en/abs/placing-your-coins-on-a-shelf-1707.01239</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/placing-your-coins-on-a-shelf-1707.01239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/placing-your-coins-on-a-shelf-1707.01239"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-optimal-transport-between-a-simplex-soup-and-a-point-cloud-1707.01337</loc><lastmod>2017-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-optimal-transport-between-a-simplex-soup-and-a-point-cloud-1707.01337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-optimal-transport-between-a-simplex-soup-and-a-point-cloud-1707.01337"/></url>
<url><loc>https://scifaro.com/en/abs/fast-asymmetric-fronts-propagation-for-image-segmentation-1707.02403</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-asymmetric-fronts-propagation-for-image-segmentation-1707.02403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-asymmetric-fronts-propagation-for-image-segmentation-1707.02403"/></url>
<url><loc>https://scifaro.com/en/abs/on-string-contact-representations-in-3d-1707.02953</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-string-contact-representations-in-3d-1707.02953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-string-contact-representations-in-3d-1707.02953"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-geodesic-nearest-neighbor-searching-in-a-simple-polygon-1707.02961</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-geodesic-nearest-neighbor-searching-in-a-simple-polygon-1707.02961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-geodesic-nearest-neighbor-searching-in-a-simple-polygon-1707.02961"/></url>
<url><loc>https://scifaro.com/en/abs/a-technique-for-solving-the-polygon-inclusion-problems-1707.04071</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-technique-for-solving-the-polygon-inclusion-problems-1707.04071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-technique-for-solving-the-polygon-inclusion-problems-1707.04071"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-electrical-reduction-on-surfaces-1707.04683</loc><lastmod>2019-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-electrical-reduction-on-surfaces-1707.04683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-electrical-reduction-on-surfaces-1707.04683"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-range-searching-among-curves-1707.04789</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-range-searching-among-curves-1707.04789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-range-searching-among-curves-1707.04789"/></url>
<url><loc>https://scifaro.com/en/abs/packing-plane-spanning-trees-and-paths-in-complete-geometric-graphs-1707.05440</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-plane-spanning-trees-and-paths-in-complete-geometric-graphs-1707.05440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-plane-spanning-trees-and-paths-in-complete-geometric-graphs-1707.05440"/></url>
<url><loc>https://scifaro.com/en/abs/energy-efficient-strip-monitoring-by-identical-devices-directed-to-one-side-along-the-strip-and-having-a-coverage-area-in-the-form-of-a-sector-1707.05464</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/energy-efficient-strip-monitoring-by-identical-devices-directed-to-one-side-along-the-strip-and-having-a-coverage-area-in-the-form-of-a-sector-1707.05464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/energy-efficient-strip-monitoring-by-identical-devices-directed-to-one-side-along-the-strip-and-having-a-coverage-area-in-the-form-of-a-sector-1707.05464"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-triangulation-1707.05466</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-triangulation-1707.05466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-triangulation-1707.05466"/></url>
<url><loc>https://scifaro.com/en/abs/on-recent-advances-in-2d-constrained-delaunay-triangulation-algorithms-1707.05949</loc><lastmod>2017-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-recent-advances-in-2d-constrained-delaunay-triangulation-algorithms-1707.05949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-recent-advances-in-2d-constrained-delaunay-triangulation-algorithms-1707.05949"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-simplex-stars-1707.08373</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-simplex-stars-1707.08373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-simplex-stars-1707.08373"/></url>
<url><loc>https://scifaro.com/en/abs/the-shape-metric-for-clustering-algorithms-1707.08524</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-shape-metric-for-clustering-algorithms-1707.08524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-shape-metric-for-clustering-algorithms-1707.08524"/></url>
<url><loc>https://scifaro.com/en/abs/rational-points-on-the-unit-sphere-approximation-complexity-and-practical-constructions-1707.08549</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-points-on-the-unit-sphere-approximation-complexity-and-practical-constructions-1707.08549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-points-on-the-unit-sphere-approximation-complexity-and-practical-constructions-1707.08549"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-minimal-dispersion-of-point-sets-in-the-unit-cube-1707.08794</loc><lastmod>2017-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-minimal-dispersion-of-point-sets-in-the-unit-cube-1707.08794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-minimal-dispersion-of-point-sets-in-the-unit-cube-1707.08794"/></url>
<url><loc>https://scifaro.com/en/abs/planar-graphs-as-l-intersection-or-l-contact-graphs-1707.08833</loc><lastmod>2017-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-graphs-as-l-intersection-or-l-contact-graphs-1707.08833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-graphs-as-l-intersection-or-l-contact-graphs-1707.08833"/></url>
<url><loc>https://scifaro.com/en/abs/expanding-visibility-polygons-by-mirrors-upto-at-least-k-units-1707.09504</loc><lastmod>2017-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expanding-visibility-polygons-by-mirrors-upto-at-least-k-units-1707.09504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expanding-visibility-polygons-by-mirrors-upto-at-least-k-units-1707.09504"/></url>
<url><loc>https://scifaro.com/en/abs/line-segment-covering-of-cells-in-arrangements-1708.00576</loc><lastmod>2017-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-segment-covering-of-cells-in-arrangements-1708.00576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-segment-covering-of-cells-in-arrangements-1708.00576"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-area-quadrilateral-in-a-convex-polygon-revisited-1708.00681</loc><lastmod>2018-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-area-quadrilateral-in-a-convex-polygon-revisited-1708.00681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-area-quadrilateral-in-a-convex-polygon-revisited-1708.00681"/></url>
<url><loc>https://scifaro.com/en/abs/improved-time-space-trade-offs-for-computing-voronoi-diagrams-1708.00814</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-time-space-trade-offs-for-computing-voronoi-diagrams-1708.00814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-time-space-trade-offs-for-computing-voronoi-diagrams-1708.00814"/></url>
<url><loc>https://scifaro.com/en/abs/on-balanced-4-holes-in-bichromatic-point-sets-1708.01321</loc><lastmod>2017-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-balanced-4-holes-in-bichromatic-point-sets-1708.01321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-balanced-4-holes-in-bichromatic-point-sets-1708.01321"/></url>
<url><loc>https://scifaro.com/en/abs/a-low-rank-spline-approximation-of-planar-domains-1708.01347</loc><lastmod>2017-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-low-rank-spline-approximation-of-planar-domains-1708.01347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-low-rank-spline-approximation-of-planar-domains-1708.01347"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-embedding-of-path-and-cycle-graphs-in-pseudo-convex-polygons-1708.01457</loc><lastmod>2017-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-embedding-of-path-and-cycle-graphs-in-pseudo-convex-polygons-1708.01457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-embedding-of-path-and-cycle-graphs-in-pseudo-convex-polygons-1708.01457"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-orthogonal-watchman-route-problem-with-minimum-bends-1708.01461</loc><lastmod>2017-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-orthogonal-watchman-route-problem-with-minimum-bends-1708.01461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-orthogonal-watchman-route-problem-with-minimum-bends-1708.01461"/></url>
<url><loc>https://scifaro.com/en/abs/grid-obstacle-representation-of-graphs-1708.01765</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grid-obstacle-representation-of-graphs-1708.01765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grid-obstacle-representation-of-graphs-1708.01765"/></url>
<url><loc>https://scifaro.com/en/abs/grid-obstacle-representations-with-connections-to-staircase-guarding-1708.01903</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grid-obstacle-representations-with-connections-to-staircase-guarding-1708.01903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grid-obstacle-representations-with-connections-to-staircase-guarding-1708.01903"/></url>
<url><loc>https://scifaro.com/en/abs/layouts-for-plane-graphs-on-constant-number-of-tracks-1708.02114</loc><lastmod>2017-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layouts-for-plane-graphs-on-constant-number-of-tracks-1708.02114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layouts-for-plane-graphs-on-constant-number-of-tracks-1708.02114"/></url>
<url><loc>https://scifaro.com/en/abs/an-approach-to-quad-meshing-based-on-harmonic-cross-valued-maps-and-the-ginzburg-landau-theory-1708.02316</loc><lastmod>2018-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approach-to-quad-meshing-based-on-harmonic-cross-valued-maps-and-the-ginzburg-landau-theory-1708.02316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approach-to-quad-meshing-based-on-harmonic-cross-valued-maps-and-the-ginzburg-landau-theory-1708.02316"/></url>
<url><loc>https://scifaro.com/en/abs/kinematic-interpretation-of-the-study-quadric-s-ambient-space-1708.02622</loc><lastmod>2017-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinematic-interpretation-of-the-study-quadric-s-ambient-space-1708.02622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinematic-interpretation-of-the-study-quadric-s-ambient-space-1708.02622"/></url>
<url><loc>https://scifaro.com/en/abs/online-unit-clustering-in-higher-dimensions-1708.02662</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-unit-clustering-in-higher-dimensions-1708.02662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-unit-clustering-in-higher-dimensions-1708.02662"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-algorithms-for-separating-a-polyhedron-from-its-single-part-mold-1708.04203</loc><lastmod>2021-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-algorithms-for-separating-a-polyhedron-from-its-single-part-mold-1708.04203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-algorithms-for-separating-a-polyhedron-from-its-single-part-mold-1708.04203"/></url>
<url><loc>https://scifaro.com/en/abs/optimally-guarding-2-reflex-orthogonal-polyhedra-by-reflex-edge-guards-1708.05469</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimally-guarding-2-reflex-orthogonal-polyhedra-by-reflex-edge-guards-1708.05469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimally-guarding-2-reflex-orthogonal-polyhedra-by-reflex-edge-guards-1708.05469"/></url>
<url><loc>https://scifaro.com/en/abs/non-crossing-paths-with-geographic-constraints-1708.05486</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-crossing-paths-with-geographic-constraints-1708.05486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-crossing-paths-with-geographic-constraints-1708.05486"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-hidden-guarding-of-histogram-polygons-1708.05815</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-hidden-guarding-of-histogram-polygons-1708.05815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-hidden-guarding-of-histogram-polygons-1708.05815"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-partitions-of-3-colored-geometric-sets-in-the-plane-1708.06062</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-partitions-of-3-colored-geometric-sets-in-the-plane-1708.06062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-partitions-of-3-colored-geometric-sets-in-the-plane-1708.06062"/></url>
<url><loc>https://scifaro.com/en/abs/helly-numbers-of-polyominoes-1708.06063</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/helly-numbers-of-polyominoes-1708.06063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/helly-numbers-of-polyominoes-1708.06063"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-order-types-1708.06064</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-order-types-1708.06064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-order-types-1708.06064"/></url>
<url><loc>https://scifaro.com/en/abs/3d-visibility-representations-of-1-planar-graphs-1708.06196</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3d-visibility-representations-of-1-planar-graphs-1708.06196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3d-visibility-representations-of-1-planar-graphs-1708.06196"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbors-search-without-false-negatives-for-l-2-for-c-sqrt-log-log-n-1708.06395</loc><lastmod>2017-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbors-search-without-false-negatives-for-l-2-for-c-sqrt-log-log-n-1708.06395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbors-search-without-false-negatives-for-l-2-for-c-sqrt-log-log-n-1708.06395"/></url>
<url><loc>https://scifaro.com/en/abs/arrangements-of-pseudocircles-triangles-and-drawings-1708.06449</loc><lastmod>2020-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrangements-of-pseudocircles-triangles-and-drawings-1708.06449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrangements-of-pseudocircles-triangles-and-drawings-1708.06449"/></url>
<url><loc>https://scifaro.com/en/abs/support-free-hollowing-for-3d-printing-via-voronoi-diagram-of-ellipses-1708.06577</loc><lastmod>2017-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/support-free-hollowing-for-3d-printing-via-voronoi-diagram-of-ellipses-1708.06577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/support-free-hollowing-for-3d-printing-via-voronoi-diagram-of-ellipses-1708.06577"/></url>
<url><loc>https://scifaro.com/en/abs/upward-partitioned-book-embeddings-1708.06730</loc><lastmod>2017-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-partitioned-book-embeddings-1708.06730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-partitioned-book-embeddings-1708.06730"/></url>
<url><loc>https://scifaro.com/en/abs/geodesics-of-triangulated-image-object-shapes-approximating-image-shapes-via-rectilinear-and-curvilinear-triangulations-1708.07413</loc><lastmod>2017-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesics-of-triangulated-image-object-shapes-approximating-image-shapes-via-rectilinear-and-curvilinear-triangulations-1708.07413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesics-of-triangulated-image-object-shapes-approximating-image-shapes-via-rectilinear-and-curvilinear-triangulations-1708.07413"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-level-planarity-geodesic-planarity-and-bi-monotonicity-1708.07428</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-level-planarity-geodesic-planarity-and-bi-monotonicity-1708.07428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-level-planarity-geodesic-planarity-and-bi-monotonicity-1708.07428"/></url>
<url><loc>https://scifaro.com/en/abs/gap-planar-graphs-1708.07653</loc><lastmod>2019-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gap-planar-graphs-1708.07653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gap-planar-graphs-1708.07653"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-sparsification-of-simplicial-complexes-for-clustering-and-label-propagation-1708.08436</loc><lastmod>2019-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-sparsification-of-simplicial-complexes-for-clustering-and-label-propagation-1708.08436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-sparsification-of-simplicial-complexes-for-clustering-and-label-propagation-1708.08436"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-big-graphs-using-spectral-sparsification-1708.08659</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-big-graphs-using-spectral-sparsification-1708.08659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-big-graphs-using-spectral-sparsification-1708.08659"/></url>
<url><loc>https://scifaro.com/en/abs/fused-segmentation-of-geometric-models-for-myocardium-and-coronary-artery-via-medial-axis-1708.09055</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fused-segmentation-of-geometric-models-for-myocardium-and-coronary-artery-via-medial-axis-1708.09055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fused-segmentation-of-geometric-models-for-myocardium-and-coronary-artery-via-medial-axis-1708.09055"/></url>
<url><loc>https://scifaro.com/en/abs/colored-point-set-embeddings-of-acyclic-graphs-1708.09167</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-point-set-embeddings-of-acyclic-graphs-1708.09167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-point-set-embeddings-of-acyclic-graphs-1708.09167"/></url>
<url><loc>https://scifaro.com/en/abs/improvements-on-the-k-center-problem-for-uncertain-data-1708.09180</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improvements-on-the-k-center-problem-for-uncertain-data-1708.09180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improvements-on-the-k-center-problem-for-uncertain-data-1708.09180"/></url>
<url><loc>https://scifaro.com/en/abs/planar-drawings-of-fixed-mobile-bigraphs-1708.09238</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-drawings-of-fixed-mobile-bigraphs-1708.09238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-drawings-of-fixed-mobile-bigraphs-1708.09238"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-approximating-weighted-independence-on-intersection-graphs-of-paths-on-a-grid-1708.09314</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-approximating-weighted-independence-on-intersection-graphs-of-paths-on-a-grid-1708.09314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-approximating-weighted-independence-on-intersection-graphs-of-paths-on-a-grid-1708.09314"/></url>
<url><loc>https://scifaro.com/en/abs/computational-topology-techniques-for-characterizing-time-series-data-1708.09359</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-topology-techniques-for-characterizing-time-series-data-1708.09359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-topology-techniques-for-characterizing-time-series-data-1708.09359"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-to-simulate-alternating-turing-machine-in-signal-machine-1708.09455</loc><lastmod>2017-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-to-simulate-alternating-turing-machine-in-signal-machine-1708.09455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-to-simulate-alternating-turing-machine-in-signal-machine-1708.09455"/></url>
<url><loc>https://scifaro.com/en/abs/on-upward-drawings-of-trees-on-a-given-grid-1708.09515</loc><lastmod>2017-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-upward-drawings-of-trees-on-a-given-grid-1708.09515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-upward-drawings-of-trees-on-a-given-grid-1708.09515"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-plus-contacts-rectangular-duals-and-box-orthogonal-drawings-1708.09560</loc><lastmod>2017-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-plus-contacts-rectangular-duals-and-box-orthogonal-drawings-1708.09560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-plus-contacts-rectangular-duals-and-box-orthogonal-drawings-1708.09560"/></url>
<url><loc>https://scifaro.com/en/abs/epg-representations-with-small-grid-size-1708.09749</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epg-representations-with-small-grid-size-1708.09749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epg-representations-with-small-grid-size-1708.09749"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-bobbin-lace-graphs-or-fundamental-cycles-for-a-subclass-of-periodic-graphs-1708.09778</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-bobbin-lace-graphs-or-fundamental-cycles-for-a-subclass-of-periodic-graphs-1708.09778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-bobbin-lace-graphs-or-fundamental-cycles-for-a-subclass-of-periodic-graphs-1708.09778"/></url>
<url><loc>https://scifaro.com/en/abs/experimental-analysis-of-the-accessibility-of-drawings-with-few-segments-1708.09815</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experimental-analysis-of-the-accessibility-of-drawings-with-few-segments-1708.09815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experimental-analysis-of-the-accessibility-of-drawings-with-few-segments-1708.09815"/></url>
<url><loc>https://scifaro.com/en/abs/lombardi-drawings-of-knots-and-links-1708.09819</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lombardi-drawings-of-knots-and-links-1708.09819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lombardi-drawings-of-knots-and-links-1708.09819"/></url>
<url><loc>https://scifaro.com/en/abs/the-painter-s-problem-covering-a-grid-with-colored-connected-polygons-1709.00001</loc><lastmod>2017-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-painter-s-problem-covering-a-grid-with-colored-connected-polygons-1709.00001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-painter-s-problem-covering-a-grid-with-colored-connected-polygons-1709.00001"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-edge-length-ratio-of-outerplanar-graphs-1709.00043</loc><lastmod>2017-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-edge-length-ratio-of-outerplanar-graphs-1709.00043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-edge-length-ratio-of-outerplanar-graphs-1709.00043"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-en-ex-marking-rule-for-degenerate-intersection-points-in-2d-polygon-clipping-1709.00184</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-en-ex-marking-rule-for-degenerate-intersection-points-in-2d-polygon-clipping-1709.00184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-en-ex-marking-rule-for-degenerate-intersection-points-in-2d-polygon-clipping-1709.00184"/></url>
<url><loc>https://scifaro.com/en/abs/mixed-linear-layouts-of-planar-graphs-1709.00285</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixed-linear-layouts-of-planar-graphs-1709.00285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixed-linear-layouts-of-planar-graphs-1709.00285"/></url>
<url><loc>https://scifaro.com/en/abs/anisotropic-radial-layout-for-visualizing-centrality-and-structure-in-graphs-1709.00804</loc><lastmod>2018-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anisotropic-radial-layout-for-visualizing-centrality-and-structure-in-graphs-1709.00804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anisotropic-radial-layout-for-visualizing-centrality-and-structure-in-graphs-1709.00804"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-for-low-complexity-models-1709.01037</loc><lastmod>2019-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-for-low-complexity-models-1709.01037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-for-low-complexity-models-1709.01037"/></url>
<url><loc>https://scifaro.com/en/abs/computing-storyline-visualizations-with-few-block-crossings-1709.01055</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-storyline-visualizations-with-few-block-crossings-1709.01055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-storyline-visualizations-with-few-block-crossings-1709.01055"/></url>
<url><loc>https://scifaro.com/en/abs/fault-tolerant-additive-weighted-geometric-spanners-1709.01061</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-tolerant-additive-weighted-geometric-spanners-1709.01061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-tolerant-additive-weighted-geometric-spanners-1709.01061"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-drawing-trees-on-fixed-points-with-l-shaped-edges-1709.01456</loc><lastmod>2017-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-drawing-trees-on-fixed-points-with-l-shaped-edges-1709.01456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-drawing-trees-on-fixed-points-with-l-shaped-edges-1709.01456"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-path-polygons-with-orthogonal-visibility-1709.01569</loc><lastmod>2017-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-path-polygons-with-orthogonal-visibility-1709.01569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-path-polygons-with-orthogonal-visibility-1709.01569"/></url>
<url><loc>https://scifaro.com/en/abs/addendum-to-edge-unfolding-nearly-flat-convex-caps-1709.02433</loc><lastmod>2017-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/addendum-to-edge-unfolding-nearly-flat-convex-caps-1709.02433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/addendum-to-edge-unfolding-nearly-flat-convex-caps-1709.02433"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-line-separators-of-unit-disk-graphs-1709.02579</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-line-separators-of-unit-disk-graphs-1709.02579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-line-separators-of-unit-disk-graphs-1709.02579"/></url>
<url><loc>https://scifaro.com/en/abs/homotheties-and-incidences-1709.02933</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotheties-and-incidences-1709.02933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotheties-and-incidences-1709.02933"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-dispersion-of-sparse-grids-1709.02983</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-dispersion-of-sparse-grids-1709.02983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-dispersion-of-sparse-grids-1709.02983"/></url>
<url><loc>https://scifaro.com/en/abs/special-guards-in-chromatic-art-gallery-1709.02996</loc><lastmod>2017-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/special-guards-in-chromatic-art-gallery-1709.02996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/special-guards-in-chromatic-art-gallery-1709.02996"/></url>
<url><loc>https://scifaro.com/en/abs/subspace-least-squares-multidimensional-scaling-1709.03484</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subspace-least-squares-multidimensional-scaling-1709.03484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subspace-least-squares-multidimensional-scaling-1709.03484"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-free-coloring-of-intersection-graphs-1709.03876</loc><lastmod>2017-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-free-coloring-of-intersection-graphs-1709.03876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-free-coloring-of-intersection-graphs-1709.03876"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-25th-international-symposium-on-graph-drawing-and-network-visualization-gd-2017-1709.04228</loc><lastmod>2017-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-25th-international-symposium-on-graph-drawing-and-network-visualization-gd-2017-1709.04228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-25th-international-symposium-on-graph-drawing-and-network-visualization-gd-2017-1709.04228"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-network-graphical-deformation-of-penetrated-objects-1709.04866</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-network-graphical-deformation-of-penetrated-objects-1709.04866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-network-graphical-deformation-of-penetrated-objects-1709.04866"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-to-cover-and-hit-a-set-of-line-segments-optimally-by-two-axis-parallel-squares-1709.04870</loc><lastmod>2017-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-to-cover-and-hit-a-set-of-line-segments-optimally-by-two-axis-parallel-squares-1709.04870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-to-cover-and-hit-a-set-of-line-segments-optimally-by-two-axis-parallel-squares-1709.04870"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-clustering-in-normed-planes-1709.04976</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-clustering-in-normed-planes-1709.04976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-clustering-in-normed-planes-1709.04976"/></url>
<url><loc>https://scifaro.com/en/abs/the-dominating-set-problem-in-geometric-intersection-graphs-1709.05182</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dominating-set-problem-in-geometric-intersection-graphs-1709.05182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dominating-set-problem-in-geometric-intersection-graphs-1709.05182"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-difference-between-closest-furthest-and-orthogonal-pairs-nearly-linear-vs-barely-subquadratic-complexity-in-computational-geometry-1709.05282</loc><lastmod>2018-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-difference-between-closest-furthest-and-orthogonal-pairs-nearly-linear-vs-barely-subquadratic-complexity-in-computational-geometry-1709.05282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-difference-between-closest-furthest-and-orthogonal-pairs-nearly-linear-vs-barely-subquadratic-complexity-in-computational-geometry-1709.05282"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-approach-for-ellipsoidal-outer-approximation-of-the-intersection-region-of-ellipses-in-the-plane-1709.06021</loc><lastmod>2017-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-approach-for-ellipsoidal-outer-approximation-of-the-intersection-region-of-ellipses-in-the-plane-1709.06021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-approach-for-ellipsoidal-outer-approximation-of-the-intersection-region-of-ellipses-in-the-plane-1709.06021"/></url>
<url><loc>https://scifaro.com/en/abs/parameterization-of-configuration-space-obstacles-in-three-dimensional-rotational-motion-planning-1709.06601</loc><lastmod>2017-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterization-of-configuration-space-obstacles-in-three-dimensional-rotational-motion-planning-1709.06601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterization-of-configuration-space-obstacles-in-three-dimensional-rotational-motion-planning-1709.06601"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-graphs-on-few-circles-and-few-spheres-1709.06965</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-graphs-on-few-circles-and-few-spheres-1709.06965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-graphs-on-few-circles-and-few-spheres-1709.06965"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-nearest-neighbor-search-for-dynamical-systems-with-nonholonomic-constraints-1709.07610</loc><lastmod>2017-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-nearest-neighbor-search-for-dynamical-systems-with-nonholonomic-constraints-1709.07610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-nearest-neighbor-search-for-dynamical-systems-with-nonholonomic-constraints-1709.07610"/></url>
<url><loc>https://scifaro.com/en/abs/exact-computation-of-a-manifold-metric-via-lipschitz-embeddings-and-shortest-paths-on-a-graph-1709.07797</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-computation-of-a-manifold-metric-via-lipschitz-embeddings-and-shortest-paths-on-a-graph-1709.07797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-computation-of-a-manifold-metric-via-lipschitz-embeddings-and-shortest-paths-on-a-graph-1709.07797"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-computing-a-cycle-separator-1709.08122</loc><lastmod>2018-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-computing-a-cycle-separator-1709.08122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-computing-a-cycle-separator-1709.08122"/></url>
<url><loc>https://scifaro.com/en/abs/shadow-detection-and-geo-tagged-image-information-based-strategic-infrastructure-characterization-1709.08375</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shadow-detection-and-geo-tagged-image-information-based-strategic-infrastructure-characterization-1709.08375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shadow-detection-and-geo-tagged-image-information-based-strategic-infrastructure-characterization-1709.08375"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-weak-embeddings-of-graphs-1709.09209</loc><lastmod>2019-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-weak-embeddings-of-graphs-1709.09209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-weak-embeddings-of-graphs-1709.09209"/></url>
<url><loc>https://scifaro.com/en/abs/colored-fused-filament-fabrication-1709.09689</loc><lastmod>2019-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-fused-filament-fabrication-1709.09689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-fused-filament-fabrication-1709.09689"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-balanced-subdivision-of-a-simple-polygon-for-time-space-trade-off-algorithms-1709.09932</loc><lastmod>2018-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-balanced-subdivision-of-a-simple-polygon-for-time-space-trade-off-algorithms-1709.09932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-balanced-subdivision-of-a-simple-polygon-for-time-space-trade-off-algorithms-1709.09932"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximate-near-neighbor-search-without-false-negatives-for-l-2-1709.10338</loc><lastmod>2017-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximate-near-neighbor-search-without-false-negatives-for-l-2-1709.10338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximate-near-neighbor-search-without-false-negatives-for-l-2-1709.10338"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-conflict-free-colorings-in-the-plane-1709.10466</loc><lastmod>2017-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-conflict-free-colorings-in-the-plane-1709.10466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-conflict-free-colorings-in-the-plane-1709.10466"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-deformation-method-for-higher-order-mesh-generation-1710.00291</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-deformation-method-for-higher-order-mesh-generation-1710.00291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-deformation-method-for-higher-order-mesh-generation-1710.00291"/></url>
<url><loc>https://scifaro.com/en/abs/orthogonal-terrain-guarding-is-np-complete-1710.00386</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthogonal-terrain-guarding-is-np-complete-1710.00386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthogonal-terrain-guarding-is-np-complete-1710.00386"/></url>
<url><loc>https://scifaro.com/en/abs/square-contact-representations-of-partial-2-trees-and-triconnected-simply-nested-graphs-1710.00426</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-contact-representations-of-partial-2-trees-and-triconnected-simply-nested-graphs-1710.00426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-contact-representations-of-partial-2-trees-and-triconnected-simply-nested-graphs-1710.00426"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-red-blue-points-separation-1710.00637</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-red-blue-points-separation-1710.00637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-red-blue-points-separation-1710.00637"/></url>
<url><loc>https://scifaro.com/en/abs/network-optimization-on-partitioned-pairs-of-points-1710.00876</loc><lastmod>2017-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-optimization-on-partitioned-pairs-of-points-1710.00876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-optimization-on-partitioned-pairs-of-points-1710.00876"/></url>
<url><loc>https://scifaro.com/en/abs/online-unit-covering-in-euclidean-space-1710.00954</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-unit-covering-in-euclidean-space-1710.00954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-unit-covering-in-euclidean-space-1710.00954"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-generation-of-geographically-accurate-transit-maps-1710.02226</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-generation-of-geographically-accurate-transit-maps-1710.02226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-generation-of-geographically-accurate-transit-maps-1710.02226"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-the-orbit-conjecture-for-flipping-edge-labelled-triangulations-1710.02741</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-orbit-conjecture-for-flipping-edge-labelled-triangulations-1710.02741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-orbit-conjecture-for-flipping-edge-labelled-triangulations-1710.02741"/></url>
<url><loc>https://scifaro.com/en/abs/grid-peeling-and-the-affine-curve-shortening-flow-1710.03960</loc><lastmod>2020-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grid-peeling-and-the-affine-curve-shortening-flow-1710.03960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grid-peeling-and-the-affine-curve-shortening-flow-1710.03960"/></url>
<url><loc>https://scifaro.com/en/abs/balancing-expression-dags-for-more-efficient-lazy-adaptive-evaluation-1710.04576</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancing-expression-dags-for-more-efficient-lazy-adaptive-evaluation-1710.04576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancing-expression-dags-for-more-efficient-lazy-adaptive-evaluation-1710.04576"/></url>
<url><loc>https://scifaro.com/en/abs/4-connected-planar-graphs-are-in-b-3-epg-1710.04583</loc><lastmod>2017-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/4-connected-planar-graphs-are-in-b-3-epg-1710.04583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/4-connected-planar-graphs-are-in-b-3-epg-1710.04583"/></url>
<url><loc>https://scifaro.com/en/abs/graph-drawing-by-stochastic-gradient-descent-1710.04626</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-drawing-by-stochastic-gradient-descent-1710.04626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-drawing-by-stochastic-gradient-descent-1710.04626"/></url>
<url><loc>https://scifaro.com/en/abs/pcpnet-learning-local-shape-properties-from-raw-point-clouds-1710.04954</loc><lastmod>2018-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pcpnet-learning-local-shape-properties-from-raw-point-clouds-1710.04954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pcpnet-learning-local-shape-properties-from-raw-point-clouds-1710.04954"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-hotspots-of-orthogonal-trajectories-1710.05185</loc><lastmod>2019-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-hotspots-of-orthogonal-trajectories-1710.05185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-hotspots-of-orthogonal-trajectories-1710.05185"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-coherence-penalized-minimal-path-model-with-application-to-retinal-vessel-centerline-delineation-1710.06194</loc><lastmod>2017-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-coherence-penalized-minimal-path-model-with-application-to-retinal-vessel-centerline-delineation-1710.06194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-coherence-penalized-minimal-path-model-with-application-to-retinal-vessel-centerline-delineation-1710.06194"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-neighbor-finding-on-space-filling-curves-1710.06384</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-neighbor-finding-on-space-filling-curves-1710.06384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-neighbor-finding-on-space-filling-curves-1710.06384"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-potential-theoretic-mother-bodies-in-electrostatics-1710.06991</loc><lastmod>2017-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-potential-theoretic-mother-bodies-in-electrostatics-1710.06991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-potential-theoretic-mother-bodies-in-electrostatics-1710.06991"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-computing-with-chain-complexes-design-and-features-of-a-julia-package-1710.07819</loc><lastmod>2017-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-computing-with-chain-complexes-design-and-features-of-a-julia-package-1710.07819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-computing-with-chain-complexes-design-and-features-of-a-julia-package-1710.07819"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-routing-between-non-visible-vertices-1710.08060</loc><lastmod>2021-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-routing-between-non-visible-vertices-1710.08060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-routing-between-non-visible-vertices-1710.08060"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-dispersion-of-admissible-lattices-1710.08694</loc><lastmod>2021-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-dispersion-of-admissible-lattices-1710.08694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-dispersion-of-admissible-lattices-1710.08694"/></url>
<url><loc>https://scifaro.com/en/abs/the-geodesic-2-center-problem-in-a-simple-polygon-1710.09035</loc><lastmod>2017-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geodesic-2-center-problem-in-a-simple-polygon-1710.09035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geodesic-2-center-problem-in-a-simple-polygon-1710.09035"/></url>
<url><loc>https://scifaro.com/en/abs/topological-characteristics-of-oil-and-gas-reservoirs-and-their-applications-1710.09721</loc><lastmod>2022-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-characteristics-of-oil-and-gas-reservoirs-and-their-applications-1710.09721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-characteristics-of-oil-and-gas-reservoirs-and-their-applications-1710.09721"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-geodesics-in-cat-0-cubical-complexes-1710.09932</loc><lastmod>2018-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-geodesics-in-cat-0-cubical-complexes-1710.09932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-geodesics-in-cat-0-cubical-complexes-1710.09932"/></url>
<url><loc>https://scifaro.com/en/abs/fast-frechet-distance-between-curves-with-long-edges-1710.10521</loc><lastmod>2019-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-frechet-distance-between-curves-with-long-edges-1710.10521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-frechet-distance-between-curves-with-long-edges-1710.10521"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-minimum-area-rectilinear-convex-hull-under-rotation-and-generalizations-1710.10888</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-minimum-area-rectilinear-convex-hull-under-rotation-and-generalizations-1710.10888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-minimum-area-rectilinear-convex-hull-under-rotation-and-generalizations-1710.10888"/></url>
<url><loc>https://scifaro.com/en/abs/rectangle-transformation-problem-1710.10924</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangle-transformation-problem-1710.10924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangle-transformation-problem-1710.10924"/></url>
<url><loc>https://scifaro.com/en/abs/the-stretch-factor-of-hexagon-delaunay-triangulations-1711.00068</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stretch-factor-of-hexagon-delaunay-triangulations-1711.00068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stretch-factor-of-hexagon-delaunay-triangulations-1711.00068"/></url>
<url><loc>https://scifaro.com/en/abs/finding-all-maximal-area-parallelograms-in-a-convex-polygon-1711.00181</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-all-maximal-area-parallelograms-in-a-convex-polygon-1711.00181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-all-maximal-area-parallelograms-in-a-convex-polygon-1711.00181"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-optimal-homotopies-1711.00788</loc><lastmod>2017-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-optimal-homotopies-1711.00788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-optimal-homotopies-1711.00788"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-successive-over-relaxation-algorithm-for-force-directed-network-graph-drawing-1711.01228</loc><lastmod>2018-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-successive-over-relaxation-algorithm-for-force-directed-network-graph-drawing-1711.01228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-successive-over-relaxation-algorithm-for-force-directed-network-graph-drawing-1711.01228"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computability-of-the-fr-echet-distance-of-surfaces-in-the-bit-model-of-real-computation-1711.02161</loc><lastmod>2018-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computability-of-the-fr-echet-distance-of-surfaces-in-the-bit-model-of-real-computation-1711.02161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computability-of-the-fr-echet-distance-of-surfaces-in-the-bit-model-of-real-computation-1711.02161"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-variational-principle-for-riemann-mappings-and-discrete-conformality-1711.02221</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-variational-principle-for-riemann-mappings-and-discrete-conformality-1711.02221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-variational-principle-for-riemann-mappings-and-discrete-conformality-1711.02221"/></url>
<url><loc>https://scifaro.com/en/abs/shape-representation-by-zippable-ribbons-1711.02450</loc><lastmod>2017-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shape-representation-by-zippable-ribbons-1711.02450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shape-representation-by-zippable-ribbons-1711.02450"/></url>
<url><loc>https://scifaro.com/en/abs/time-windowed-contiguous-hotspot-queries-1711.03795</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-windowed-contiguous-hotspot-queries-1711.03795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-windowed-contiguous-hotspot-queries-1711.03795"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-of-hierarchical-clustering-and-persistent-homology-methods-on-directed-networks-1711.04211</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-of-hierarchical-clustering-and-persistent-homology-methods-on-directed-networks-1711.04211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-of-hierarchical-clustering-and-persistent-homology-methods-on-directed-networks-1711.04211"/></url>
<url><loc>https://scifaro.com/en/abs/sixteen-space-filling-curves-and-traversals-for-d-dimensional-cubes-and-simplices-1711.04473</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sixteen-space-filling-curves-and-traversals-for-d-dimensional-cubes-and-simplices-1711.04473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sixteen-space-filling-curves-and-traversals-for-d-dimensional-cubes-and-simplices-1711.04473"/></url>
<url><loc>https://scifaro.com/en/abs/on-partial-covering-for-geometric-set-systems-1711.04882</loc><lastmod>2017-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-partial-covering-for-geometric-set-systems-1711.04882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-partial-covering-for-geometric-set-systems-1711.04882"/></url>
<url><loc>https://scifaro.com/en/abs/analytic-methods-for-geometric-modeling-via-spherical-decomposition-1711.05075</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analytic-methods-for-geometric-modeling-via-spherical-decomposition-1711.05075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analytic-methods-for-geometric-modeling-via-spherical-decomposition-1711.05075"/></url>
<url><loc>https://scifaro.com/en/abs/generation-of-unstructured-meshes-in-2-d-3-d-and-spherical-geometries-with-embedded-high-resolution-sub-regions-1711.06333</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-of-unstructured-meshes-in-2-d-3-d-and-spherical-geometries-with-embedded-high-resolution-sub-regions-1711.06333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-of-unstructured-meshes-in-2-d-3-d-and-spherical-geometries-with-embedded-high-resolution-sub-regions-1711.06333"/></url>
<url><loc>https://scifaro.com/en/abs/triangulated-surface-denoising-using-high-order-regularization-with-dynamic-weights-1711.08137</loc><lastmod>2021-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangulated-surface-denoising-using-high-order-regularization-with-dynamic-weights-1711.08137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangulated-surface-denoising-using-high-order-regularization-with-dynamic-weights-1711.08137"/></url>
<url><loc>https://scifaro.com/en/abs/a-conversion-procedure-for-nnc-polyhedra-1711.09593</loc><lastmod>2017-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-conversion-procedure-for-nnc-polyhedra-1711.09593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-conversion-procedure-for-nnc-polyhedra-1711.09593"/></url>
<url><loc>https://scifaro.com/en/abs/when-are-epsilon-nets-small-1711.10414</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-are-epsilon-nets-small-1711.10414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-are-epsilon-nets-small-1711.10414"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-rectilinear-shortest-path-amid-splinegons-in-plane-1711.11524</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-rectilinear-shortest-path-amid-splinegons-in-plane-1711.11524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-rectilinear-shortest-path-amid-splinegons-in-plane-1711.11524"/></url>
<url><loc>https://scifaro.com/en/abs/shape-complementarity-analysis-for-objects-of-arbitrary-shape-1712.00238</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shape-complementarity-analysis-for-objects-of-arbitrary-shape-1712.00238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shape-complementarity-analysis-for-objects-of-arbitrary-shape-1712.00238"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-width-axis-parallel-empty-rectangular-annulus-1712.00375</loc><lastmod>2017-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-width-axis-parallel-empty-rectangular-annulus-1712.00375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-width-axis-parallel-empty-rectangular-annulus-1712.00375"/></url>
<url><loc>https://scifaro.com/en/abs/drinfeld-modules-with-complex-multiplication-hasse-invariants-and-factoring-polynomials-over-finite-fields-1712.00669</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drinfeld-modules-with-complex-multiplication-hasse-invariants-and-factoring-polynomials-over-finite-fields-1712.00669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drinfeld-modules-with-complex-multiplication-hasse-invariants-and-factoring-polynomials-over-finite-fields-1712.00669"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-to-reconstruct-convex-polyhedra-from-their-face-normals-and-areas-1712.00825</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-to-reconstruct-convex-polyhedra-from-their-face-normals-and-areas-1712.00825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-to-reconstruct-convex-polyhedra-from-their-face-normals-and-areas-1712.00825"/></url>
<url><loc>https://scifaro.com/en/abs/arrangements-of-pseudocircles-on-circularizability-1712.02149</loc><lastmod>2020-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrangements-of-pseudocircles-on-circularizability-1712.02149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrangements-of-pseudocircles-on-circularizability-1712.02149"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-primal-dual-grids-for-unstructured-co-volume-schemes-1712.02657</loc><lastmod>2018-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-primal-dual-grids-for-unstructured-co-volume-schemes-1712.02657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-primal-dual-grids-for-unstructured-co-volume-schemes-1712.02657"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-arrangements-of-hyperplanes-vc-dimension-combinatorial-dimension-and-point-location-1712.02913</loc><lastmod>2017-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-arrangements-of-hyperplanes-vc-dimension-combinatorial-dimension-and-point-location-1712.02913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-arrangements-of-hyperplanes-vc-dimension-combinatorial-dimension-and-point-location-1712.02913"/></url>
<url><loc>https://scifaro.com/en/abs/journey-to-the-center-of-the-point-set-1712.02949</loc><lastmod>2019-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/journey-to-the-center-of-the-point-set-1712.02949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/journey-to-the-center-of-the-point-set-1712.02949"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-longest-spanning-tree-with-neighborhoods-1712.03297</loc><lastmod>2020-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-longest-spanning-tree-with-neighborhoods-1712.03297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-longest-spanning-tree-with-neighborhoods-1712.03297"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-of-transformation-based-on-jacobian-determinant-and-curl-vector-1712.03443</loc><lastmod>2018-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-of-transformation-based-on-jacobian-determinant-and-curl-vector-1712.03443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-of-transformation-based-on-jacobian-determinant-and-curl-vector-1712.03443"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-navigate-through-obstacles-1712.04043</loc><lastmod>2017-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-navigate-through-obstacles-1712.04043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-navigate-through-obstacles-1712.04043"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-the-interleaving-distance-1712.04281</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-the-interleaving-distance-1712.04281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-the-interleaving-distance-1712.04281"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-convex-hull-of-data-streams-1712.04564</loc><lastmod>2017-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-convex-hull-of-data-streams-1712.04564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-convex-hull-of-data-streams-1712.04564"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-spanners-are-optimal-in-doubling-metrics-1712.05007</loc><lastmod>2017-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-spanners-are-optimal-in-doubling-metrics-1712.05007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-spanners-are-optimal-in-doubling-metrics-1712.05007"/></url>
<url><loc>https://scifaro.com/en/abs/qptas-and-subexponential-algorithm-for-maximum-clique-on-disk-graphs-1712.05010</loc><lastmod>2018-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qptas-and-subexponential-algorithm-for-maximum-clique-on-disk-graphs-1712.05010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qptas-and-subexponential-algorithm-for-maximum-clique-on-disk-graphs-1712.05010"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-minimum-area-all-flush-triangles-circumscribing-a-convex-polygon-1712.05081</loc><lastmod>2022-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-minimum-area-all-flush-triangles-circumscribing-a-convex-polygon-1712.05081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-minimum-area-all-flush-triangles-circumscribing-a-convex-polygon-1712.05081"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-for-the-complexity-class-forall-exists-mathbb-r-and-area-universality-1712.05142</loc><lastmod>2021-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-for-the-complexity-class-forall-exists-mathbb-r-and-area-universality-1712.05142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-for-the-complexity-class-forall-exists-mathbb-r-and-area-universality-1712.05142"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-automata-applications-in-shortest-path-problem-1712.05202</loc><lastmod>2017-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-automata-applications-in-shortest-path-problem-1712.05202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-automata-applications-in-shortest-path-problem-1712.05202"/></url>
<url><loc>https://scifaro.com/en/abs/constant-approximation-algorithms-for-guarding-simple-polygons-using-vertex-guards-1712.05492</loc><lastmod>2018-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-approximation-algorithms-for-guarding-simple-polygons-using-vertex-guards-1712.05492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-approximation-algorithms-for-guarding-simple-polygons-using-vertex-guards-1712.05492"/></url>
<url><loc>https://scifaro.com/en/abs/rectilinear-link-diameter-and-radius-in-a-rectilinear-polygonal-domain-1712.05538</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectilinear-link-diameter-and-radius-in-a-rectilinear-polygonal-domain-1712.05538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectilinear-link-diameter-and-radius-in-a-rectilinear-polygonal-domain-1712.05538"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-reducibility-of-geometric-constraint-graphs-1712.05578</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-reducibility-of-geometric-constraint-graphs-1712.05578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-reducibility-of-geometric-constraint-graphs-1712.05578"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-smooth-compressed-quadtrees-fullversion-1712.05591</loc><lastmod>2018-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-smooth-compressed-quadtrees-fullversion-1712.05591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-smooth-compressed-quadtrees-fullversion-1712.05591"/></url>
<url><loc>https://scifaro.com/en/abs/time-space-trade-offs-for-computing-euclidean-minimum-spanning-trees-1712.06431</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-space-trade-offs-for-computing-euclidean-minimum-spanning-trees-1712.06431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-space-trade-offs-for-computing-euclidean-minimum-spanning-trees-1712.06431"/></url>
<url><loc>https://scifaro.com/en/abs/products-of-euclidean-metrics-and-applications-to-proximity-questions-among-curves-1712.06471</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/products-of-euclidean-metrics-and-applications-to-proximity-questions-among-curves-1712.06471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/products-of-euclidean-metrics-and-applications-to-proximity-questions-among-curves-1712.06471"/></url>
<url><loc>https://scifaro.com/en/abs/don-t-rock-the-boat-algorithms-for-balanced-dynamic-loading-and-unloading-1712.06498</loc><lastmod>2018-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/don-t-rock-the-boat-algorithms-for-balanced-dynamic-loading-and-unloading-1712.06498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/don-t-rock-the-boat-algorithms-for-balanced-dynamic-loading-and-unloading-1712.06498"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-low-distortion-embeddings-into-arbitrary-1-dimensional-spaces-1712.06747</loc><lastmod>2017-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-low-distortion-embeddings-into-arbitrary-1-dimensional-spaces-1712.06747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-low-distortion-embeddings-into-arbitrary-1-dimensional-spaces-1712.06747"/></url>
<url><loc>https://scifaro.com/en/abs/laguerre-intersection-method-for-implicit-solvation-1712.06956</loc><lastmod>2017-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/laguerre-intersection-method-for-implicit-solvation-1712.06956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/laguerre-intersection-method-for-implicit-solvation-1712.06956"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorics-of-beacon-based-routing-in-three-dimensions-1712.07416</loc><lastmod>2020-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorics-of-beacon-based-routing-in-three-dimensions-1712.07416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorics-of-beacon-based-routing-in-three-dimensions-1712.07416"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-generalized-transmission-graphs-of-line-segments-and-circular-sectors-1712.07559</loc><lastmod>2017-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-generalized-transmission-graphs-of-line-segments-and-circular-sectors-1712.07559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-generalized-transmission-graphs-of-line-segments-and-circular-sectors-1712.07559"/></url>
<url><loc>https://scifaro.com/en/abs/sheaf-theoretic-stratification-learning-from-geometric-and-topological-perspectives-1712.07734</loc><lastmod>2020-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sheaf-theoretic-stratification-learning-from-geometric-and-topological-perspectives-1712.07734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sheaf-theoretic-stratification-learning-from-geometric-and-topological-perspectives-1712.07734"/></url>
<url><loc>https://scifaro.com/en/abs/differential-geometry-and-stochastic-dynamics-with-deep-learning-numerics-1712.08364</loc><lastmod>2017-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-geometry-and-stochastic-dynamics-with-deep-learning-numerics-1712.08364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-geometry-and-stochastic-dynamics-with-deep-learning-numerics-1712.08364"/></url>
<url><loc>https://scifaro.com/en/abs/optimality-program-in-segment-and-string-graphs-1712.08907</loc><lastmod>2018-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimality-program-in-segment-and-string-graphs-1712.08907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimality-program-in-segment-and-string-graphs-1712.08907"/></url>
<url><loc>https://scifaro.com/en/abs/largest-and-smallest-area-triangles-on-imprecise-points-1712.08911</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/largest-and-smallest-area-triangles-on-imprecise-points-1712.08911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/largest-and-smallest-area-triangles-on-imprecise-points-1712.08911"/></url>
<url><loc>https://scifaro.com/en/abs/folding-polyominoes-into-poly-cubes-1712.09317</loc><lastmod>2018-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-polyominoes-into-poly-cubes-1712.09317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-polyominoes-into-poly-cubes-1712.09317"/></url>
<url><loc>https://scifaro.com/en/abs/new-bounds-for-range-closest-pair-problems-1712.09749</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-bounds-for-range-closest-pair-problems-1712.09749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-bounds-for-range-closest-pair-problems-1712.09749"/></url>
<url><loc>https://scifaro.com/en/abs/interesting-paths-in-the-mapper-1712.10197</loc><lastmod>2018-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interesting-paths-in-the-mapper-1712.10197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interesting-paths-in-the-mapper-1712.10197"/></url>
<url><loc>https://scifaro.com/en/abs/sketching-and-clustering-metric-measure-spaces-1801.00551</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sketching-and-clustering-metric-measure-spaces-1801.00551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sketching-and-clustering-metric-measure-spaces-1801.00551"/></url>
<url><loc>https://scifaro.com/en/abs/there-are-174-subdivisions-of-the-hexahedron-into-tetrahedra-1801.01288</loc><lastmod>2018-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/there-are-174-subdivisions-of-the-hexahedron-into-tetrahedra-1801.01288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/there-are-174-subdivisions-of-the-hexahedron-into-tetrahedra-1801.01288"/></url>
<url><loc>https://scifaro.com/en/abs/coordinated-motion-planning-reconfiguring-a-swarm-of-labeled-robots-with-bounded-stretch-1801.01689</loc><lastmod>2018-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coordinated-motion-planning-reconfiguring-a-swarm-of-labeled-robots-with-bounded-stretch-1801.01689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coordinated-motion-planning-reconfiguring-a-swarm-of-labeled-robots-with-bounded-stretch-1801.01689"/></url>
<url><loc>https://scifaro.com/en/abs/subquadratic-encodings-for-point-configurations-1801.01767</loc><lastmod>2018-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subquadratic-encodings-for-point-configurations-1801.01767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subquadratic-encodings-for-point-configurations-1801.01767"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-a-convex-polygon-from-its-omega-cloud-1801.02162</loc><lastmod>2019-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-a-convex-polygon-from-its-omega-cloud-1801.02162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-a-convex-polygon-from-its-omega-cloud-1801.02162"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-diagrams-for-a-moderate-sized-point-set-in-a-simple-polygon-1801.02292</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagrams-for-a-moderate-sized-point-set-in-a-simple-polygon-1801.02292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagrams-for-a-moderate-sized-point-set-in-a-simple-polygon-1801.02292"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-disassemble-and-pack-for-mechanism-1801.02356</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-disassemble-and-pack-for-mechanism-1801.02356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-disassemble-and-pack-for-mechanism-1801.02356"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-morphs-of-planar-orthogonal-drawings-1801.02455</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-morphs-of-planar-orthogonal-drawings-1801.02455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-morphs-of-planar-orthogonal-drawings-1801.02455"/></url>
<url><loc>https://scifaro.com/en/abs/stabbing-pairwise-intersecting-disks-by-five-points-1801.03158</loc><lastmod>2021-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabbing-pairwise-intersecting-disks-by-five-points-1801.03158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabbing-pairwise-intersecting-disks-by-five-points-1801.03158"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-stratified-morse-theory-algorithms-and-a-user-s-guide-1801.03183</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-stratified-morse-theory-algorithms-and-a-user-s-guide-1801.03183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-stratified-morse-theory-algorithms-and-a-user-s-guide-1801.03183"/></url>
<url><loc>https://scifaro.com/en/abs/fpt-algorithms-for-embedding-into-low-complexity-graphic-metrics-1801.03253</loc><lastmod>2018-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fpt-algorithms-for-embedding-into-low-complexity-graphic-metrics-1801.03253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fpt-algorithms-for-embedding-into-low-complexity-graphic-metrics-1801.03253"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-algorithm-for-balanced-clustering-via-graph-partitioning-1801.03347</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-algorithm-for-balanced-clustering-via-graph-partitioning-1801.03347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-algorithm-for-balanced-clustering-via-graph-partitioning-1801.03347"/></url>
<url><loc>https://scifaro.com/en/abs/a-universality-theorem-for-allowable-sequences-with-applications-1801.05992</loc><lastmod>2018-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universality-theorem-for-allowable-sequences-with-applications-1801.05992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universality-theorem-for-allowable-sequences-with-applications-1801.05992"/></url>
<url><loc>https://scifaro.com/en/abs/angle-monotone-graphs-construction-and-local-routing-1801.06290</loc><lastmod>2018-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angle-monotone-graphs-construction-and-local-routing-1801.06290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angle-monotone-graphs-construction-and-local-routing-1801.06290"/></url>
<url><loc>https://scifaro.com/en/abs/inka-an-ink-based-model-of-graph-visualization-1801.07008</loc><lastmod>2018-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inka-an-ink-based-model-of-graph-visualization-1801.07008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inka-an-ink-based-model-of-graph-visualization-1801.07008"/></url>
<url><loc>https://scifaro.com/en/abs/finding-pairwise-intersections-of-rectangles-in-a-query-rectangle-1801.07362</loc><lastmod>2018-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-pairwise-intersections-of-rectangles-in-a-query-rectangle-1801.07362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-pairwise-intersections-of-rectangles-in-a-query-rectangle-1801.07362"/></url>
<url><loc>https://scifaro.com/en/abs/onion-curve-a-space-filling-curve-with-near-optimal-clustering-1801.07399</loc><lastmod>2018-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/onion-curve-a-space-filling-curve-with-near-optimal-clustering-1801.07399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/onion-curve-a-space-filling-curve-with-near-optimal-clustering-1801.07399"/></url>
<url><loc>https://scifaro.com/en/abs/threadable-curves-1801.08003</loc><lastmod>2018-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/threadable-curves-1801.08003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/threadable-curves-1801.08003"/></url>
<url><loc>https://scifaro.com/en/abs/a-smaller-cover-for-closed-unit-curves-1801.08405</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-smaller-cover-for-closed-unit-curves-1801.08405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-smaller-cover-for-closed-unit-curves-1801.08405"/></url>
<url><loc>https://scifaro.com/en/abs/rollercoasters-and-caterpillars-1801.08565</loc><lastmod>2018-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rollercoasters-and-caterpillars-1801.08565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rollercoasters-and-caterpillars-1801.08565"/></url>
<url><loc>https://scifaro.com/en/abs/robust-vertex-enumeration-for-convex-hulls-in-high-dimensions-1802.01515</loc><lastmod>2018-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-vertex-enumeration-for-convex-hulls-in-high-dimensions-1802.01515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-vertex-enumeration-for-convex-hulls-in-high-dimensions-1802.01515"/></url>
<url><loc>https://scifaro.com/en/abs/un-unzippable-convex-caps-1802.01621</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/un-unzippable-convex-caps-1802.01621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/un-unzippable-convex-caps-1802.01621"/></url>
<url><loc>https://scifaro.com/en/abs/robust-watertight-manifold-surface-generation-method-for-shapenet-models-1802.01698</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-watertight-manifold-surface-generation-method-for-shapenet-models-1802.01698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-watertight-manifold-surface-generation-method-for-shapenet-models-1802.01698"/></url>
<url><loc>https://scifaro.com/en/abs/colored-ray-configurations-1802.03415</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-ray-configurations-1802.03415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-ray-configurations-1802.03415"/></url>
<url><loc>https://scifaro.com/en/abs/rederiving-the-upper-bound-for-halving-edges-using-cardano-s-formula-1802.03730</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rederiving-the-upper-bound-for-halving-edges-using-cardano-s-formula-1802.03730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rederiving-the-upper-bound-for-halving-edges-using-cardano-s-formula-1802.03730"/></url>
<url><loc>https://scifaro.com/en/abs/a-reallocation-algorithm-for-online-split-packing-of-circles-1802.05873</loc><lastmod>2018-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reallocation-algorithm-for-online-split-packing-of-circles-1802.05873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reallocation-algorithm-for-online-split-packing-of-circles-1802.05873"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-generalized-kernels-of-polygons-1802.05995</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-generalized-kernels-of-polygons-1802.05995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-generalized-kernels-of-polygons-1802.05995"/></url>
<url><loc>https://scifaro.com/en/abs/the-geodesic-farthest-point-voronoi-diagram-in-a-simple-polygon-1802.06223</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geodesic-farthest-point-voronoi-diagram-in-a-simple-polygon-1802.06223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geodesic-farthest-point-voronoi-diagram-in-a-simple-polygon-1802.06223"/></url>
<url><loc>https://scifaro.com/en/abs/structural-properties-of-bichromatic-non-crossing-matchings-1802.06301</loc><lastmod>2021-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-properties-of-bichromatic-non-crossing-matchings-1802.06301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-properties-of-bichromatic-non-crossing-matchings-1802.06301"/></url>
<url><loc>https://scifaro.com/en/abs/solving-large-scale-minimum-weight-triangulation-instances-to-provable-optimality-1802.06415</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-large-scale-minimum-weight-triangulation-instances-to-provable-optimality-1802.06415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-large-scale-minimum-weight-triangulation-instances-to-provable-optimality-1802.06415"/></url>
<url><loc>https://scifaro.com/en/abs/convexity-increasing-morphs-of-planar-graphs-1802.06579</loc><lastmod>2019-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convexity-increasing-morphs-of-planar-graphs-1802.06579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convexity-increasing-morphs-of-planar-graphs-1802.06579"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-road-coverage-using-wireless-sensor-networks-for-moving-objects-monitoring-1802.07502</loc><lastmod>2020-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-road-coverage-using-wireless-sensor-networks-for-moving-objects-monitoring-1802.07502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-road-coverage-using-wireless-sensor-networks-for-moving-objects-monitoring-1802.07502"/></url>
<url><loc>https://scifaro.com/en/abs/fast-flow-based-algorithm-for-creating-density-equalizing-map-projections-1802.07625</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-flow-based-algorithm-for-creating-density-equalizing-map-projections-1802.07625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-flow-based-algorithm-for-creating-density-equalizing-map-projections-1802.07625"/></url>
<url><loc>https://scifaro.com/en/abs/on-pseudo-disk-hypergraphs-1802.08799</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-pseudo-disk-hypergraphs-1802.08799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-pseudo-disk-hypergraphs-1802.08799"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-some-optimization-problems-on-collinear-points-1802.09505</loc><lastmod>2018-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-some-optimization-problems-on-collinear-points-1802.09505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-some-optimization-problems-on-collinear-points-1802.09505"/></url>
<url><loc>https://scifaro.com/en/abs/the-density-of-expected-persistence-diagrams-and-its-kernel-based-estimation-1802.10457</loc><lastmod>2019-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-density-of-expected-persistence-diagrams-and-its-kernel-based-estimation-1802.10457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-density-of-expected-persistence-diagrams-and-its-kernel-based-estimation-1802.10457"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-implementation-of-near-neighbors-queries-for-fr-echet-distance-gis-cup-1803.00806</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-implementation-of-near-neighbors-queries-for-fr-echet-distance-gis-cup-1803.00806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-implementation-of-near-neighbors-queries-for-fr-echet-distance-gis-cup-1803.00806"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-volume-subset-selection-for-anchored-boxes-1803.00849</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-volume-subset-selection-for-anchored-boxes-1803.00849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-volume-subset-selection-for-anchored-boxes-1803.00849"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-characterization-of-reversible-hinged-dissections-1803.01172</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-characterization-of-reversible-hinged-dissections-1803.01172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-characterization-of-reversible-hinged-dissections-1803.01172"/></url>
<url><loc>https://scifaro.com/en/abs/path-puzzles-discrete-tomography-with-a-path-constraint-is-hard-1803.01176</loc><lastmod>2019-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/path-puzzles-discrete-tomography-with-a-path-constraint-is-hard-1803.01176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/path-puzzles-discrete-tomography-with-a-path-constraint-is-hard-1803.01176"/></url>
<url><loc>https://scifaro.com/en/abs/eptas-for-max-clique-on-disks-and-unit-balls-1803.01822</loc><lastmod>2018-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eptas-for-max-clique-on-disks-and-unit-balls-1803.01822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eptas-for-max-clique-on-disks-and-unit-balls-1803.01822"/></url>
<url><loc>https://scifaro.com/en/abs/a-ptas-for-vertex-guarding-weakly-visible-polygons-an-extended-abstract-1803.02160</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ptas-for-vertex-guarding-weakly-visible-polygons-an-extended-abstract-1803.02160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ptas-for-vertex-guarding-weakly-visible-polygons-an-extended-abstract-1803.02160"/></url>
<url><loc>https://scifaro.com/en/abs/packing-plane-spanning-trees-into-a-point-set-1803.02385</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-plane-spanning-trees-into-a-point-set-1803.02385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-plane-spanning-trees-into-a-point-set-1803.02385"/></url>
<url><loc>https://scifaro.com/en/abs/computing-bottleneck-distance-for-multi-parameter-interval-decomposable-persistence-modules-1803.02869</loc><lastmod>2019-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-bottleneck-distance-for-multi-parameter-interval-decomposable-persistence-modules-1803.02869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-bottleneck-distance-for-multi-parameter-interval-decomposable-persistence-modules-1803.02869"/></url>
<url><loc>https://scifaro.com/en/abs/routing-on-the-visibility-graph-1803.02979</loc><lastmod>2019-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-on-the-visibility-graph-1803.02979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-on-the-visibility-graph-1803.02979"/></url>
<url><loc>https://scifaro.com/en/abs/super-compaction-and-pluripotent-shape-transformation-via-algorithmic-stacking-for-3d-deployable-structures-1803.03302</loc><lastmod>2018-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/super-compaction-and-pluripotent-shape-transformation-via-algorithmic-stacking-for-3d-deployable-structures-1803.03302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/super-compaction-and-pluripotent-shape-transformation-via-algorithmic-stacking-for-3d-deployable-structures-1803.03302"/></url>
<url><loc>https://scifaro.com/en/abs/on-contact-graphs-of-paths-on-a-grid-1803.03468</loc><lastmod>2018-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-contact-graphs-of-paths-on-a-grid-1803.03468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-contact-graphs-of-paths-on-a-grid-1803.03468"/></url>
<url><loc>https://scifaro.com/en/abs/a-nearly-optimal-algorithm-for-the-geodesic-voronoi-diagram-in-a-simple-polygon-1803.03526</loc><lastmod>2018-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-nearly-optimal-algorithm-for-the-geodesic-voronoi-diagram-in-a-simple-polygon-1803.03526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-nearly-optimal-algorithm-for-the-geodesic-voronoi-diagram-in-a-simple-polygon-1803.03526"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-polyline-simplification-using-the-hausdorff-and-fr-echet-distance-1803.03550</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-polyline-simplification-using-the-hausdorff-and-fr-echet-distance-1803.03550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-polyline-simplification-using-the-hausdorff-and-fr-echet-distance-1803.03550"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-obstacle-representation-of-graphs-1803.03705</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-obstacle-representation-of-graphs-1803.03705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-obstacle-representation-of-graphs-1803.03705"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-range-queries-for-clustering-1803.03978</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-range-queries-for-clustering-1803.03978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-range-queries-for-clustering-1803.03978"/></url>
<url><loc>https://scifaro.com/en/abs/point-location-in-dynamic-planar-subdivisions-1803.04325</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-location-in-dynamic-planar-subdivisions-1803.04325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-location-in-dynamic-planar-subdivisions-1803.04325"/></url>
<url><loc>https://scifaro.com/en/abs/graph-reconstruction-by-discrete-morse-theory-1803.05093</loc><lastmod>2018-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-reconstruction-by-discrete-morse-theory-1803.05093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-reconstruction-by-discrete-morse-theory-1803.05093"/></url>
<url><loc>https://scifaro.com/en/abs/deletion-in-abstract-voronoi-diagrams-in-expected-linear-time-and-related-problems-1803.05372</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deletion-in-abstract-voronoi-diagrams-in-expected-linear-time-and-related-problems-1803.05372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deletion-in-abstract-voronoi-diagrams-in-expected-linear-time-and-related-problems-1803.05372"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-1803.05705</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-1803.05705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-crossings-in-constrained-two-sided-circular-graph-layouts-1803.05705"/></url>
<url><loc>https://scifaro.com/en/abs/improved-dynamic-geodesic-nearest-neighbor-searching-in-a-simple-polygon-1803.05765</loc><lastmod>2018-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-dynamic-geodesic-nearest-neighbor-searching-in-a-simple-polygon-1803.05765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-dynamic-geodesic-nearest-neighbor-searching-in-a-simple-polygon-1803.05765"/></url>
<url><loc>https://scifaro.com/en/abs/practical-volume-computation-of-structured-convex-bodies-and-an-application-to-modeling-portfolio-dependencies-and-financial-crises-1803.05861</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-volume-computation-of-structured-convex-bodies-and-an-application-to-modeling-portfolio-dependencies-and-financial-crises-1803.05861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-volume-computation-of-structured-convex-bodies-and-an-application-to-modeling-portfolio-dependencies-and-financial-crises-1803.05861"/></url>
<url><loc>https://scifaro.com/en/abs/altitude-terrain-guarding-and-guarding-uni-monotone-polygons-1803.05893</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/altitude-terrain-guarding-and-guarding-uni-monotone-polygons-1803.05893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/altitude-terrain-guarding-and-guarding-uni-monotone-polygons-1803.05893"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-to-compute-the-inverse-beacon-attraction-region-1803.05946</loc><lastmod>2018-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-to-compute-the-inverse-beacon-attraction-region-1803.05946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-to-compute-the-inverse-beacon-attraction-region-1803.05946"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-planar-beta-skeleton-depth-1803.05970</loc><lastmod>2018-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-planar-beta-skeleton-depth-1803.05970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-planar-beta-skeleton-depth-1803.05970"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-conditions-for-conforming-voronoi-meshing-by-the-vorocrust-algorithm-1803.06078</loc><lastmod>2018-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-conditions-for-conforming-voronoi-meshing-by-the-vorocrust-algorithm-1803.06078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-conditions-for-conforming-voronoi-meshing-by-the-vorocrust-algorithm-1803.06078"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-dominating-set-on-intersection-graphs-of-rectangles-and-l-frames-1803.06216</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-dominating-set-on-intersection-graphs-of-rectangles-and-l-frames-1803.06216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-dominating-set-on-intersection-graphs-of-rectangles-and-l-frames-1803.06216"/></url>
<url><loc>https://scifaro.com/en/abs/consistent-sets-of-lines-with-no-colorful-incidence-1803.06267</loc><lastmod>2018-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistent-sets-of-lines-with-no-colorful-incidence-1803.06267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistent-sets-of-lines-with-no-colorful-incidence-1803.06267"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-streaming-complexity-of-fundamental-geometric-problems-1803.06875</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-streaming-complexity-of-fundamental-geometric-problems-1803.06875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-streaming-complexity-of-fundamental-geometric-problems-1803.06875"/></url>
<url><loc>https://scifaro.com/en/abs/table-based-detection-of-degenerate-predicates-in-free-space-construction-1803.06908</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/table-based-detection-of-degenerate-predicates-in-free-space-construction-1803.06908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/table-based-detection-of-degenerate-predicates-in-free-space-construction-1803.06908"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-graphs-into-two-dimensional-simplicial-complexes-1803.07032</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-graphs-into-two-dimensional-simplicial-complexes-1803.07032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-graphs-into-two-dimensional-simplicial-complexes-1803.07032"/></url>
<url><loc>https://scifaro.com/en/abs/tree-drawings-revisited-1803.07185</loc><lastmod>2018-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-drawings-revisited-1803.07185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-drawings-revisited-1803.07185"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-analysis-of-an-online-algorithm-for-the-bipartite-matching-problem-on-a-line-1803.07206</loc><lastmod>2018-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-analysis-of-an-online-algorithm-for-the-bipartite-matching-problem-on-a-line-1803.07206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-analysis-of-an-online-algorithm-for-the-bipartite-matching-problem-on-a-line-1803.07206"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-number-of-seq-shellable-drawings-of-complete-graphs-1803.07515</loc><lastmod>2018-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-number-of-seq-shellable-drawings-of-complete-graphs-1803.07515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-number-of-seq-shellable-drawings-of-complete-graphs-1803.07515"/></url>
<url><loc>https://scifaro.com/en/abs/the-ell-infty-cophenetic-metric-for-phylogenetic-trees-as-an-interleaving-distance-1803.07609</loc><lastmod>2018-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ell-infty-cophenetic-metric-for-phylogenetic-trees-as-an-interleaving-distance-1803.07609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ell-infty-cophenetic-metric-for-phylogenetic-trees-as-an-interleaving-distance-1803.07609"/></url>
<url><loc>https://scifaro.com/en/abs/local-criteria-for-triangulation-of-manifolds-1803.07642</loc><lastmod>2018-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-criteria-for-triangulation-of-manifolds-1803.07642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-criteria-for-triangulation-of-manifolds-1803.07642"/></url>
<url><loc>https://scifaro.com/en/abs/looking-for-bird-nests-identifying-stay-points-with-bounded-gaps-1803.07773</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/looking-for-bird-nests-identifying-stay-points-with-bounded-gaps-1803.07773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/looking-for-bird-nests-identifying-stay-points-with-bounded-gaps-1803.07773"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-constant-factor-approximation-algorithms-for-stabbing-line-segments-with-equal-disks-1803.08341</loc><lastmod>2020-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-constant-factor-approximation-algorithms-for-stabbing-line-segments-with-equal-disks-1803.08341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-constant-factor-approximation-algorithms-for-stabbing-line-segments-with-equal-disks-1803.08341"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-range-segment-and-rectangle-queries-with-augmented-maps-1803.08621</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-range-segment-and-rectangle-queries-with-augmented-maps-1803.08621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-range-segment-and-rectangle-queries-with-augmented-maps-1803.08621"/></url>
<url><loc>https://scifaro.com/en/abs/mathcal-o-k-robust-spanners-in-one-dimension-1803.08719</loc><lastmod>2018-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathcal-o-k-robust-spanners-in-one-dimension-1803.08719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathcal-o-k-robust-spanners-in-one-dimension-1803.08719"/></url>
<url><loc>https://scifaro.com/en/abs/alternative-interpretation-of-the-pl-ucker-quadric-s-ambient-space-and-its-application-1803.09498</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternative-interpretation-of-the-pl-ucker-quadric-s-ambient-space-and-its-application-1803.09498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternative-interpretation-of-the-pl-ucker-quadric-s-ambient-space-and-its-application-1803.09498"/></url>
<url><loc>https://scifaro.com/en/abs/universal-slope-sets-for-upward-planar-drawings-1803.09949</loc><lastmod>2018-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-slope-sets-for-upward-planar-drawings-1803.09949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-slope-sets-for-upward-planar-drawings-1803.09949"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-optimal-algorithm-for-computing-the-visibility-area-of-a-simple-polygon-from-a-viewpoint-1803.10184</loc><lastmod>2018-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-optimal-algorithm-for-computing-the-visibility-area-of-a-simple-polygon-from-a-viewpoint-1803.10184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-optimal-algorithm-for-computing-the-visibility-area-of-a-simple-polygon-from-a-viewpoint-1803.10184"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-eth-tight-algorithms-and-lower-bounds-in-geometric-intersection-graphs-1803.10633</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-eth-tight-algorithms-and-lower-bounds-in-geometric-intersection-graphs-1803.10633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-eth-tight-algorithms-and-lower-bounds-in-geometric-intersection-graphs-1803.10633"/></url>
<url><loc>https://scifaro.com/en/abs/boundary-labeling-for-rectangular-diagrams-1803.10812</loc><lastmod>2018-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boundary-labeling-for-rectangular-diagrams-1803.10812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boundary-labeling-for-rectangular-diagrams-1803.10812"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-triangulations-of-points-on-circles-1803.11436</loc><lastmod>2018-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-triangulations-of-points-on-circles-1803.11436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-triangulations-of-points-on-circles-1803.11436"/></url>
<url><loc>https://scifaro.com/en/abs/fast-fencing-1804.00101</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-fencing-1804.00101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-fencing-1804.00101"/></url>
<url><loc>https://scifaro.com/en/abs/assigning-weights-to-minimize-the-covering-radius-in-the-plane-1804.00241</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assigning-weights-to-minimize-the-covering-radius-in-the-plane-1804.00241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assigning-weights-to-minimize-the-covering-radius-in-the-plane-1804.00241"/></url>
<url><loc>https://scifaro.com/en/abs/restructuring-expression-dags-for-efficient-parallelization-1804.03256</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/restructuring-expression-dags-for-efficient-parallelization-1804.03256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/restructuring-expression-dags-for-efficient-parallelization-1804.03256"/></url>
<url><loc>https://scifaro.com/en/abs/computing-shapley-values-in-the-plane-1804.03894</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-shapley-values-in-the-plane-1804.03894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-shapley-values-in-the-plane-1804.03894"/></url>
<url><loc>https://scifaro.com/en/abs/computing-quasiconformal-folds-1804.03936</loc><lastmod>2019-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-quasiconformal-folds-1804.03936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-quasiconformal-folds-1804.03936"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-simplicial-complex-reconstruction-from-mobile-laser-scanning-using-sensor-topology-1804.04001</loc><lastmod>2018-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-simplicial-complex-reconstruction-from-mobile-laser-scanning-using-sensor-topology-1804.04001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-simplicial-complex-reconstruction-from-mobile-laser-scanning-using-sensor-topology-1804.04001"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-visibility-graphs-of-polygons-with-holes-and-internal-external-visibility-graphs-of-polygons-1804.05105</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-visibility-graphs-of-polygons-with-holes-and-internal-external-visibility-graphs-of-polygons-1804.05105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-visibility-graphs-of-polygons-with-holes-and-internal-external-visibility-graphs-of-polygons-1804.05105"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-simplices-in-diagonally-distorted-lattices-1804.07024</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-simplices-in-diagonally-distorted-lattices-1804.07024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-simplices-in-diagonally-distorted-lattices-1804.07024"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-guarding-plane-graphs-with-edges-1804.07150</loc><lastmod>2018-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-guarding-plane-graphs-with-edges-1804.07150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-guarding-plane-graphs-with-edges-1804.07150"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-graph-drawing-beyond-planarity-1804.07257</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-graph-drawing-beyond-planarity-1804.07257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-graph-drawing-beyond-planarity-1804.07257"/></url>
<url><loc>https://scifaro.com/en/abs/self-functional-maps-1804.08080</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-functional-maps-1804.08080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-functional-maps-1804.08080"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-comparison-trees-for-point-location-problems-1804.08237</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-comparison-trees-for-point-location-problems-1804.08237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-comparison-trees-for-point-location-problems-1804.08237"/></url>
<url><loc>https://scifaro.com/en/abs/stable-matching-voronoi-diagrams-combinatorial-complexity-and-algorithms-1804.09411</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-matching-voronoi-diagrams-combinatorial-complexity-and-algorithms-1804.09411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-matching-voronoi-diagrams-combinatorial-complexity-and-algorithms-1804.09411"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-geometric-approach-for-outlier-recognition-in-high-dimension-1804.09653</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-geometric-approach-for-outlier-recognition-in-high-dimension-1804.09653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-geometric-approach-for-outlier-recognition-in-high-dimension-1804.09653"/></url>
<url><loc>https://scifaro.com/en/abs/on-geometric-prototype-and-applications-1804.09655</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-geometric-prototype-and-applications-1804.09655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-geometric-prototype-and-applications-1804.09655"/></url>
<url><loc>https://scifaro.com/en/abs/a-rational-parametrization-of-b-ezier-like-curves-1804.10406</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rational-parametrization-of-b-ezier-like-curves-1804.10406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rational-parametrization-of-b-ezier-like-curves-1804.10406"/></url>
<url><loc>https://scifaro.com/en/abs/resolving-sinr-queries-in-a-dynamic-setting-1804.10654</loc><lastmod>2019-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolving-sinr-queries-in-a-dynamic-setting-1804.10654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolving-sinr-queries-in-a-dynamic-setting-1804.10654"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-approximation-algorithm-for-the-orthogonal-terrain-guarding-problem-1804.11088</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-approximation-algorithm-for-the-orthogonal-terrain-guarding-problem-1804.11088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-approximation-algorithm-for-the-orthogonal-terrain-guarding-problem-1804.11088"/></url>
<url><loc>https://scifaro.com/en/abs/simple-distances-for-trajectories-via-landmarks-1804.11284</loc><lastmod>2019-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-distances-for-trajectories-via-landmarks-1804.11284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-distances-for-trajectories-via-landmarks-1804.11284"/></url>
<url><loc>https://scifaro.com/en/abs/computing-approximate-statistical-discrepancy-1804.11287</loc><lastmod>2018-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-approximate-statistical-discrepancy-1804.11287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-approximate-statistical-discrepancy-1804.11287"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-deciding-membership-in-polytopes-of-general-dimension-1804.11295</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-deciding-membership-in-polytopes-of-general-dimension-1804.11295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-deciding-membership-in-polytopes-of-general-dimension-1804.11295"/></url>
<url><loc>https://scifaro.com/en/abs/practical-low-dimensional-halfspace-range-space-sampling-1804.11307</loc><lastmod>2018-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-low-dimensional-halfspace-range-space-sampling-1804.11307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-low-dimensional-halfspace-range-space-sampling-1804.11307"/></url>
<url><loc>https://scifaro.com/en/abs/description-and-retrieval-of-geometric-patterns-on-surface-meshes-using-an-edge-based-lbp-approach-1805.00719</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/description-and-retrieval-of-geometric-patterns-on-surface-meshes-using-an-edge-based-lbp-approach-1805.00719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/description-and-retrieval-of-geometric-patterns-on-surface-meshes-using-an-edge-based-lbp-approach-1805.00719"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-k-ell-center-clustering-for-curves-1805.01547</loc><lastmod>2018-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-k-ell-center-clustering-for-curves-1805.01547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-k-ell-center-clustering-for-curves-1805.01547"/></url>
<url><loc>https://scifaro.com/en/abs/nearly-optimal-planar-k-nearest-neighbors-queries-under-general-distance-functions-1805.02066</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearly-optimal-planar-k-nearest-neighbors-queries-under-general-distance-functions-1805.02066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearly-optimal-planar-k-nearest-neighbors-queries-under-general-distance-functions-1805.02066"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-terrain-guarding-with-two-sided-guards-1805.02447</loc><lastmod>2018-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-terrain-guarding-with-two-sided-guards-1805.02447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-terrain-guarding-with-two-sided-guards-1805.02447"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-points-with-a-rotating-polygon-and-a-3d-extension-1805.02570</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-points-with-a-rotating-polygon-and-a-3d-extension-1805.02570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-points-with-a-rotating-polygon-and-a-3d-extension-1805.02570"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-rounding-and-feature-separation-in-meshes-1805.03252</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-rounding-and-feature-separation-in-meshes-1805.03252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-rounding-and-feature-separation-in-meshes-1805.03252"/></url>
<url><loc>https://scifaro.com/en/abs/computing-coverage-kernels-under-restricted-settings-1805.04223</loc><lastmod>2018-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-coverage-kernels-under-restricted-settings-1805.04223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-coverage-kernels-under-restricted-settings-1805.04223"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-class-of-curves-of-rational-b-spline-type-1805.04433</loc><lastmod>2018-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-class-of-curves-of-rational-b-spline-type-1805.04433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-class-of-curves-of-rational-b-spline-type-1805.04433"/></url>
<url><loc>https://scifaro.com/en/abs/topological-skeletonization-and-tree-summarization-of-neurons-using-discrete-morse-theory-1805.04997</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-skeletonization-and-tree-summarization-of-neurons-using-discrete-morse-theory-1805.04997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-skeletonization-and-tree-summarization-of-neurons-using-discrete-morse-theory-1805.04997"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-number-of-semi-pair-shellable-drawings-of-complete-graphs-1805.06780</loc><lastmod>2018-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-number-of-semi-pair-shellable-drawings-of-complete-graphs-1805.06780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-number-of-semi-pair-shellable-drawings-of-complete-graphs-1805.06780"/></url>
<url><loc>https://scifaro.com/en/abs/automated-process-planning-for-hybrid-manufacturing-1805.07035</loc><lastmod>2018-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-process-planning-for-hybrid-manufacturing-1805.07035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-process-planning-for-hybrid-manufacturing-1805.07035"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-data-depth-revisited-1805.07373</loc><lastmod>2018-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-data-depth-revisited-1805.07373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-data-depth-revisited-1805.07373"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-atlasing-and-search-of-configuration-spaces-of-point-sets-constrained-by-distance-intervals-1805.07450</loc><lastmod>2018-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-atlasing-and-search-of-configuration-spaces-of-point-sets-constrained-by-distance-intervals-1805.07450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-atlasing-and-search-of-configuration-spaces-of-point-sets-constrained-by-distance-intervals-1805.07450"/></url>
<url><loc>https://scifaro.com/en/abs/revealing-the-basis-ordinal-embedding-through-geometry-1805.07589</loc><lastmod>2018-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revealing-the-basis-ordinal-embedding-through-geometry-1805.07589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revealing-the-basis-ordinal-embedding-through-geometry-1805.07589"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-segment-cover-contiguous-sat-and-visibility-with-uncertain-obstacles-1805.07724</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-segment-cover-contiguous-sat-and-visibility-with-uncertain-obstacles-1805.07724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-segment-cover-contiguous-sat-and-visibility-with-uncertain-obstacles-1805.07724"/></url>
<url><loc>https://scifaro.com/en/abs/rule-based-drawing-analysis-and-generation-of-graphs-for-mason-s-mark-design-1805.08453</loc><lastmod>2018-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rule-based-drawing-analysis-and-generation-of-graphs-for-mason-s-mark-design-1805.08453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rule-based-drawing-analysis-and-generation-of-graphs-for-mason-s-mark-design-1805.08453"/></url>
<url><loc>https://scifaro.com/en/abs/orthogonal-point-location-and-rectangle-stabbing-queries-in-3-d-1805.08602</loc><lastmod>2018-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthogonal-point-location-and-rectangle-stabbing-queries-in-3-d-1805.08602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthogonal-point-location-and-rectangle-stabbing-queries-in-3-d-1805.08602"/></url>
<url><loc>https://scifaro.com/en/abs/one-machine-one-minute-three-billion-tetrahedra-1805.08831</loc><lastmod>2018-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-machine-one-minute-three-billion-tetrahedra-1805.08831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-machine-one-minute-three-billion-tetrahedra-1805.08831"/></url>
<url><loc>https://scifaro.com/en/abs/learning-simplicial-complexes-from-persistence-diagrams-1805.10716</loc><lastmod>2018-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-simplicial-complexes-from-persistence-diagrams-1805.10716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-simplicial-complexes-from-persistence-diagrams-1805.10716"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-intersection-graph-of-the-disks-with-diameters-the-sides-of-a-convex-n-gon-1805.10847</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-intersection-graph-of-the-disks-with-diameters-the-sides-of-a-convex-n-gon-1805.10847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-intersection-graph-of-the-disks-with-diameters-the-sides-of-a-convex-n-gon-1805.10847"/></url>
<url><loc>https://scifaro.com/en/abs/a-44-element-mesh-of-schneiders-pyramid-bounding-the-difficulty-of-hex-meshing-problems-1806.01022</loc><lastmod>2018-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-44-element-mesh-of-schneiders-pyramid-bounding-the-difficulty-of-hex-meshing-problems-1806.01022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-44-element-mesh-of-schneiders-pyramid-bounding-the-difficulty-of-hex-meshing-problems-1806.01022"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-computation-of-the-discrete-fr-echet-distance-1806.01226</loc><lastmod>2018-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-computation-of-the-discrete-fr-echet-distance-1806.01226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-computation-of-the-discrete-fr-echet-distance-1806.01226"/></url>
<url><loc>https://scifaro.com/en/abs/progressive-simplification-of-polygonal-curves-1806.02647</loc><lastmod>2018-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progressive-simplification-of-polygonal-curves-1806.02647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progressive-simplification-of-polygonal-curves-1806.02647"/></url>
<url><loc>https://scifaro.com/en/abs/stabbing-rectangles-by-line-segments-how-decomposition-reduces-the-shallow-cell-complexity-1806.02851</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabbing-rectangles-by-line-segments-how-decomposition-reduces-the-shallow-cell-complexity-1806.02851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabbing-rectangles-by-line-segments-how-decomposition-reduces-the-shallow-cell-complexity-1806.02851"/></url>
<url><loc>https://scifaro.com/en/abs/the-saturated-subpaths-decomposition-in-z-2-a-short-note-on-generalized-tangential-cover-1806.03053</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-saturated-subpaths-decomposition-in-z-2-a-short-note-on-generalized-tangential-cover-1806.03053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-saturated-subpaths-decomposition-in-z-2-a-short-note-on-generalized-tangential-cover-1806.03053"/></url>
<url><loc>https://scifaro.com/en/abs/aligned-plane-drawings-of-the-generalized-delaunay-graphs-for-pseudo-disks-1806.04217</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aligned-plane-drawings-of-the-generalized-delaunay-graphs-for-pseudo-disks-1806.04217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aligned-plane-drawings-of-the-generalized-delaunay-graphs-for-pseudo-disks-1806.04217"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-a-rooted-tree-as-a-rooted-y-monotone-minimum-spanning-tree-1806.04720</loc><lastmod>2018-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-a-rooted-tree-as-a-rooted-y-monotone-minimum-spanning-tree-1806.04720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-a-rooted-tree-as-a-rooted-y-monotone-minimum-spanning-tree-1806.04720"/></url>
<url><loc>https://scifaro.com/en/abs/corner-sharing-tetrahedra-for-modeling-micro-structure-1806.05528</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/corner-sharing-tetrahedra-for-modeling-micro-structure-1806.05528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/corner-sharing-tetrahedra-for-modeling-micro-structure-1806.05528"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedra-circuits-and-their-applications-1806.05797</loc><lastmod>2018-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedra-circuits-and-their-applications-1806.05797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedra-circuits-and-their-applications-1806.05797"/></url>
<url><loc>https://scifaro.com/en/abs/computing-projective-equivalences-of-special-algebraic-varieties-1806.05827</loc><lastmod>2018-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-projective-equivalences-of-special-algebraic-varieties-1806.05827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-projective-equivalences-of-special-algebraic-varieties-1806.05827"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-algorithms-with-limited-workspace-a-survey-1806.05868</loc><lastmod>2018-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-algorithms-with-limited-workspace-a-survey-1806.05868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-algorithms-with-limited-workspace-a-survey-1806.05868"/></url>
<url><loc>https://scifaro.com/en/abs/fractal-scaling-of-population-counts-over-time-spans-1806.06772</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractal-scaling-of-population-counts-over-time-spans-1806.06772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractal-scaling-of-population-counts-over-time-spans-1806.06772"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-the-relative-positions-between-an-ellipsoid-and-an-elliptic-paraboloid-1806.06805</loc><lastmod>2018-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-the-relative-positions-between-an-ellipsoid-and-an-elliptic-paraboloid-1806.06805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-the-relative-positions-between-an-ellipsoid-and-an-elliptic-paraboloid-1806.06805"/></url>
<url><loc>https://scifaro.com/en/abs/homology-preserving-dimensionality-reduction-via-manifold-landmarking-and-tearing-1806.08460</loc><lastmod>2018-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homology-preserving-dimensionality-reduction-via-manifold-landmarking-and-tearing-1806.08460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homology-preserving-dimensionality-reduction-via-manifold-landmarking-and-tearing-1806.08460"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-2d-monotone-minimum-spanning-graphs-1806.08770</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-2d-monotone-minimum-spanning-graphs-1806.08770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-2d-monotone-minimum-spanning-graphs-1806.08770"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-area-axis-aligned-square-packings-1806.09562</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-area-axis-aligned-square-packings-1806.09562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-area-axis-aligned-square-packings-1806.09562"/></url>
<url><loc>https://scifaro.com/en/abs/compact-drawings-of-1-planar-graphs-with-right-angle-crossings-and-few-bends-1806.10044</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-drawings-of-1-planar-graphs-with-right-angle-crossings-and-few-bends-1806.10044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-drawings-of-1-planar-graphs-with-right-angle-crossings-and-few-bends-1806.10044"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-complex-zeros-of-triangular-systems-of-polynomials-1806.10164</loc><lastmod>2019-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-complex-zeros-of-triangular-systems-of-polynomials-1806.10164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-complex-zeros-of-triangular-systems-of-polynomials-1806.10164"/></url>
<url><loc>https://scifaro.com/en/abs/cemnet-self-supervised-learning-for-accurate-continuous-ego-motion-estimation-1806.10309</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cemnet-self-supervised-learning-for-accurate-continuous-ego-motion-estimation-1806.10309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cemnet-self-supervised-learning-for-accurate-continuous-ego-motion-estimation-1806.10309"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-multi-projection-3d-point-cloud-denoising-with-estimated-tangent-planes-1807.00253</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-multi-projection-3d-point-cloud-denoising-with-estimated-tangent-planes-1807.00253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-multi-projection-3d-point-cloud-denoising-with-estimated-tangent-planes-1807.00253"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-convex-intersection-detection-with-applications-to-width-and-minkowski-sums-1807.00484</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-convex-intersection-detection-with-applications-to-width-and-minkowski-sums-1807.00484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-convex-intersection-detection-with-applications-to-width-and-minkowski-sums-1807.00484"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-persistence-analysis-based-on-stable-rank-invariant-1807.01217</loc><lastmod>2018-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-persistence-analysis-based-on-stable-rank-invariant-1807.01217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-persistence-analysis-based-on-stable-rank-invariant-1807.01217"/></url>
<url><loc>https://scifaro.com/en/abs/distance-two-colorings-of-barnette-graphs-1807.01410</loc><lastmod>2018-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-two-colorings-of-barnette-graphs-1807.01410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-two-colorings-of-barnette-graphs-1807.01410"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-parallel-self-assembly-under-uniform-control-inputs-1807.01584</loc><lastmod>2018-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-parallel-self-assembly-under-uniform-control-inputs-1807.01584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-parallel-self-assembly-under-uniform-control-inputs-1807.01584"/></url>
<url><loc>https://scifaro.com/en/abs/online-exploration-outside-a-convex-obstacle-1807.02773</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-exploration-outside-a-convex-obstacle-1807.02773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-exploration-outside-a-convex-obstacle-1807.02773"/></url>
<url><loc>https://scifaro.com/en/abs/computing-height-persistence-and-homology-generators-in-mathbb-r-3-efficiently-1807.03655</loc><lastmod>2019-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-height-persistence-and-homology-generators-in-mathbb-r-3-efficiently-1807.03655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-height-persistence-and-homology-generators-in-mathbb-r-3-efficiently-1807.03655"/></url>
<url><loc>https://scifaro.com/en/abs/on-error-representation-in-exact-decisions-number-types-1807.04181</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-error-representation-in-exact-decisions-number-types-1807.04181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-error-representation-in-exact-decisions-number-types-1807.04181"/></url>
<url><loc>https://scifaro.com/en/abs/self-assembly-of-3-d-structures-using-2-d-folding-tiles-1807.04818</loc><lastmod>2018-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-assembly-of-3-d-structures-using-2-d-folding-tiles-1807.04818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-assembly-of-3-d-structures-using-2-d-folding-tiles-1807.04818"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-metric-learning-via-contrastive-embeddings-1807.04881</loc><lastmod>2019-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-metric-learning-via-contrastive-embeddings-1807.04881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-metric-learning-via-contrastive-embeddings-1807.04881"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-morse-theory-for-computing-zigzag-persistence-1807.05172</loc><lastmod>2019-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-morse-theory-for-computing-zigzag-persistence-1807.05172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-morse-theory-for-computing-zigzag-persistence-1807.05172"/></url>
<url><loc>https://scifaro.com/en/abs/motion-planning-for-multiple-unit-ball-robots-in-mathbb-r-d-1807.05428</loc><lastmod>2018-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/motion-planning-for-multiple-unit-ball-robots-in-mathbb-r-d-1807.05428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/motion-planning-for-multiple-unit-ball-robots-in-mathbb-r-d-1807.05428"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-minimal-number-of-skewed-unit-cells-for-periodic-distance-calculation-1807.06053</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-minimal-number-of-skewed-unit-cells-for-periodic-distance-calculation-1807.06053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-minimal-number-of-skewed-unit-cells-for-periodic-distance-calculation-1807.06053"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-homology-of-semialgebraic-sets-i-lax-formulas-1807.06435</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-homology-of-semialgebraic-sets-i-lax-formulas-1807.06435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-homology-of-semialgebraic-sets-i-lax-formulas-1807.06435"/></url>
<url><loc>https://scifaro.com/en/abs/smoothed-analysis-of-the-expected-number-of-maximal-points-in-two-dimensions-1807.06845</loc><lastmod>2018-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smoothed-analysis-of-the-expected-number-of-maximal-points-in-two-dimensions-1807.06845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smoothed-analysis-of-the-expected-number-of-maximal-points-in-two-dimensions-1807.06845"/></url>
<url><loc>https://scifaro.com/en/abs/an-eth-tight-exact-algorithm-for-euclidean-tsp-1807.06933</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-eth-tight-exact-algorithm-for-euclidean-tsp-1807.06933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-eth-tight-exact-algorithm-for-euclidean-tsp-1807.06933"/></url>
<url><loc>https://scifaro.com/en/abs/metric-violation-distance-revisited-and-extended-1807.08078</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-violation-distance-revisited-and-extended-1807.08078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-violation-distance-revisited-and-extended-1807.08078"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-metrics-for-adaptive-samples-1807.08208</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-metrics-for-adaptive-samples-1807.08208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-metrics-for-adaptive-samples-1807.08208"/></url>
<url><loc>https://scifaro.com/en/abs/deep-learning-parametrization-for-b-spline-curve-approximation-1807.08304</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deep-learning-parametrization-for-b-spline-curve-approximation-1807.08304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deep-learning-parametrization-for-b-spline-curve-approximation-1807.08304"/></url>
<url><loc>https://scifaro.com/en/abs/tracking-mobile-intruders-in-an-art-gallery-guard-deployment-strategies-fundamental-limitations-and-performance-guarantees-1807.08350</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracking-mobile-intruders-in-an-art-gallery-guard-deployment-strategies-fundamental-limitations-and-performance-guarantees-1807.08350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracking-mobile-intruders-in-an-art-gallery-guard-deployment-strategies-fundamental-limitations-and-performance-guarantees-1807.08350"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-target-tracking-with-a-mixed-team-of-static-and-mobile-guards-deployment-and-activation-strategies-1807.08354</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-target-tracking-with-a-mixed-team-of-static-and-mobile-guards-deployment-and-activation-strategies-1807.08354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-target-tracking-with-a-mixed-team-of-static-and-mobile-guards-deployment-and-activation-strategies-1807.08354"/></url>
<url><loc>https://scifaro.com/en/abs/seth-says-weak-fr-echet-distance-is-faster-but-only-if-it-is-continuous-and-in-one-dimension-1807.08699</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/seth-says-weak-fr-echet-distance-is-faster-but-only-if-it-is-continuous-and-in-one-dimension-1807.08699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/seth-says-weak-fr-echet-distance-is-faster-but-only-if-it-is-continuous-and-in-one-dimension-1807.08699"/></url>
<url><loc>https://scifaro.com/en/abs/does-a-robot-path-have-clearance-c-1807.09392</loc><lastmod>2018-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/does-a-robot-path-have-clearance-c-1807.09392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/does-a-robot-path-have-clearance-c-1807.09392"/></url>
<url><loc>https://scifaro.com/en/abs/a-36-element-solution-to-schneiders-pyramid-hex-meshing-problem-and-a-parity-changing-template-for-hex-mesh-revision-1807.09415</loc><lastmod>2018-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-36-element-solution-to-schneiders-pyramid-hex-meshing-problem-and-a-parity-changing-template-for-hex-mesh-revision-1807.09415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-36-element-solution-to-schneiders-pyramid-hex-meshing-problem-and-a-parity-changing-template-for-hex-mesh-revision-1807.09415"/></url>
<url><loc>https://scifaro.com/en/abs/a-greedy-heuristic-for-crossing-angle-maximization-1807.09483</loc><lastmod>2018-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-greedy-heuristic-for-crossing-angle-maximization-1807.09483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-greedy-heuristic-for-crossing-angle-maximization-1807.09483"/></url>
<url><loc>https://scifaro.com/en/abs/searching-for-the-closest-pair-in-a-query-translate-1807.09498</loc><lastmod>2019-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-for-the-closest-pair-in-a-query-translate-1807.09498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-for-the-closest-pair-in-a-query-translate-1807.09498"/></url>
<url><loc>https://scifaro.com/en/abs/colored-range-closest-pair-problem-under-general-distance-functions-1807.09977</loc><lastmod>2018-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-range-closest-pair-problem-under-general-distance-functions-1807.09977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-range-closest-pair-problem-under-general-distance-functions-1807.09977"/></url>
<url><loc>https://scifaro.com/en/abs/sparips-1807.09982</loc><lastmod>2018-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparips-1807.09982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparips-1807.09982"/></url>
<url><loc>https://scifaro.com/en/abs/computing-optimal-shortcuts-for-networks-1807.10093</loc><lastmod>2018-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-optimal-shortcuts-for-networks-1807.10093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-optimal-shortcuts-for-networks-1807.10093"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-for-min-max-angle-of-polygons-1807.10926</loc><lastmod>2021-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-for-min-max-angle-of-polygons-1807.10926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-for-min-max-angle-of-polygons-1807.10926"/></url>
<url><loc>https://scifaro.com/en/abs/on-l-shaped-point-set-embeddings-of-trees-first-non-embeddable-examples-1807.11043</loc><lastmod>2020-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-l-shaped-point-set-embeddings-of-trees-first-non-embeddable-examples-1807.11043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-l-shaped-point-set-embeddings-of-trees-first-non-embeddable-examples-1807.11043"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-fingerprint-recognition-via-oriented-point-set-pattern-matching-1808.00561</loc><lastmod>2018-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-fingerprint-recognition-via-oriented-point-set-pattern-matching-1808.00561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-fingerprint-recognition-via-oriented-point-set-pattern-matching-1808.00561"/></url>
<url><loc>https://scifaro.com/en/abs/perception-of-symmetries-in-drawings-of-graphs-1808.01031</loc><lastmod>2018-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perception-of-symmetries-in-drawings-of-graphs-1808.01031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perception-of-symmetries-in-drawings-of-graphs-1808.01031"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-spanning-and-routing-ratio-of-directed-theta-four-1808.01298</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-spanning-and-routing-ratio-of-directed-theta-four-1808.01298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-spanning-and-routing-ratio-of-directed-theta-four-1808.01298"/></url>
<url><loc>https://scifaro.com/en/abs/a-2d-advancing-front-delaunay-mesh-refinement-algorithm-1808.01539</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-2d-advancing-front-delaunay-mesh-refinement-algorithm-1808.01539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-2d-advancing-front-delaunay-mesh-refinement-algorithm-1808.01539"/></url>
<url><loc>https://scifaro.com/en/abs/polyline-defined-nc-trajectories-parametrization-a-compact-analysis-and-solution-focused-on-3d-printing-1808.01831</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyline-defined-nc-trajectories-parametrization-a-compact-analysis-and-solution-focused-on-3d-printing-1808.01831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyline-defined-nc-trajectories-parametrization-a-compact-analysis-and-solution-focused-on-3d-printing-1808.01831"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-embeddings-of-the-fr-echet-distance-1808.01983</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-embeddings-of-the-fr-echet-distance-1808.01983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-embeddings-of-the-fr-echet-distance-1808.01983"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-point-sets-with-hereditary-properties-1808.02162</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-point-sets-with-hereditary-properties-1808.02162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-point-sets-with-hereditary-properties-1808.02162"/></url>
<url><loc>https://scifaro.com/en/abs/on-tail-estimates-for-randomized-incremental-construction-1808.02356</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-tail-estimates-for-randomized-incremental-construction-1808.02356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-tail-estimates-for-randomized-incremental-construction-1808.02356"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-flip-distance-problem-for-edge-labeled-triangulations-1808.03126</loc><lastmod>2018-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-flip-distance-problem-for-edge-labeled-triangulations-1808.03126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-flip-distance-problem-for-edge-labeled-triangulations-1808.03126"/></url>
<url><loc>https://scifaro.com/en/abs/low-ply-drawings-of-trees-and-2-trees-1808.03139</loc><lastmod>2018-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-ply-drawings-of-trees-and-2-trees-1808.03139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-ply-drawings-of-trees-and-2-trees-1808.03139"/></url>
<url><loc>https://scifaro.com/en/abs/few-cuts-meet-many-point-sets-1808.03260</loc><lastmod>2022-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/few-cuts-meet-many-point-sets-1808.03260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/few-cuts-meet-many-point-sets-1808.03260"/></url>
<url><loc>https://scifaro.com/en/abs/representing-three-dimensional-cross-fields-using-4th-order-tensors-1808.03999</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-three-dimensional-cross-fields-using-4th-order-tensors-1808.03999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-three-dimensional-cross-fields-using-4th-order-tensors-1808.03999"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-constrained-k-means-through-2-means-1808.04062</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-constrained-k-means-through-2-means-1808.04062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-constrained-k-means-through-2-means-1808.04062"/></url>
<url><loc>https://scifaro.com/en/abs/new-bounds-on-the-tile-complexity-of-thin-rectangles-at-temperature-1-1808.04358</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-bounds-on-the-tile-complexity-of-thin-rectangles-at-temperature-1-1808.04358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-bounds-on-the-tile-complexity-of-thin-rectangles-at-temperature-1-1808.04358"/></url>
<url><loc>https://scifaro.com/en/abs/covering-tours-and-cycle-covers-with-turn-costs-hardness-and-approximation-1808.04417</loc><lastmod>2019-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-tours-and-cycle-covers-with-turn-costs-hardness-and-approximation-1808.04417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-tours-and-cycle-covers-with-turn-costs-hardness-and-approximation-1808.04417"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-properties-of-theta-theta-6-1808.04744</loc><lastmod>2018-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-properties-of-theta-theta-6-1808.04744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-properties-of-theta-theta-6-1808.04744"/></url>
<url><loc>https://scifaro.com/en/abs/realization-and-connectivity-of-the-graphs-of-origami-flat-foldings-1808.06013</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realization-and-connectivity-of-the-graphs-of-origami-flat-foldings-1808.06013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realization-and-connectivity-of-the-graphs-of-origami-flat-foldings-1808.06013"/></url>
<url><loc>https://scifaro.com/en/abs/asymmetric-convex-intersection-testing-1808.06460</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymmetric-convex-intersection-testing-1808.06460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymmetric-convex-intersection-testing-1808.06460"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-drawings-of-k-inner-planar-graphs-1808.06892</loc><lastmod>2018-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-drawings-of-k-inner-planar-graphs-1808.06892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-drawings-of-k-inner-planar-graphs-1808.06892"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-minimization-in-perturbed-drawings-1808.07608</loc><lastmod>2018-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-minimization-in-perturbed-drawings-1808.07608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-minimization-in-perturbed-drawings-1808.07608"/></url>
<url><loc>https://scifaro.com/en/abs/high-quality-facial-surface-and-texture-synthesis-via-generative-adversarial-networks-1808.08281</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-quality-facial-surface-and-texture-synthesis-via-generative-adversarial-networks-1808.08281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-quality-facial-surface-and-texture-synthesis-via-generative-adversarial-networks-1808.08281"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-subcubic-1-planar-graphs-with-few-bends-few-slopes-and-large-angles-1808.08496</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-subcubic-1-planar-graphs-with-few-bends-few-slopes-and-large-angles-1808.08496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-subcubic-1-planar-graphs-with-few-bends-few-slopes-and-large-angles-1808.08496"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-rectilinear-drawings-1808.09063</loc><lastmod>2019-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-rectilinear-drawings-1808.09063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-rectilinear-drawings-1808.09063"/></url>
<url><loc>https://scifaro.com/en/abs/proper-circular-arc-graphs-as-intersection-graphs-of-paths-on-a-grid-1808.09344</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proper-circular-arc-graphs-as-intersection-graphs-of-paths-on-a-grid-1808.09344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proper-circular-arc-graphs-as-intersection-graphs-of-paths-on-a-grid-1808.09344"/></url>
<url><loc>https://scifaro.com/en/abs/short-plane-supports-for-spatial-hypergraphs-1808.09729</loc><lastmod>2018-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-plane-supports-for-spatial-hypergraphs-1808.09729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-plane-supports-for-spatial-hypergraphs-1808.09729"/></url>
<url><loc>https://scifaro.com/en/abs/same-stats-different-graphs-graph-statistics-and-why-we-need-graph-drawings-1808.09913</loc><lastmod>2019-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/same-stats-different-graphs-graph-statistics-and-why-we-need-graph-drawings-1808.09913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/same-stats-different-graphs-graph-statistics-and-why-we-need-graph-drawings-1808.09913"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-and-drawing-of-stick-graphs-1808.10005</loc><lastmod>2018-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-and-drawing-of-stick-graphs-1808.10005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-and-drawing-of-stick-graphs-1808.10005"/></url>
<url><loc>https://scifaro.com/en/abs/beta-stars-or-on-extending-a-drawing-of-a-connected-subgraph-1808.10366</loc><lastmod>2018-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beta-stars-or-on-extending-a-drawing-of-a-connected-subgraph-1808.10366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beta-stars-or-on-extending-a-drawing-of-a-connected-subgraph-1808.10366"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-fit-a-tree-in-a-box-1808.10572</loc><lastmod>2018-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-fit-a-tree-in-a-box-1808.10572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-fit-a-tree-in-a-box-1808.10572"/></url>
<url><loc>https://scifaro.com/en/abs/pole-dancing-3d-morphs-for-tree-drawings-1808.10738</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pole-dancing-3d-morphs-for-tree-drawings-1808.10738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pole-dancing-3d-morphs-for-tree-drawings-1808.10738"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-area-universality-of-triangulations-1808.10864</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-area-universality-of-triangulations-1808.10864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-area-universality-of-triangulations-1808.10864"/></url>
<url><loc>https://scifaro.com/en/abs/on-triangluar-separation-of-bichromatic-point-sets-in-polygonal-environment-1809.00116</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-triangluar-separation-of-bichromatic-point-sets-in-polygonal-environment-1809.00116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-triangluar-separation-of-bichromatic-point-sets-in-polygonal-environment-1809.00116"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-barycenter-drawing-recognition-problem-1809.00628</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-barycenter-drawing-recognition-problem-1809.00628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-barycenter-drawing-recognition-problem-1809.00628"/></url>
<url><loc>https://scifaro.com/en/abs/faster-balanced-clusterings-in-high-dimension-1809.00932</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-balanced-clusterings-in-high-dimension-1809.00932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-balanced-clusterings-in-high-dimension-1809.00932"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-incremental-construction-of-net-trees-1809.01308</loc><lastmod>2018-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-incremental-construction-of-net-trees-1809.01308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-incremental-construction-of-net-trees-1809.01308"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-farthest-point-voronoi-diagram-in-linear-time-1809.01481</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-farthest-point-voronoi-diagram-in-linear-time-1809.01481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-farthest-point-voronoi-diagram-in-linear-time-1809.01481"/></url>
<url><loc>https://scifaro.com/en/abs/fresh-fr-echet-similarity-with-hashing-1809.02350</loc><lastmod>2019-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fresh-fr-echet-similarity-with-hashing-1809.02350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fresh-fr-echet-similarity-with-hashing-1809.02350"/></url>
<url><loc>https://scifaro.com/en/abs/the-partition-spanning-forest-problem-1809.02710</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-partition-spanning-forest-problem-1809.02710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-partition-spanning-forest-problem-1809.02710"/></url>
<url><loc>https://scifaro.com/en/abs/brain-morphometry-analysis-with-surface-foliation-theory-1809.02870</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/brain-morphometry-analysis-with-surface-foliation-theory-1809.02870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/brain-morphometry-analysis-with-surface-foliation-theory-1809.02870"/></url>
<url><loc>https://scifaro.com/en/abs/fitting-a-graph-to-one-dimensional-data-1809.02948</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fitting-a-graph-to-one-dimensional-data-1809.02948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fitting-a-graph-to-one-dimensional-data-1809.02948"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-26th-international-symposium-on-graph-drawing-and-network-visualization-gd-2018-1809.03264</loc><lastmod>2018-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-26th-international-symposium-on-graph-drawing-and-network-visualization-gd-2018-1809.03264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-26th-international-symposium-on-graph-drawing-and-network-visualization-gd-2018-1809.03264"/></url>
<url><loc>https://scifaro.com/en/abs/computing-wasserstein-distance-for-persistence-diagrams-on-a-quantum-computer-1809.06433</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-wasserstein-distance-for-persistence-diagrams-on-a-quantum-computer-1809.06433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-wasserstein-distance-for-persistence-diagrams-on-a-quantum-computer-1809.06433"/></url>
<url><loc>https://scifaro.com/en/abs/testing-sensograph-a-geometric-approach-for-fast-sensory-evaluation-1809.06911</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-sensograph-a-geometric-approach-for-fast-sensory-evaluation-1809.06911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-sensograph-a-geometric-approach-for-fast-sensory-evaluation-1809.06911"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-the-traveling-salesman-problem-with-neighborhoods-on-uniform-disks-1809.07159</loc><lastmod>2018-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-the-traveling-salesman-problem-with-neighborhoods-on-uniform-disks-1809.07159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-the-traveling-salesman-problem-with-neighborhoods-on-uniform-disks-1809.07159"/></url>
<url><loc>https://scifaro.com/en/abs/covering-and-packing-of-rectilinear-subdivision-1809.07214</loc><lastmod>2018-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-and-packing-of-rectilinear-subdivision-1809.07214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-and-packing-of-rectilinear-subdivision-1809.07214"/></url>
<url><loc>https://scifaro.com/en/abs/a-physical-perspective-on-control-points-and-polar-forms-b-ezier-curves-angular-momentum-and-harmonic-oscillators-1809.07287</loc><lastmod>2018-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-physical-perspective-on-control-points-and-polar-forms-b-ezier-curves-angular-momentum-and-harmonic-oscillators-1809.07287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-physical-perspective-on-control-points-and-polar-forms-b-ezier-curves-angular-momentum-and-harmonic-oscillators-1809.07287"/></url>
<url><loc>https://scifaro.com/en/abs/l-1-shortest-path-queries-in-simple-polygons-1809.07481</loc><lastmod>2018-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-1-shortest-path-queries-in-simple-polygons-1809.07481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-1-shortest-path-queries-in-simple-polygons-1809.07481"/></url>
<url><loc>https://scifaro.com/en/abs/polyline-drawings-with-topological-constraints-1809.08111</loc><lastmod>2018-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyline-drawings-with-topological-constraints-1809.08111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyline-drawings-with-topological-constraints-1809.08111"/></url>
<url><loc>https://scifaro.com/en/abs/a-numerical-approach-for-the-filtered-generalized-cech-complex-1809.08175</loc><lastmod>2019-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-numerical-approach-for-the-filtered-generalized-cech-complex-1809.08175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-numerical-approach-for-the-filtered-generalized-cech-complex-1809.08175"/></url>
<url><loc>https://scifaro.com/en/abs/improved-constant-approximation-factor-algorithms-for-k-center-problem-for-uncertain-data-1809.08549</loc><lastmod>2020-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-constant-approximation-factor-algorithms-for-k-center-problem-for-uncertain-data-1809.08549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-constant-approximation-factor-algorithms-for-k-center-problem-for-uncertain-data-1809.08549"/></url>
<url><loc>https://scifaro.com/en/abs/rectilinear-shortest-paths-among-transient-obstacles-1809.08898</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectilinear-shortest-paths-among-transient-obstacles-1809.08898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectilinear-shortest-paths-among-transient-obstacles-1809.08898"/></url>
<url><loc>https://scifaro.com/en/abs/gathering-by-repulsion-1809.09792</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gathering-by-repulsion-1809.09792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gathering-by-repulsion-1809.09792"/></url>
<url><loc>https://scifaro.com/en/abs/approximability-of-covering-cells-with-line-segments-1809.09979</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximability-of-covering-cells-with-line-segments-1809.09979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximability-of-covering-cells-with-line-segments-1809.09979"/></url>
<url><loc>https://scifaro.com/en/abs/convex-partial-transversals-of-planar-regions-1809.10078</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-partial-transversals-of-planar-regions-1809.10078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-partial-transversals-of-planar-regions-1809.10078"/></url>
<url><loc>https://scifaro.com/en/abs/global-curve-simplification-1809.10269</loc><lastmod>2020-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-curve-simplification-1809.10269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-curve-simplification-1809.10269"/></url>
<url><loc>https://scifaro.com/en/abs/point-location-in-incremental-planar-subdivisions-1809.10495</loc><lastmod>2018-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-location-in-incremental-planar-subdivisions-1809.10495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-location-in-incremental-planar-subdivisions-1809.10495"/></url>
<url><loc>https://scifaro.com/en/abs/closest-pair-queries-in-fat-rectangles-1809.10531</loc><lastmod>2019-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closest-pair-queries-in-fat-rectangles-1809.10531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closest-pair-queries-in-fat-rectangles-1809.10531"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-and-efficient-data-point-neighborhood-construction-algorithm-based-on-apollonius-circle-1809.10702</loc><lastmod>2018-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-and-efficient-data-point-neighborhood-construction-algorithm-based-on-apollonius-circle-1809.10702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-and-efficient-data-point-neighborhood-construction-algorithm-based-on-apollonius-circle-1809.10702"/></url>
<url><loc>https://scifaro.com/en/abs/strong-collapse-for-persistence-1809.10945</loc><lastmod>2018-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-collapse-for-persistence-1809.10945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-collapse-for-persistence-1809.10945"/></url>
<url><loc>https://scifaro.com/en/abs/on-locality-sensitive-orderings-and-their-applications-1809.11147</loc><lastmod>2020-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-locality-sensitive-orderings-and-their-applications-1809.11147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-locality-sensitive-orderings-and-their-applications-1809.11147"/></url>
<url><loc>https://scifaro.com/en/abs/streaming-algorithms-for-planar-convex-hulls-1810.00455</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/streaming-algorithms-for-planar-convex-hulls-1810.00455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/streaming-algorithms-for-planar-convex-hulls-1810.00455"/></url>
<url><loc>https://scifaro.com/en/abs/polyline-simplification-has-cubic-complexity-1810.00621</loc><lastmod>2025-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyline-simplification-has-cubic-complexity-1810.00621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyline-simplification-has-cubic-complexity-1810.00621"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-planar-point-location-1810.00715</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-planar-point-location-1810.00715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-planar-point-location-1810.00715"/></url>
<url><loc>https://scifaro.com/en/abs/topological-stability-of-kinetic-k-centers-1810.00794</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-stability-of-kinetic-k-centers-1810.00794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-stability-of-kinetic-k-centers-1810.00794"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-framework-for-clustering-constrained-data-without-locality-property-1810.01049</loc><lastmod>2018-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-framework-for-clustering-constrained-data-without-locality-property-1810.01049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-framework-for-clustering-constrained-data-without-locality-property-1810.01049"/></url>
<url><loc>https://scifaro.com/en/abs/dihedral-rigidity-and-deformation-1810.01546</loc><lastmod>2018-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dihedral-rigidity-and-deformation-1810.01546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dihedral-rigidity-and-deformation-1810.01546"/></url>
<url><loc>https://scifaro.com/en/abs/towards-uniform-online-spherical-tessellations-1810.01786</loc><lastmod>2020-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-uniform-online-spherical-tessellations-1810.01786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-uniform-online-spherical-tessellations-1810.01786"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-conversion-from-rotating-matrix-to-rotation-axis-and-angle-by-extending-rodrigues-formula-1810.02999</loc><lastmod>2018-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-conversion-from-rotating-matrix-to-rotation-axis-and-angle-by-extending-rodrigues-formula-1810.02999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-conversion-from-rotating-matrix-to-rotation-axis-and-angle-by-extending-rodrigues-formula-1810.02999"/></url>
<url><loc>https://scifaro.com/en/abs/ncard-improving-neighborhood-construction-by-apollonius-region-algorithm-based-on-density-1810.03084</loc><lastmod>2018-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ncard-improving-neighborhood-construction-by-apollonius-region-algorithm-based-on-density-1810.03084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ncard-improving-neighborhood-construction-by-apollonius-region-algorithm-based-on-density-1810.03084"/></url>
<url><loc>https://scifaro.com/en/abs/filtration-simplification-for-persistent-homology-via-edge-contraction-1810.04388</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filtration-simplification-for-persistent-homology-via-edge-contraction-1810.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filtration-simplification-for-persistent-homology-via-edge-contraction-1810.04388"/></url>
<url><loc>https://scifaro.com/en/abs/an-edge-extrusion-approach-to-generate-extruded-miura-ori-and-its-double-tiling-origami-patterns-1810.04625</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-edge-extrusion-approach-to-generate-extruded-miura-ori-and-its-double-tiling-origami-patterns-1810.04625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-edge-extrusion-approach-to-generate-extruded-miura-ori-and-its-double-tiling-origami-patterns-1810.04625"/></url>
<url><loc>https://scifaro.com/en/abs/the-lamb-oseen-vortex-and-paint-marbling-1810.04646</loc><lastmod>2018-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lamb-oseen-vortex-and-paint-marbling-1810.04646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lamb-oseen-vortex-and-paint-marbling-1810.04646"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-1-cycles-definition-computation-and-its-application-1810.04807</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-1-cycles-definition-computation-and-its-application-1810.04807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-1-cycles-definition-computation-and-its-application-1810.04807"/></url>
<url><loc>https://scifaro.com/en/abs/computational-technologies-for-brain-morphometry-1810.04833</loc><lastmod>2018-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-technologies-for-brain-morphometry-1810.04833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-technologies-for-brain-morphometry-1810.04833"/></url>
<url><loc>https://scifaro.com/en/abs/deep-surface-light-fields-1810.06514</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deep-surface-light-fields-1810.06514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deep-surface-light-fields-1810.06514"/></url>
<url><loc>https://scifaro.com/en/abs/segment-representations-with-small-resolution-1810.07072</loc><lastmod>2018-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/segment-representations-with-small-resolution-1810.07072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/segment-representations-with-small-resolution-1810.07072"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-triangle-algorithm-a-fast-oracle-for-convex-hull-membership-queries-1810.07346</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-triangle-algorithm-a-fast-oracle-for-convex-hull-membership-queries-1810.07346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-triangle-algorithm-a-fast-oracle-for-convex-hull-membership-queries-1810.07346"/></url>
<url><loc>https://scifaro.com/en/abs/planar-cpg-graphs-1810.08008</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-cpg-graphs-1810.08008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-cpg-graphs-1810.08008"/></url>
<url><loc>https://scifaro.com/en/abs/a-minimalistic-approach-for-fast-computation-of-geodesic-distances-on-triangular-meshes-1810.08218</loc><lastmod>2019-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minimalistic-approach-for-fast-computation-of-geodesic-distances-on-triangular-meshes-1810.08218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minimalistic-approach-for-fast-computation-of-geodesic-distances-on-triangular-meshes-1810.08218"/></url>
<url><loc>https://scifaro.com/en/abs/a-robust-feature-aware-sparse-mesh-representation-1810.08266</loc><lastmod>2020-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-robust-feature-aware-sparse-mesh-representation-1810.08266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-robust-feature-aware-sparse-mesh-representation-1810.08266"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-data-retrieval-parallel-reeb-graph-algorithm-1810.08310</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-data-retrieval-parallel-reeb-graph-algorithm-1810.08310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-data-retrieval-parallel-reeb-graph-algorithm-1810.08310"/></url>
<url><loc>https://scifaro.com/en/abs/local-cliques-in-er-perturbed-random-geometric-graphs-1810.08383</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-cliques-in-er-perturbed-random-geometric-graphs-1810.08383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-cliques-in-er-perturbed-random-geometric-graphs-1810.08383"/></url>
<url><loc>https://scifaro.com/en/abs/nonlinear-mapping-and-distance-geometry-1810.08661</loc><lastmod>2019-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonlinear-mapping-and-distance-geometry-1810.08661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonlinear-mapping-and-distance-geometry-1810.08661"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-consistent-subset-problem-1810.09232</loc><lastmod>2018-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-consistent-subset-problem-1810.09232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-consistent-subset-problem-1810.09232"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-indexing-point-sets-for-approximate-bottleneck-distance-queries-1810.09482</loc><lastmod>2021-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-indexing-point-sets-for-approximate-bottleneck-distance-queries-1810.09482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-indexing-point-sets-for-approximate-bottleneck-distance-queries-1810.09482"/></url>
<url><loc>https://scifaro.com/en/abs/further-towards-unambiguous-edge-bundling-investigating-power-confluent-drawings-for-network-visualization-1810.09948</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-towards-unambiguous-edge-bundling-investigating-power-confluent-drawings-for-network-visualization-1810.09948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-towards-unambiguous-edge-bundling-investigating-power-confluent-drawings-for-network-visualization-1810.09948"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-centerpoint-theorem-to-multiple-points-1810.10231</loc><lastmod>2018-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-centerpoint-theorem-to-multiple-points-1810.10231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-centerpoint-theorem-to-multiple-points-1810.10231"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-minimum-weight-matching-with-outliers-under-translation-1810.10466</loc><lastmod>2018-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-minimum-weight-matching-with-outliers-under-translation-1810.10466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-minimum-weight-matching-with-outliers-under-translation-1810.10466"/></url>
<url><loc>https://scifaro.com/en/abs/tigl-an-open-source-computational-geometry-library-for-parametric-aircraft-design-1810.10795</loc><lastmod>2019-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tigl-an-open-source-computational-geometry-library-for-parametric-aircraft-design-1810.10795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tigl-an-open-source-computational-geometry-library-for-parametric-aircraft-design-1810.10795"/></url>
<url><loc>https://scifaro.com/en/abs/practical-shape-analysis-and-segmentation-methods-for-point-cloud-models-1810.10933</loc><lastmod>2018-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-shape-analysis-and-segmentation-methods-for-point-cloud-models-1810.10933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-shape-analysis-and-segmentation-methods-for-point-cloud-models-1810.10933"/></url>
<url><loc>https://scifaro.com/en/abs/better-approximation-algorithm-for-point-set-diameter-1810.11628</loc><lastmod>2020-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-approximation-algorithm-for-point-set-diameter-1810.11628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-approximation-algorithm-for-point-set-diameter-1810.11628"/></url>
<url><loc>https://scifaro.com/en/abs/computational-geometry-and-the-u-s-supreme-court-1810.11704</loc><lastmod>2018-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-geometry-and-the-u-s-supreme-court-1810.11704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-geometry-and-the-u-s-supreme-court-1810.11704"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-k-means-and-k-median-clustering-and-their-applications-1810.12826</loc><lastmod>2018-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-k-means-and-k-median-clustering-and-their-applications-1810.12826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-k-means-and-k-median-clustering-and-their-applications-1810.12826"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-clustered-graphs-on-disk-arrangements-1811.00785</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-clustered-graphs-on-disk-arrangements-1811.00785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-clustered-graphs-on-disk-arrangements-1811.00785"/></url>
<url><loc>https://scifaro.com/en/abs/smoothed-analysis-of-the-art-gallery-problem-1811.01177</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smoothed-analysis-of-the-art-gallery-problem-1811.01177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smoothed-analysis-of-the-art-gallery-problem-1811.01177"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-polycube-trees-with-constant-refinement-1811.01842</loc><lastmod>2021-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-polycube-trees-with-constant-refinement-1811.01842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-polycube-trees-with-constant-refinement-1811.01842"/></url>
<url><loc>https://scifaro.com/en/abs/high-dimensional-clustering-with-r-nets-1811.02288</loc><lastmod>2018-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-dimensional-clustering-with-r-nets-1811.02288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-dimensional-clustering-with-r-nets-1811.02288"/></url>
<url><loc>https://scifaro.com/en/abs/fpt-algorithms-for-computing-gromov-hausdorff-and-interleaving-distances-between-trees-1811.02425</loc><lastmod>2019-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fpt-algorithms-for-computing-gromov-hausdorff-and-interleaving-distances-between-trees-1811.02425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fpt-algorithms-for-computing-gromov-hausdorff-and-interleaving-distances-between-trees-1811.02425"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-order-types-in-integer-grids-of-small-size-1811.02455</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-order-types-in-integer-grids-of-small-size-1811.02455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-order-types-in-integer-grids-of-small-size-1811.02455"/></url>
<url><loc>https://scifaro.com/en/abs/push-pull-direct-modeling-of-solid-cad-models-1811.04036</loc><lastmod>2018-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/push-pull-direct-modeling-of-solid-cad-models-1811.04036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/push-pull-direct-modeling-of-solid-cad-models-1811.04036"/></url>
<url><loc>https://scifaro.com/en/abs/computing-discrete-morse-complexes-from-simplicial-complexes-1811.04485</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-discrete-morse-complexes-from-simplicial-complexes-1811.04485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-discrete-morse-complexes-from-simplicial-complexes-1811.04485"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-curve-restricted-simplification-of-polygonal-curves-1811.04552</loc><lastmod>2019-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-curve-restricted-simplification-of-polygonal-curves-1811.04552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-curve-restricted-simplification-of-polygonal-curves-1811.04552"/></url>
<url><loc>https://scifaro.com/en/abs/dtm-based-filtrations-1811.04757</loc><lastmod>2024-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dtm-based-filtrations-1811.04757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dtm-based-filtrations-1811.04757"/></url>
<url><loc>https://scifaro.com/en/abs/computing-multiparameter-persistent-homology-through-a-discrete-morse-based-approach-1811.05396</loc><lastmod>2020-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-multiparameter-persistent-homology-through-a-discrete-morse-based-approach-1811.05396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-multiparameter-persistent-homology-through-a-discrete-morse-based-approach-1811.05396"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-combinatorial-algorithm-for-optimal-compression-of-a-polyline-with-segments-and-arcs-1811.05659</loc><lastmod>2018-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-combinatorial-algorithm-for-optimal-compression-of-a-polyline-with-segments-and-arcs-1811.05659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-combinatorial-algorithm-for-optimal-compression-of-a-polyline-with-segments-and-arcs-1811.05659"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-minkowski-sum-of-convex-polytopes-in-re-d-1811.05812</loc><lastmod>2018-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-minkowski-sum-of-convex-polytopes-in-re-d-1811.05812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-minkowski-sum-of-convex-polytopes-in-re-d-1811.05812"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-width-empty-square-and-rectangular-annulus-1811.06217</loc><lastmod>2018-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-width-empty-square-and-rectangular-annulus-1811.06217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-width-empty-square-and-rectangular-annulus-1811.06217"/></url>
<url><loc>https://scifaro.com/en/abs/the-edgeconflict-predicate-in-the-3d-apollonius-diagram-1811.06504</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-edgeconflict-predicate-in-the-3d-apollonius-diagram-1811.06504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-edgeconflict-predicate-in-the-3d-apollonius-diagram-1811.06504"/></url>
<url><loc>https://scifaro.com/en/abs/advice-complexity-of-treasure-hunt-in-geometric-terrains-1811.06823</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advice-complexity-of-treasure-hunt-in-geometric-terrains-1811.06823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advice-complexity-of-treasure-hunt-in-geometric-terrains-1811.06823"/></url>
<url><loc>https://scifaro.com/en/abs/a-spanner-for-the-day-after-1811.06898</loc><lastmod>2020-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spanner-for-the-day-after-1811.06898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spanner-for-the-day-after-1811.06898"/></url>
<url><loc>https://scifaro.com/en/abs/multi-block-grid-deformation-method-in-3d-1811.08974</loc><lastmod>2018-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-block-grid-deformation-method-in-3d-1811.08974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-block-grid-deformation-method-in-3d-1811.08974"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-interleaving-distance-is-np-hard-1811.09165</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-interleaving-distance-is-np-hard-1811.09165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-interleaving-distance-is-np-hard-1811.09165"/></url>
<url><loc>https://scifaro.com/en/abs/on-embeddability-of-unit-disk-graphs-onto-straight-lines-1811.09881</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-embeddability-of-unit-disk-graphs-onto-straight-lines-1811.09881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-embeddability-of-unit-disk-graphs-onto-straight-lines-1811.09881"/></url>
<url><loc>https://scifaro.com/en/abs/challenges-in-reconstructing-shapes-from-euler-characteristic-curves-1811.11337</loc><lastmod>2018-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/challenges-in-reconstructing-shapes-from-euler-characteristic-curves-1811.11337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/challenges-in-reconstructing-shapes-from-euler-characteristic-curves-1811.11337"/></url>
<url><loc>https://scifaro.com/en/abs/isospectralization-or-how-to-hear-shape-style-and-correspondence-1811.11465</loc><lastmod>2020-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isospectralization-or-how-to-hear-shape-style-and-correspondence-1811.11465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isospectralization-or-how-to-hear-shape-style-and-correspondence-1811.11465"/></url>
<url><loc>https://scifaro.com/en/abs/topology-aware-surface-reconstruction-for-point-clouds-1811.12543</loc><lastmod>2021-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-aware-surface-reconstruction-for-point-clouds-1811.12543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-aware-surface-reconstruction-for-point-clouds-1811.12543"/></url>
<url><loc>https://scifaro.com/en/abs/metric-based-quadrilateral-mesh-generation-1811.12604</loc><lastmod>2018-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-based-quadrilateral-mesh-generation-1811.12604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-based-quadrilateral-mesh-generation-1811.12604"/></url>
<url><loc>https://scifaro.com/en/abs/computational-paper-wrapping-transforms-non-stretchable-2d-devices-into-wearable-and-conformable-3d-devices-1812.00003</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-paper-wrapping-transforms-non-stretchable-2d-devices-into-wearable-and-conformable-3d-devices-1812.00003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-paper-wrapping-transforms-non-stretchable-2d-devices-into-wearable-and-conformable-3d-devices-1812.00003"/></url>
<url><loc>https://scifaro.com/en/abs/on-closest-pair-in-euclidean-metric-monochromatic-is-as-hard-as-bichromatic-1812.00901</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-closest-pair-in-euclidean-metric-monochromatic-is-as-hard-as-bichromatic-1812.00901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-closest-pair-in-euclidean-metric-monochromatic-is-as-hard-as-bichromatic-1812.00901"/></url>
<url><loc>https://scifaro.com/en/abs/rigid-foldability-is-np-hard-1812.01160</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rigid-foldability-is-np-hard-1812.01160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rigid-foldability-is-np-hard-1812.01160"/></url>
<url><loc>https://scifaro.com/en/abs/conic-crease-patterns-with-reflecting-rule-lines-1812.01167</loc><lastmod>2018-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conic-crease-patterns-with-reflecting-rule-lines-1812.01167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conic-crease-patterns-with-reflecting-rule-lines-1812.01167"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-vertices-of-the-convex-hull-even-unordered-takes-omega-n-log-n-time-a-proof-by-reduction-from-epsilon-closeness-1812.01332</loc><lastmod>2018-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-vertices-of-the-convex-hull-even-unordered-takes-omega-n-log-n-time-a-proof-by-reduction-from-epsilon-closeness-1812.01332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-vertices-of-the-convex-hull-even-unordered-takes-omega-n-log-n-time-a-proof-by-reduction-from-epsilon-closeness-1812.01332"/></url>
<url><loc>https://scifaro.com/en/abs/topological-data-analysis-of-single-cell-hi-c-contact-maps-1812.01360</loc><lastmod>2018-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-data-analysis-of-single-cell-hi-c-contact-maps-1812.01360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-data-analysis-of-single-cell-hi-c-contact-maps-1812.01360"/></url>
<url><loc>https://scifaro.com/en/abs/topologically-trivial-closed-walks-in-directed-surface-graphs-1812.01564</loc><lastmod>2019-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topologically-trivial-closed-walks-in-directed-surface-graphs-1812.01564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topologically-trivial-closed-walks-in-directed-surface-graphs-1812.01564"/></url>
<url><loc>https://scifaro.com/en/abs/from-crossing-free-graphs-on-wheel-sets-to-embracing-simplices-and-polytopes-with-few-vertices-1812.01595</loc><lastmod>2019-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-crossing-free-graphs-on-wheel-sets-to-embracing-simplices-and-polytopes-with-few-vertices-1812.01595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-crossing-free-graphs-on-wheel-sets-to-embracing-simplices-and-polytopes-with-few-vertices-1812.01595"/></url>
<url><loc>https://scifaro.com/en/abs/euler-transformation-of-polyhedral-complexes-1812.02412</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euler-transformation-of-polyhedral-complexes-1812.02412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euler-transformation-of-polyhedral-complexes-1812.02412"/></url>
<url><loc>https://scifaro.com/en/abs/time-series-featurization-via-topological-data-analysis-1812.02987</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-series-featurization-via-topological-data-analysis-1812.02987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-series-featurization-via-topological-data-analysis-1812.02987"/></url>
<url><loc>https://scifaro.com/en/abs/the-persistent-homology-of-cyclic-graphs-1812.03374</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-persistent-homology-of-cyclic-graphs-1812.03374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-persistent-homology-of-cyclic-graphs-1812.03374"/></url>
<url><loc>https://scifaro.com/en/abs/area-preserving-mapping-of-3d-ultrasound-carotid-artery-images-using-density-equalizing-reference-map-1812.03434</loc><lastmod>2020-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/area-preserving-mapping-of-3d-ultrasound-carotid-artery-images-using-density-equalizing-reference-map-1812.03434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/area-preserving-mapping-of-3d-ultrasound-carotid-artery-images-using-density-equalizing-reference-map-1812.03434"/></url>
<url><loc>https://scifaro.com/en/abs/hyperbolic-intersection-graphs-and-quasi-polynomial-time-1812.03960</loc><lastmod>2019-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperbolic-intersection-graphs-and-quasi-polynomial-time-1812.03960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperbolic-intersection-graphs-and-quasi-polynomial-time-1812.03960"/></url>
<url><loc>https://scifaro.com/en/abs/bundled-crossings-revisited-1812.04263</loc><lastmod>2022-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bundled-crossings-revisited-1812.04263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bundled-crossings-revisited-1812.04263"/></url>
<url><loc>https://scifaro.com/en/abs/the-crossing-tverberg-theorem-1812.04911</loc><lastmod>2021-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-crossing-tverberg-theorem-1812.04911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-crossing-tverberg-theorem-1812.04911"/></url>
<url><loc>https://scifaro.com/en/abs/improved-topological-approximations-by-digitization-1812.04966</loc><lastmod>2018-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-topological-approximations-by-digitization-1812.04966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-topological-approximations-by-digitization-1812.04966"/></url>
<url><loc>https://scifaro.com/en/abs/peeling-digital-potatoes-1812.05410</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peeling-digital-potatoes-1812.05410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peeling-digital-potatoes-1812.05410"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-simplification-by-minimizing-convex-corners-1812.05656</loc><lastmod>2018-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-simplification-by-minimizing-convex-corners-1812.05656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-simplification-by-minimizing-convex-corners-1812.05656"/></url>
<url><loc>https://scifaro.com/en/abs/mapper-comparison-with-wasserstein-metrics-1812.06232</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mapper-comparison-with-wasserstein-metrics-1812.06232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mapper-comparison-with-wasserstein-metrics-1812.06232"/></url>
<url><loc>https://scifaro.com/en/abs/3dti-net-learn-inner-transform-invariant-3d-geometry-features-using-dynamic-gcn-1812.06254</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3dti-net-learn-inner-transform-invariant-3d-geometry-features-using-dynamic-gcn-1812.06254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3dti-net-learn-inner-transform-invariant-3d-geometry-features-using-dynamic-gcn-1812.06254"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-testing-with-persistent-homology-1812.06491</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-testing-with-persistent-homology-1812.06491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-testing-with-persistent-homology-1812.06491"/></url>
<url><loc>https://scifaro.com/en/abs/stabbing-pairwise-intersecting-disks-by-four-points-1812.06907</loc><lastmod>2020-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabbing-pairwise-intersecting-disks-by-four-points-1812.06907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabbing-pairwise-intersecting-disks-by-four-points-1812.06907"/></url>
<url><loc>https://scifaro.com/en/abs/momen-e-t-flavor-the-moments-in-learning-to-classify-shapes-1812.07431</loc><lastmod>2019-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/momen-e-t-flavor-the-moments-in-learning-to-classify-shapes-1812.07431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/momen-e-t-flavor-the-moments-in-learning-to-classify-shapes-1812.07431"/></url>
<url><loc>https://scifaro.com/en/abs/on-order-types-of-random-point-sets-1812.08525</loc><lastmod>2020-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-order-types-of-random-point-sets-1812.08525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-order-types-of-random-point-sets-1812.08525"/></url>
<url><loc>https://scifaro.com/en/abs/distance-measures-for-embedded-graphs-1812.09095</loc><lastmod>2019-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-measures-for-embedded-graphs-1812.09095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-measures-for-embedded-graphs-1812.09095"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-o-k-robust-geometric-spanners-1812.09913</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-o-k-robust-geometric-spanners-1812.09913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-o-k-robust-geometric-spanners-1812.09913"/></url>
<url><loc>https://scifaro.com/en/abs/3-colorable-delaunay-triangulations-1812.09951</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3-colorable-delaunay-triangulations-1812.09951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3-colorable-delaunay-triangulations-1812.09951"/></url>
<url><loc>https://scifaro.com/en/abs/evacuating-equilateral-triangles-and-squares-in-the-face-to-face-model-1812.10162</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evacuating-equilateral-triangles-and-squares-in-the-face-to-face-model-1812.10162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evacuating-equilateral-triangles-and-squares-in-the-face-to-face-model-1812.10162"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-generalized-polynomial-partitioning-and-its-applications-1812.10269</loc><lastmod>2026-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-generalized-polynomial-partitioning-and-its-applications-1812.10269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-generalized-polynomial-partitioning-and-its-applications-1812.10269"/></url>
<url><loc>https://scifaro.com/en/abs/group-evolution-patterns-in-running-races-1812.10530</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/group-evolution-patterns-in-running-races-1812.10530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/group-evolution-patterns-in-running-races-1812.10530"/></url>
<url><loc>https://scifaro.com/en/abs/degree-bounded-bottleneck-spanning-trees-in-three-dimensions-1812.11177</loc><lastmod>2019-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-bounded-bottleneck-spanning-trees-in-three-dimensions-1812.11177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-bounded-bottleneck-spanning-trees-in-three-dimensions-1812.11177"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbors-in-the-space-of-persistence-diagrams-1812.11257</loc><lastmod>2021-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbors-in-the-space-of-persistence-diagrams-1812.11257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbors-in-the-space-of-persistence-diagrams-1812.11257"/></url>
<url><loc>https://scifaro.com/en/abs/distributions-of-matching-distances-in-topological-data-analysis-1812.11258</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributions-of-matching-distances-in-topological-data-analysis-1812.11258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributions-of-matching-distances-in-topological-data-analysis-1812.11258"/></url>
<url><loc>https://scifaro.com/en/abs/convex-polygons-in-cartesian-products-1812.11332</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-polygons-in-cartesian-products-1812.11332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-polygons-in-cartesian-products-1812.11332"/></url>
<url><loc>https://scifaro.com/en/abs/singularity-structure-simplification-of-hexahedral-mesh-via-weighted-ranking-1901.00238</loc><lastmod>2019-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/singularity-structure-simplification-of-hexahedral-mesh-via-weighted-ranking-1901.00238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/singularity-structure-simplification-of-hexahedral-mesh-via-weighted-ranking-1901.00238"/></url>
<url><loc>https://scifaro.com/en/abs/a-variational-approach-to-high-order-r-adaptation-1901.00990</loc><lastmod>2019-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-variational-approach-to-high-order-r-adaptation-1901.00990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-variational-approach-to-high-order-r-adaptation-1901.00990"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-matchings-and-minimum-blocking-sets-in-theta-6-graphs-1901.01476</loc><lastmod>2019-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-matchings-and-minimum-blocking-sets-in-theta-6-graphs-1901.01476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-matchings-and-minimum-blocking-sets-in-theta-6-graphs-1901.01476"/></url>
<url><loc>https://scifaro.com/en/abs/walking-the-dog-fast-in-practice-algorithm-engineering-of-the-fr-echet-distance-1901.01504</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/walking-the-dog-fast-in-practice-algorithm-engineering-of-the-fr-echet-distance-1901.01504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/walking-the-dog-fast-in-practice-algorithm-engineering-of-the-fr-echet-distance-1901.01504"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-discontinuous-trajectory-hotspots-1901.01763</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-discontinuous-trajectory-hotspots-1901.01763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-discontinuous-trajectory-hotspots-1901.01763"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-k-l-clustering-under-the-fr-echet-distance-1901.01870</loc><lastmod>2019-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-k-l-clustering-under-the-fr-echet-distance-1901.01870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-k-l-clustering-under-the-fr-echet-distance-1901.01870"/></url>
<url><loc>https://scifaro.com/en/abs/a-semi-structured-approach-to-curvilinear-mesh-generation-around-streamlined-bodies-1901.01968</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-semi-structured-approach-to-curvilinear-mesh-generation-around-streamlined-bodies-1901.01968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-semi-structured-approach-to-curvilinear-mesh-generation-around-streamlined-bodies-1901.01968"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-the-topology-and-the-geometry-of-the-space-of-persistence-diagrams-via-optimal-partial-transport-1901.03048</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-the-topology-and-the-geometry-of-the-space-of-persistence-diagrams-via-optimal-partial-transport-1901.03048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-the-topology-and-the-geometry-of-the-space-of-persistence-diagrams-via-optimal-partial-transport-1901.03048"/></url>
<url><loc>https://scifaro.com/en/abs/skeletonisation-algorithms-with-theoretical-guarantees-for-unorganised-point-clouds-with-high-levels-of-noise-1901.03319</loc><lastmod>2021-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skeletonisation-algorithms-with-theoretical-guarantees-for-unorganised-point-clouds-with-high-levels-of-noise-1901.03319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skeletonisation-algorithms-with-theoretical-guarantees-for-unorganised-point-clouds-with-high-levels-of-noise-1901.03319"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-to-test-digital-convexity-1901.04738</loc><lastmod>2019-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-to-test-digital-convexity-1901.04738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-to-test-digital-convexity-1901.04738"/></url>
<url><loc>https://scifaro.com/en/abs/complementarity-preserving-fracture-morphology-for-archaeological-fragments-1901.05726</loc><lastmod>2019-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complementarity-preserving-fracture-morphology-for-archaeological-fragments-1901.05726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complementarity-preserving-fracture-morphology-for-archaeological-fragments-1901.05726"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-facial-photometries-and-corresponding-geometries-using-generative-adversarial-networks-1901.06551</loc><lastmod>2019-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-facial-photometries-and-corresponding-geometries-using-generative-adversarial-networks-1901.06551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-facial-photometries-and-corresponding-geometries-using-generative-adversarial-networks-1901.06551"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-strategy-works-for-k-center-clustering-with-outliers-and-coreset-construction-1901.08219</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-strategy-works-for-k-center-clustering-with-outliers-and-coreset-construction-1901.08219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-strategy-works-for-k-center-clustering-with-outliers-and-coreset-construction-1901.08219"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-sampling-methods-for-the-calculation-of-metamer-mismatch-volumes-1901.08419</loc><lastmod>2019-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-sampling-methods-for-the-calculation-of-metamer-mismatch-volumes-1901.08419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-sampling-methods-for-the-calculation-of-metamer-mismatch-volumes-1901.08419"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-all-layers-simple-foldability-1901.08564</loc><lastmod>2019-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-all-layers-simple-foldability-1901.08564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-all-layers-simple-foldability-1901.08564"/></url>
<url><loc>https://scifaro.com/en/abs/metric-spaces-with-expensive-distances-1901.08805</loc><lastmod>2019-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-spaces-with-expensive-distances-1901.08805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-spaces-with-expensive-distances-1901.08805"/></url>
<url><loc>https://scifaro.com/en/abs/plantinga-vegter-algorithm-takes-average-polynomial-time-1901.09234</loc><lastmod>2024-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plantinga-vegter-algorithm-takes-average-polynomial-time-1901.09234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plantinga-vegter-algorithm-takes-average-polynomial-time-1901.09234"/></url>
<url><loc>https://scifaro.com/en/abs/a-common-lines-approach-for-ab-initio-modeling-of-cyclically-symmetric-molecules-1901.10888</loc><lastmod>2020-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-common-lines-approach-for-ab-initio-modeling-of-cyclically-symmetric-molecules-1901.10888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-common-lines-approach-for-ab-initio-modeling-of-cyclically-symmetric-molecules-1901.10888"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-self-improving-sorting-with-hidden-partitions-1902.00219</loc><lastmod>2019-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-self-improving-sorting-with-hidden-partitions-1902.00219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-self-improving-sorting-with-hidden-partitions-1902.00219"/></url>
<url><loc>https://scifaro.com/en/abs/external-labeling-techniques-a-taxonomy-and-survey-1902.01454</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/external-labeling-techniques-a-taxonomy-and-survey-1902.01454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/external-labeling-techniques-a-taxonomy-and-survey-1902.01454"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-convex-bodies-by-their-contact-and-intersection-graphs-1902.01732</loc><lastmod>2019-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-convex-bodies-by-their-contact-and-intersection-graphs-1902.01732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-convex-bodies-by-their-contact-and-intersection-graphs-1902.01732"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-tractable-algorithms-for-corridor-guarding-problems-1902.03820</loc><lastmod>2022-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-tractable-algorithms-for-corridor-guarding-problems-1902.03820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-tractable-algorithms-for-corridor-guarding-problems-1902.03820"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-multicut-1902.04045</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-multicut-1902.04045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-multicut-1902.04045"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-yolk-in-spatial-voting-games-without-computing-median-lines-1902.04735</loc><lastmod>2019-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-yolk-in-spatial-voting-games-without-computing-median-lines-1902.04735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-yolk-in-spatial-voting-games-without-computing-median-lines-1902.04735"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-of-geospatial-data-a-case-study-with-voting-1902.05911</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-of-geospatial-data-a-case-study-with-voting-1902.05911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-of-geospatial-data-a-case-study-with-voting-1902.05911"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-secluded-paths-and-planar-satisfiability-1902.06471</loc><lastmod>2020-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-secluded-paths-and-planar-satisfiability-1902.06471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-secluded-paths-and-planar-satisfiability-1902.06471"/></url>
<url><loc>https://scifaro.com/en/abs/routing-in-histograms-1902.06599</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-in-histograms-1902.06599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-in-histograms-1902.06599"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-tsp-motorcycle-graphs-and-other-new-applications-of-nearest-neighbor-chains-1902.06875</loc><lastmod>2019-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-tsp-motorcycle-graphs-and-other-new-applications-of-nearest-neighbor-chains-1902.06875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-tsp-motorcycle-graphs-and-other-new-applications-of-nearest-neighbor-chains-1902.06875"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-continuous-functions-on-persistence-diagrams-using-template-functions-1902.07190</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-continuous-functions-on-persistence-diagrams-using-template-functions-1902.07190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-continuous-functions-on-persistence-diagrams-using-template-functions-1902.07190"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbor-for-curves-simple-efficient-and-deterministic-1902.07562</loc><lastmod>2022-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-for-curves-simple-efficient-and-deterministic-1902.07562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-for-curves-simple-efficient-and-deterministic-1902.07562"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-computing-an-average-curve-1902.08053</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-computing-an-average-curve-1902.08053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-computing-an-average-curve-1902.08053"/></url>
<url><loc>https://scifaro.com/en/abs/matching-points-with-disks-with-a-common-intersection-1902.08427</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-points-with-disks-with-a-common-intersection-1902.08427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-points-with-disks-with-a-common-intersection-1902.08427"/></url>
<url><loc>https://scifaro.com/en/abs/near-neighbor-preserving-dimension-reduction-for-doubling-subsets-of-ell-1-1902.08815</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-neighbor-preserving-dimension-reduction-for-doubling-subsets-of-ell-1-1902.08815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-neighbor-preserving-dimension-reduction-for-doubling-subsets-of-ell-1-1902.08815"/></url>
<url><loc>https://scifaro.com/en/abs/on-one-round-discrete-voronoi-games-1902.09234</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-one-round-discrete-voronoi-games-1902.09234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-one-round-discrete-voronoi-games-1902.09234"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-maintenance-of-the-lower-envelope-of-pseudo-lines-1902.09565</loc><lastmod>2019-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-maintenance-of-the-lower-envelope-of-pseudo-lines-1902.09565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-maintenance-of-the-lower-envelope-of-pseudo-lines-1902.09565"/></url>
<url><loc>https://scifaro.com/en/abs/towards-real-time-3d-reconstruction-using-consumer-uavs-1902.09733</loc><lastmod>2019-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-real-time-3d-reconstruction-using-consumer-uavs-1902.09733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-real-time-3d-reconstruction-using-consumer-uavs-1902.09733"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-lower-bound-on-the-maximum-number-of-plane-graphs-using-production-matrices-1902.09841</loc><lastmod>2019-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-lower-bound-on-the-maximum-number-of-plane-graphs-using-production-matrices-1902.09841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-lower-bound-on-the-maximum-number-of-plane-graphs-using-production-matrices-1902.09841"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-morphogenesis-of-three-dimensional-tensegrity-structures-1902.09953</loc><lastmod>2019-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-morphogenesis-of-three-dimensional-tensegrity-structures-1902.09953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-morphogenesis-of-three-dimensional-tensegrity-structures-1902.09953"/></url>
<url><loc>https://scifaro.com/en/abs/shapes-from-echoes-uniqueness-from-point-to-plane-distance-matrices-1902.09959</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shapes-from-echoes-uniqueness-from-point-to-plane-distance-matrices-1902.09959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shapes-from-echoes-uniqueness-from-point-to-plane-distance-matrices-1902.09959"/></url>
<url><loc>https://scifaro.com/en/abs/plane-hop-spanners-for-unit-disk-graphs-simpler-and-better-1902.10051</loc><lastmod>2019-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-hop-spanners-for-unit-disk-graphs-simpler-and-better-1902.10051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-hop-spanners-for-unit-disk-graphs-simpler-and-better-1902.10051"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-smallest-enclosing-ball-in-high-dimensions-via-subgradient-sampling-1902.10966</loc><lastmod>2019-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-smallest-enclosing-ball-in-high-dimensions-via-subgradient-sampling-1902.10966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-smallest-enclosing-ball-in-high-dimensions-via-subgradient-sampling-1902.10966"/></url>
<url><loc>https://scifaro.com/en/abs/algorithm-and-hardness-results-on-liar-s-dominating-set-and-k-tuple-dominating-set-1902.11149</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithm-and-hardness-results-on-liar-s-dominating-set-and-k-tuple-dominating-set-1902.11149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithm-and-hardness-results-on-liar-s-dominating-set-and-k-tuple-dominating-set-1902.11149"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-planar-convex-hull-1902.11169</loc><lastmod>2019-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-planar-convex-hull-1902.11169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-planar-convex-hull-1902.11169"/></url>
<url><loc>https://scifaro.com/en/abs/dimdraw-a-novel-tool-for-drawing-concept-lattices-1903.00686</loc><lastmod>2019-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimdraw-a-novel-tool-for-drawing-concept-lattices-1903.00686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimdraw-a-novel-tool-for-drawing-concept-lattices-1903.00686"/></url>
<url><loc>https://scifaro.com/en/abs/robust-corner-and-tangent-point-detection-for-strokes-with-deep-learning-approach-1903.00899</loc><lastmod>2019-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-corner-and-tangent-point-detection-for-strokes-with-deep-learning-approach-1903.00899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-corner-and-tangent-point-detection-for-strokes-with-deep-learning-approach-1903.00899"/></url>
<url><loc>https://scifaro.com/en/abs/a-divide-and-conquer-algorithm-for-two-point-l-1-shortest-path-queries-in-polygonal-domains-1903.01417</loc><lastmod>2019-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-divide-and-conquer-algorithm-for-two-point-l-1-shortest-path-queries-in-polygonal-domains-1903.01417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-divide-and-conquer-algorithm-for-two-point-l-1-shortest-path-queries-in-polygonal-domains-1903.01417"/></url>
<url><loc>https://scifaro.com/en/abs/cpg-graphs-some-structural-and-hardness-results-1903.01805</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cpg-graphs-some-structural-and-hardness-results-1903.01805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cpg-graphs-some-structural-and-hardness-results-1903.01805"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-fr-echet-distance-1903.02353</loc><lastmod>2019-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-fr-echet-distance-1903.02353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-fr-echet-distance-1903.02353"/></url>
<url><loc>https://scifaro.com/en/abs/controlling-meshes-via-curvature-spin-transformations-for-pose-invariant-shape-processing-1903.02429</loc><lastmod>2019-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlling-meshes-via-curvature-spin-transformations-for-pose-invariant-shape-processing-1903.02429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlling-meshes-via-curvature-spin-transformations-for-pose-invariant-shape-processing-1903.02429"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-representation-and-manipulation-of-quadratic-surfaces-using-geometric-algebras-1903.02444</loc><lastmod>2019-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-representation-and-manipulation-of-quadratic-surfaces-using-geometric-algebras-1903.02444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-representation-and-manipulation-of-quadratic-surfaces-using-geometric-algebras-1903.02444"/></url>
<url><loc>https://scifaro.com/en/abs/an-experimental-study-of-forbidden-patterns-in-geometric-permutations-by-combinatorial-lifting-1903.03014</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-experimental-study-of-forbidden-patterns-in-geometric-permutations-by-combinatorial-lifting-1903.03014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-experimental-study-of-forbidden-patterns-in-geometric-permutations-by-combinatorial-lifting-1903.03014"/></url>
<url><loc>https://scifaro.com/en/abs/the-vc-dimension-of-metric-balls-under-fr-echet-and-hausdorff-distances-1903.03211</loc><lastmod>2019-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vc-dimension-of-metric-balls-under-fr-echet-and-hausdorff-distances-1903.03211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vc-dimension-of-metric-balls-under-fr-echet-and-hausdorff-distances-1903.03211"/></url>
<url><loc>https://scifaro.com/en/abs/active-learning-a-convex-body-in-low-dimensions-1903.03693</loc><lastmod>2021-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/active-learning-a-convex-body-in-low-dimensions-1903.03693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/active-learning-a-convex-body-in-low-dimensions-1903.03693"/></url>
<url><loc>https://scifaro.com/en/abs/counting-polygon-triangulations-is-hard-1903.04737</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-polygon-triangulations-is-hard-1903.04737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-polygon-triangulations-is-hard-1903.04737"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-ortho-radial-graph-drawing-1903.05048</loc><lastmod>2019-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-ortho-radial-graph-drawing-1903.05048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-ortho-radial-graph-drawing-1903.05048"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-algorithms-for-shortest-paths-in-weighted-unit-disk-graphs-1903.05255</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-algorithms-for-shortest-paths-in-weighted-unit-disk-graphs-1903.05255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-algorithms-for-shortest-paths-in-weighted-unit-disk-graphs-1903.05255"/></url>
<url><loc>https://scifaro.com/en/abs/cubic-planar-graphs-that-cannot-be-drawn-on-few-lines-1903.05256</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubic-planar-graphs-that-cannot-be-drawn-on-few-lines-1903.05256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubic-planar-graphs-that-cannot-be-drawn-on-few-lines-1903.05256"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-maximum-degree-conjecture-holds-precisely-for-c-crossing-critical-graphs-with-c-leq-12-1903.05363</loc><lastmod>2021-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-maximum-degree-conjecture-holds-precisely-for-c-crossing-critical-graphs-with-c-leq-12-1903.05363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-maximum-degree-conjecture-holds-precisely-for-c-crossing-critical-graphs-with-c-leq-12-1903.05363"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-sensitive-bounds-on-relative-approximations-of-geometric-ranges-1903.06617</loc><lastmod>2019-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-sensitive-bounds-on-relative-approximations-of-geometric-ranges-1903.06617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-sensitive-bounds-on-relative-approximations-of-geometric-ranges-1903.06617"/></url>
<url><loc>https://scifaro.com/en/abs/smallest-k-enclosing-rectangle-revisited-1903.06785</loc><lastmod>2019-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smallest-k-enclosing-rectangle-revisited-1903.06785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smallest-k-enclosing-rectangle-revisited-1903.06785"/></url>
<url><loc>https://scifaro.com/en/abs/k-means-clustering-of-lines-for-big-data-1903.06904</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-means-clustering-of-lines-for-big-data-1903.06904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-means-clustering-of-lines-for-big-data-1903.06904"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-intersection-of-two-quadrics-through-projection-and-lifting-1903.06983</loc><lastmod>2019-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-intersection-of-two-quadrics-through-projection-and-lifting-1903.06983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-intersection-of-two-quadrics-through-projection-and-lifting-1903.06983"/></url>
<url><loc>https://scifaro.com/en/abs/circumscribing-polygons-and-polygonizations-for-disjoint-line-segments-1903.07019</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circumscribing-polygons-and-polygonizations-for-disjoint-line-segments-1903.07019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circumscribing-polygons-and-polygonizations-for-disjoint-line-segments-1903.07019"/></url>
<url><loc>https://scifaro.com/en/abs/computing-maximum-independent-set-on-outerstring-graphs-and-their-relatives-1903.07024</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-maximum-independent-set-on-outerstring-graphs-and-their-relatives-1903.07024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-maximum-independent-set-on-outerstring-graphs-and-their-relatives-1903.07024"/></url>
<url><loc>https://scifaro.com/en/abs/general-techniques-for-approximate-incidences-and-their-application-to-the-camera-posing-problem-1903.07047</loc><lastmod>2019-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-techniques-for-approximate-incidences-and-their-application-to-the-camera-posing-problem-1903.07047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-techniques-for-approximate-incidences-and-their-application-to-the-camera-posing-problem-1903.07047"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-k-level-in-arrangements-of-pseudoplanes-1903.07196</loc><lastmod>2020-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-k-level-in-arrangements-of-pseudoplanes-1903.07196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-k-level-in-arrangements-of-pseudoplanes-1903.07196"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-contact-representations-of-graphs-1903.07595</loc><lastmod>2019-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-contact-representations-of-graphs-1903.07595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-contact-representations-of-graphs-1903.07595"/></url>
<url><loc>https://scifaro.com/en/abs/variational-b-rep-model-analysis-for-direct-modeling-using-geometric-perturbation-1903.07770</loc><lastmod>2019-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variational-b-rep-model-analysis-for-direct-modeling-using-geometric-perturbation-1903.07770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variational-b-rep-model-analysis-for-direct-modeling-using-geometric-perturbation-1903.07770"/></url>
<url><loc>https://scifaro.com/en/abs/packing-disks-into-disks-with-optimal-worst-case-density-1903.07908</loc><lastmod>2019-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-disks-into-disks-with-optimal-worst-case-density-1903.07908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-disks-into-disks-with-optimal-worst-case-density-1903.07908"/></url>
<url><loc>https://scifaro.com/en/abs/upward-book-embeddings-of-st-graphs-1903.07966</loc><lastmod>2019-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-book-embeddings-of-st-graphs-1903.07966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-book-embeddings-of-st-graphs-1903.07966"/></url>
<url><loc>https://scifaro.com/en/abs/preprocessing-ambiguous-imprecise-points-1903.08280</loc><lastmod>2019-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preprocessing-ambiguous-imprecise-points-1903.08280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preprocessing-ambiguous-imprecise-points-1903.08280"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-geometric-data-structures-via-shallow-cuttings-1903.08387</loc><lastmod>2019-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-geometric-data-structures-via-shallow-cuttings-1903.08387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-geometric-data-structures-via-shallow-cuttings-1903.08387"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-planar-graphs-with-few-segments-on-a-polynomial-grid-1903.08496</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-few-segments-on-a-polynomial-grid-1903.08496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-planar-graphs-with-few-segments-on-a-polynomial-grid-1903.08496"/></url>
<url><loc>https://scifaro.com/en/abs/topological-data-analysis-in-information-space-1903.08510</loc><lastmod>2019-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-data-analysis-in-information-space-1903.08510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-data-analysis-in-information-space-1903.08510"/></url>
<url><loc>https://scifaro.com/en/abs/volumetric-untrimming-precise-decomposition-of-trimmed-trivariates-into-tensor-products-1903.08907</loc><lastmod>2019-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/volumetric-untrimming-precise-decomposition-of-trimmed-trivariates-into-tensor-products-1903.08907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/volumetric-untrimming-precise-decomposition-of-trimmed-trivariates-into-tensor-products-1903.08907"/></url>
<url><loc>https://scifaro.com/en/abs/rods-and-rings-soft-subdivision-planner-for-r-3-x-s-2-1903.09416</loc><lastmod>2019-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rods-and-rings-soft-subdivision-planner-for-r-3-x-s-2-1903.09416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rods-and-rings-soft-subdivision-planner-for-r-3-x-s-2-1903.09416"/></url>
<url><loc>https://scifaro.com/en/abs/a-weighted-approach-to-the-maximum-cardinality-bipartite-matching-problem-with-applications-in-geometric-settings-1903.10445</loc><lastmod>2019-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weighted-approach-to-the-maximum-cardinality-bipartite-matching-problem-with-applications-in-geometric-settings-1903.10445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weighted-approach-to-the-maximum-cardinality-bipartite-matching-problem-with-applications-in-geometric-settings-1903.10445"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-homology-of-semialgebraic-sets-ii-general-formulas-1903.10710</loc><lastmod>2021-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-homology-of-semialgebraic-sets-ii-general-formulas-1903.10710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-homology-of-semialgebraic-sets-ii-general-formulas-1903.10710"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-r-regular-objects-from-trinary-images-1903.10942</loc><lastmod>2019-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-r-regular-objects-from-trinary-images-1903.10942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-r-regular-objects-from-trinary-images-1903.10942"/></url>
<url><loc>https://scifaro.com/en/abs/maintaining-the-union-of-unit-discs-under-insertions-with-near-optimal-overhead-1903.10943</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maintaining-the-union-of-unit-discs-under-insertions-with-near-optimal-overhead-1903.10943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maintaining-the-union-of-unit-discs-under-insertions-with-near-optimal-overhead-1903.10943"/></url>
<url><loc>https://scifaro.com/en/abs/robust-nfp-generation-for-nesting-problems-1903.11139</loc><lastmod>2019-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-nfp-generation-for-nesting-problems-1903.11139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-nfp-generation-for-nesting-problems-1903.11139"/></url>
<url><loc>https://scifaro.com/en/abs/stability-analysis-of-kinetic-orientation-based-shape-descriptors-1903.11445</loc><lastmod>2019-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-analysis-of-kinetic-orientation-based-shape-descriptors-1903.11445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-analysis-of-kinetic-orientation-based-shape-descriptors-1903.11445"/></url>
<url><loc>https://scifaro.com/en/abs/parallelizable-global-conformal-parameterization-of-simply-connected-surfaces-via-partial-welding-1903.12359</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallelizable-global-conformal-parameterization-of-simply-connected-surfaces-via-partial-welding-1903.12359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallelizable-global-conformal-parameterization-of-simply-connected-surfaces-via-partial-welding-1903.12359"/></url>
<url><loc>https://scifaro.com/en/abs/ham-sandwich-cuts-and-center-transversals-in-subspaces-1903.12516</loc><lastmod>2019-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ham-sandwich-cuts-and-center-transversals-in-subspaces-1903.12516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ham-sandwich-cuts-and-center-transversals-in-subspaces-1903.12516"/></url>
<url><loc>https://scifaro.com/en/abs/on-limitations-of-the-witness-configuration-method-for-geometric-constraint-solving-in-cad-modeling-1904.00526</loc><lastmod>2019-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-limitations-of-the-witness-configuration-method-for-geometric-constraint-solving-in-cad-modeling-1904.00526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-limitations-of-the-witness-configuration-method-for-geometric-constraint-solving-in-cad-modeling-1904.00526"/></url>
<url><loc>https://scifaro.com/en/abs/internal-versus-external-balancing-in-the-evaluation-of-graph-based-number-types-1904.02034</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-versus-external-balancing-in-the-evaluation-of-graph-based-number-types-1904.02034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-versus-external-balancing-in-the-evaluation-of-graph-based-number-types-1904.02034"/></url>
<url><loc>https://scifaro.com/en/abs/linearly-converging-quasi-branch-and-bound-algorithms-for-global-rigid-registration-1904.02204</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearly-converging-quasi-branch-and-bound-algorithms-for-global-rigid-registration-1904.02204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearly-converging-quasi-branch-and-bound-algorithms-for-global-rigid-registration-1904.02204"/></url>
<url><loc>https://scifaro.com/en/abs/sharing-a-pizza-bisecting-masses-with-two-cuts-1904.02502</loc><lastmod>2019-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharing-a-pizza-bisecting-masses-with-two-cuts-1904.02502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharing-a-pizza-bisecting-masses-with-two-cuts-1904.02502"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-algorithm-for-the-limited-capacity-many-to-many-point-matching-in-one-dimension-1904.03015</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-algorithm-for-the-limited-capacity-many-to-many-point-matching-in-one-dimension-1904.03015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-algorithm-for-the-limited-capacity-many-to-many-point-matching-in-one-dimension-1904.03015"/></url>
<url><loc>https://scifaro.com/en/abs/towards-data-driven-multilinear-metro-maps-1904.03039</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-data-driven-multilinear-metro-maps-1904.03039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-data-driven-multilinear-metro-maps-1904.03039"/></url>
<url><loc>https://scifaro.com/en/abs/an-experimental-study-of-algorithms-for-geodesic-shortest-paths-in-the-constant-workspace-model-1904.03050</loc><lastmod>2019-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-experimental-study-of-algorithms-for-geodesic-shortest-paths-in-the-constant-workspace-model-1904.03050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-experimental-study-of-algorithms-for-geodesic-shortest-paths-in-the-constant-workspace-model-1904.03050"/></url>
<url><loc>https://scifaro.com/en/abs/near-linear-time-approximation-schemes-for-steiner-tree-and-forest-in-low-dimensional-spaces-1904.03611</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-linear-time-approximation-schemes-for-steiner-tree-and-forest-in-low-dimensional-spaces-1904.03611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-linear-time-approximation-schemes-for-steiner-tree-and-forest-in-low-dimensional-spaces-1904.03611"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-manifold-reconstruction-1904.03764</loc><lastmod>2019-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-manifold-reconstruction-1904.03764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-manifold-reconstruction-1904.03764"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-enclosing-ball-revisited-stability-and-sub-linear-time-algorithms-1904.03796</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-enclosing-ball-revisited-stability-and-sub-linear-time-algorithms-1904.03796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-enclosing-ball-revisited-stability-and-sub-linear-time-algorithms-1904.03796"/></url>
<url><loc>https://scifaro.com/en/abs/relative-perfectness-of-discrete-gradient-vector-fields-and-multi-parameter-persistent-homology-1904.05081</loc><lastmod>2021-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-perfectness-of-discrete-gradient-vector-fields-and-multi-parameter-persistent-homology-1904.05081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-perfectness-of-discrete-gradient-vector-fields-and-multi-parameter-persistent-homology-1904.05081"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-constructions-of-intrinsic-geometries-1904.05173</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-constructions-of-intrinsic-geometries-1904.05173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-constructions-of-intrinsic-geometries-1904.05173"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-many-to-many-matching-of-points-with-demands-in-one-dimension-1904.05184</loc><lastmod>2025-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-many-to-many-matching-of-points-with-demands-in-one-dimension-1904.05184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-many-to-many-matching-of-points-with-demands-in-one-dimension-1904.05184"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-hv-restricted-planar-graphs-1904.06760</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-hv-restricted-planar-graphs-1904.06760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-hv-restricted-planar-graphs-1904.06760"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-area-rectangular-and-square-annulus-problem-1904.06832</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-area-rectangular-and-square-annulus-problem-1904.06832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-area-rectangular-and-square-annulus-problem-1904.06832"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-minimum-width-cubic-and-hypercubic-shell-1904.06833</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-minimum-width-cubic-and-hypercubic-shell-1904.06833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-minimum-width-cubic-and-hypercubic-shell-1904.06833"/></url>
<url><loc>https://scifaro.com/en/abs/level-set-based-design-of-wang-tiles-for-modelling-complex-microstructures-1904.07657</loc><lastmod>2020-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/level-set-based-design-of-wang-tiles-for-modelling-complex-microstructures-1904.07657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/level-set-based-design-of-wang-tiles-for-modelling-complex-microstructures-1904.07657"/></url>
<url><loc>https://scifaro.com/en/abs/persistence-curves-a-canonical-framework-for-summarizing-persistence-diagrams-1904.07768</loc><lastmod>2021-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistence-curves-a-canonical-framework-for-summarizing-persistence-diagrams-1904.07768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistence-curves-a-canonical-framework-for-summarizing-persistence-diagrams-1904.07768"/></url>
<url><loc>https://scifaro.com/en/abs/on-conflict-free-chromatic-guarding-of-simple-polygons-1904.08624</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-conflict-free-chromatic-guarding-of-simple-polygons-1904.08624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-conflict-free-chromatic-guarding-of-simple-polygons-1904.08624"/></url>
<url><loc>https://scifaro.com/en/abs/advancing-through-terrains-1904.08746</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advancing-through-terrains-1904.08746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advancing-through-terrains-1904.08746"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-polynomial-partitioning-for-algebraic-curves-in-mathbb-r-3-with-applications-1904.09526</loc><lastmod>2026-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-polynomial-partitioning-for-algebraic-curves-in-mathbb-r-3-with-applications-1904.09526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-polynomial-partitioning-for-algebraic-curves-in-mathbb-r-3-with-applications-1904.09526"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-nearest-neighbor-query-and-clustering-of-planar-curves-1904.11026</loc><lastmod>2019-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-nearest-neighbor-query-and-clustering-of-planar-curves-1904.11026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-nearest-neighbor-query-and-clustering-of-planar-curves-1904.11026"/></url>
<url><loc>https://scifaro.com/en/abs/counting-the-number-of-crossings-in-geometric-graphs-1904.11037</loc><lastmod>2020-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-the-number-of-crossings-in-geometric-graphs-1904.11037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-the-number-of-crossings-in-geometric-graphs-1904.11037"/></url>
<url><loc>https://scifaro.com/en/abs/finding-hexahedrizations-for-small-quadrangulations-of-the-sphere-1904.11229</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-hexahedrizations-for-small-quadrangulations-of-the-sphere-1904.11229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-hexahedrizations-for-small-quadrangulations-of-the-sphere-1904.11229"/></url>
<url><loc>https://scifaro.com/en/abs/truly-optimal-euclidean-spanners-1904.12042</loc><lastmod>2021-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-optimal-euclidean-spanners-1904.12042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-optimal-euclidean-spanners-1904.12042"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-support-removal-for-additive-manufacturing-post-processing-1904.12117</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-support-removal-for-additive-manufacturing-post-processing-1904.12117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-support-removal-for-additive-manufacturing-post-processing-1904.12117"/></url>
<url><loc>https://scifaro.com/en/abs/guarantees-on-nearest-neighbor-condensation-heuristics-1904.12142</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarantees-on-nearest-neighbor-condensation-heuristics-1904.12142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarantees-on-nearest-neighbor-condensation-heuristics-1904.12142"/></url>
<url><loc>https://scifaro.com/en/abs/learning-metrics-for-persistence-based-summaries-and-applications-for-graph-classification-1904.12189</loc><lastmod>2019-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-metrics-for-persistence-based-summaries-and-applications-for-graph-classification-1904.12189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-metrics-for-persistence-based-summaries-and-applications-for-graph-classification-1904.12189"/></url>
<url><loc>https://scifaro.com/en/abs/the-graphs-behind-reuleaux-polyhedra-1904.12761</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-graphs-behind-reuleaux-polyhedra-1904.12761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-graphs-behind-reuleaux-polyhedra-1904.12761"/></url>
<url><loc>https://scifaro.com/en/abs/a-classification-of-topological-discrepancies-in-additive-manufacturing-1904.13210</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-classification-of-topological-discrepancies-in-additive-manufacturing-1904.13210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-classification-of-topological-discrepancies-in-additive-manufacturing-1904.13210"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-orthogonal-segment-stabbing-1904.13369</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-orthogonal-segment-stabbing-1904.13369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-orthogonal-segment-stabbing-1904.13369"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithms-for-the-bichromatic-two-center-problem-for-pairs-of-points-1905.00157</loc><lastmod>2019-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithms-for-the-bichromatic-two-center-problem-for-pairs-of-points-1905.00157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithms-for-the-bichromatic-two-center-problem-for-pairs-of-points-1905.00157"/></url>
<url><loc>https://scifaro.com/en/abs/pseudo-triangle-visibility-graph-characterization-and-reconstruction-1905.00727</loc><lastmod>2019-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pseudo-triangle-visibility-graph-characterization-and-reconstruction-1905.00727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pseudo-triangle-visibility-graph-characterization-and-reconstruction-1905.00727"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-ply-covering-of-points-with-disks-and-squares-1905.00790</loc><lastmod>2019-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-ply-covering-of-points-with-disks-and-squares-1905.00790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-ply-covering-of-points-with-disks-and-squares-1905.00790"/></url>
<url><loc>https://scifaro.com/en/abs/flip-distance-to-some-plane-configurations-1905.00791</loc><lastmod>2019-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-distance-to-some-plane-configurations-1905.00791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-distance-to-some-plane-configurations-1905.00791"/></url>
<url><loc>https://scifaro.com/en/abs/range-closest-pair-search-in-higher-dimensions-1905.01029</loc><lastmod>2019-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-closest-pair-search-in-higher-dimensions-1905.01029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-closest-pair-search-in-higher-dimensions-1905.01029"/></url>
<url><loc>https://scifaro.com/en/abs/most-vital-segment-barriers-1905.01185</loc><lastmod>2019-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/most-vital-segment-barriers-1905.01185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/most-vital-segment-barriers-1905.01185"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-firefighting-in-the-half-plane-1905.02067</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-firefighting-in-the-half-plane-1905.02067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-firefighting-in-the-half-plane-1905.02067"/></url>
<url><loc>https://scifaro.com/en/abs/hlo-half-kernel-laplacian-operator-for-surface-smoothing-1905.04678</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hlo-half-kernel-laplacian-operator-for-surface-smoothing-1905.04678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hlo-half-kernel-laplacian-operator-for-surface-smoothing-1905.04678"/></url>
<url><loc>https://scifaro.com/en/abs/color-spanning-localized-query-1905.05066</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/color-spanning-localized-query-1905.05066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/color-spanning-localized-query-1905.05066"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-algorithm-for-volume-estimation-based-on-billiard-trajectories-and-simulated-annealing-1905.05494</loc><lastmod>2023-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-algorithm-for-volume-estimation-based-on-billiard-trajectories-and-simulated-annealing-1905.05494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-algorithm-for-volume-estimation-based-on-billiard-trajectories-and-simulated-annealing-1905.05494"/></url>
<url><loc>https://scifaro.com/en/abs/variations-of-largest-rectangle-recognition-amidst-a-bichromatic-point-set-1905.07124</loc><lastmod>2019-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variations-of-largest-rectangle-recognition-amidst-a-bichromatic-point-set-1905.07124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variations-of-largest-rectangle-recognition-amidst-a-bichromatic-point-set-1905.07124"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-diagram-of-orthogonal-polyhedra-in-two-and-three-dimensions-1905.08691</loc><lastmod>2019-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagram-of-orthogonal-polyhedra-in-two-and-three-dimensions-1905.08691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagram-of-orthogonal-polyhedra-in-two-and-three-dimensions-1905.08691"/></url>
<url><loc>https://scifaro.com/en/abs/coarse-quad-layouts-through-robust-simplification-of-cross-field-separatrix-partitions-1905.09097</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coarse-quad-layouts-through-robust-simplification-of-cross-field-separatrix-partitions-1905.09097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coarse-quad-layouts-through-robust-simplification-of-cross-field-separatrix-partitions-1905.09097"/></url>
<url><loc>https://scifaro.com/en/abs/automated-process-planning-for-turning-a-feature-free-approach-1905.09434</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-process-planning-for-turning-a-feature-free-approach-1905.09434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-process-planning-for-turning-a-feature-free-approach-1905.09434"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-and-geometric-aspects-of-data-depth-with-focus-on-beta-skeleton-depth-1905.10716</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-and-geometric-aspects-of-data-depth-with-focus-on-beta-skeleton-depth-1905.10716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-and-geometric-aspects-of-data-depth-with-focus-on-beta-skeleton-depth-1905.10716"/></url>
<url><loc>https://scifaro.com/en/abs/the-largest-contained-quadrilateral-and-the-smallest-enclosing-parallelogram-of-a-convex-polygon-1905.11203</loc><lastmod>2019-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-largest-contained-quadrilateral-and-the-smallest-enclosing-parallelogram-of-a-convex-polygon-1905.11203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-largest-contained-quadrilateral-and-the-smallest-enclosing-parallelogram-of-a-convex-polygon-1905.11203"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-detects-curvature-1905.13196</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-detects-curvature-1905.13196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-detects-curvature-1905.13196"/></url>
<url><loc>https://scifaro.com/en/abs/largest-inscribed-rectangles-in-geometric-convex-sets-1905.13246</loc><lastmod>2022-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/largest-inscribed-rectangles-in-geometric-convex-sets-1905.13246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/largest-inscribed-rectangles-in-geometric-convex-sets-1905.13246"/></url>
<url><loc>https://scifaro.com/en/abs/on-problems-related-to-crossing-families-1906.00191</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-problems-related-to-crossing-families-1906.00191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-problems-related-to-crossing-families-1906.00191"/></url>
<url><loc>https://scifaro.com/en/abs/a-library-to-compute-the-density-of-the-distance-between-a-point-and-a-random-variable-uniformly-distributed-in-some-sets-1906.00958</loc><lastmod>2019-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-library-to-compute-the-density-of-the-distance-between-a-point-and-a-random-variable-uniformly-distributed-in-some-sets-1906.00958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-library-to-compute-the-density-of-the-distance-between-a-point-and-a-random-variable-uniformly-distributed-in-some-sets-1906.00958"/></url>
<url><loc>https://scifaro.com/en/abs/on-romeo-and-juliet-problems-minimizing-distance-to-sight-1906.01114</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-romeo-and-juliet-problems-minimizing-distance-to-sight-1906.01114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-romeo-and-juliet-problems-minimizing-distance-to-sight-1906.01114"/></url>
<url><loc>https://scifaro.com/en/abs/crossfill-foam-structures-with-graded-density-for-continuous-material-extrusion-1906.03027</loc><lastmod>2019-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossfill-foam-structures-with-graded-density-for-continuous-material-extrusion-1906.03027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossfill-foam-structures-with-graded-density-for-continuous-material-extrusion-1906.03027"/></url>
<url><loc>https://scifaro.com/en/abs/bipartite-and-series-parallel-graphs-without-planar-lombardi-drawings-1906.04401</loc><lastmod>2021-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipartite-and-series-parallel-graphs-without-planar-lombardi-drawings-1906.04401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipartite-and-series-parallel-graphs-without-planar-lombardi-drawings-1906.04401"/></url>
<url><loc>https://scifaro.com/en/abs/multi-level-tree-based-approach-for-interactive-graph-visualization-with-semantic-zoom-1906.05996</loc><lastmod>2019-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-level-tree-based-approach-for-interactive-graph-visualization-with-semantic-zoom-1906.05996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-level-tree-based-approach-for-interactive-graph-visualization-with-semantic-zoom-1906.05996"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-comparison-of-time-dependent-treemaps-1906.06014</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-comparison-of-time-dependent-treemaps-1906.06014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-comparison-of-time-dependent-treemaps-1906.06014"/></url>
<url><loc>https://scifaro.com/en/abs/topological-data-analysis-with-epsilon-net-induced-lazy-witness-complex-1906.06122</loc><lastmod>2019-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-data-analysis-with-epsilon-net-induced-lazy-witness-complex-1906.06122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-data-analysis-with-epsilon-net-induced-lazy-witness-complex-1906.06122"/></url>
<url><loc>https://scifaro.com/en/abs/soft-subdivision-motion-planning-for-complex-planar-robots-1906.06154</loc><lastmod>2019-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soft-subdivision-motion-planning-for-complex-planar-robots-1906.06154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soft-subdivision-motion-planning-for-complex-planar-robots-1906.06154"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-order-diagrams-through-two-dimension-extension-1906.06208</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-order-diagrams-through-two-dimension-extension-1906.06208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-order-diagrams-through-two-dimension-extension-1906.06208"/></url>
<url><loc>https://scifaro.com/en/abs/correspondence-free-region-localization-for-partial-shape-similarity-via-hamiltonian-spectrum-alignment-1906.06226</loc><lastmod>2019-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correspondence-free-region-localization-for-partial-shape-similarity-via-hamiltonian-spectrum-alignment-1906.06226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correspondence-free-region-localization-for-partial-shape-similarity-via-hamiltonian-spectrum-alignment-1906.06226"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-sequences-of-lattices-1906.07158</loc><lastmod>2019-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-sequences-of-lattices-1906.07158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-sequences-of-lattices-1906.07158"/></url>
<url><loc>https://scifaro.com/en/abs/existence-of-a-convex-polyhedron-with-respect-to-the-given-radii-1906.07919</loc><lastmod>2025-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existence-of-a-convex-polyhedron-with-respect-to-the-given-radii-1906.07919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existence-of-a-convex-polyhedron-with-respect-to-the-given-radii-1906.07919"/></url>
<url><loc>https://scifaro.com/en/abs/rock-climber-distance-frogs-versus-dogs-1906.08141</loc><lastmod>2019-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rock-climber-distance-frogs-versus-dogs-1906.08141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rock-climber-distance-frogs-versus-dogs-1906.08141"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-support-method-for-information-inconsistency-resolution-in-direct-modeling-of-cad-models-1906.08433</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-support-method-for-information-inconsistency-resolution-in-direct-modeling-of-cad-models-1906.08433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-support-method-for-information-inconsistency-resolution-in-direct-modeling-of-cad-models-1906.08433"/></url>
<url><loc>https://scifaro.com/en/abs/a-robust-direct-modeling-method-for-quadric-b-rep-models-based-on-geometry-topology-inconsistency-tracking-1906.08455</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-robust-direct-modeling-method-for-quadric-b-rep-models-based-on-geometry-topology-inconsistency-tracking-1906.08455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-robust-direct-modeling-method-for-quadric-b-rep-models-based-on-geometry-topology-inconsistency-tracking-1906.08455"/></url>
<url><loc>https://scifaro.com/en/abs/n-vdd-location-privacy-protection-based-on-voronoi-delaunay-duality-1906.09158</loc><lastmod>2019-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/n-vdd-location-privacy-protection-based-on-voronoi-delaunay-duality-1906.09158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/n-vdd-location-privacy-protection-based-on-voronoi-delaunay-duality-1906.09158"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-stretch-factor-of-polygonal-chains-1906.10217</loc><lastmod>2023-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-polygonal-chains-1906.10217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-stretch-factor-of-polygonal-chains-1906.10217"/></url>
<url><loc>https://scifaro.com/en/abs/structural-design-using-laplacian-shells-1906.10669</loc><lastmod>2019-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-design-using-laplacian-shells-1906.10669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-design-using-laplacian-shells-1906.10669"/></url>
<url><loc>https://scifaro.com/en/abs/packing-boundary-anchored-rectangles-and-squares-1906.11948</loc><lastmod>2019-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-boundary-anchored-rectangles-and-squares-1906.11948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-boundary-anchored-rectangles-and-squares-1906.11948"/></url>
<url><loc>https://scifaro.com/en/abs/mgos-a-library-for-molecular-geometry-and-its-operating-system-1906.12141</loc><lastmod>2019-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mgos-a-library-for-molecular-geometry-and-its-operating-system-1906.12141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mgos-a-library-for-molecular-geometry-and-its-operating-system-1906.12141"/></url>
<url><loc>https://scifaro.com/en/abs/quadrilateral-mesh-generation-ii-meromorphic-quartic-differentials-and-abel-jacobi-condition-1907.00216</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadrilateral-mesh-generation-ii-meromorphic-quartic-differentials-and-abel-jacobi-condition-1907.00216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadrilateral-mesh-generation-ii-meromorphic-quartic-differentials-and-abel-jacobi-condition-1907.00216"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-feasible-design-spaces-for-heterogeneous-constraints-1907.01117</loc><lastmod>2019-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-feasible-design-spaces-for-heterogeneous-constraints-1907.01117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-feasible-design-spaces-for-heterogeneous-constraints-1907.01117"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-vertex-guarding-a-wv-polygon-1907.01228</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-vertex-guarding-a-wv-polygon-1907.01228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-vertex-guarding-a-wv-polygon-1907.01228"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-vc-dimension-of-half-spaces-with-respect-to-convex-sets-1907.01241</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-vc-dimension-of-half-spaces-with-respect-to-convex-sets-1907.01241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-vc-dimension-of-half-spaces-with-respect-to-convex-sets-1907.01241"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-crossing-minimization-a-scalable-randomized-approach-1907.01243</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-crossing-minimization-a-scalable-randomized-approach-1907.01243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-crossing-minimization-a-scalable-randomized-approach-1907.01243"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-proof-of-the-toughness-of-delaunay-triangulations-1907.01617</loc><lastmod>2019-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-proof-of-the-toughness-of-delaunay-triangulations-1907.01617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-proof-of-the-toughness-of-delaunay-triangulations-1907.01617"/></url>
<url><loc>https://scifaro.com/en/abs/triangles-and-girth-in-disk-graphs-and-transmission-graphs-1907.01980</loc><lastmod>2019-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triangles-and-girth-in-disk-graphs-and-transmission-graphs-1907.01980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triangles-and-girth-in-disk-graphs-and-transmission-graphs-1907.01980"/></url>
<url><loc>https://scifaro.com/en/abs/sketched-mindist-1907.02171</loc><lastmod>2019-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sketched-mindist-1907.02171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sketched-mindist-1907.02171"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-micro-tiles-in-micro-structures-as-a-design-paradigm-1907.02245</loc><lastmod>2019-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-micro-tiles-in-micro-structures-as-a-design-paradigm-1907.02245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-micro-tiles-in-micro-structures-as-a-design-paradigm-1907.02245"/></url>
<url><loc>https://scifaro.com/en/abs/no-dimensional-tverberg-theorems-and-algorithms-1907.04284</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-dimensional-tverberg-theorems-and-algorithms-1907.04284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-dimensional-tverberg-theorems-and-algorithms-1907.04284"/></url>
<url><loc>https://scifaro.com/en/abs/sublinear-data-structures-for-short-fr-echet-queries-1907.04420</loc><lastmod>2019-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sublinear-data-structures-for-short-fr-echet-queries-1907.04420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sublinear-data-structures-for-short-fr-echet-queries-1907.04420"/></url>
<url><loc>https://scifaro.com/en/abs/a-near-linear-time-approximation-scheme-for-geometric-transportation-with-arbitrary-supplies-and-spread-1907.04426</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-near-linear-time-approximation-scheme-for-geometric-transportation-with-arbitrary-supplies-and-spread-1907.04426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-near-linear-time-approximation-scheme-for-geometric-transportation-with-arbitrary-supplies-and-spread-1907.04426"/></url>
<url><loc>https://scifaro.com/en/abs/smoothed-analysis-of-order-types-1907.04645</loc><lastmod>2019-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smoothed-analysis-of-order-types-1907.04645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smoothed-analysis-of-order-types-1907.04645"/></url>
<url><loc>https://scifaro.com/en/abs/computing-minimal-persistent-cycles-polynomial-and-hard-cases-1907.04889</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-minimal-persistent-cycles-polynomial-and-hard-cases-1907.04889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-minimal-persistent-cycles-polynomial-and-hard-cases-1907.04889"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-stick-graphs-with-and-without-length-constraints-1907.05257</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-stick-graphs-with-and-without-length-constraints-1907.05257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-stick-graphs-with-and-without-length-constraints-1907.05257"/></url>
<url><loc>https://scifaro.com/en/abs/simplification-of-polyline-bundles-1907.05296</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplification-of-polyline-bundles-1907.05296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplification-of-polyline-bundles-1907.05296"/></url>
<url><loc>https://scifaro.com/en/abs/on-linear-regression-in-three-dimensional-euclidean-space-1907.06009</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-linear-regression-in-three-dimensional-euclidean-space-1907.06009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-linear-regression-in-three-dimensional-euclidean-space-1907.06009"/></url>
<url><loc>https://scifaro.com/en/abs/noise-stable-rigid-graphs-for-euclidean-embedding-1907.06441</loc><lastmod>2022-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noise-stable-rigid-graphs-for-euclidean-embedding-1907.06441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noise-stable-rigid-graphs-for-euclidean-embedding-1907.06441"/></url>
<url><loc>https://scifaro.com/en/abs/on-circles-enclosing-many-points-1907.06601</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-circles-enclosing-many-points-1907.06601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-circles-enclosing-many-points-1907.06601"/></url>
<url><loc>https://scifaro.com/en/abs/full-tilt-universal-constructors-for-general-shapes-with-uniform-external-forces-1907.06741</loc><lastmod>2019-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-tilt-universal-constructors-for-general-shapes-with-uniform-external-forces-1907.06741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-tilt-universal-constructors-for-general-shapes-with-uniform-external-forces-1907.06741"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-rectilinear-convex-subsets-1907.07441</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-rectilinear-convex-subsets-1907.07441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-rectilinear-convex-subsets-1907.07441"/></url>
<url><loc>https://scifaro.com/en/abs/on-arrangements-of-orthogonal-circles-1907.08121</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-arrangements-of-orthogonal-circles-1907.08121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-arrangements-of-orthogonal-circles-1907.08121"/></url>
<url><loc>https://scifaro.com/en/abs/some-polycubes-have-no-edge-zipper-unfolding-1907.08433</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-polycubes-have-no-edge-zipper-unfolding-1907.08433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-polycubes-have-no-edge-zipper-unfolding-1907.08433"/></url>
<url><loc>https://scifaro.com/en/abs/real-time-deformation-of-soft-tissue-internal-structure-with-surface-profile-variations-using-particle-system-1907.10707</loc><lastmod>2019-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-time-deformation-of-soft-tissue-internal-structure-with-surface-profile-variations-using-particle-system-1907.10707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-time-deformation-of-soft-tissue-internal-structure-with-surface-profile-variations-using-particle-system-1907.10707"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-approach-extra-vertex-and-generalization-of-shoelace-algorithm-usage-in-convex-polygon-point-in-polygon-1907.11015</loc><lastmod>2019-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-approach-extra-vertex-and-generalization-of-shoelace-algorithm-usage-in-convex-polygon-point-in-polygon-1907.11015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-approach-extra-vertex-and-generalization-of-shoelace-algorithm-usage-in-convex-polygon-point-in-polygon-1907.11015"/></url>
<url><loc>https://scifaro.com/en/abs/packing-rotating-segments-1907.12758</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-rotating-segments-1907.12758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-rotating-segments-1907.12758"/></url>
<url><loc>https://scifaro.com/en/abs/atomic-embeddability-clustered-planarity-and-thickenability-1907.13086</loc><lastmod>2019-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/atomic-embeddability-clustered-planarity-and-thickenability-1907.13086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/atomic-embeddability-clustered-planarity-and-thickenability-1907.13086"/></url>
<url><loc>https://scifaro.com/en/abs/intrinsic-interleaving-distance-for-merge-trees-1908.00063</loc><lastmod>2022-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intrinsic-interleaving-distance-for-merge-trees-1908.00063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intrinsic-interleaving-distance-for-merge-trees-1908.00063"/></url>
<url><loc>https://scifaro.com/en/abs/a-structural-average-of-labeled-merge-trees-for-uncertainty-visualization-1908.00113</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-structural-average-of-labeled-merge-trees-for-uncertainty-visualization-1908.00113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-structural-average-of-labeled-merge-trees-for-uncertainty-visualization-1908.00113"/></url>
<url><loc>https://scifaro.com/en/abs/a-true-o-n-log-n-algorithm-for-the-all-k-nearest-neighbors-problem-1908.00159</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-true-o-n-log-n-algorithm-for-the-all-k-nearest-neighbors-problem-1908.00159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-true-o-n-log-n-algorithm-for-the-all-k-nearest-neighbors-problem-1908.00159"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-and-generation-of-a-new-graph-planarity-game-1908.01426</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-and-generation-of-a-new-graph-planarity-game-1908.01426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-and-generation-of-a-new-graph-planarity-game-1908.01426"/></url>
<url><loc>https://scifaro.com/en/abs/proof-of-correctness-and-time-complexity-analysis-of-a-maximum-distance-transform-algorithm-1908.01662</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-of-correctness-and-time-complexity-analysis-of-a-maximum-distance-transform-algorithm-1908.01662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-of-correctness-and-time-complexity-analysis-of-a-maximum-distance-transform-algorithm-1908.01662"/></url>
<url><loc>https://scifaro.com/en/abs/stress-plus-x-spx-graph-layout-1908.01769</loc><lastmod>2019-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stress-plus-x-spx-graph-layout-1908.01769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stress-plus-x-spx-graph-layout-1908.01769"/></url>
<url><loc>https://scifaro.com/en/abs/a-universality-theorem-for-nested-polytopes-1908.02213</loc><lastmod>2019-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universality-theorem-for-nested-polytopes-1908.02213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universality-theorem-for-nested-polytopes-1908.02213"/></url>
<url><loc>https://scifaro.com/en/abs/on-cylindrical-regression-in-three-dimensional-euclidean-space-1908.02215</loc><lastmod>2019-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cylindrical-regression-in-three-dimensional-euclidean-space-1908.02215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cylindrical-regression-in-three-dimensional-euclidean-space-1908.02215"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-1908.03153</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-1908.03153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-1908.03153"/></url>
<url><loc>https://scifaro.com/en/abs/link-crossing-number-is-np-hard-1908.04073</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/link-crossing-number-is-np-hard-1908.04073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/link-crossing-number-is-np-hard-1908.04073"/></url>
<url><loc>https://scifaro.com/en/abs/sketched-representations-and-orthogonal-planarity-of-bounded-treewidth-graphs-1908.05015</loc><lastmod>2019-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sketched-representations-and-orthogonal-planarity-of-bounded-treewidth-graphs-1908.05015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sketched-representations-and-orthogonal-planarity-of-bounded-treewidth-graphs-1908.05015"/></url>
<url><loc>https://scifaro.com/en/abs/on-strict-outer-confluent-graphs-1908.05345</loc><lastmod>2019-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-strict-outer-confluent-graphs-1908.05345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-strict-outer-confluent-graphs-1908.05345"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-height-grid-major-height-and-graph-drawing-height-1908.05706</loc><lastmod>2019-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-height-grid-major-height-and-graph-drawing-height-1908.05706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-height-grid-major-height-and-graph-drawing-height-1908.05706"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-computation-of-alpha-complex-for-biomolecules-1908.05944</loc><lastmod>2020-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-computation-of-alpha-complex-for-biomolecules-1908.05944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-computation-of-alpha-complex-for-biomolecules-1908.05944"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-2-colored-crossing-number-1908.06461</loc><lastmod>2019-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-2-colored-crossing-number-1908.06461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-2-colored-crossing-number-1908.06461"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-large-total-angular-resolution-1908.06504</loc><lastmod>2022-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-large-total-angular-resolution-1908.06504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-large-total-angular-resolution-1908.06504"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-gaussian-curvature-derivative-of-a-space-filling-diagram-1908.06777</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-gaussian-curvature-derivative-of-a-space-filling-diagram-1908.06777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-gaussian-curvature-derivative-of-a-space-filling-diagram-1908.06777"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-mean-curvature-derivative-of-a-space-filling-diagram-1908.06779</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-mean-curvature-derivative-of-a-space-filling-diagram-1908.06779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-mean-curvature-derivative-of-a-space-filling-diagram-1908.06779"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-polyhedra-1908.07152</loc><lastmod>2019-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-polyhedra-1908.07152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-polyhedra-1908.07152"/></url>
<url><loc>https://scifaro.com/en/abs/studying-wythoff-and-zometool-constructions-using-maple-1908.07153</loc><lastmod>2021-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/studying-wythoff-and-zometool-constructions-using-maple-1908.07153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/studying-wythoff-and-zometool-constructions-using-maple-1908.07153"/></url>
<url><loc>https://scifaro.com/en/abs/computing-stable-demers-cartograms-1908.07291</loc><lastmod>2019-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-stable-demers-cartograms-1908.07291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-stable-demers-cartograms-1908.07291"/></url>
<url><loc>https://scifaro.com/en/abs/new-efficient-flat-back-3d-gadgets-in-origami-extrusions-compatible-with-the-conventional-pyramid-supported-3d-gadgets-1908.07342</loc><lastmod>2020-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-efficient-flat-back-3d-gadgets-in-origami-extrusions-compatible-with-the-conventional-pyramid-supported-3d-gadgets-1908.07342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-efficient-flat-back-3d-gadgets-in-origami-extrusions-compatible-with-the-conventional-pyramid-supported-3d-gadgets-1908.07342"/></url>
<url><loc>https://scifaro.com/en/abs/node-overlap-removal-algorithms-a-comparative-study-1908.07363</loc><lastmod>2019-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/node-overlap-removal-algorithms-a-comparative-study-1908.07363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/node-overlap-removal-algorithms-a-comparative-study-1908.07363"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-toolpath-planning-in-additive-manufacturing-1908.07452</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-toolpath-planning-in-additive-manufacturing-1908.07452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-toolpath-planning-in-additive-manufacturing-1908.07452"/></url>
<url><loc>https://scifaro.com/en/abs/line-and-plane-cover-numbers-revisited-1908.07647</loc><lastmod>2019-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-and-plane-cover-numbers-revisited-1908.07647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-and-plane-cover-numbers-revisited-1908.07647"/></url>
<url><loc>https://scifaro.com/en/abs/existence-and-hardness-of-conveyor-belts-1908.07668</loc><lastmod>2020-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existence-and-hardness-of-conveyor-belts-1908.07668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existence-and-hardness-of-conveyor-belts-1908.07668"/></url>
<url><loc>https://scifaro.com/en/abs/universal-reconfiguration-of-facet-connected-modular-robots-by-pivots-the-o-1-musketeers-1908.07880</loc><lastmod>2019-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-reconfiguration-of-facet-connected-modular-robots-by-pivots-the-o-1-musketeers-1908.07880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-reconfiguration-of-facet-connected-modular-robots-by-pivots-the-o-1-musketeers-1908.07880"/></url>
<url><loc>https://scifaro.com/en/abs/extending-simple-drawings-1908.08129</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-simple-drawings-1908.08129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-simple-drawings-1908.08129"/></url>
<url><loc>https://scifaro.com/en/abs/representing-graphs-and-hypergraphs-by-touching-polygons-in-3d-1908.08273</loc><lastmod>2020-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-graphs-and-hypergraphs-by-touching-polygons-in-3d-1908.08273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-graphs-and-hypergraphs-by-touching-polygons-in-3d-1908.08273"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-morphs-of-planar-orthogonal-drawings-ii-1908.08365</loc><lastmod>2019-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-morphs-of-planar-orthogonal-drawings-ii-1908.08365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-morphs-of-planar-orthogonal-drawings-ii-1908.08365"/></url>
<url><loc>https://scifaro.com/en/abs/variants-of-the-segment-number-of-a-graph-1908.08871</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variants-of-the-segment-number-of-a-graph-1908.08871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variants-of-the-segment-number-of-a-graph-1908.08871"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs-1908.08905</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs-1908.08905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-ink-in-partial-edge-drawings-of-k-plane-graphs-1908.08905"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistent-surface-registration-via-optimization-of-mapping-distortions-1908.09098</loc><lastmod>2020-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistent-surface-registration-via-optimization-of-mapping-distortions-1908.09098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistent-surface-registration-via-optimization-of-mapping-distortions-1908.09098"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-curve-straightening-is-exists-mathbb-r-complete-1908.09400</loc><lastmod>2019-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-curve-straightening-is-exists-mathbb-r-complete-1908.09400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-curve-straightening-is-exists-mathbb-r-complete-1908.09400"/></url>
<url><loc>https://scifaro.com/en/abs/planar-p-center-problems-are-solvable-in-polynomial-time-when-clustering-a-pareto-front-1908.09648</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-p-center-problems-are-solvable-in-polynomial-time-when-clustering-a-pareto-front-1908.09648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-p-center-problems-are-solvable-in-polynomial-time-when-clustering-a-pareto-front-1908.09648"/></url>
<url><loc>https://scifaro.com/en/abs/a-time-space-trade-off-for-computing-the-geodesic-center-of-a-simple-polygon-1908.11260</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-time-space-trade-off-for-computing-the-geodesic-center-of-a-simple-polygon-1908.11260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-time-space-trade-off-for-computing-the-geodesic-center-of-a-simple-polygon-1908.11260"/></url>
<url><loc>https://scifaro.com/en/abs/simple-k-planar-graphs-are-simple-k-1-quasiplanar-1909.00223</loc><lastmod>2020-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-k-planar-graphs-are-simple-k-1-quasiplanar-1909.00223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-k-planar-graphs-are-simple-k-1-quasiplanar-1909.00223"/></url>
<url><loc>https://scifaro.com/en/abs/homotopic-curve-shortening-and-the-affine-curve-shortening-flow-1909.00263</loc><lastmod>2022-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopic-curve-shortening-and-the-affine-curve-shortening-flow-1909.00263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopic-curve-shortening-and-the-affine-curve-shortening-flow-1909.00263"/></url>
<url><loc>https://scifaro.com/en/abs/disks-in-curves-of-bounded-convex-curvature-1909.00852</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disks-in-curves-of-bounded-convex-curvature-1909.00852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disks-in-curves-of-bounded-convex-curvature-1909.00852"/></url>
<url><loc>https://scifaro.com/en/abs/propagate-and-pair-a-single-pass-approach-to-critical-point-pairing-in-reeb-graphs-1909.01513</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propagate-and-pair-a-single-pass-approach-to-critical-point-pairing-in-reeb-graphs-1909.01513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propagate-and-pair-a-single-pass-approach-to-critical-point-pairing-in-reeb-graphs-1909.01513"/></url>
<url><loc>https://scifaro.com/en/abs/material-characterization-and-precise-finite-element-analysis-of-fiber-reinforced-thermoplastic-composites-for-4d-printing-1909.02083</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/material-characterization-and-precise-finite-element-analysis-of-fiber-reinforced-thermoplastic-composites-for-4d-printing-1909.02083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/material-characterization-and-precise-finite-element-analysis-of-fiber-reinforced-thermoplastic-composites-for-4d-printing-1909.02083"/></url>
<url><loc>https://scifaro.com/en/abs/connected-assembly-and-reconfiguration-by-finite-automata-1909.03880</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connected-assembly-and-reconfiguration-by-finite-automata-1909.03880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connected-assembly-and-reconfiguration-by-finite-automata-1909.03880"/></url>
<url><loc>https://scifaro.com/en/abs/bisecting-three-classes-of-lines-1909.04419</loc><lastmod>2019-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisecting-three-classes-of-lines-1909.04419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisecting-three-classes-of-lines-1909.04419"/></url>
<url><loc>https://scifaro.com/en/abs/optimized-synthesis-of-snapping-fixtures-1909.05953</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimized-synthesis-of-snapping-fixtures-1909.05953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimized-synthesis-of-snapping-fixtures-1909.05953"/></url>
<url><loc>https://scifaro.com/en/abs/linear-size-planar-manhattan-network-for-convex-point-sets-1909.06457</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-size-planar-manhattan-network-for-convex-point-sets-1909.06457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-size-planar-manhattan-network-for-convex-point-sets-1909.06457"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-on-the-surface-of-the-hyper-sphere-1909.06463</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-on-the-surface-of-the-hyper-sphere-1909.06463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-on-the-surface-of-the-hyper-sphere-1909.06463"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-27th-international-symposium-on-graph-drawing-and-network-visualization-gd-2019-1909.07013</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-27th-international-symposium-on-graph-drawing-and-network-visualization-gd-2019-1909.07013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-27th-international-symposium-on-graph-drawing-and-network-visualization-gd-2019-1909.07013"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-morph-a-tree-on-a-small-grid-1909.07093</loc><lastmod>2019-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-morph-a-tree-on-a-small-grid-1909.07093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-morph-a-tree-on-a-small-grid-1909.07093"/></url>
<url><loc>https://scifaro.com/en/abs/inserting-one-edge-into-a-simple-drawing-is-hard-1909.07347</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inserting-one-edge-into-a-simple-drawing-is-hard-1909.07347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inserting-one-edge-into-a-simple-drawing-is-hard-1909.07347"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-minimal-art-galleries-1909.09043</loc><lastmod>2019-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-minimal-art-galleries-1909.09043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-minimal-art-galleries-1909.09043"/></url>
<url><loc>https://scifaro.com/en/abs/structured-discrete-shape-approximation-theoretical-complexity-and-practical-algorithm-1909.09217</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-discrete-shape-approximation-theoretical-complexity-and-practical-algorithm-1909.09217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-discrete-shape-approximation-theoretical-complexity-and-practical-algorithm-1909.09217"/></url>
<url><loc>https://scifaro.com/en/abs/corrigendum-to-linear-time-algorithm-to-cover-and-hit-a-set-of-line-segments-optimally-by-two-axis-parallel-squares-theoretical-computer-science-769-2019-63-74-1909.09445</loc><lastmod>2019-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/corrigendum-to-linear-time-algorithm-to-cover-and-hit-a-set-of-line-segments-optimally-by-two-axis-parallel-squares-theoretical-computer-science-769-2019-63-74-1909.09445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/corrigendum-to-linear-time-algorithm-to-cover-and-hit-a-set-of-line-segments-optimally-by-two-axis-parallel-squares-theoretical-computer-science-769-2019-63-74-1909.09445"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-estimation-of-the-modified-gromov-hausdorff-distance-between-unweighted-graphs-1909.09772</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-estimation-of-the-modified-gromov-hausdorff-distance-between-unweighted-graphs-1909.09772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-estimation-of-the-modified-gromov-hausdorff-distance-between-unweighted-graphs-1909.09772"/></url>
<url><loc>https://scifaro.com/en/abs/local-routing-in-sparse-and-lightweight-geometric-graphs-1909.10215</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-routing-in-sparse-and-lightweight-geometric-graphs-1909.10215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-routing-in-sparse-and-lightweight-geometric-graphs-1909.10215"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-edge-length-ratio-of-2-trees-1909.11152</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-edge-length-ratio-of-2-trees-1909.11152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-edge-length-ratio-of-2-trees-1909.11152"/></url>
<url><loc>https://scifaro.com/en/abs/how-does-object-fatness-impact-the-complexity-of-packing-in-d-dimensions-1909.12044</loc><lastmod>2019-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-does-object-fatness-impact-the-complexity-of-packing-in-d-dimensions-1909.12044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-does-object-fatness-impact-the-complexity-of-packing-in-d-dimensions-1909.12044"/></url>
<url><loc>https://scifaro.com/en/abs/atol-measure-vectorization-for-automatic-topologically-oriented-learning-1909.13472</loc><lastmod>2020-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/atol-measure-vectorization-for-automatic-topologically-oriented-learning-1909.13472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/atol-measure-vectorization-for-automatic-topologically-oriented-learning-1909.13472"/></url>
<url><loc>https://scifaro.com/en/abs/automated-generation-of-dimensioned-rectangular-floorplans-1910.00081</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-generation-of-dimensioned-rectangular-floorplans-1910.00081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-generation-of-dimensioned-rectangular-floorplans-1910.00081"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-geometric-edit-distance-1910.00773</loc><lastmod>2020-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-geometric-edit-distance-1910.00773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-geometric-edit-distance-1910.00773"/></url>
<url><loc>https://scifaro.com/en/abs/a-grid-based-approach-for-convexity-analysis-of-a-density-based-cluster-1910.01492</loc><lastmod>2020-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-grid-based-approach-for-convexity-analysis-of-a-density-based-cluster-1910.01492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-grid-based-approach-for-convexity-analysis-of-a-density-based-cluster-1910.01492"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-a-center-persistence-diagram-1910.01753</loc><lastmod>2020-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-a-center-persistence-diagram-1910.01753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-a-center-persistence-diagram-1910.01753"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-matchings-in-geometric-intersection-graphs-1910.02123</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-matchings-in-geometric-intersection-graphs-1910.02123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-matchings-in-geometric-intersection-graphs-1910.02123"/></url>
<url><loc>https://scifaro.com/en/abs/on-geodesic-triangles-with-right-angles-in-a-dually-flat-space-1910.03935</loc><lastmod>2021-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-geodesic-triangles-with-right-angles-in-a-dually-flat-space-1910.03935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-geodesic-triangles-with-right-angles-in-a-dually-flat-space-1910.03935"/></url>
<url><loc>https://scifaro.com/en/abs/the-impacts-of-dimensionality-diffusion-and-directedness-on-intrinsic-universality-in-the-abstract-tile-assembly-model-1910.03950</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-impacts-of-dimensionality-diffusion-and-directedness-on-intrinsic-universality-in-the-abstract-tile-assembly-model-1910.03950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-impacts-of-dimensionality-diffusion-and-directedness-on-intrinsic-universality-in-the-abstract-tile-assembly-model-1910.03950"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-levi-s-extension-lemma-1910.05388</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-levi-s-extension-lemma-1910.05388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-levi-s-extension-lemma-1910.05388"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-topology-of-bond-networks-with-applications-to-silica-1910.05842</loc><lastmod>2020-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-topology-of-bond-networks-with-applications-to-silica-1910.05842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-topology-of-bond-networks-with-applications-to-silica-1910.05842"/></url>
<url><loc>https://scifaro.com/en/abs/some-geometric-applications-of-anti-chains-1910.07586</loc><lastmod>2020-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-geometric-applications-of-anti-chains-1910.07586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-geometric-applications-of-anti-chains-1910.07586"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-semi-automatic-map-labeling-1910.07799</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-semi-automatic-map-labeling-1910.07799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-semi-automatic-map-labeling-1910.07799"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-partitioning-for-template-functions-on-persistence-diagrams-1910.08506</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-partitioning-for-template-functions-on-persistence-diagrams-1910.08506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-partitioning-for-template-functions-on-persistence-diagrams-1910.08506"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-area-rectangles-in-a-simple-polygon-1910.08686</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-area-rectangles-in-a-simple-polygon-1910.08686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-area-rectangles-in-a-simple-polygon-1910.08686"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-queries-for-convex-hulls-of-points-1910.08717</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-queries-for-convex-hulls-of-points-1910.08717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-queries-for-convex-hulls-of-points-1910.08717"/></url>
<url><loc>https://scifaro.com/en/abs/folding-polyominoes-with-holes-into-a-cube-1910.09917</loc><lastmod>2020-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-polyominoes-with-holes-into-a-cube-1910.09917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-polyominoes-with-holes-into-a-cube-1910.09917"/></url>
<url><loc>https://scifaro.com/en/abs/emanation-graph-a-plane-geometric-spanner-with-steiner-points-1910.10376</loc><lastmod>2022-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/emanation-graph-a-plane-geometric-spanner-with-steiner-points-1910.10376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/emanation-graph-a-plane-geometric-spanner-with-steiner-points-1910.10376"/></url>
<url><loc>https://scifaro.com/en/abs/finite-boolean-algebras-for-solid-geometry-using-julia-s-sparse-arrays-1910.11848</loc><lastmod>2026-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-boolean-algebras-for-solid-geometry-using-julia-s-sparse-arrays-1910.11848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-boolean-algebras-for-solid-geometry-using-julia-s-sparse-arrays-1910.11848"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-center-region-and-its-variants-1910.12169</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-center-region-and-its-variants-1910.12169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-center-region-and-its-variants-1910.12169"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-geodesic-two-center-of-points-in-a-simple-polygon-1910.12177</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-geodesic-two-center-of-points-in-a-simple-polygon-1910.12177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-geodesic-two-center-of-points-in-a-simple-polygon-1910.12177"/></url>
<url><loc>https://scifaro.com/en/abs/equipartitions-with-wedges-and-cones-1910.13352</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equipartitions-with-wedges-and-cones-1910.13352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equipartitions-with-wedges-and-cones-1910.13352"/></url>
<url><loc>https://scifaro.com/en/abs/expected-complexity-of-routing-in-theta-6-and-half-theta-6-graphs-1910.14289</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expected-complexity-of-routing-in-theta-6-and-half-theta-6-graphs-1910.14289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expected-complexity-of-routing-in-theta-6-and-half-theta-6-graphs-1910.14289"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-bound-on-the-combinatorial-complexity-of-approximating-polytopes-1910.14459</loc><lastmod>2022-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-bound-on-the-combinatorial-complexity-of-approximating-polytopes-1910.14459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-bound-on-the-combinatorial-complexity-of-approximating-polytopes-1910.14459"/></url>
<url><loc>https://scifaro.com/en/abs/an-experimental-study-of-a-1-planarity-testing-and-embedding-algorithm-1911.00573</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-experimental-study-of-a-1-planarity-testing-and-embedding-algorithm-1911.00573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-experimental-study-of-a-1-planarity-testing-and-embedding-algorithm-1911.00573"/></url>
<url><loc>https://scifaro.com/en/abs/computing-circle-packing-representations-of-planar-graphs-1911.00612</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-circle-packing-representations-of-planar-graphs-1911.00612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-circle-packing-representations-of-planar-graphs-1911.00612"/></url>
<url><loc>https://scifaro.com/en/abs/topological-feature-search-in-time-varying-multifield-data-1911.00687</loc><lastmod>2024-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-feature-search-in-time-varying-multifield-data-1911.00687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-feature-search-in-time-varying-multifield-data-1911.00687"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-intersection-graphs-of-multiple-intervals-and-pseudo-disks-1911.01374</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-intersection-graphs-of-multiple-intervals-and-pseudo-disks-1911.01374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-intersection-graphs-of-multiple-intervals-and-pseudo-disks-1911.01374"/></url>
<url><loc>https://scifaro.com/en/abs/same-stats-different-graphs-exploring-the-space-of-graphs-in-terms-of-graph-properties-1911.01527</loc><lastmod>2019-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/same-stats-different-graphs-exploring-the-space-of-graphs-in-terms-of-graph-properties-1911.01527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/same-stats-different-graphs-exploring-the-space-of-graphs-in-terms-of-graph-properties-1911.01527"/></url>
<url><loc>https://scifaro.com/en/abs/packing-trees-into-1-planar-graphs-1911.01761</loc><lastmod>2019-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-trees-into-1-planar-graphs-1911.01761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-trees-into-1-planar-graphs-1911.01761"/></url>
<url><loc>https://scifaro.com/en/abs/angle-covers-algorithms-and-complexity-1911.02040</loc><lastmod>2022-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angle-covers-algorithms-and-complexity-1911.02040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angle-covers-algorithms-and-complexity-1911.02040"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-average-complexity-of-the-k-level-1911.02408</loc><lastmod>2020-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-average-complexity-of-the-k-level-1911.02408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-average-complexity-of-the-k-level-1911.02408"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-as-stopping-criterion-for-voronoi-interpolation-1911.02922</loc><lastmod>2026-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-as-stopping-criterion-for-voronoi-interpolation-1911.02922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-as-stopping-criterion-for-voronoi-interpolation-1911.02922"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-bounds-for-interpolation-and-normals-on-triangulated-surfaces-and-manifolds-1911.03424</loc><lastmod>2019-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-bounds-for-interpolation-and-normals-on-triangulated-surfaces-and-manifolds-1911.03424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-bounds-for-interpolation-and-normals-on-triangulated-surfaces-and-manifolds-1911.03424"/></url>
<url><loc>https://scifaro.com/en/abs/a-penetration-metric-for-deforming-tetrahedra-using-object-norm-1911.06144</loc><lastmod>2019-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-penetration-metric-for-deforming-tetrahedra-using-object-norm-1911.06144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-penetration-metric-for-deforming-tetrahedra-using-object-norm-1911.06144"/></url>
<url><loc>https://scifaro.com/en/abs/the-isoperimetric-problem-in-a-lattice-of-mathbb-h-3-1911.06264</loc><lastmod>2019-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-isoperimetric-problem-in-a-lattice-of-mathbb-h-3-1911.06264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-isoperimetric-problem-in-a-lattice-of-mathbb-h-3-1911.06264"/></url>
<url><loc>https://scifaro.com/en/abs/new-bounds-on-the-biplanar-and-k-planar-crossing-numbers-1911.06403</loc><lastmod>2021-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-bounds-on-the-biplanar-and-k-planar-crossing-numbers-1911.06403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-bounds-on-the-biplanar-and-k-planar-crossing-numbers-1911.06403"/></url>
<url><loc>https://scifaro.com/en/abs/a-crossing-lemma-for-families-of-jordan-curves-with-a-bounded-intersection-number-1911.07287</loc><lastmod>2021-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-crossing-lemma-for-families-of-jordan-curves-with-a-bounded-intersection-number-1911.07287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-crossing-lemma-for-families-of-jordan-curves-with-a-bounded-intersection-number-1911.07287"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-width-double-strip-and-parallelogram-annulus-1911.07504</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-width-double-strip-and-parallelogram-annulus-1911.07504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-width-double-strip-and-parallelogram-annulus-1911.07504"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-and-approximation-of-minimum-convex-partition-1911.07697</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-and-approximation-of-minimum-convex-partition-1911.07697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-and-approximation-of-minimum-convex-partition-1911.07697"/></url>
<url><loc>https://scifaro.com/en/abs/topological-computing-of-arrangements-with-co-chains-1911.08130</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-computing-of-arrangements-with-co-chains-1911.08130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-computing-of-arrangements-with-co-chains-1911.08130"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-bottleneck-bounded-degree-spanning-tree-ratios-1911.08529</loc><lastmod>2019-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-bottleneck-bounded-degree-spanning-tree-ratios-1911.08529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-bottleneck-bounded-degree-spanning-tree-ratios-1911.08529"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-planar-networks-on-bichromatic-points-1911.08924</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-planar-networks-on-bichromatic-points-1911.08924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-planar-networks-on-bichromatic-points-1911.08924"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-model-in-firefighting-theory-1911.10341</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-model-in-firefighting-theory-1911.10341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-model-in-firefighting-theory-1911.10341"/></url>
<url><loc>https://scifaro.com/en/abs/on-maximum-sum-matchings-of-points-1911.10610</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-maximum-sum-matchings-of-points-1911.10610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-maximum-sum-matchings-of-points-1911.10610"/></url>
<url><loc>https://scifaro.com/en/abs/threshold-based-graph-reconstruction-using-discrete-morse-theory-1911.12865</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/threshold-based-graph-reconstruction-using-discrete-morse-theory-1911.12865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/threshold-based-graph-reconstruction-using-discrete-morse-theory-1911.12865"/></url>
<url><loc>https://scifaro.com/en/abs/empty-squares-in-arbitrary-orientation-among-points-1911.12988</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/empty-squares-in-arbitrary-orientation-among-points-1911.12988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/empty-squares-in-arbitrary-orientation-among-points-1911.12988"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-folding-of-tetrahedron-1912.01227</loc><lastmod>2019-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-folding-of-tetrahedron-1912.01227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-folding-of-tetrahedron-1912.01227"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-shortest-separating-cycle-1912.01541</loc><lastmod>2019-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-shortest-separating-cycle-1912.01541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-shortest-separating-cycle-1912.01541"/></url>
<url><loc>https://scifaro.com/en/abs/sometimes-reliable-spanners-of-almost-linear-size-1912.01547</loc><lastmod>2022-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sometimes-reliable-spanners-of-almost-linear-size-1912.01547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sometimes-reliable-spanners-of-almost-linear-size-1912.01547"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-algorithms-for-geometric-centers-and-depth-1912.01639</loc><lastmod>2021-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-algorithms-for-geometric-centers-and-depth-1912.01639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-algorithms-for-geometric-centers-and-depth-1912.01639"/></url>
<url><loc>https://scifaro.com/en/abs/proof-of-dudley-s-convex-approximation-1912.01977</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-of-dudley-s-convex-approximation-1912.01977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-of-dudley-s-convex-approximation-1912.01977"/></url>
<url><loc>https://scifaro.com/en/abs/smoothing-the-gap-between-np-and-er-1912.02278</loc><lastmod>2021-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smoothing-the-gap-between-np-and-er-1912.02278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smoothing-the-gap-between-np-and-er-1912.02278"/></url>
<url><loc>https://scifaro.com/en/abs/a-densest-ternary-circle-packing-in-the-plane-1912.02297</loc><lastmod>2019-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-densest-ternary-circle-packing-in-the-plane-1912.02297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-densest-ternary-circle-packing-in-the-plane-1912.02297"/></url>
<url><loc>https://scifaro.com/en/abs/topology-preserving-terrain-simplification-1912.03032</loc><lastmod>2020-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-preserving-terrain-simplification-1912.03032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-preserving-terrain-simplification-1912.03032"/></url>
<url><loc>https://scifaro.com/en/abs/recovering-the-homology-of-immersed-manifolds-1912.03033</loc><lastmod>2024-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recovering-the-homology-of-immersed-manifolds-1912.03033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recovering-the-homology-of-immersed-manifolds-1912.03033"/></url>
<url><loc>https://scifaro.com/en/abs/topological-and-geometric-reconstruction-of-metric-graphs-in-mathbb-r-n-1912.03134</loc><lastmod>2019-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-and-geometric-reconstruction-of-metric-graphs-in-mathbb-r-n-1912.03134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-and-geometric-reconstruction-of-metric-graphs-in-mathbb-r-n-1912.03134"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-dynamization-of-trapezoidal-point-location-in-planar-subdivisions-1912.03389</loc><lastmod>2019-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-dynamization-of-trapezoidal-point-location-in-planar-subdivisions-1912.03389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-dynamization-of-trapezoidal-point-location-in-planar-subdivisions-1912.03389"/></url>
<url><loc>https://scifaro.com/en/abs/covering-polygons-by-min-area-convex-polygons-1912.03429</loc><lastmod>2019-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-polygons-by-min-area-convex-polygons-1912.03429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-polygons-by-min-area-convex-polygons-1912.03429"/></url>
<url><loc>https://scifaro.com/en/abs/moebinv-c-libraries-for-manipulations-in-non-euclidean-geometry-1912.03489</loc><lastmod>2019-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moebinv-c-libraries-for-manipulations-in-non-euclidean-geometry-1912.03489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moebinv-c-libraries-for-manipulations-in-non-euclidean-geometry-1912.03489"/></url>
<url><loc>https://scifaro.com/en/abs/flipping-geometric-triangulations-on-hyperbolic-surfaces-1912.04640</loc><lastmod>2019-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flipping-geometric-triangulations-on-hyperbolic-surfaces-1912.04640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flipping-geometric-triangulations-on-hyperbolic-surfaces-1912.04640"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-approximation-of-the-matching-distance-for-2-parameter-persistence-1912.05826</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-approximation-of-the-matching-distance-for-2-parameter-persistence-1912.05826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-approximation-of-the-matching-distance-for-2-parameter-persistence-1912.05826"/></url>
<url><loc>https://scifaro.com/en/abs/topoact-visually-exploring-the-shape-of-activations-in-deep-learning-1912.06332</loc><lastmod>2021-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topoact-visually-exploring-the-shape-of-activations-in-deep-learning-1912.06332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topoact-visually-exploring-the-shape-of-activations-in-deep-learning-1912.06332"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-embedded-graphs-from-persistence-diagrams-1912.08913</loc><lastmod>2020-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-embedded-graphs-from-persistence-diagrams-1912.08913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-embedded-graphs-from-persistence-diagrams-1912.08913"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-finding-normal-surfaces-1912.09051</loc><lastmod>2024-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-finding-normal-surfaces-1912.09051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-finding-normal-surfaces-1912.09051"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-the-escherization-problem-in-the-polygon-representation-1912.09605</loc><lastmod>2020-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-the-escherization-problem-in-the-polygon-representation-1912.09605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-the-escherization-problem-in-the-polygon-representation-1912.09605"/></url>
<url><loc>https://scifaro.com/en/abs/improved-upper-and-lower-bounds-for-lr-drawings-of-binary-trees-1912.10148</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-upper-and-lower-bounds-for-lr-drawings-of-binary-trees-1912.10148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-upper-and-lower-bounds-for-lr-drawings-of-binary-trees-1912.10148"/></url>
<url><loc>https://scifaro.com/en/abs/a-faithful-discretization-of-the-verbose-persistent-homology-transform-1912.12759</loc><lastmod>2026-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faithful-discretization-of-the-verbose-persistent-homology-transform-1912.12759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faithful-discretization-of-the-verbose-persistent-homology-transform-1912.12759"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-and-analytics-of-the-multifacility-weber-problem-1912.12973</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-and-analytics-of-the-multifacility-weber-problem-1912.12973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-and-analytics-of-the-multifacility-weber-problem-1912.12973"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-for-stabbing-simplices-by-a-line-2001.00782</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-for-stabbing-simplices-by-a-line-2001.00782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-for-stabbing-simplices-by-a-line-2001.00782"/></url>
<url><loc>https://scifaro.com/en/abs/computing-euclidean-k-center-over-sliding-windows-2001.01035</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-euclidean-k-center-over-sliding-windows-2001.01035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-euclidean-k-center-over-sliding-windows-2001.01035"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-surface-mesh-generation-for-discrete-models-a-complete-and-automatic-pipeline-based-on-reparameterization-2001.02542</loc><lastmod>2020-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-surface-mesh-generation-for-discrete-models-a-complete-and-automatic-pipeline-based-on-reparameterization-2001.02542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-surface-mesh-generation-for-discrete-models-a-complete-and-automatic-pipeline-based-on-reparameterization-2001.02542"/></url>
<url><loc>https://scifaro.com/en/abs/the-simplex-tree-an-efficient-data-structure-for-general-simplicial-complexes-2001.02581</loc><lastmod>2020-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-simplex-tree-an-efficient-data-structure-for-general-simplicial-complexes-2001.02581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-simplex-tree-an-efficient-data-structure-for-general-simplicial-complexes-2001.02581"/></url>
<url><loc>https://scifaro.com/en/abs/an-inexact-matching-approach-for-the-comparison-of-plane-curves-with-general-elastic-metrics-2001.02858</loc><lastmod>2025-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inexact-matching-approach-for-the-comparison-of-plane-curves-with-general-elastic-metrics-2001.02858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inexact-matching-approach-for-the-comparison-of-plane-curves-with-general-elastic-metrics-2001.02858"/></url>
<url><loc>https://scifaro.com/en/abs/rac-drawings-in-subcubic-area-2001.02867</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rac-drawings-in-subcubic-area-2001.02867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rac-drawings-in-subcubic-area-2001.02867"/></url>
<url><loc>https://scifaro.com/en/abs/computing-persistent-homology-with-various-coefficient-fields-in-a-single-pass-2001.02960</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-persistent-homology-with-various-coefficient-fields-in-a-single-pass-2001.02960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-persistent-homology-with-various-coefficient-fields-in-a-single-pass-2001.02960"/></url>
<url><loc>https://scifaro.com/en/abs/new-variants-of-perfect-non-crossing-matchings-2001.03252</loc><lastmod>2021-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-variants-of-perfect-non-crossing-matchings-2001.03252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-variants-of-perfect-non-crossing-matchings-2001.03252"/></url>
<url><loc>https://scifaro.com/en/abs/obtaining-a-canonical-polygonal-schema-from-a-greedy-homotopy-basis-with-minimal-mesh-refinement-2001.03664</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obtaining-a-canonical-polygonal-schema-from-a-greedy-homotopy-basis-with-minimal-mesh-refinement-2001.03664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obtaining-a-canonical-polygonal-schema-from-a-greedy-homotopy-basis-with-minimal-mesh-refinement-2001.03664"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-the-snappability-of-bar-joint-frameworks-2001.04430</loc><lastmod>2020-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-the-snappability-of-bar-joint-frameworks-2001.04430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-the-snappability-of-bar-joint-frameworks-2001.04430"/></url>
<url><loc>https://scifaro.com/en/abs/np-completeness-of-slope-constrained-drawing-of-complete-graphs-2001.04671</loc><lastmod>2020-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-completeness-of-slope-constrained-drawing-of-complete-graphs-2001.04671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-completeness-of-slope-constrained-drawing-of-complete-graphs-2001.04671"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-contractibility-of-a-non-simple-curve-on-the-boundary-of-a-3-manifold-a-computational-loop-theorem-2001.04747</loc><lastmod>2020-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-contractibility-of-a-non-simple-curve-on-the-boundary-of-a-3-manifold-a-computational-loop-theorem-2001.04747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-contractibility-of-a-non-simple-curve-on-the-boundary-of-a-3-manifold-a-computational-loop-theorem-2001.04747"/></url>
<url><loc>https://scifaro.com/en/abs/critical-sets-of-pl-and-discrete-morse-theory-a-correspondence-2001.04767</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-sets-of-pl-and-discrete-morse-theory-a-correspondence-2001.04767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-sets-of-pl-and-discrete-morse-theory-a-correspondence-2001.04767"/></url>
<url><loc>https://scifaro.com/en/abs/simplification-of-indoor-space-footprints-2001.05564</loc><lastmod>2020-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplification-of-indoor-space-footprints-2001.05564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplification-of-indoor-space-footprints-2001.05564"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-the-maximum-number-of-runners-that-cause-loneliness-and-its-application-to-isolation-2001.06169</loc><lastmod>2020-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-maximum-number-of-runners-that-cause-loneliness-and-its-application-to-isolation-2001.06169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-maximum-number-of-runners-that-cause-loneliness-and-its-application-to-isolation-2001.06169"/></url>
<url><loc>https://scifaro.com/en/abs/on-visibility-graphs-of-convex-fans-and-terrains-2001.06436</loc><lastmod>2020-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-visibility-graphs-of-convex-fans-and-terrains-2001.06436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-visibility-graphs-of-convex-fans-and-terrains-2001.06436"/></url>
<url><loc>https://scifaro.com/en/abs/chirotopes-of-random-points-in-space-are-realizable-on-a-small-integer-grid-2001.08062</loc><lastmod>2020-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chirotopes-of-random-points-in-space-are-realizable-on-a-small-integer-grid-2001.08062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chirotopes-of-random-points-in-space-are-realizable-on-a-small-integer-grid-2001.08062"/></url>
<url><loc>https://scifaro.com/en/abs/arrangements-of-approaching-pseudo-lines-2001.08419</loc><lastmod>2020-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrangements-of-approaching-pseudo-lines-2001.08419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrangements-of-approaching-pseudo-lines-2001.08419"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-crossing-free-geometric-graphs-with-connectivity-constraint-for-fast-enumeration-random-sampling-and-optimization-2001.08899</loc><lastmod>2020-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-crossing-free-geometric-graphs-with-connectivity-constraint-for-fast-enumeration-random-sampling-and-optimization-2001.08899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-crossing-free-geometric-graphs-with-connectivity-constraint-for-fast-enumeration-random-sampling-and-optimization-2001.08899"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-surfaces-in-r-3-by-meshes-with-guaranteed-regularity-2001.09081</loc><lastmod>2020-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-surfaces-in-r-3-by-meshes-with-guaranteed-regularity-2001.09081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-surfaces-in-r-3-by-meshes-with-guaranteed-regularity-2001.09081"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-1-dimensional-persistent-path-homology-2001.09549</loc><lastmod>2020-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-1-dimensional-persistent-path-homology-2001.09549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-1-dimensional-persistent-path-homology-2001.09549"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-middle-curve-problem-2001.10298</loc><lastmod>2020-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-middle-curve-problem-2001.10298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-middle-curve-problem-2001.10298"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-fr-echet-distance-of-trees-and-graphs-of-bounded-tree-width-2001.10502</loc><lastmod>2020-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-fr-echet-distance-of-trees-and-graphs-of-bounded-tree-width-2001.10502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-fr-echet-distance-of-trees-and-graphs-of-bounded-tree-width-2001.10502"/></url>
<url><loc>https://scifaro.com/en/abs/polylidar-polygons-from-triangular-meshes-2002.01886</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polylidar-polygons-from-triangular-meshes-2002.01886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polylidar-polygons-from-triangular-meshes-2002.01886"/></url>
<url><loc>https://scifaro.com/en/abs/which-convex-polyhedra-can-be-made-by-gluing-regular-hexagons-2002.02052</loc><lastmod>2020-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/which-convex-polyhedra-can-be-made-by-gluing-regular-hexagons-2002.02052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/which-convex-polyhedra-can-be-made-by-gluing-regular-hexagons-2002.02052"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-two-interval-pattern-problem-2002.05099</loc><lastmod>2020-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-two-interval-pattern-problem-2002.05099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-two-interval-pattern-problem-2002.05099"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-scalable-complex-network-descriptor-using-pagerank-and-persistent-homology-2002.05158</loc><lastmod>2020-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-scalable-complex-network-descriptor-using-pagerank-and-persistent-homology-2002.05158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-scalable-complex-network-descriptor-using-pagerank-and-persistent-homology-2002.05158"/></url>
<url><loc>https://scifaro.com/en/abs/computing-shapley-values-for-mean-width-in-3-d-2002.05252</loc><lastmod>2020-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-shapley-values-for-mean-width-in-3-d-2002.05252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-shapley-values-for-mean-width-in-3-d-2002.05252"/></url>
<url><loc>https://scifaro.com/en/abs/a-quasi-polynomial-algorithm-for-well-spaced-hyperbolic-tsp-2002.05414</loc><lastmod>2020-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quasi-polynomial-algorithm-for-well-spaced-hyperbolic-tsp-2002.05414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quasi-polynomial-algorithm-for-well-spaced-hyperbolic-tsp-2002.05414"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-systems-of-unbiased-representatives-2002.05488</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-systems-of-unbiased-representatives-2002.05488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-systems-of-unbiased-representatives-2002.05488"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-edge-crossings-of-the-greedy-spanner-2002.05854</loc><lastmod>2021-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-edge-crossings-of-the-greedy-spanner-2002.05854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-edge-crossings-of-the-greedy-spanner-2002.05854"/></url>
<url><loc>https://scifaro.com/en/abs/kinetic-geodesic-voronoi-diagrams-in-a-simple-polygon-2002.05910</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kinetic-geodesic-voronoi-diagrams-in-a-simple-polygon-2002.05910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kinetic-geodesic-voronoi-diagrams-in-a-simple-polygon-2002.05910"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-unbounded-polyhedra-derived-from-convex-caps-2002.06418</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-unbounded-polyhedra-derived-from-convex-caps-2002.06418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-unbounded-polyhedra-derived-from-convex-caps-2002.06418"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-the-nearest-neighbor-rule-2002.06650</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-the-nearest-neighbor-rule-2002.06650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-the-nearest-neighbor-rule-2002.06650"/></url>
<url><loc>https://scifaro.com/en/abs/computing-boundary-cycle-of-a-pseudo-triangle-polygon-from-its-visibility-graph-2002.06712</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-boundary-cycle-of-a-pseudo-triangle-polygon-from-its-visibility-graph-2002.06712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-boundary-cycle-of-a-pseudo-triangle-polygon-from-its-visibility-graph-2002.06712"/></url>
<url><loc>https://scifaro.com/en/abs/overlaid-oriented-voronoi-diagrams-and-the-1-steiner-tree-problem-2002.06752</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overlaid-oriented-voronoi-diagrams-and-the-1-steiner-tree-problem-2002.06752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overlaid-oriented-voronoi-diagrams-and-the-1-steiner-tree-problem-2002.06752"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-stabbing-convex-polygons-and-variants-of-the-hadwiger-debrunner-p-q-theorem-2002.06947</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-stabbing-convex-polygons-and-variants-of-the-hadwiger-debrunner-p-q-theorem-2002.06947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-stabbing-convex-polygons-and-variants-of-the-hadwiger-debrunner-p-q-theorem-2002.06947"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2002.07611</loc><lastmod>2022-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2002.07611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2002.07611"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-line-fields-on-surfaces-2002.07723</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-line-fields-on-surfaces-2002.07723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-line-fields-on-surfaces-2002.07723"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-hop-spanners-for-unit-disk-graphs-2002.07840</loc><lastmod>2021-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-hop-spanners-for-unit-disk-graphs-2002.07840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-hop-spanners-for-unit-disk-graphs-2002.07840"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-planar-two-center-problem-and-circular-hulls-2002.07945</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-planar-two-center-problem-and-circular-hulls-2002.07945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-planar-two-center-problem-and-circular-hulls-2002.07945"/></url>
<url><loc>https://scifaro.com/en/abs/globally-optimal-point-set-registration-by-joint-symmetry-plane-fitting-2002.07988</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/globally-optimal-point-set-registration-by-joint-symmetry-plane-fitting-2002.07988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/globally-optimal-point-set-registration-by-joint-symmetry-plane-fitting-2002.07988"/></url>
<url><loc>https://scifaro.com/en/abs/the-tree-stabbing-number-is-not-monotone-2002.08198</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tree-stabbing-number-is-not-monotone-2002.08198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tree-stabbing-number-is-not-monotone-2002.08198"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-epsilon-nets-2002.08693</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-epsilon-nets-2002.08693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-epsilon-nets-2002.08693"/></url>
<url><loc>https://scifaro.com/en/abs/on-layered-fan-planar-graph-drawings-2002.09597</loc><lastmod>2020-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-layered-fan-planar-graph-drawings-2002.09597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-layered-fan-planar-graph-drawings-2002.09597"/></url>
<url><loc>https://scifaro.com/en/abs/faster-multi-sided-boundary-labelling-2002.09740</loc><lastmod>2020-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-multi-sided-boundary-labelling-2002.09740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-multi-sided-boundary-labelling-2002.09740"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-empty-balanced-tetrahedra-in-two-colored-point-sets-in-mathbb-r-3-2002.10646</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-empty-balanced-tetrahedra-in-two-colored-point-sets-in-mathbb-r-3-2002.10646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-empty-balanced-tetrahedra-in-two-colored-point-sets-in-mathbb-r-3-2002.10646"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-subpath-convex-hull-queries-and-ray-shooting-among-segments-2002.10672</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-subpath-convex-hull-queries-and-ray-shooting-among-segments-2002.10672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-subpath-convex-hull-queries-and-ray-shooting-among-segments-2002.10672"/></url>
<url><loc>https://scifaro.com/en/abs/routing-in-unit-disk-graphs-without-dynamic-headers-2002.10841</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-in-unit-disk-graphs-without-dynamic-headers-2002.10841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-in-unit-disk-graphs-without-dynamic-headers-2002.10841"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-based-similarity-distances-between-arbitrary-crystal-lattices-2002.11165</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-based-similarity-distances-between-arbitrary-crystal-lattices-2002.11165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-based-similarity-distances-between-arbitrary-crystal-lattices-2002.11165"/></url>
<url><loc>https://scifaro.com/en/abs/finding-large-matchings-in-1-planar-graphs-of-minimum-degree-3-2002.11818</loc><lastmod>2020-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-large-matchings-in-1-planar-graphs-of-minimum-degree-3-2002.11818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-large-matchings-in-1-planar-graphs-of-minimum-degree-3-2002.11818"/></url>
<url><loc>https://scifaro.com/en/abs/layered-sampling-for-robust-optimization-problems-2002.11904</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layered-sampling-for-robust-optimization-problems-2002.11904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layered-sampling-for-robust-optimization-problems-2002.11904"/></url>
<url><loc>https://scifaro.com/en/abs/the-effectiveness-of-johnson-lindenstrauss-transform-for-high-dimensional-optimization-with-adversarial-outliers-and-the-recovery-2002.11923</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-effectiveness-of-johnson-lindenstrauss-transform-for-high-dimensional-optimization-with-adversarial-outliers-and-the-recovery-2002.11923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-effectiveness-of-johnson-lindenstrauss-transform-for-high-dimensional-optimization-with-adversarial-outliers-and-the-recovery-2002.11923"/></url>
<url><loc>https://scifaro.com/en/abs/on-metric-dbscan-with-low-doubling-dimension-2002.11933</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-metric-dbscan-with-low-doubling-dimension-2002.11933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-metric-dbscan-with-low-doubling-dimension-2002.11933"/></url>
<url><loc>https://scifaro.com/en/abs/a-data-dependent-algorithm-for-querying-earth-mover-s-distance-with-low-doubling-dimensions-2002.12354</loc><lastmod>2020-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-data-dependent-algorithm-for-querying-earth-mover-s-distance-with-low-doubling-dimensions-2002.12354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-data-dependent-algorithm-for-querying-earth-mover-s-distance-with-low-doubling-dimensions-2002.12354"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-geometric-set-cover-and-hitting-set-2003.00202</loc><lastmod>2020-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-geometric-set-cover-and-hitting-set-2003.00202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-geometric-set-cover-and-hitting-set-2003.00202"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-level-vertex-in-an-arrangement-of-lines-2003.00518</loc><lastmod>2020-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-level-vertex-in-an-arrangement-of-lines-2003.00518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-level-vertex-in-an-arrangement-of-lines-2003.00518"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-area-requirements-of-planar-greedy-drawings-of-triconnected-planar-graphs-2003.00556</loc><lastmod>2020-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-area-requirements-of-planar-greedy-drawings-of-triconnected-planar-graphs-2003.00556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-area-requirements-of-planar-greedy-drawings-of-triconnected-planar-graphs-2003.00556"/></url>
<url><loc>https://scifaro.com/en/abs/shape-analysis-via-inconsistent-surface-registration-2003.01357</loc><lastmod>2020-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shape-analysis-via-inconsistent-surface-registration-2003.01357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shape-analysis-via-inconsistent-surface-registration-2003.01357"/></url>
<url><loc>https://scifaro.com/en/abs/procedural-band-patterns-2003.01408</loc><lastmod>2020-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/procedural-band-patterns-2003.01408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/procedural-band-patterns-2003.01408"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-enclosing-parallelogram-with-outliers-2003.01900</loc><lastmod>2021-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-enclosing-parallelogram-with-outliers-2003.01900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-enclosing-parallelogram-with-outliers-2003.01900"/></url>
<url><loc>https://scifaro.com/en/abs/incidences-between-points-and-curves-with-almost-two-degrees-of-freedom-2003.02190</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incidences-between-points-and-curves-with-almost-two-degrees-of-freedom-2003.02190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incidences-between-points-and-curves-with-almost-two-degrees-of-freedom-2003.02190"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-clique-in-disk-like-intersection-graphs-2003.02583</loc><lastmod>2020-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-clique-in-disk-like-intersection-graphs-2003.02583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-clique-in-disk-like-intersection-graphs-2003.02583"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-approximate-maximum-independent-set-of-intervals-hypercubes-and-hyperrectangles-2003.02605</loc><lastmod>2020-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-approximate-maximum-independent-set-of-intervals-hypercubes-and-hyperrectangles-2003.02605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-approximate-maximum-independent-set-of-intervals-hypercubes-and-hyperrectangles-2003.02605"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-bounded-chains-and-minimum-homologous-chains-in-embedded-simplicial-complexes-2003.02801</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-bounded-chains-and-minimum-homologous-chains-in-embedded-simplicial-complexes-2003.02801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-bounded-chains-and-minimum-homologous-chains-in-embedded-simplicial-complexes-2003.02801"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-graphs-with-circular-arcs-and-right-angle-crossings-2003.04740</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-graphs-with-circular-arcs-and-right-angle-crossings-2003.04740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-graphs-with-circular-arcs-and-right-angle-crossings-2003.04740"/></url>
<url><loc>https://scifaro.com/en/abs/monotone-arc-diagrams-with-few-biarcs-2003.05332</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotone-arc-diagrams-with-few-biarcs-2003.05332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotone-arc-diagrams-with-few-biarcs-2003.05332"/></url>
<url><loc>https://scifaro.com/en/abs/on-beta-plurality-points-in-spatial-voting-games-2003.07513</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-beta-plurality-points-in-spatial-voting-games-2003.07513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-beta-plurality-points-in-spatial-voting-games-2003.07513"/></url>
<url><loc>https://scifaro.com/en/abs/book-embeddings-of-nonplanar-graphs-with-small-faces-in-few-pages-2003.07655</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/book-embeddings-of-nonplanar-graphs-with-small-faces-in-few-pages-2003.07655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/book-embeddings-of-nonplanar-graphs-with-small-faces-in-few-pages-2003.07655"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-guarding-almost-convex-polygons-2003.07793</loc><lastmod>2020-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-guarding-almost-convex-polygons-2003.07793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-guarding-almost-convex-polygons-2003.07793"/></url>
<url><loc>https://scifaro.com/en/abs/gpu-accelerated-computation-of-vietoris-rips-persistence-barcodes-2003.07989</loc><lastmod>2026-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gpu-accelerated-computation-of-vietoris-rips-persistence-barcodes-2003.07989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gpu-accelerated-computation-of-vietoris-rips-persistence-barcodes-2003.07989"/></url>
<url><loc>https://scifaro.com/en/abs/worst-case-optimal-covering-of-rectangles-by-disks-2003.08236</loc><lastmod>2020-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/worst-case-optimal-covering-of-rectangles-by-disks-2003.08236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/worst-case-optimal-covering-of-rectangles-by-disks-2003.08236"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-distribution-sensitive-point-location-2003.08288</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-distribution-sensitive-point-location-2003.08288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-distribution-sensitive-point-location-2003.08288"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-self-improving-algorithms-2003.08329</loc><lastmod>2020-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-self-improving-algorithms-2003.08329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-self-improving-algorithms-2003.08329"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hulls-of-random-order-types-2003.08456</loc><lastmod>2022-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hulls-of-random-order-types-2003.08456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hulls-of-random-order-types-2003.08456"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-scan-cover-with-angular-transition-costs-2003.08816</loc><lastmod>2020-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-scan-cover-with-angular-transition-costs-2003.08816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-scan-cover-with-angular-transition-costs-2003.08816"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-the-alpha-ham-sandwich-problem-2003.09266</loc><lastmod>2020-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-the-alpha-ham-sandwich-problem-2003.09266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-the-alpha-ham-sandwich-problem-2003.09266"/></url>
<url><loc>https://scifaro.com/en/abs/testing-polynomials-for-vanishing-on-cartesian-products-of-planar-point-sets-collinearity-testing-and-related-problems-2003.09533</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-polynomials-for-vanishing-on-cartesian-products-of-planar-point-sets-collinearity-testing-and-related-problems-2003.09533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-polynomials-for-vanishing-on-cartesian-products-of-planar-point-sets-collinearity-testing-and-related-problems-2003.09533"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-snappability-and-singularity-distance-of-frameworks-with-bars-and-triangular-plates-2003.09904</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-snappability-and-singularity-distance-of-frameworks-with-bars-and-triangular-plates-2003.09904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-snappability-and-singularity-distance-of-frameworks-with-bars-and-triangular-plates-2003.09904"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-tsp-in-narrow-strips-2003.09948</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-tsp-in-narrow-strips-2003.09948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-tsp-in-narrow-strips-2003.09948"/></url>
<url><loc>https://scifaro.com/en/abs/an-implicit-representation-of-swept-volumes-based-on-local-shapes-and-movements-2003.11527</loc><lastmod>2020-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implicit-representation-of-swept-volumes-based-on-local-shapes-and-movements-2003.11527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implicit-representation-of-swept-volumes-based-on-local-shapes-and-movements-2003.11527"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-pattern-matching-reduces-to-k-sum-2003.11890</loc><lastmod>2020-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-pattern-matching-reduces-to-k-sum-2003.11890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-pattern-matching-reduces-to-k-sum-2003.11890"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-sparsification-of-closeness-relations-eigenvalue-clustering-for-computing-matrix-functions-2003.11914</loc><lastmod>2020-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-sparsification-of-closeness-relations-eigenvalue-clustering-for-computing-matrix-functions-2003.11914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-sparsification-of-closeness-relations-eigenvalue-clustering-for-computing-matrix-functions-2003.11914"/></url>
<url><loc>https://scifaro.com/en/abs/plane-filling-trails-2003.12745</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-filling-trails-2003.12745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-filling-trails-2003.12745"/></url>
<url><loc>https://scifaro.com/en/abs/single-point-visibility-constraint-minimum-link-paths-in-simple-polygons-2003.12778</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/single-point-visibility-constraint-minimum-link-paths-in-simple-polygons-2003.12778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/single-point-visibility-constraint-minimum-link-paths-in-simple-polygons-2003.12778"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-reconfiguring-robot-swarms-with-uniform-external-control-in-limited-directions-2003.13097</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-reconfiguring-robot-swarms-with-uniform-external-control-in-limited-directions-2003.13097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-reconfiguring-robot-swarms-with-uniform-external-control-in-limited-directions-2003.13097"/></url>
<url><loc>https://scifaro.com/en/abs/long-alternating-paths-exist-2003.13291</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/long-alternating-paths-exist-2003.13291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/long-alternating-paths-exist-2003.13291"/></url>
<url><loc>https://scifaro.com/en/abs/faster-approximation-algorithms-for-geometric-set-cover-2003.13420</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-approximation-algorithms-for-geometric-set-cover-2003.13420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-approximation-algorithms-for-geometric-set-cover-2003.13420"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-of-triangulation-flip-graphs-in-the-plane-2003.13557</loc><lastmod>2020-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-of-triangulation-flip-graphs-in-the-plane-2003.13557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-of-triangulation-flip-graphs-in-the-plane-2003.13557"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-properties-of-self-overlapping-curves-and-interior-boundaries-2003.13595</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-properties-of-self-overlapping-curves-and-interior-boundaries-2003.13595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-properties-of-self-overlapping-curves-and-interior-boundaries-2003.13595"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-halin-graphs-with-small-height-2003.14413</loc><lastmod>2020-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-halin-graphs-with-small-height-2003.14413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-halin-graphs-with-small-height-2003.14413"/></url>
<url><loc>https://scifaro.com/en/abs/local-congruence-of-chain-complexes-2004.00046</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-congruence-of-chain-complexes-2004.00046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-congruence-of-chain-complexes-2004.00046"/></url>
<url><loc>https://scifaro.com/en/abs/k-median-clustering-under-discrete-fr-e-chet-and-hausdorff-distances-2004.00722</loc><lastmod>2020-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-median-clustering-under-discrete-fr-e-chet-and-hausdorff-distances-2004.00722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-median-clustering-under-discrete-fr-e-chet-and-hausdorff-distances-2004.00722"/></url>
<url><loc>https://scifaro.com/en/abs/terrain-visibility-graphs-persistence-is-not-enough-2004.00750</loc><lastmod>2020-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terrain-visibility-graphs-persistence-is-not-enough-2004.00750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terrain-visibility-graphs-persistence-is-not-enough-2004.00750"/></url>
<url><loc>https://scifaro.com/en/abs/dots-polygons-2004.01235</loc><lastmod>2020-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dots-polygons-2004.01235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dots-polygons-2004.01235"/></url>
<url><loc>https://scifaro.com/en/abs/geodesic-spanners-for-points-in-mathbb-r-3-amid-axis-parallel-boxes-2004.01599</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geodesic-spanners-for-points-in-mathbb-r-3-amid-axis-parallel-boxes-2004.01599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geodesic-spanners-for-points-in-mathbb-r-3-amid-axis-parallel-boxes-2004.01599"/></url>
<url><loc>https://scifaro.com/en/abs/query-points-visibility-constraint-minimum-link-paths-in-simple-polygons-2004.02220</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-points-visibility-constraint-minimum-link-paths-in-simple-polygons-2004.02220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-points-visibility-constraint-minimum-link-paths-in-simple-polygons-2004.02220"/></url>
<url><loc>https://scifaro.com/en/abs/a-sufficient-condition-for-visibility-paths-in-simple-polygons-2004.02227</loc><lastmod>2022-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sufficient-condition-for-visibility-paths-in-simple-polygons-2004.02227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sufficient-condition-for-visibility-paths-in-simple-polygons-2004.02227"/></url>
<url><loc>https://scifaro.com/en/abs/probing-a-set-of-trajectories-to-maximize-captured-information-2004.03486</loc><lastmod>2020-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probing-a-set-of-trajectories-to-maximize-captured-information-2004.03486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probing-a-set-of-trajectories-to-maximize-captured-information-2004.03486"/></url>
<url><loc>https://scifaro.com/en/abs/cutting-cycles-of-rods-in-space-is-fpt-2004.03693</loc><lastmod>2020-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cutting-cycles-of-rods-in-space-is-fpt-2004.03693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cutting-cycles-of-rods-in-space-is-fpt-2004.03693"/></url>
<url><loc>https://scifaro.com/en/abs/computing-convex-partitions-for-point-sets-in-the-plane-the-cg-shop-challenge-2020-2004.04207</loc><lastmod>2020-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-convex-partitions-for-point-sets-in-the-plane-the-cg-shop-challenge-2020-2004.04207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-convex-partitions-for-point-sets-in-the-plane-the-cg-shop-challenge-2020-2004.04207"/></url>
<url><loc>https://scifaro.com/en/abs/the-vc-dimension-of-k-vertex-d-polytopes-2004.04841</loc><lastmod>2020-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vc-dimension-of-k-vertex-d-polytopes-2004.04841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vc-dimension-of-k-vertex-d-polytopes-2004.04841"/></url>
<url><loc>https://scifaro.com/en/abs/submodular-clustering-in-low-dimensions-2004.05494</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodular-clustering-in-low-dimensions-2004.05494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodular-clustering-in-low-dimensions-2004.05494"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-spatial-uniformity-with-the-hypersphere-chord-length-distribution-2004.05692</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-spatial-uniformity-with-the-hypersphere-chord-length-distribution-2004.05692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-spatial-uniformity-with-the-hypersphere-chord-length-distribution-2004.05692"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-randomized-o-n-log-n-time-closest-pair-algorithm-in-doubling-metrics-2004.05883</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-randomized-o-n-log-n-time-closest-pair-algorithm-in-doubling-metrics-2004.05883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-randomized-o-n-log-n-time-closest-pair-algorithm-in-doubling-metrics-2004.05883"/></url>
<url><loc>https://scifaro.com/en/abs/pentagon-contact-representations-2004.05942</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pentagon-contact-representations-2004.05942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pentagon-contact-representations-2004.05942"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-a-polyhedron-between-polygons-in-parallel-slices-2004.05946</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-a-polyhedron-between-polygons-in-parallel-slices-2004.05946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-a-polyhedron-between-polygons-in-parallel-slices-2004.05946"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-clustering-in-euclidean-spaces-importance-sampling-is-nearly-optimal-2004.06263</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-clustering-in-euclidean-spaces-importance-sampling-is-nearly-optimal-2004.06263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-clustering-in-euclidean-spaces-importance-sampling-is-nearly-optimal-2004.06263"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-plantinga-vegter-algorithm-2004.06879</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-plantinga-vegter-algorithm-2004.06879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-plantinga-vegter-algorithm-2004.06879"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-battleship-2004.07354</loc><lastmod>2020-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-battleship-2004.07354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-battleship-2004.07354"/></url>
<url><loc>https://scifaro.com/en/abs/framework-for-exists-mathbb-r-completeness-of-two-dimensional-packing-problems-2004.07558</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/framework-for-exists-mathbb-r-completeness-of-two-dimensional-packing-problems-2004.07558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/framework-for-exists-mathbb-r-completeness-of-two-dimensional-packing-problems-2004.07558"/></url>
<url><loc>https://scifaro.com/en/abs/compatible-paths-on-labelled-point-sets-2004.07996</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatible-paths-on-labelled-point-sets-2004.07996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatible-paths-on-labelled-point-sets-2004.07996"/></url>
<url><loc>https://scifaro.com/en/abs/hilbert-geometry-of-the-siegel-disk-the-siegel-klein-disk-model-2004.08160</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hilbert-geometry-of-the-siegel-disk-the-siegel-klein-disk-model-2004.08160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hilbert-geometry-of-the-siegel-disk-the-siegel-klein-disk-model-2004.08160"/></url>
<url><loc>https://scifaro.com/en/abs/on-homotopy-continuation-based-singularity-distance-computations-for-3-rpr-manipulators-2004.08359</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-homotopy-continuation-based-singularity-distance-computations-for-3-rpr-manipulators-2004.08359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-homotopy-continuation-based-singularity-distance-computations-for-3-rpr-manipulators-2004.08359"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-approximate-nearest-neighbor-queries-among-curves-under-the-fr-echet-distance-2004.08444</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-approximate-nearest-neighbor-queries-among-curves-under-the-fr-echet-distance-2004.08444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-approximate-nearest-neighbor-queries-among-curves-under-the-fr-echet-distance-2004.08444"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-total-interference-in-asymmetric-sensor-networks-2004.08847</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-total-interference-in-asymmetric-sensor-networks-2004.08847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-total-interference-in-asymmetric-sensor-networks-2004.08847"/></url>
<url><loc>https://scifaro.com/en/abs/planar-bichromatic-bottleneck-spanning-trees-2004.08854</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-bichromatic-bottleneck-spanning-trees-2004.08854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-bichromatic-bottleneck-spanning-trees-2004.08854"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-algorithms-for-computational-geometry-problems-2004.08949</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-algorithms-for-computational-geometry-problems-2004.08949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-algorithms-for-computational-geometry-problems-2004.08949"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-study-of-steiner-tree-on-unit-disk-graphs-2004.09220</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-study-of-steiner-tree-on-unit-disk-graphs-2004.09220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-study-of-steiner-tree-on-unit-disk-graphs-2004.09220"/></url>
<url><loc>https://scifaro.com/en/abs/linear-expected-complexity-for-directional-and-multiplicative-voronoi-diagrams-2004.09385</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-expected-complexity-for-directional-and-multiplicative-voronoi-diagrams-2004.09385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-expected-complexity-for-directional-and-multiplicative-voronoi-diagrams-2004.09385"/></url>
<url><loc>https://scifaro.com/en/abs/a-sub-linear-time-framework-for-geometric-optimization-with-outliers-in-high-dimensions-2004.10090</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sub-linear-time-framework-for-geometric-optimization-with-outliers-in-high-dimensions-2004.10090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sub-linear-time-framework-for-geometric-optimization-with-outliers-in-high-dimensions-2004.10090"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-euler-curve-transform-for-shape-and-image-analysis-2004.11128</loc><lastmod>2020-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-euler-curve-transform-for-shape-and-image-analysis-2004.11128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-euler-curve-transform-for-shape-and-image-analysis-2004.11128"/></url>
<url><loc>https://scifaro.com/en/abs/point-location-and-active-learning-learning-halfspaces-almost-optimally-2004.11380</loc><lastmod>2020-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-location-and-active-learning-learning-halfspaces-almost-optimally-2004.11380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-location-and-active-learning-learning-halfspaces-almost-optimally-2004.11380"/></url>
<url><loc>https://scifaro.com/en/abs/fr-echet-distance-for-uncertain-curves-2004.11862</loc><lastmod>2023-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-echet-distance-for-uncertain-curves-2004.11862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-echet-distance-for-uncertain-curves-2004.11862"/></url>
<url><loc>https://scifaro.com/en/abs/multi-robot-motion-planning-of-k-colored-discs-is-pspace-hard-2004.12144</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-robot-motion-planning-of-k-colored-discs-is-pspace-hard-2004.12144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-robot-motion-planning-of-k-colored-discs-is-pspace-hard-2004.12144"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-any-angle-pathfinding-on-a-sphere-2004.12781</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-any-angle-pathfinding-on-a-sphere-2004.12781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-any-angle-pathfinding-on-a-sphere-2004.12781"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-group-testing-2004.14632</loc><lastmod>2020-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-group-testing-2004.14632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-group-testing-2004.14632"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-cuts-in-geometric-intersection-graphs-2005.00858</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-cuts-in-geometric-intersection-graphs-2005.00858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-cuts-in-geometric-intersection-graphs-2005.00858"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-visibility-representations-of-undirected-pairs-of-graphs-2005.00937</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-visibility-representations-of-undirected-pairs-of-graphs-2005.00937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-visibility-representations-of-undirected-pairs-of-graphs-2005.00937"/></url>
<url><loc>https://scifaro.com/en/abs/geoopt-riemannian-optimization-in-pytorch-2005.02819</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geoopt-riemannian-optimization-in-pytorch-2005.02819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geoopt-riemannian-optimization-in-pytorch-2005.02819"/></url>
<url><loc>https://scifaro.com/en/abs/plurality-in-spatial-voting-games-with-constant-beta-2005.04799</loc><lastmod>2023-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plurality-in-spatial-voting-games-with-constant-beta-2005.04799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plurality-in-spatial-voting-games-with-constant-beta-2005.04799"/></url>
<url><loc>https://scifaro.com/en/abs/on-radial-isotropic-position-theory-and-algorithms-2005.04918</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-radial-isotropic-position-theory-and-algorithms-2005.04918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-radial-isotropic-position-theory-and-algorithms-2005.04918"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-mathrm-cvp-p-in-time-2-0-802-n-2005.04957</loc><lastmod>2020-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-mathrm-cvp-p-in-time-2-0-802-n-2005.04957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-mathrm-cvp-p-in-time-2-0-802-n-2005.04957"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-p-mean-curve-of-large-data-sets-2005.06672</loc><lastmod>2021-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-p-mean-curve-of-large-data-sets-2005.06672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-p-mean-curve-of-large-data-sets-2005.06672"/></url>
<url><loc>https://scifaro.com/en/abs/local-gathering-of-mobile-robots-in-three-dimensions-2005.07495</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-gathering-of-mobile-robots-in-three-dimensions-2005.07495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-gathering-of-mobile-robots-in-three-dimensions-2005.07495"/></url>
<url><loc>https://scifaro.com/en/abs/output-sensitive-algorithms-for-approximate-incidences-and-their-applications-2005.08193</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/output-sensitive-algorithms-for-approximate-incidences-and-their-applications-2005.08193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/output-sensitive-algorithms-for-approximate-incidences-and-their-applications-2005.08193"/></url>
<url><loc>https://scifaro.com/en/abs/a-tropical-geometry-approach-to-bibo-stability-2005.08541</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tropical-geometry-approach-to-bibo-stability-2005.08541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tropical-geometry-approach-to-bibo-stability-2005.08541"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-convex-containers-of-polygons-ii-2005.10245</loc><lastmod>2020-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-convex-containers-of-polygons-ii-2005.10245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-convex-containers-of-polygons-ii-2005.10245"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-index-structure-supporting-fr-echet-proximity-queries-among-trajectories-2005.13773</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-index-structure-supporting-fr-echet-proximity-queries-among-trajectories-2005.13773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-index-structure-supporting-fr-echet-proximity-queries-among-trajectories-2005.13773"/></url>
<url><loc>https://scifaro.com/en/abs/negative-instance-for-the-edge-patrolling-beacon-problem-2006.01202</loc><lastmod>2020-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negative-instance-for-the-edge-patrolling-beacon-problem-2006.01202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negative-instance-for-the-edge-patrolling-beacon-problem-2006.01202"/></url>
<url><loc>https://scifaro.com/en/abs/zone-theorem-for-arrangements-in-three-dimensions-2006.01428</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zone-theorem-for-arrangements-in-three-dimensions-2006.01428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zone-theorem-for-arrangements-in-three-dimensions-2006.01428"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-expression-for-filling-congruent-circles-in-a-circle-2006.03819</loc><lastmod>2020-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-expression-for-filling-congruent-circles-in-a-circle-2006.03819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-expression-for-filling-congruent-circles-in-a-circle-2006.03819"/></url>
<url><loc>https://scifaro.com/en/abs/space-aware-reconfiguration-2006.04402</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-aware-reconfiguration-2006.04402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-aware-reconfiguration-2006.04402"/></url>
<url><loc>https://scifaro.com/en/abs/condition-numbers-for-the-cube-i-univariate-polynomials-and-hypersurfaces-2006.04423</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/condition-numbers-for-the-cube-i-univariate-polynomials-and-hypersurfaces-2006.04423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/condition-numbers-for-the-cube-i-univariate-polynomials-and-hypersurfaces-2006.04423"/></url>
<url><loc>https://scifaro.com/en/abs/unsupervised-learning-of-3d-point-set-registration-2006.06200</loc><lastmod>2020-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsupervised-learning-of-3d-point-set-registration-2006.06200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsupervised-learning-of-3d-point-set-registration-2006.06200"/></url>
<url><loc>https://scifaro.com/en/abs/on-voronoi-diagrams-and-dual-delaunay-complexes-on-the-information-geometric-cauchy-manifolds-2006.07020</loc><lastmod>2020-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-voronoi-diagrams-and-dual-delaunay-complexes-on-the-information-geometric-cauchy-manifolds-2006.07020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-voronoi-diagrams-and-dual-delaunay-complexes-on-the-information-geometric-cauchy-manifolds-2006.07020"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-mean-curvature-flow-for-surface-parametrizations-2006.07392</loc><lastmod>2020-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-mean-curvature-flow-for-surface-parametrizations-2006.07392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-mean-curvature-flow-for-surface-parametrizations-2006.07392"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-planar-two-center-algorithms-2006.10365</loc><lastmod>2020-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-planar-two-center-algorithms-2006.10365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-planar-two-center-algorithms-2006.10365"/></url>
<url><loc>https://scifaro.com/en/abs/duality-based-approximation-algorithms-for-depth-queries-and-maximum-depth-2006.12318</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duality-based-approximation-algorithms-for-depth-queries-and-maximum-depth-2006.12318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duality-based-approximation-algorithms-for-depth-queries-and-maximum-depth-2006.12318"/></url>
<url><loc>https://scifaro.com/en/abs/distance-bounds-for-high-dimensional-consistent-digital-rays-and-2-d-partially-consistent-digital-rays-2006.14059</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-bounds-for-high-dimensional-consistent-digital-rays-and-2-d-partially-consistent-digital-rays-2006.14059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-bounds-for-high-dimensional-consistent-digital-rays-and-2-d-partially-consistent-digital-rays-2006.14059"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-constructing-orthogonal-floor-plans-with-minimum-number-of-bends-2006.14182</loc><lastmod>2020-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-constructing-orthogonal-floor-plans-with-minimum-number-of-bends-2006.14182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-constructing-orthogonal-floor-plans-with-minimum-number-of-bends-2006.14182"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-practical-algorithm-and-implementation-for-computing-multiplicatively-weighted-voronoi-diagrams-2006.14298</loc><lastmod>2020-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-practical-algorithm-and-implementation-for-computing-multiplicatively-weighted-voronoi-diagrams-2006.14298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-practical-algorithm-and-implementation-for-computing-multiplicatively-weighted-voronoi-diagrams-2006.14298"/></url>
<url><loc>https://scifaro.com/en/abs/cutting-polygons-into-small-pieces-with-chords-laser-based-localization-2006.15089</loc><lastmod>2020-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cutting-polygons-into-small-pieces-with-chords-laser-based-localization-2006.15089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cutting-polygons-into-small-pieces-with-chords-laser-based-localization-2006.15089"/></url>
<url><loc>https://scifaro.com/en/abs/social-distancing-is-good-for-points-too-2006.15650</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/social-distancing-is-good-for-points-too-2006.15650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/social-distancing-is-good-for-points-too-2006.15650"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-maximum-distance-traveled-to-form-patterns-with-systems-of-mobile-robots-2006.15664</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-maximum-distance-traveled-to-form-patterns-with-systems-of-mobile-robots-2006.15664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-maximum-distance-traveled-to-form-patterns-with-systems-of-mobile-robots-2006.15664"/></url>
<url><loc>https://scifaro.com/en/abs/subspace-approximation-with-outliers-2006.16573</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subspace-approximation-with-outliers-2006.16573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subspace-approximation-with-outliers-2006.16573"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-guarding-for-dynamic-orthogonal-art-galleries-2006.16651</loc><lastmod>2021-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-guarding-for-dynamic-orthogonal-art-galleries-2006.16651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-guarding-for-dynamic-orthogonal-art-galleries-2006.16651"/></url>
<url><loc>https://scifaro.com/en/abs/medial-axis-isoperimetric-profiles-2007.01428</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/medial-axis-isoperimetric-profiles-2007.01428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/medial-axis-isoperimetric-profiles-2007.01428"/></url>
<url><loc>https://scifaro.com/en/abs/sublinear-explicit-incremental-planar-voronoi-diagrams-2007.01686</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sublinear-explicit-incremental-planar-voronoi-diagrams-2007.01686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sublinear-explicit-incremental-planar-voronoi-diagrams-2007.01686"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-list-of-all-convex-polyhedra-made-by-gluing-regular-pentagons-2007.01753</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-list-of-all-convex-polyhedra-made-by-gluing-regular-pentagons-2007.01753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-list-of-all-convex-polyhedra-made-by-gluing-regular-pentagons-2007.01753"/></url>
<url><loc>https://scifaro.com/en/abs/improved-flat-back-3d-gadgets-in-origami-extrusions-completely-downward-compatible-with-the-conventional-pyramid-supported-3d-gadgets-2007.01859</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-flat-back-3d-gadgets-in-origami-extrusions-completely-downward-compatible-with-the-conventional-pyramid-supported-3d-gadgets-2007.01859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-flat-back-3d-gadgets-in-origami-extrusions-completely-downward-compatible-with-the-conventional-pyramid-supported-3d-gadgets-2007.01859"/></url>
<url><loc>https://scifaro.com/en/abs/skeletonization-via-local-separators-2007.03483</loc><lastmod>2020-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skeletonization-via-local-separators-2007.03483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skeletonization-via-local-separators-2007.03483"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-maximum-clique-in-geometric-superclasses-of-disk-graphs-2007.03492</loc><lastmod>2021-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-maximum-clique-in-geometric-superclasses-of-disk-graphs-2007.03492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-maximum-clique-in-geometric-superclasses-of-disk-graphs-2007.03492"/></url>
<url><loc>https://scifaro.com/en/abs/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2007.05346</loc><lastmod>2020-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2007.05346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-nearly-complete-1-planar-drawings-in-polynomial-time-2007.05346"/></url>
<url><loc>https://scifaro.com/en/abs/city-guarding-with-limited-field-of-view-2007.06052</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/city-guarding-with-limited-field-of-view-2007.06052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/city-guarding-with-limited-field-of-view-2007.06052"/></url>
<url><loc>https://scifaro.com/en/abs/predicates-of-the-3d-apollonius-diagram-2007.06658</loc><lastmod>2020-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicates-of-the-3d-apollonius-diagram-2007.06658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicates-of-the-3d-apollonius-diagram-2007.06658"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-algorithm-with-performance-guarantees-for-the-art-gallery-problem-2007.06920</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-algorithm-with-performance-guarantees-for-the-art-gallery-problem-2007.06920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-algorithm-with-performance-guarantees-for-the-art-gallery-problem-2007.06920"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximations-to-minimum-link-visibility-paths-in-simple-polygons-2007.07329</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximations-to-minimum-link-visibility-paths-in-simple-polygons-2007.07329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximations-to-minimum-link-visibility-paths-in-simple-polygons-2007.07329"/></url>
<url><loc>https://scifaro.com/en/abs/quadrilateral-mesh-generation-iii-optimizing-singularity-configuration-based-on-abel-jacobi-theory-2007.07334</loc><lastmod>2021-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadrilateral-mesh-generation-iii-optimizing-singularity-configuration-based-on-abel-jacobi-theory-2007.07334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadrilateral-mesh-generation-iii-optimizing-singularity-configuration-based-on-abel-jacobi-theory-2007.07334"/></url>
<url><loc>https://scifaro.com/en/abs/an-tilde-o-n-5-4-time-varepsilon-approximation-algorithm-for-rms-matching-in-a-plane-2007.07720</loc><lastmod>2020-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-tilde-o-n-5-4-time-varepsilon-approximation-algorithm-for-rms-matching-in-a-plane-2007.07720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-tilde-o-n-5-4-time-varepsilon-approximation-algorithm-for-rms-matching-in-a-plane-2007.07720"/></url>
<url><loc>https://scifaro.com/en/abs/a-family-of-metrics-from-the-truncated-smoothing-of-reeb-graphs-2007.07795</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-family-of-metrics-from-the-truncated-smoothing-of-reeb-graphs-2007.07795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-family-of-metrics-from-the-truncated-smoothing-of-reeb-graphs-2007.07795"/></url>
<url><loc>https://scifaro.com/en/abs/empty-rainbow-triangles-in-k-colored-point-sets-2007.07863</loc><lastmod>2020-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/empty-rainbow-triangles-in-k-colored-point-sets-2007.07863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/empty-rainbow-triangles-in-k-colored-point-sets-2007.07863"/></url>
<url><loc>https://scifaro.com/en/abs/coloring-and-maximum-weight-independent-set-of-rectangles-2007.07880</loc><lastmod>2020-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coloring-and-maximum-weight-independent-set-of-rectangles-2007.07880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coloring-and-maximum-weight-independent-set-of-rectangles-2007.07880"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-morph-graphs-on-the-torus-2007.07927</loc><lastmod>2020-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-morph-graphs-on-the-torus-2007.07927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-morph-graphs-on-the-torus-2007.07927"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-angle-bounds-for-quadrilateral-meshes-2007.07983</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-angle-bounds-for-quadrilateral-meshes-2007.07983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-angle-bounds-for-quadrilateral-meshes-2007.07983"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-continuous-fr-echet-distance-2007.07994</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-continuous-fr-echet-distance-2007.07994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-continuous-fr-echet-distance-2007.07994"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-products-of-ranks-2007.08123</loc><lastmod>2020-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-products-of-ranks-2007.08123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-products-of-ranks-2007.08123"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-watchman-tours-in-simple-polygons-under-rotated-monotone-visibility-2007.08368</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-watchman-tours-in-simple-polygons-under-rotated-monotone-visibility-2007.08368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-watchman-tours-in-simple-polygons-under-rotated-monotone-visibility-2007.08368"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-algorithms-for-tverberg-partitions-2007.08717</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-algorithms-for-tverberg-partitions-2007.08717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-algorithms-for-tverberg-partitions-2007.08717"/></url>
<url><loc>https://scifaro.com/en/abs/reliable-spanners-for-metric-spaces-2007.08738</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reliable-spanners-for-metric-spaces-2007.08738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reliable-spanners-for-metric-spaces-2007.08738"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-algorithm-for-the-planar-two-center-problem-2007.08784</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-algorithm-for-the-planar-two-center-problem-2007.08784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-algorithm-for-the-planar-two-center-problem-2007.08784"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-approximate-skeleton-with-guarantees-for-any-cloud-of-points-in-a-euclidean-space-2007.08900</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-approximate-skeleton-with-guarantees-for-any-cloud-of-points-in-a-euclidean-space-2007.08900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-approximate-skeleton-with-guarantees-for-any-cloud-of-points-in-a-euclidean-space-2007.08900"/></url>
<url><loc>https://scifaro.com/en/abs/escaping-a-polygon-2007.08965</loc><lastmod>2025-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/escaping-a-polygon-2007.08965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/escaping-a-polygon-2007.08965"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-secure-path-in-a-voronoi-diagram-2007.09773</loc><lastmod>2021-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-secure-path-in-a-voronoi-diagram-2007.09773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-secure-path-in-a-voronoi-diagram-2007.09773"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-stabbing-convex-bodies-with-points-lines-and-flats-2007.09874</loc><lastmod>2022-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-stabbing-convex-bodies-with-points-lines-and-flats-2007.09874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-stabbing-convex-bodies-with-points-lines-and-flats-2007.09874"/></url>
<url><loc>https://scifaro.com/en/abs/nonobtuse-triangulations-of-pslgs-2007.10041</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonobtuse-triangulations-of-pslgs-2007.10041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonobtuse-triangulations-of-pslgs-2007.10041"/></url>
<url><loc>https://scifaro.com/en/abs/quadrilateral-meshes-for-pslgs-2007.10074</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadrilateral-meshes-for-pslgs-2007.10074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadrilateral-meshes-for-pslgs-2007.10074"/></url>
<url><loc>https://scifaro.com/en/abs/rainbow-polygons-for-colored-point-sets-in-the-plane-2007.10139</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rainbow-polygons-for-colored-point-sets-in-the-plane-2007.10139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rainbow-polygons-for-colored-point-sets-in-the-plane-2007.10139"/></url>
<url><loc>https://scifaro.com/en/abs/static-and-streaming-data-structures-for-fr-echet-distance-queries-2007.10898</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-and-streaming-data-structures-for-fr-echet-distance-queries-2007.10898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-and-streaming-data-structures-for-fr-echet-distance-queries-2007.10898"/></url>
<url><loc>https://scifaro.com/en/abs/the-mergegram-of-a-dendrogram-and-its-stability-2007.11278</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mergegram-of-a-dendrogram-and-its-stability-2007.11278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mergegram-of-a-dendrogram-and-its-stability-2007.11278"/></url>
<url><loc>https://scifaro.com/en/abs/point-location-in-the-arrangement-of-curves-2007.11451</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-location-in-the-arrangement-of-curves-2007.11451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-location-in-the-arrangement-of-curves-2007.11451"/></url>
<url><loc>https://scifaro.com/en/abs/light-euclidean-spanners-with-steiner-points-2007.11636</loc><lastmod>2020-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-euclidean-spanners-with-steiner-points-2007.11636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-euclidean-spanners-with-steiner-points-2007.11636"/></url>
<url><loc>https://scifaro.com/en/abs/plane-augmentation-of-plane-graphs-to-meet-parity-constraints-2007.11863</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-augmentation-of-plane-graphs-to-meet-parity-constraints-2007.11863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-augmentation-of-plane-graphs-to-meet-parity-constraints-2007.11863"/></url>
<url><loc>https://scifaro.com/en/abs/largest-triangles-in-a-polygon-2007.12330</loc><lastmod>2020-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/largest-triangles-in-a-polygon-2007.12330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/largest-triangles-in-a-polygon-2007.12330"/></url>
<url><loc>https://scifaro.com/en/abs/improving-the-dilation-of-a-metric-graph-by-adding-edges-2007.12350</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-the-dilation-of-a-metric-graph-by-adding-edges-2007.12350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-the-dilation-of-a-metric-graph-by-adding-edges-2007.12350"/></url>
<url><loc>https://scifaro.com/en/abs/rectangle-tiling-binary-arrays-2007.14142</loc><lastmod>2024-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangle-tiling-binary-arrays-2007.14142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangle-tiling-binary-arrays-2007.14142"/></url>
<url><loc>https://scifaro.com/en/abs/acutely-triangulated-stacked-and-very-ununfoldable-polyhedra-2007.14525</loc><lastmod>2020-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acutely-triangulated-stacked-and-very-ununfoldable-polyhedra-2007.14525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acutely-triangulated-stacked-and-very-ununfoldable-polyhedra-2007.14525"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-3d-graphic-statics-constrained-areas-2007.15133</loc><lastmod>2020-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-3d-graphic-statics-constrained-areas-2007.15133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-3d-graphic-statics-constrained-areas-2007.15133"/></url>
<url><loc>https://scifaro.com/en/abs/many-order-types-on-integer-grids-of-polynomial-size-2007.15334</loc><lastmod>2021-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-order-types-on-integer-grids-of-polynomial-size-2007.15334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-order-types-on-integer-grids-of-polynomial-size-2007.15334"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-point-inclusion-test-for-convex-polygons-based-on-voronoi-tessellations-2007.15385</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-point-inclusion-test-for-convex-polygons-based-on-voronoi-tessellations-2007.15385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-point-inclusion-test-for-convex-polygons-based-on-voronoi-tessellations-2007.15385"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-3d-graphic-statics-reciprocal-constructions-2007.15720</loc><lastmod>2020-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-3d-graphic-statics-reciprocal-constructions-2007.15720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-3d-graphic-statics-reciprocal-constructions-2007.15720"/></url>
<url><loc>https://scifaro.com/en/abs/new-results-in-sona-drawing-hardness-and-tsp-separation-2007.15784</loc><lastmod>2023-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-results-in-sona-drawing-hardness-and-tsp-separation-2007.15784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-results-in-sona-drawing-hardness-and-tsp-separation-2007.15784"/></url>
<url><loc>https://scifaro.com/en/abs/orientation-preserving-vectorized-distance-between-curves-2007.15924</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orientation-preserving-vectorized-distance-between-curves-2007.15924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orientation-preserving-vectorized-distance-between-curves-2007.15924"/></url>
<url><loc>https://scifaro.com/en/abs/improved-time-warp-edit-distance-a-parallel-dynamic-program-in-linear-memory-2007.16135</loc><lastmod>2020-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-time-warp-edit-distance-a-parallel-dynamic-program-in-linear-memory-2007.16135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-time-warp-edit-distance-a-parallel-dynamic-program-in-linear-memory-2007.16135"/></url>
<url><loc>https://scifaro.com/en/abs/finding-closed-quasigeodesics-on-convex-polyhedra-2008.00589</loc><lastmod>2025-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-closed-quasigeodesics-on-convex-polyhedra-2008.00589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-closed-quasigeodesics-on-convex-polyhedra-2008.00589"/></url>
<url><loc>https://scifaro.com/en/abs/gplan-computer-generated-dimensioned-floorplans-for-given-adjacencies-2008.01803</loc><lastmod>2020-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gplan-computer-generated-dimensioned-floorplans-for-given-adjacencies-2008.01803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gplan-computer-generated-dimensioned-floorplans-for-given-adjacencies-2008.01803"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-in-ell-infty-metric-2008.02071</loc><lastmod>2021-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-in-ell-infty-metric-2008.02071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-in-ell-infty-metric-2008.02071"/></url>
<url><loc>https://scifaro.com/en/abs/expected-size-of-random-tukey-layers-and-convex-layers-2008.02258</loc><lastmod>2021-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expected-size-of-random-tukey-layers-and-convex-layers-2008.02258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expected-size-of-random-tukey-layers-and-convex-layers-2008.02258"/></url>
<url><loc>https://scifaro.com/en/abs/an-evolver-program-for-weighted-steiner-trees-2008.02398</loc><lastmod>2020-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-evolver-program-for-weighted-steiner-trees-2008.02398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-evolver-program-for-weighted-steiner-trees-2008.02398"/></url>
<url><loc>https://scifaro.com/en/abs/a-sub-linear-time-algorithm-for-approximating-k-nearest-neighbor-with-full-quality-guarantee-2008.02924</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sub-linear-time-algorithm-for-approximating-k-nearest-neighbor-with-full-quality-guarantee-2008.02924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sub-linear-time-algorithm-for-approximating-k-nearest-neighbor-with-full-quality-guarantee-2008.02924"/></url>
<url><loc>https://scifaro.com/en/abs/error-resilient-space-partitioning-2008.03675</loc><lastmod>2025-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/error-resilient-space-partitioning-2008.03675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/error-resilient-space-partitioning-2008.03675"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-characterization-of-stretchable-aligned-graphs-2008.06300</loc><lastmod>2020-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-characterization-of-stretchable-aligned-graphs-2008.06300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-characterization-of-stretchable-aligned-graphs-2008.06300"/></url>
<url><loc>https://scifaro.com/en/abs/catching-a-polygonal-fish-with-a-minimum-net-2008.06337</loc><lastmod>2021-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catching-a-polygonal-fish-with-a-minimum-net-2008.06337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catching-a-polygonal-fish-with-a-minimum-net-2008.06337"/></url>
<url><loc>https://scifaro.com/en/abs/when-lipschitz-walks-your-dog-algorithm-engineering-of-the-discrete-fr-echet-distance-under-translation-2008.07510</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-lipschitz-walks-your-dog-algorithm-engineering-of-the-discrete-fr-echet-distance-under-translation-2008.07510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-lipschitz-walks-your-dog-algorithm-engineering-of-the-discrete-fr-echet-distance-under-translation-2008.07510"/></url>
<url><loc>https://scifaro.com/en/abs/planar-l-drawings-of-bimodal-graphs-2008.07834</loc><lastmod>2020-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-l-drawings-of-bimodal-graphs-2008.07834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-l-drawings-of-bimodal-graphs-2008.07834"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-algorithms-for-queue-layouts-2008.08288</loc><lastmod>2020-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-algorithms-for-queue-layouts-2008.08288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-algorithms-for-queue-layouts-2008.08288"/></url>
<url><loc>https://scifaro.com/en/abs/quality-tetrahedral-mesh-generation-with-hxt-2008.08508</loc><lastmod>2020-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quality-tetrahedral-mesh-generation-with-hxt-2008.08508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quality-tetrahedral-mesh-generation-with-hxt-2008.08508"/></url>
<url><loc>https://scifaro.com/en/abs/plane-spanning-trees-in-edge-colored-simple-drawings-of-k-n-2008.08827</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-spanning-trees-in-edge-colored-simple-drawings-of-k-n-2008.08827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-spanning-trees-in-edge-colored-simple-drawings-of-k-n-2008.08827"/></url>
<url><loc>https://scifaro.com/en/abs/on-turn-regular-orthogonal-representations-2008.09002</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-turn-regular-orthogonal-representations-2008.09002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-turn-regular-orthogonal-representations-2008.09002"/></url>
<url><loc>https://scifaro.com/en/abs/2-epsilon-ann-for-time-series-under-the-fr-echet-distance-2008.09406</loc><lastmod>2021-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-epsilon-ann-for-time-series-under-the-fr-echet-distance-2008.09406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-epsilon-ann-for-time-series-under-the-fr-echet-distance-2008.09406"/></url>
<url><loc>https://scifaro.com/en/abs/polygons-with-prescribed-angles-in-2d-and-3d-2008.10192</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygons-with-prescribed-angles-in-2d-and-3d-2008.10192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygons-with-prescribed-angles-in-2d-and-3d-2008.10192"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-real-isolated-points-of-an-algebraic-hypersurface-2008.10331</loc><lastmod>2020-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-real-isolated-points-of-an-algebraic-hypersurface-2008.10331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-real-isolated-points-of-an-algebraic-hypersurface-2008.10331"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-linear-program-for-bend-minimization-in-ortho-radial-drawings-2008.10373</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-linear-program-for-bend-minimization-in-ortho-radial-drawings-2008.10373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-linear-program-for-bend-minimization-in-ortho-radial-drawings-2008.10373"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-gradient-descent-works-really-well-for-stress-minimization-2008.10376</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-gradient-descent-works-really-well-for-stress-minimization-2008.10376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-gradient-descent-works-really-well-for-stress-minimization-2008.10376"/></url>
<url><loc>https://scifaro.com/en/abs/limiting-crossing-numbers-for-geodesic-drawings-on-the-sphere-2008.10459</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limiting-crossing-numbers-for-geodesic-drawings-on-the-sphere-2008.10459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limiting-crossing-numbers-for-geodesic-drawings-on-the-sphere-2008.10459"/></url>
<url><loc>https://scifaro.com/en/abs/simple-topological-drawings-of-k-planar-graphs-2008.10794</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-topological-drawings-of-k-planar-graphs-2008.10794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-topological-drawings-of-k-planar-graphs-2008.10794"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-maximum-number-of-crossings-in-star-simple-drawings-of-k-n-with-no-empty-lens-2008.11058</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-maximum-number-of-crossings-in-star-simple-drawings-of-k-n-with-no-empty-lens-2008.11058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-maximum-number-of-crossings-in-star-simple-drawings-of-k-n-with-no-empty-lens-2008.11058"/></url>
<url><loc>https://scifaro.com/en/abs/flip-paths-between-lattice-triangulations-2008.11292</loc><lastmod>2024-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-paths-between-lattice-triangulations-2008.11292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-paths-between-lattice-triangulations-2008.11292"/></url>
<url><loc>https://scifaro.com/en/abs/a-topological-similarity-measure-between-multi-field-data-using-multi-resolution-reeb-spaces-2008.12567</loc><lastmod>2020-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-topological-similarity-measure-between-multi-field-data-using-multi-resolution-reeb-spaces-2008.12567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-topological-similarity-measure-between-multi-field-data-using-multi-resolution-reeb-spaces-2008.12567"/></url>
<url><loc>https://scifaro.com/en/abs/on-polyhedral-realization-with-isosceles-triangles-2009.00116</loc><lastmod>2021-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-polyhedral-realization-with-isosceles-triangles-2009.00116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-polyhedral-realization-with-isosceles-triangles-2009.00116"/></url>
<url><loc>https://scifaro.com/en/abs/isotopic-arrangement-of-simple-curves-an-exact-numerical-approach-based-on-subdivision-2009.00811</loc><lastmod>2020-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isotopic-arrangement-of-simple-curves-an-exact-numerical-approach-based-on-subdivision-2009.00811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isotopic-arrangement-of-simple-curves-an-exact-numerical-approach-based-on-subdivision-2009.00811"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-k-ell-median-clustering-for-polygonal-curves-2009.01488</loc><lastmod>2020-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-k-ell-median-clustering-for-polygonal-curves-2009.01488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-k-ell-median-clustering-for-polygonal-curves-2009.01488"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-linear-time-constrained-triangulation-using-simplified-earcut-2009.04294</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-linear-time-constrained-triangulation-using-simplified-earcut-2009.04294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-linear-time-constrained-triangulation-using-simplified-earcut-2009.04294"/></url>
<url><loc>https://scifaro.com/en/abs/2d-fractional-cascading-on-axis-aligned-planar-subdivisions-2009.05541</loc><lastmod>2020-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2d-fractional-cascading-on-axis-aligned-planar-subdivisions-2009.05541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2d-fractional-cascading-on-axis-aligned-planar-subdivisions-2009.05541"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-degree-spanners-in-the-presence-of-polygonal-obstacles-2009.06879</loc><lastmod>2020-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-degree-spanners-in-the-presence-of-polygonal-obstacles-2009.06879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-degree-spanners-in-the-presence-of-polygonal-obstacles-2009.06879"/></url>
<url><loc>https://scifaro.com/en/abs/steady-and-ranging-sets-in-graph-persistence-2009.06897</loc><lastmod>2022-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steady-and-ranging-sets-in-graph-persistence-2009.06897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steady-and-ranging-sets-in-graph-persistence-2009.06897"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-outer-1-planar-graphs-revisited-2009.07106</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-outer-1-planar-graphs-revisited-2009.07106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-outer-1-planar-graphs-revisited-2009.07106"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-packedness-of-polygonal-curves-2009.07789</loc><lastmod>2020-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-packedness-of-polygonal-curves-2009.07789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-packedness-of-polygonal-curves-2009.07789"/></url>
<url><loc>https://scifaro.com/en/abs/1d-and-2d-flow-routing-on-a-terrain-2009.08014</loc><lastmod>2020-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1d-and-2d-flow-routing-on-a-terrain-2009.08014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1d-and-2d-flow-routing-on-a-terrain-2009.08014"/></url>
<url><loc>https://scifaro.com/en/abs/using-zigzag-persistent-homology-to-detect-hopf-bifurcations-in-dynamical-systems-2009.08972</loc><lastmod>2020-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-zigzag-persistent-homology-to-detect-hopf-bifurcations-in-dynamical-systems-2009.08972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-zigzag-persistent-homology-to-detect-hopf-bifurcations-in-dynamical-systems-2009.08972"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-positively-invariant-sets-inductive-and-topological-methods-2009.09797</loc><lastmod>2022-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-positively-invariant-sets-inductive-and-topological-methods-2009.09797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-positively-invariant-sets-inductive-and-topological-methods-2009.09797"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-approximation-for-discriminating-and-identifying-code-problems-in-geometric-setups-2009.10353</loc><lastmod>2023-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-approximation-for-discriminating-and-identifying-code-problems-in-geometric-setups-2009.10353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-approximation-for-discriminating-and-identifying-code-problems-in-geometric-setups-2009.10353"/></url>
<url><loc>https://scifaro.com/en/abs/on-two-handed-planar-assembly-partitioning-with-connectivity-constraints-2009.12369</loc><lastmod>2023-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-two-handed-planar-assembly-partitioning-with-connectivity-constraints-2009.12369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-two-handed-planar-assembly-partitioning-with-connectivity-constraints-2009.12369"/></url>
<url><loc>https://scifaro.com/en/abs/epsilon-net-induced-lazy-witness-complexes-on-graphs-2009.13071</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epsilon-net-induced-lazy-witness-complexes-on-graphs-2009.13071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epsilon-net-induced-lazy-witness-complexes-on-graphs-2009.13071"/></url>
<url><loc>https://scifaro.com/en/abs/a-task-based-approach-to-parallel-parametric-linear-programming-solving-and-application-to-polyhedral-computations-2009.14435</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-task-based-approach-to-parallel-parametric-linear-programming-solving-and-application-to-polyhedral-computations-2009.14435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-task-based-approach-to-parallel-parametric-linear-programming-solving-and-application-to-polyhedral-computations-2009.14435"/></url>
<url><loc>https://scifaro.com/en/abs/the-online-broadcast-range-assignment-problem-2009.14473</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-online-broadcast-range-assignment-problem-2009.14473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-online-broadcast-range-assignment-problem-2009.14473"/></url>
<url><loc>https://scifaro.com/en/abs/between-shapes-using-the-hausdorff-distance-2009.14719</loc><lastmod>2021-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/between-shapes-using-the-hausdorff-distance-2009.14719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/between-shapes-using-the-hausdorff-distance-2009.14719"/></url>
<url><loc>https://scifaro.com/en/abs/lum-awig-an-efficient-algorithm-for-dimension-zero-bottleneck-distance-computation-in-topological-data-analysis-2010.00371</loc><lastmod>2020-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lum-awig-an-efficient-algorithm-for-dimension-zero-bottleneck-distance-computation-in-topological-data-analysis-2010.00371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lum-awig-an-efficient-algorithm-for-dimension-zero-bottleneck-distance-computation-in-topological-data-analysis-2010.00371"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-embedded-caterpillars-with-weak-unit-disk-contact-representations-is-np-hard-2010.01881</loc><lastmod>2020-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-embedded-caterpillars-with-weak-unit-disk-contact-representations-is-np-hard-2010.01881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-embedded-caterpillars-with-weak-unit-disk-contact-representations-is-np-hard-2010.01881"/></url>
<url><loc>https://scifaro.com/en/abs/weak-unit-disk-contact-representations-for-graphs-without-embedding-2010.01886</loc><lastmod>2020-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-unit-disk-contact-representations-for-graphs-without-embedding-2010.01886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-unit-disk-contact-representations-for-graphs-without-embedding-2010.01886"/></url>
<url><loc>https://scifaro.com/en/abs/on-euclidean-steiner-1-epsilon-spanners-2010.02908</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-euclidean-steiner-1-epsilon-spanners-2010.02908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-euclidean-steiner-1-epsilon-spanners-2010.02908"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-sampling-from-feasible-sets-of-sdps-and-volume-approximation-2010.03817</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-sampling-from-feasible-sets-of-sdps-and-volume-approximation-2010.03817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-sampling-from-feasible-sets-of-sdps-and-volume-approximation-2010.03817"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-ratios-for-two-euclidean-maximum-spanning-tree-problems-2010.03870</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-ratios-for-two-euclidean-maximum-spanning-tree-problems-2010.03870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-ratios-for-two-euclidean-maximum-spanning-tree-problems-2010.03870"/></url>
<url><loc>https://scifaro.com/en/abs/intrinsic-hierarchical-clustering-behavior-recovers-higher-dimensional-shape-information-2010.03894</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intrinsic-hierarchical-clustering-behavior-recovers-higher-dimensional-shape-information-2010.03894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intrinsic-hierarchical-clustering-behavior-recovers-higher-dimensional-shape-information-2010.03894"/></url>
<url><loc>https://scifaro.com/en/abs/closest-pair-queries-and-minimum-weight-queries-are-equivalent-for-squares-2010.06463</loc><lastmod>2020-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closest-pair-queries-and-minimum-weight-queries-are-equivalent-for-squares-2010.06463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closest-pair-queries-and-minimum-weight-queries-are-equivalent-for-squares-2010.06463"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-persistent-homology-based-functions-2010.08356</loc><lastmod>2021-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-persistent-homology-based-functions-2010.08356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-persistent-homology-based-functions-2010.08356"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-among-obstacles-in-the-plane-revisited-2010.09115</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-among-obstacles-in-the-plane-revisited-2010.09115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-among-obstacles-in-the-plane-revisited-2010.09115"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-algorithm-to-calculate-cap-discrepancy-2010.10454</loc><lastmod>2020-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-algorithm-to-calculate-cap-discrepancy-2010.10454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-algorithm-to-calculate-cap-discrepancy-2010.10454"/></url>
<url><loc>https://scifaro.com/en/abs/minvo-basis-finding-simplexes-with-minimum-volume-enclosing-polynomial-curves-2010.10726</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minvo-basis-finding-simplexes-with-minimum-volume-enclosing-polynomial-curves-2010.10726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minvo-basis-finding-simplexes-with-minimum-volume-enclosing-polynomial-curves-2010.10726"/></url>
<url><loc>https://scifaro.com/en/abs/a-4-approximation-of-the-frac-2-pi-3-mst-2010.11571</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-4-approximation-of-the-frac-2-pi-3-mst-2010.11571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-4-approximation-of-the-frac-2-pi-3-mst-2010.11571"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-separability-using-orthogonal-objects-2010.12227</loc><lastmod>2022-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-separability-using-orthogonal-objects-2010.12227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-separability-using-orthogonal-objects-2010.12227"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-two-posets-2010.12928</loc><lastmod>2020-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-two-posets-2010.12928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-two-posets-2010.12928"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-optimal-degree-three-spanners-of-the-square-lattice-2010.13473</loc><lastmod>2026-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-optimal-degree-three-spanners-of-the-square-lattice-2010.13473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-optimal-degree-three-spanners-of-the-square-lattice-2010.13473"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-large-asymptotics-of-3-manifold-quantum-invariants-2010.14316</loc><lastmod>2020-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-large-asymptotics-of-3-manifold-quantum-invariants-2010.14316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-large-asymptotics-of-3-manifold-quantum-invariants-2010.14316"/></url>
<url><loc>https://scifaro.com/en/abs/explainable-artificial-intelligence-for-manufacturing-cost-estimation-and-machining-feature-visualization-2010.14824</loc><lastmod>2022-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explainable-artificial-intelligence-for-manufacturing-cost-estimation-and-machining-feature-visualization-2010.14824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explainable-artificial-intelligence-for-manufacturing-cost-estimation-and-machining-feature-visualization-2010.14824"/></url>
<url><loc>https://scifaro.com/en/abs/free-boundary-conformal-parameterization-of-point-clouds-2010.15399</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-boundary-conformal-parameterization-of-point-clouds-2010.15399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-boundary-conformal-parameterization-of-point-clouds-2010.15399"/></url>
<url><loc>https://scifaro.com/en/abs/a-secure-two-party-computation-protocol-for-intersection-detection-between-two-convex-hulls-2011.00319</loc><lastmod>2021-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-secure-two-party-computation-protocol-for-intersection-detection-between-two-convex-hulls-2011.00319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-secure-two-party-computation-protocol-for-intersection-detection-between-two-convex-hulls-2011.00319"/></url>
<url><loc>https://scifaro.com/en/abs/affine-invariant-triangulations-2011.02197</loc><lastmod>2020-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/affine-invariant-triangulations-2011.02197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/affine-invariant-triangulations-2011.02197"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-extension-via-reflection-2011.03107</loc><lastmod>2023-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-extension-via-reflection-2011.03107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-extension-via-reflection-2011.03107"/></url>
<url><loc>https://scifaro.com/en/abs/mapper-interactive-a-scalable-extendable-and-interactive-toolbox-for-the-visual-exploration-of-high-dimensional-data-2011.03209</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mapper-interactive-a-scalable-extendable-and-interactive-toolbox-for-the-visual-exploration-of-high-dimensional-data-2011.03209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mapper-interactive-a-scalable-extendable-and-interactive-toolbox-for-the-visual-exploration-of-high-dimensional-data-2011.03209"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-fault-tolerant-geometric-spanners-for-weighted-points-2011.03354</loc><lastmod>2020-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-fault-tolerant-geometric-spanners-for-weighted-points-2011.03354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-fault-tolerant-geometric-spanners-for-weighted-points-2011.03354"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-higher-order-delaunay-mosaics-and-alpha-shapes-2011.03617</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-higher-order-delaunay-mosaics-and-alpha-shapes-2011.03617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-higher-order-delaunay-mosaics-and-alpha-shapes-2011.03617"/></url>
<url><loc>https://scifaro.com/en/abs/a-gap-eth-tight-approximation-scheme-for-euclidean-tsp-2011.03778</loc><lastmod>2024-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gap-eth-tight-approximation-scheme-for-euclidean-tsp-2011.03778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gap-eth-tight-approximation-scheme-for-euclidean-tsp-2011.03778"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-predictor-corrector-type-incremental-algorithm-for-the-construction-of-weighted-straight-skeletons-based-on-the-notion-of-deforming-polygon-2011.07107</loc><lastmod>2020-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-predictor-corrector-type-incremental-algorithm-for-the-construction-of-weighted-straight-skeletons-based-on-the-notion-of-deforming-polygon-2011.07107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-predictor-corrector-type-incremental-algorithm-for-the-construction-of-weighted-straight-skeletons-based-on-the-notion-of-deforming-polygon-2011.07107"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-delaunay-triangulations-of-hyperbolic-surfaces-2011.09847</loc><lastmod>2020-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-delaunay-triangulations-of-hyperbolic-surfaces-2011.09847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-delaunay-triangulations-of-hyperbolic-surfaces-2011.09847"/></url>
<url><loc>https://scifaro.com/en/abs/fast-conformal-parameterization-of-disks-and-sphere-sectors-2011.09875</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-conformal-parameterization-of-disks-and-sphere-sectors-2011.09875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-conformal-parameterization-of-disks-and-sphere-sectors-2011.09875"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-polygons-and-visibility-graphs-among-dynamic-polygonal-obstacles-in-the-plane-2011.09925</loc><lastmod>2020-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-polygons-and-visibility-graphs-among-dynamic-polygonal-obstacles-in-the-plane-2011.09925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-polygons-and-visibility-graphs-among-dynamic-polygonal-obstacles-in-the-plane-2011.09925"/></url>
<url><loc>https://scifaro.com/en/abs/escherization-with-generalized-distance-functions-focusing-on-local-structural-similarity-2011.10175</loc><lastmod>2020-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/escherization-with-generalized-distance-functions-focusing-on-local-structural-similarity-2011.10175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/escherization-with-generalized-distance-functions-focusing-on-local-structural-similarity-2011.10175"/></url>
<url><loc>https://scifaro.com/en/abs/harmonic-algorithms-for-packing-d-dimensional-cuboids-into-bins-2011.10963</loc><lastmod>2021-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/harmonic-algorithms-for-packing-d-dimensional-cuboids-into-bins-2011.10963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/harmonic-algorithms-for-packing-d-dimensional-cuboids-into-bins-2011.10963"/></url>
<url><loc>https://scifaro.com/en/abs/tiling-with-squares-and-packing-dominos-in-polynomial-time-2011.10983</loc><lastmod>2021-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tiling-with-squares-and-packing-dominos-in-polynomial-time-2011.10983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tiling-with-squares-and-packing-dominos-in-polynomial-time-2011.10983"/></url>
<url><loc>https://scifaro.com/en/abs/differentiable-computational-geometry-for-2d-and-3d-machine-learning-2011.11134</loc><lastmod>2020-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentiable-computational-geometry-for-2d-and-3d-machine-learning-2011.11134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentiable-computational-geometry-for-2d-and-3d-machine-learning-2011.11134"/></url>
<url><loc>https://scifaro.com/en/abs/metric-transforms-and-low-rank-matrices-via-representation-theory-of-the-real-hyperrectangle-2011.11503</loc><lastmod>2021-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-transforms-and-low-rank-matrices-via-representation-theory-of-the-real-hyperrectangle-2011.11503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-transforms-and-low-rank-matrices-via-representation-theory-of-the-real-hyperrectangle-2011.11503"/></url>
<url><loc>https://scifaro.com/en/abs/the-interconnectivity-vector-a-finite-dimensional-vector-representation-of-persistent-homology-2011.11579</loc><lastmod>2020-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-interconnectivity-vector-a-finite-dimensional-vector-representation-of-persistent-homology-2011.11579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-interconnectivity-vector-a-finite-dimensional-vector-representation-of-persistent-homology-2011.11579"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-and-computation-of-feasible-trajectories-for-an-articulated-probe-with-a-variable-length-end-segment-2011.11672</loc><lastmod>2020-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-and-computation-of-feasible-trajectories-for-an-articulated-probe-with-a-variable-length-end-segment-2011.11672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-and-computation-of-feasible-trajectories-for-an-articulated-probe-with-a-variable-length-end-segment-2011.11672"/></url>
<url><loc>https://scifaro.com/en/abs/computing-feasible-trajectories-for-an-articulated-probe-in-three-dimensions-2011.11685</loc><lastmod>2020-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-feasible-trajectories-for-an-articulated-probe-in-three-dimensions-2011.11685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-feasible-trajectories-for-an-articulated-probe-in-three-dimensions-2011.11685"/></url>
<url><loc>https://scifaro.com/en/abs/competitive-location-problems-balanced-facility-location-and-the-one-round-manhattan-voronoi-game-2011.13275</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/competitive-location-problems-balanced-facility-location-and-the-one-round-manhattan-voronoi-game-2011.13275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/competitive-location-problems-balanced-facility-location-and-the-one-round-manhattan-voronoi-game-2011.13275"/></url>
<url><loc>https://scifaro.com/en/abs/hexgen-and-hex2spline-polycube-based-hexahedral-mesh-generation-and-spline-modeling-for-isogeometric-analysis-applications-in-ls-dyna-2011.14213</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hexgen-and-hex2spline-polycube-based-hexahedral-mesh-generation-and-spline-modeling-for-isogeometric-analysis-applications-in-ls-dyna-2011.14213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hexgen-and-hex2spline-polycube-based-hexahedral-mesh-generation-and-spline-modeling-for-isogeometric-analysis-applications-in-ls-dyna-2011.14213"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-order-type-graphs-using-an-axiomatic-approach-2011.14282</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-order-type-graphs-using-an-axiomatic-approach-2011.14282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-order-type-graphs-using-an-axiomatic-approach-2011.14282"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-factor-approximation-for-navigating-through-connected-obstacles-in-the-plane-2011.14463</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-navigating-through-connected-obstacles-in-the-plane-2011.14463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-factor-approximation-for-navigating-through-connected-obstacles-in-the-plane-2011.14463"/></url>
<url><loc>https://scifaro.com/en/abs/homology-localization-through-the-looking-glass-of-parameterized-complexity-theory-2011.14490</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homology-localization-through-the-looking-glass-of-parameterized-complexity-theory-2011.14490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homology-localization-through-the-looking-glass-of-parameterized-complexity-theory-2011.14490"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-semialgebraic-range-searching-and-stabbing-problems-2012.00704</loc><lastmod>2021-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-semialgebraic-range-searching-and-stabbing-problems-2012.00704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-semialgebraic-range-searching-and-stabbing-problems-2012.00704"/></url>
<url><loc>https://scifaro.com/en/abs/local-routing-in-a-tree-metric-1-spanner-2012.00959</loc><lastmod>2021-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-routing-in-a-tree-metric-1-spanner-2012.00959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-routing-in-a-tree-metric-1-spanner-2012.00959"/></url>
<url><loc>https://scifaro.com/en/abs/a-natural-extension-to-the-convex-hull-problem-and-a-novel-solution-2012.01216</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-natural-extension-to-the-convex-hull-problem-and-a-novel-solution-2012.01216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-natural-extension-to-the-convex-hull-problem-and-a-novel-solution-2012.01216"/></url>
<url><loc>https://scifaro.com/en/abs/a-sparse-delaunay-filtration-2012.01947</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sparse-delaunay-filtration-2012.01947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sparse-delaunay-filtration-2012.01947"/></url>
<url><loc>https://scifaro.com/en/abs/sketching-persistence-diagrams-2012.01967</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sketching-persistence-diagrams-2012.01967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sketching-persistence-diagrams-2012.01967"/></url>
<url><loc>https://scifaro.com/en/abs/light-euclidean-steiner-spanners-in-the-plane-2012.02216</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-euclidean-steiner-spanners-in-the-plane-2012.02216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-euclidean-steiner-spanners-in-the-plane-2012.02216"/></url>
<url><loc>https://scifaro.com/en/abs/saturated-k-plane-drawings-with-few-edges-2012.02281</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/saturated-k-plane-drawings-with-few-edges-2012.02281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/saturated-k-plane-drawings-with-few-edges-2012.02281"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-contractibility-of-compressed-curves-on-3-manifold-boundaries-2012.02352</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-contractibility-of-compressed-curves-on-3-manifold-boundaries-2012.02352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-contractibility-of-compressed-curves-on-3-manifold-boundaries-2012.02352"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-algorithms-for-point-line-covering-problems-2012.02363</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-algorithms-for-point-line-covering-problems-2012.02363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-algorithms-for-point-line-covering-problems-2012.02363"/></url>
<url><loc>https://scifaro.com/en/abs/automatically-building-diagrams-for-olympiad-geometry-problems-2012.02590</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatically-building-diagrams-for-olympiad-geometry-problems-2012.02590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatically-building-diagrams-for-olympiad-geometry-problems-2012.02590"/></url>
<url><loc>https://scifaro.com/en/abs/dual-regularized-optimal-transport-2012.03126</loc><lastmod>2020-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-regularized-optimal-transport-2012.03126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-regularized-optimal-transport-2012.03126"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-minimum-convex-partition-of-point-sets-with-integer-programming-2012.03381</loc><lastmod>2020-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-minimum-convex-partition-of-point-sets-with-integer-programming-2012.03381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-minimum-convex-partition-of-point-sets-with-integer-programming-2012.03381"/></url>
<url><loc>https://scifaro.com/en/abs/using-topological-autoencoders-as-a-filtering-function-for-global-and-local-topology-2012.03383</loc><lastmod>2021-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-topological-autoencoders-as-a-filtering-function-for-global-and-local-topology-2012.03383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-topological-autoencoders-as-a-filtering-function-for-global-and-local-topology-2012.03383"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-packedness-of-curves-2012.04403</loc><lastmod>2022-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-packedness-of-curves-2012.04403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-packedness-of-curves-2012.04403"/></url>
<url><loc>https://scifaro.com/en/abs/dual-perspective-method-for-solving-the-point-in-a-polygon-problem-2012.05001</loc><lastmod>2020-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-perspective-method-for-solving-the-point-in-a-polygon-problem-2012.05001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-perspective-method-for-solving-the-point-in-a-polygon-problem-2012.05001"/></url>
<url><loc>https://scifaro.com/en/abs/route-reconstruction-from-traffic-flow-via-representative-trajectories-2012.05019</loc><lastmod>2020-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/route-reconstruction-from-traffic-flow-via-representative-trajectories-2012.05019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/route-reconstruction-from-traffic-flow-via-representative-trajectories-2012.05019"/></url>
<url><loc>https://scifaro.com/en/abs/compact-concurrent-or-ordered-matrix-based-packing-arrangement-computation-technique-2012.05148</loc><lastmod>2020-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-concurrent-or-ordered-matrix-based-packing-arrangement-computation-technique-2012.05148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-concurrent-or-ordered-matrix-based-packing-arrangement-computation-technique-2012.05148"/></url>
<url><loc>https://scifaro.com/en/abs/book-embeddings-of-k-map-graphs-2012.06874</loc><lastmod>2023-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/book-embeddings-of-k-map-graphs-2012.06874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/book-embeddings-of-k-map-graphs-2012.06874"/></url>
<url><loc>https://scifaro.com/en/abs/largest-similar-copies-of-convex-polygons-amidst-polygonal-obstacles-2012.06978</loc><lastmod>2020-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/largest-similar-copies-of-convex-polygons-amidst-polygonal-obstacles-2012.06978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/largest-similar-copies-of-convex-polygons-amidst-polygonal-obstacles-2012.06978"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-optimal-extension-of-simple-drawings-2012.07457</loc><lastmod>2020-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-optimal-extension-of-simple-drawings-2012.07457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-optimal-extension-of-simple-drawings-2012.07457"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-universal-reconfigurability-of-modular-pivoting-robots-2012.07556</loc><lastmod>2020-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-universal-reconfigurability-of-modular-pivoting-robots-2012.07556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-universal-reconfigurability-of-modular-pivoting-robots-2012.07556"/></url>
<url><loc>https://scifaro.com/en/abs/an-integer-programming-formulation-using-convex-polygons-for-the-convex-partition-problem-2012.07939</loc><lastmod>2020-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integer-programming-formulation-using-convex-polygons-for-the-convex-partition-problem-2012.07939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integer-programming-formulation-using-convex-polygons-for-the-convex-partition-problem-2012.07939"/></url>
<url><loc>https://scifaro.com/en/abs/mapping-surfaces-with-earcut-2012.08233</loc><lastmod>2020-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mapping-surfaces-with-earcut-2012.08233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mapping-surfaces-with-earcut-2012.08233"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-geometric-aspects-of-the-class-of-hv-convex-switching-components-2012.08332</loc><lastmod>2020-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-geometric-aspects-of-the-class-of-hv-convex-switching-components-2012.08332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-geometric-aspects-of-the-class-of-hv-convex-switching-components-2012.08332"/></url>
<url><loc>https://scifaro.com/en/abs/edge-minimum-saturated-k-planar-drawings-2012.08631</loc><lastmod>2021-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-minimum-saturated-k-planar-drawings-2012.08631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-minimum-saturated-k-planar-drawings-2012.08631"/></url>
<url><loc>https://scifaro.com/en/abs/the-quad-layout-immersion-a-mathematically-equivalent-representation-of-a-surface-quadrilateral-layout-2012.09368</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-quad-layout-immersion-a-mathematically-equivalent-representation-of-a-surface-quadrilateral-layout-2012.09368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-quad-layout-immersion-a-mathematically-equivalent-representation-of-a-surface-quadrilateral-layout-2012.09368"/></url>
<url><loc>https://scifaro.com/en/abs/upward-point-set-embeddings-of-paths-and-trees-2012.10525</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-point-set-embeddings-of-paths-and-trees-2012.10525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-point-set-embeddings-of-paths-and-trees-2012.10525"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-segment-folding-is-hard-2012.11062</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-segment-folding-is-hard-2012.11062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-segment-folding-is-hard-2012.11062"/></url>
<url><loc>https://scifaro.com/en/abs/escaping-an-infinitude-of-lions-2012.11181</loc><lastmod>2021-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/escaping-an-infinitude-of-lions-2012.11181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/escaping-an-infinitude-of-lions-2012.11181"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithm-for-computing-the-maximum-volume-bichromatic-separating-box-2012.12846</loc><lastmod>2020-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithm-for-computing-the-maximum-volume-bichromatic-separating-box-2012.12846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithm-for-computing-the-maximum-volume-bichromatic-separating-box-2012.12846"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-modeling-of-pneumothorax-deformation-by-mapping-ct-and-cone-beam-ct-images-2012.13237</loc><lastmod>2020-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-modeling-of-pneumothorax-deformation-by-mapping-ct-and-cone-beam-ct-images-2012.13237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-modeling-of-pneumothorax-deformation-by-mapping-ct-and-cone-beam-ct-images-2012.13237"/></url>
<url><loc>https://scifaro.com/en/abs/faster-distance-based-representative-skyline-and-k-center-along-pareto-front-in-the-plane-2012.15381</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-distance-based-representative-skyline-and-k-center-along-pareto-front-in-the-plane-2012.15381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-distance-based-representative-skyline-and-k-center-along-pareto-front-in-the-plane-2012.15381"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-maximum-independent-set-for-rectangles-in-the-plane-2101.00326</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-maximum-independent-set-for-rectangles-in-the-plane-2101.00326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-maximum-independent-set-for-rectangles-in-the-plane-2101.00326"/></url>
<url><loc>https://scifaro.com/en/abs/long-plane-trees-2101.00445</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/long-plane-trees-2101.00445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/long-plane-trees-2101.00445"/></url>
<url><loc>https://scifaro.com/en/abs/graph-drawing-and-network-visualization-gd2020-2101.00449</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-drawing-and-network-visualization-gd2020-2101.00449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-drawing-and-network-visualization-gd2020-2101.00449"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-pivot-pairings-2101.00451</loc><lastmod>2021-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-pivot-pairings-2101.00451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-pivot-pairings-2101.00451"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-approximation-for-packing-big-two-bar-charts-2101.00470</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-approximation-for-packing-big-two-bar-charts-2101.00470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-approximation-for-packing-big-two-bar-charts-2101.00470"/></url>
<url><loc>https://scifaro.com/en/abs/mesh-total-generalized-variation-for-denoising-2101.02322</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mesh-total-generalized-variation-for-denoising-2101.02322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mesh-total-generalized-variation-for-denoising-2101.02322"/></url>
<url><loc>https://scifaro.com/en/abs/snappability-and-singularity-distance-of-pin-jointed-body-bar-frameworks-2101.02490</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/snappability-and-singularity-distance-of-pin-jointed-body-bar-frameworks-2101.02490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/snappability-and-singularity-distance-of-pin-jointed-body-bar-frameworks-2101.02490"/></url>
<url><loc>https://scifaro.com/en/abs/sketching-merge-trees-for-scientific-data-visualization-2101.03196</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sketching-merge-trees-for-scientific-data-visualization-2101.03196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sketching-merge-trees-for-scientific-data-visualization-2101.03196"/></url>
<url><loc>https://scifaro.com/en/abs/face-based-volume-of-fluid-interface-positioning-in-arbitrary-polyhedra-2101.03861</loc><lastmod>2021-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/face-based-volume-of-fluid-interface-positioning-in-arbitrary-polyhedra-2101.03861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/face-based-volume-of-fluid-interface-positioning-in-arbitrary-polyhedra-2101.03861"/></url>
<url><loc>https://scifaro.com/en/abs/on-compatible-matchings-2101.03928</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-compatible-matchings-2101.03928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-compatible-matchings-2101.03928"/></url>
<url><loc>https://scifaro.com/en/abs/photo2cad-automated-3d-solid-reconstruction-from-2d-drawings-using-opencv-2101.04248</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/photo2cad-automated-3d-solid-reconstruction-from-2d-drawings-using-opencv-2101.04248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/photo2cad-automated-3d-solid-reconstruction-from-2d-drawings-using-opencv-2101.04248"/></url>
<url><loc>https://scifaro.com/en/abs/a-tail-estimate-with-exponential-decay-for-the-randomized-incremental-construction-of-search-structures-2101.04914</loc><lastmod>2025-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tail-estimate-with-exponential-decay-for-the-randomized-incremental-construction-of-search-structures-2101.04914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tail-estimate-with-exponential-decay-for-the-randomized-incremental-construction-of-search-structures-2101.04914"/></url>
<url><loc>https://scifaro.com/en/abs/memory-efficient-modeling-and-slicing-of-large-scale-adaptive-lattice-structures-2101.05031</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memory-efficient-modeling-and-slicing-of-large-scale-adaptive-lattice-structures-2101.05031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memory-efficient-modeling-and-slicing-of-large-scale-adaptive-lattice-structures-2101.05031"/></url>
<url><loc>https://scifaro.com/en/abs/preprocessing-imprecise-points-for-the-pareto-front-2101.06079</loc><lastmod>2021-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preprocessing-imprecise-points-for-the-pareto-front-2101.06079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preprocessing-imprecise-points-for-the-pareto-front-2101.06079"/></url>
<url><loc>https://scifaro.com/en/abs/simultaneous-embedding-of-colored-graphs-2101.06596</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simultaneous-embedding-of-colored-graphs-2101.06596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simultaneous-embedding-of-colored-graphs-2101.06596"/></url>
<url><loc>https://scifaro.com/en/abs/computer-aided-formal-design-of-swarm-robotics-algorithms-2101.06966</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-aided-formal-design-of-swarm-robotics-algorithms-2101.06966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-aided-formal-design-of-swarm-robotics-algorithms-2101.06966"/></url>
<url><loc>https://scifaro.com/en/abs/local-complexity-of-polygons-2101.07554</loc><lastmod>2021-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-complexity-of-polygons-2101.07554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-complexity-of-polygons-2101.07554"/></url>
<url><loc>https://scifaro.com/en/abs/translating-hausdorff-is-hard-fine-grained-lower-bounds-for-hausdorff-distance-under-translation-2101.07696</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-hausdorff-is-hard-fine-grained-lower-bounds-for-hausdorff-distance-under-translation-2101.07696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-hausdorff-is-hard-fine-grained-lower-bounds-for-hausdorff-distance-under-translation-2101.07696"/></url>
<url><loc>https://scifaro.com/en/abs/star-discrepancy-subset-selection-problem-formulation-and-efficient-approaches-for-low-dimensions-2101.07881</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/star-discrepancy-subset-selection-problem-formulation-and-efficient-approaches-for-low-dimensions-2101.07881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/star-discrepancy-subset-selection-problem-formulation-and-efficient-approaches-for-low-dimensions-2101.07881"/></url>
<url><loc>https://scifaro.com/en/abs/a-damped-newton-algorithm-for-generated-jacobian-equations-2101.08080</loc><lastmod>2021-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-damped-newton-algorithm-for-generated-jacobian-equations-2101.08080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-damped-newton-algorithm-for-generated-jacobian-equations-2101.08080"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-curvature-extrema-of-special-cubic-b-ezier-curves-2101.08138</loc><lastmod>2021-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-curvature-extrema-of-special-cubic-b-ezier-curves-2101.08138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-curvature-extrema-of-special-cubic-b-ezier-curves-2101.08138"/></url>
<url><loc>https://scifaro.com/en/abs/positive-geometries-for-barycentric-interpolation-2101.08589</loc><lastmod>2021-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-geometries-for-barycentric-interpolation-2101.08589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-geometries-for-barycentric-interpolation-2101.08589"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-moment-invariants-to-motion-blur-2101.08647</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-moment-invariants-to-motion-blur-2101.08647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-moment-invariants-to-motion-blur-2101.08647"/></url>
<url><loc>https://scifaro.com/en/abs/online-packing-to-minimize-area-or-perimeter-2101.09024</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-packing-to-minimize-area-or-perimeter-2101.09024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-packing-to-minimize-area-or-perimeter-2101.09024"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-visibility-graphs-of-triangulated-irregular-networks-2101.09736</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-visibility-graphs-of-triangulated-irregular-networks-2101.09736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-visibility-graphs-of-triangulated-irregular-networks-2101.09736"/></url>
<url><loc>https://scifaro.com/en/abs/covering-a-set-of-line-segments-with-a-few-squares-2101.09913</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-a-set-of-line-segments-with-a-few-squares-2101.09913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-a-set-of-line-segments-with-a-few-squares-2101.09913"/></url>
<url><loc>https://scifaro.com/en/abs/extending-partial-representations-of-rectangular-duals-with-given-contact-orientations-2102.02013</loc><lastmod>2022-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-partial-representations-of-rectangular-duals-with-given-contact-orientations-2102.02013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-partial-representations-of-rectangular-duals-with-given-contact-orientations-2102.02013"/></url>
<url><loc>https://scifaro.com/en/abs/force-directed-layout-of-order-diagrams-using-dimensional-reduction-2102.02684</loc><lastmod>2021-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/force-directed-layout-of-order-diagrams-using-dimensional-reduction-2102.02684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/force-directed-layout-of-order-diagrams-using-dimensional-reduction-2102.02684"/></url>
<url><loc>https://scifaro.com/en/abs/foldover-free-maps-in-50-lines-of-code-2102.03069</loc><lastmod>2021-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foldover-free-maps-in-50-lines-of-code-2102.03069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foldover-free-maps-in-50-lines-of-code-2102.03069"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-exposure-problem-2102.03455</loc><lastmod>2021-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-exposure-problem-2102.03455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-exposure-problem-2102.03455"/></url>
<url><loc>https://scifaro.com/en/abs/throwing-a-sofa-through-the-window-2102.04262</loc><lastmod>2021-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/throwing-a-sofa-through-the-window-2102.04262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/throwing-a-sofa-through-the-window-2102.04262"/></url>
<url><loc>https://scifaro.com/en/abs/a-better-lower-bound-for-lower-left-anchored-rectangle-packing-2102.05747</loc><lastmod>2021-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-better-lower-bound-for-lower-left-anchored-rectangle-packing-2102.05747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-better-lower-bound-for-lower-left-anchored-rectangle-packing-2102.05747"/></url>
<url><loc>https://scifaro.com/en/abs/translation-invariant-fr-echet-distance-queries-2102.05844</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translation-invariant-fr-echet-distance-queries-2102.05844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translation-invariant-fr-echet-distance-queries-2102.05844"/></url>
<url><loc>https://scifaro.com/en/abs/on-ray-shooting-for-triangles-in-3-space-and-related-problems-2102.07310</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-ray-shooting-for-triangles-in-3-space-and-related-problems-2102.07310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-ray-shooting-for-triangles-in-3-space-and-related-problems-2102.07310"/></url>
<url><loc>https://scifaro.com/en/abs/on-greedily-packing-anchored-rectangles-2102.08181</loc><lastmod>2021-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-greedily-packing-anchored-rectangles-2102.08181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-greedily-packing-anchored-rectangles-2102.08181"/></url>
<url><loc>https://scifaro.com/en/abs/reviews-topological-distances-and-losses-for-brain-networks-2102.08623</loc><lastmod>2021-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reviews-topological-distances-and-losses-for-brain-networks-2102.08623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reviews-topological-distances-and-losses-for-brain-networks-2102.08623"/></url>
<url><loc>https://scifaro.com/en/abs/on-guarding-polygons-with-holes-2102.10317</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-guarding-polygons-with-holes-2102.10317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-guarding-polygons-with-holes-2102.10317"/></url>
<url><loc>https://scifaro.com/en/abs/cut-locus-realizations-on-convex-polyhedra-2102.11097</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-locus-realizations-on-convex-polyhedra-2102.11097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-locus-realizations-on-convex-polyhedra-2102.11097"/></url>
<url><loc>https://scifaro.com/en/abs/a-graphical-framework-to-study-the-correlation-between-geometric-design-and-simulation-2102.11578</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graphical-framework-to-study-the-correlation-between-geometric-design-and-simulation-2102.11578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graphical-framework-to-study-the-correlation-between-geometric-design-and-simulation-2102.11578"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-algorithm-for-euclidean-shortest-paths-in-the-plane-2102.12589</loc><lastmod>2021-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-algorithm-for-euclidean-shortest-paths-in-the-plane-2102.12589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-algorithm-for-euclidean-shortest-paths-in-the-plane-2102.12589"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-deterministic-algorithm-for-geodesic-farthest-point-voronoi-diagrams-in-simple-polygons-2103.00076</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-deterministic-algorithm-for-geodesic-farthest-point-voronoi-diagrams-in-simple-polygons-2103.00076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-deterministic-algorithm-for-geodesic-farthest-point-voronoi-diagrams-in-simple-polygons-2103.00076"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-w-gons-in-convex-polygons-2103.01660</loc><lastmod>2021-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-w-gons-in-convex-polygons-2103.01660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-w-gons-in-convex-polygons-2103.01660"/></url>
<url><loc>https://scifaro.com/en/abs/fast-exact-booleans-for-iterated-csg-using-octree-embedded-bsps-2103.02486</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-exact-booleans-for-iterated-csg-using-octree-embedded-bsps-2103.02486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-exact-booleans-for-iterated-csg-using-octree-embedded-bsps-2103.02486"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-periodic-geometry-and-topology-2103.02749</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-periodic-geometry-and-topology-2103.02749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-periodic-geometry-and-topology-2103.02749"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-higher-mobility-closed-loop-linkages-2103.04799</loc><lastmod>2022-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-higher-mobility-closed-loop-linkages-2103.04799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-higher-mobility-closed-loop-linkages-2103.04799"/></url>
<url><loc>https://scifaro.com/en/abs/digital-convex-unimodular-mapping-8-connected-all-points-but-one-4-connected-2103.04971</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/digital-convex-unimodular-mapping-8-connected-all-points-but-one-4-connected-2103.04971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/digital-convex-unimodular-mapping-8-connected-all-points-but-one-4-connected-2103.04971"/></url>
<url><loc>https://scifaro.com/en/abs/vertex-fault-tolerant-spanners-for-weighted-points-in-polygonal-domains-2103.05931</loc><lastmod>2021-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertex-fault-tolerant-spanners-for-weighted-points-in-polygonal-domains-2103.05931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertex-fault-tolerant-spanners-for-weighted-points-in-polygonal-domains-2103.05931"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-triangulations-of-generalized-bolza-surfaces-2103.05960</loc><lastmod>2021-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-triangulations-of-generalized-bolza-surfaces-2103.05960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-triangulations-of-generalized-bolza-surfaces-2103.05960"/></url>
<url><loc>https://scifaro.com/en/abs/subtrajectory-clustering-finding-set-covers-for-set-systems-of-subcurves-2103.06040</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subtrajectory-clustering-finding-set-covers-for-set-systems-of-subcurves-2103.06040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subtrajectory-clustering-finding-set-covers-for-set-systems-of-subcurves-2103.06040"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-csg-tree-extraction-problem-2103.06139</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-csg-tree-extraction-problem-2103.06139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-csg-tree-extraction-problem-2103.06139"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-moser-s-square-packing-problem-to-a-bounded-number-of-squares-2103.06597</loc><lastmod>2021-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-moser-s-square-packing-problem-to-a-bounded-number-of-squares-2103.06597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-moser-s-square-packing-problem-to-a-bounded-number-of-squares-2103.06597"/></url>
<url><loc>https://scifaro.com/en/abs/terrain-prickliness-theoretical-grounds-for-high-complexity-viewsheds-2103.06696</loc><lastmod>2025-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terrain-prickliness-theoretical-grounds-for-high-complexity-viewsheds-2103.06696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terrain-prickliness-theoretical-grounds-for-high-complexity-viewsheds-2103.06696"/></url>
<url><loc>https://scifaro.com/en/abs/upward-planar-drawings-with-three-and-more-slopes-2103.06801</loc><lastmod>2022-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-planar-drawings-with-three-and-more-slopes-2103.06801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-planar-drawings-with-three-and-more-slopes-2103.06801"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-universal-graphs-2103.06916</loc><lastmod>2021-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-universal-graphs-2103.06916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-universal-graphs-2103.06916"/></url>
<url><loc>https://scifaro.com/en/abs/packing-squares-into-a-disk-with-optimal-worst-case-density-2103.07258</loc><lastmod>2022-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-squares-into-a-disk-with-optimal-worst-case-density-2103.07258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-squares-into-a-disk-with-optimal-worst-case-density-2103.07258"/></url>
<url><loc>https://scifaro.com/en/abs/computing-zigzag-persistence-on-graphs-in-near-linear-time-2103.07353</loc><lastmod>2021-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-zigzag-persistence-on-graphs-in-near-linear-time-2103.07353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-zigzag-persistence-on-graphs-in-near-linear-time-2103.07353"/></url>
<url><loc>https://scifaro.com/en/abs/free-form-design-of-discrete-architectural-surfaces-by-use-of-circle-packing-2103.07584</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-form-design-of-discrete-architectural-surfaces-by-use-of-circle-packing-2103.07584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-form-design-of-discrete-architectural-surfaces-by-use-of-circle-packing-2103.07584"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-multicover-bifiltration-2103.07823</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-multicover-bifiltration-2103.07823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-multicover-bifiltration-2103.07823"/></url>
<url><loc>https://scifaro.com/en/abs/more-dynamic-data-structures-for-geometric-set-cover-with-sublinear-update-time-2103.07857</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-dynamic-data-structures-for-geometric-set-cover-with-sublinear-update-time-2103.07857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-dynamic-data-structures-for-geometric-set-cover-with-sublinear-update-time-2103.07857"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-largest-empty-rectangles-and-boxes-2103.08043</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-largest-empty-rectangles-and-boxes-2103.08043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-largest-empty-rectangles-and-boxes-2103.08043"/></url>
<url><loc>https://scifaro.com/en/abs/on-planar-visibility-counting-problem-2103.08058</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-planar-visibility-counting-problem-2103.08058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-planar-visibility-counting-problem-2103.08058"/></url>
<url><loc>https://scifaro.com/en/abs/rectilinear-steiner-trees-in-narrow-strips-2103.08354</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectilinear-steiner-trees-in-narrow-strips-2103.08354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectilinear-steiner-trees-in-narrow-strips-2103.08354"/></url>
<url><loc>https://scifaro.com/en/abs/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs-2103.08416</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs-2103.08416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs-2103.08416"/></url>
<url><loc>https://scifaro.com/en/abs/tukey-depth-histograms-2103.08665</loc><lastmod>2021-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tukey-depth-histograms-2103.08665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tukey-depth-histograms-2103.08665"/></url>
<url><loc>https://scifaro.com/en/abs/axis-aligned-square-contact-representations-2103.08719</loc><lastmod>2021-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axis-aligned-square-contact-representations-2103.08719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axis-aligned-square-contact-representations-2103.08719"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-and-scalable-bottom-left-fill-algorithm-to-solve-nesting-problems-using-a-semi-discrete-representation-2103.08739</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-and-scalable-bottom-left-fill-algorithm-to-solve-nesting-problems-using-a-semi-discrete-representation-2103.08739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-and-scalable-bottom-left-fill-algorithm-to-solve-nesting-problems-using-a-semi-discrete-representation-2103.08739"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-polygons-into-fat-components-2103.08995</loc><lastmod>2021-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-polygons-into-fat-components-2103.08995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-polygons-into-fat-components-2103.08995"/></url>
<url><loc>https://scifaro.com/en/abs/uncertain-curve-simplification-2103.09223</loc><lastmod>2021-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uncertain-curve-simplification-2103.09223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uncertain-curve-simplification-2103.09223"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-patterns-in-spaces-with-a-forbidden-homological-minor-2103.09286</loc><lastmod>2026-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-patterns-in-spaces-with-a-forbidden-homological-minor-2103.09286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-patterns-in-spaces-with-a-forbidden-homological-minor-2103.09286"/></url>
<url><loc>https://scifaro.com/en/abs/on-undecided-lp-clustering-and-active-learning-2103.09308</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-undecided-lp-clustering-and-active-learning-2103.09308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-undecided-lp-clustering-and-active-learning-2103.09308"/></url>
<url><loc>https://scifaro.com/en/abs/sublinear-average-case-shortest-paths-in-weighted-unit-disk-graphs-2103.09684</loc><lastmod>2021-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sublinear-average-case-shortest-paths-in-weighted-unit-disk-graphs-2103.09684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sublinear-average-case-shortest-paths-in-weighted-unit-disk-graphs-2103.09684"/></url>
<url><loc>https://scifaro.com/en/abs/adjacency-graphs-of-polyhedral-surfaces-2103.09803</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjacency-graphs-of-polyhedral-surfaces-2103.09803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjacency-graphs-of-polyhedral-surfaces-2103.09803"/></url>
<url><loc>https://scifaro.com/en/abs/chasing-puppies-mobile-beacon-routing-on-closed-curves-2103.09811</loc><lastmod>2021-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chasing-puppies-mobile-beacon-routing-on-closed-curves-2103.09811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chasing-puppies-mobile-beacon-routing-on-closed-curves-2103.09811"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-algorithms-for-2-dimensional-knapsack-packing-into-multiple-l-shapes-spirals-and-more-2103.10406</loc><lastmod>2021-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-algorithms-for-2-dimensional-knapsack-packing-into-multiple-l-shapes-spirals-and-more-2103.10406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-algorithms-for-2-dimensional-knapsack-packing-into-multiple-l-shapes-spirals-and-more-2103.10406"/></url>
<url><loc>https://scifaro.com/en/abs/on-subspace-approximation-and-subset-selection-in-fewer-passes-by-mcmc-sampling-2103.11107</loc><lastmod>2021-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-subspace-approximation-and-subset-selection-in-fewer-passes-by-mcmc-sampling-2103.11107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-subspace-approximation-and-subset-selection-in-fewer-passes-by-mcmc-sampling-2103.11107"/></url>
<url><loc>https://scifaro.com/en/abs/key-point-interpolation-a-sparse-data-interpolation-algorithm-based-on-b-splines-2103.11310</loc><lastmod>2021-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/key-point-interpolation-a-sparse-data-interpolation-algorithm-based-on-b-splines-2103.11310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/key-point-interpolation-a-sparse-data-interpolation-algorithm-based-on-b-splines-2103.11310"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-mean-distance-of-a-weighted-graph-2103.11676</loc><lastmod>2023-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-mean-distance-of-a-weighted-graph-2103.11676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-mean-distance-of-a-weighted-graph-2103.11676"/></url>
<url><loc>https://scifaro.com/en/abs/space-mapping-of-spline-spaces-over-hierarchical-t-meshes-2103.11688</loc><lastmod>2021-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-mapping-of-spline-spaces-over-hierarchical-t-meshes-2103.11688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-mapping-of-spline-spaces-over-hierarchical-t-meshes-2103.11688"/></url>
<url><loc>https://scifaro.com/en/abs/a-multi-parameter-persistence-framework-for-mathematical-morphology-2103.13013</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multi-parameter-persistence-framework-for-mathematical-morphology-2103.13013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multi-parameter-persistence-framework-for-mathematical-morphology-2103.13013"/></url>
<url><loc>https://scifaro.com/en/abs/multimode-piezoelectric-shunt-damping-of-thin-plates-with-arrays-of-separately-shunted-patches-method-and-experimental-validation-2103.13179</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multimode-piezoelectric-shunt-damping-of-thin-plates-with-arrays-of-separately-shunted-patches-method-and-experimental-validation-2103.13179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multimode-piezoelectric-shunt-damping-of-thin-plates-with-arrays-of-separately-shunted-patches-method-and-experimental-validation-2103.13179"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-of-crisis-periods-in-stock-markets-2103.13294</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-of-crisis-periods-in-stock-markets-2103.13294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-of-crisis-periods-in-stock-markets-2103.13294"/></url>
<url><loc>https://scifaro.com/en/abs/if-you-must-choose-among-your-children-pick-the-right-one-2103.13882</loc><lastmod>2021-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/if-you-must-choose-among-your-children-pick-the-right-one-2103.13882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/if-you-must-choose-among-your-children-pick-the-right-one-2103.13882"/></url>
<url><loc>https://scifaro.com/en/abs/shadoks-approach-to-low-makespan-coordinated-motion-planning-2103.13956</loc><lastmod>2022-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shadoks-approach-to-low-makespan-coordinated-motion-planning-2103.13956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shadoks-approach-to-low-makespan-coordinated-motion-planning-2103.13956"/></url>
<url><loc>https://scifaro.com/en/abs/unit-disk-visibility-graphs-2103.14092</loc><lastmod>2021-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-disk-visibility-graphs-2103.14092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-disk-visibility-graphs-2103.14092"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-scan-cover-and-variants-theory-and-experiments-2103.14599</loc><lastmod>2021-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-scan-cover-and-variants-theory-and-experiments-2103.14599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-scan-cover-and-variants-theory-and-experiments-2103.14599"/></url>
<url><loc>https://scifaro.com/en/abs/streamtable-an-area-proportional-visualization-for-tables-with-flowing-streams-2103.15037</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/streamtable-an-area-proportional-visualization-for-tables-with-flowing-streams-2103.15037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/streamtable-an-area-proportional-visualization-for-tables-with-flowing-streams-2103.15037"/></url>
<url><loc>https://scifaro.com/en/abs/coordinated-motion-planning-through-randomized-k-opt-2103.15062</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coordinated-motion-planning-through-randomized-k-opt-2103.15062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coordinated-motion-planning-through-randomized-k-opt-2103.15062"/></url>
<url><loc>https://scifaro.com/en/abs/computing-coordinated-motion-plans-for-robot-swarms-the-cg-shop-challenge-2021-2103.15381</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-coordinated-motion-plans-for-robot-swarms-the-cg-shop-challenge-2021-2103.15381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-coordinated-motion-plans-for-robot-swarms-the-cg-shop-challenge-2021-2103.15381"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-line-segments-2103.16071</loc><lastmod>2021-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-line-segments-2103.16071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-search-for-line-segments-2103.16071"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bound-on-the-voronoi-diagram-of-lines-in-mathbb-r-d-2103.17251</loc><lastmod>2021-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bound-on-the-voronoi-diagram-of-lines-in-mathbb-r-d-2103.17251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bound-on-the-voronoi-diagram-of-lines-in-mathbb-r-d-2103.17251"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-colorable-unit-disk-cover-problem-2104.00207</loc><lastmod>2021-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-colorable-unit-disk-cover-problem-2104.00207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-colorable-unit-disk-cover-problem-2104.00207"/></url>
<url><loc>https://scifaro.com/en/abs/some-combinatorial-problems-in-power-law-graphs-2104.00944</loc><lastmod>2021-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-combinatorial-problems-in-power-law-graphs-2104.00944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-combinatorial-problems-in-power-law-graphs-2104.00944"/></url>
<url><loc>https://scifaro.com/en/abs/finite-automata-encoding-piecewise-polynomials-2104.02876</loc><lastmod>2024-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-automata-encoding-piecewise-polynomials-2104.02876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-automata-encoding-piecewise-polynomials-2104.02876"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-cad-modeling-sequences-using-zone-graphs-2104.03900</loc><lastmod>2021-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-cad-modeling-sequences-using-zone-graphs-2104.03900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-cad-modeling-sequences-using-zone-graphs-2104.03900"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-minimum-spanning-tree-problem-in-imprecise-set-up-2104.04229</loc><lastmod>2021-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-minimum-spanning-tree-problem-in-imprecise-set-up-2104.04229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-minimum-spanning-tree-problem-in-imprecise-set-up-2104.04229"/></url>
<url><loc>https://scifaro.com/en/abs/coordinate-descent-heuristics-for-the-irregular-strip-packing-problem-of-rasterized-shapes-2104.04525</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coordinate-descent-heuristics-for-the-irregular-strip-packing-problem-of-rasterized-shapes-2104.04525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coordinate-descent-heuristics-for-the-irregular-strip-packing-problem-of-rasterized-shapes-2104.04525"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-and-robust-discrete-conformal-equivalence-with-boundary-2104.04614</loc><lastmod>2021-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-and-robust-discrete-conformal-equivalence-with-boundary-2104.04614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-and-robust-discrete-conformal-equivalence-with-boundary-2104.04614"/></url>
<url><loc>https://scifaro.com/en/abs/dissecting-the-square-into-seven-or-nine-congruent-parts-2104.04940</loc><lastmod>2021-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dissecting-the-square-into-seven-or-nine-congruent-parts-2104.04940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dissecting-the-square-into-seven-or-nine-congruent-parts-2104.04940"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-frame-field-aligned-multi-laminar-structures-2104.05550</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-frame-field-aligned-multi-laminar-structures-2104.05550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-frame-field-aligned-multi-laminar-structures-2104.05550"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-all-convex-polyhedra-glued-from-squares-in-polynomial-time-2104.06787</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-all-convex-polyhedra-glued-from-squares-in-polynomial-time-2104.06787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-all-convex-polyhedra-glued-from-squares-in-polynomial-time-2104.06787"/></url>
<url><loc>https://scifaro.com/en/abs/novel-matrix-hit-and-run-for-sampling-polytopes-and-its-gpu-implementation-2104.07097</loc><lastmod>2021-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-matrix-hit-and-run-for-sampling-polytopes-and-its-gpu-implementation-2104.07097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-matrix-hit-and-run-for-sampling-polytopes-and-its-gpu-implementation-2104.07097"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-1-wasserstein-distance-between-persistence-diagrams-2104.07710</loc><lastmod>2021-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-1-wasserstein-distance-between-persistence-diagrams-2104.07710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-1-wasserstein-distance-between-persistence-diagrams-2104.07710"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-earth-mover-s-distance-between-sets-of-geometric-objects-2104.08136</loc><lastmod>2023-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-earth-mover-s-distance-between-sets-of-geometric-objects-2104.08136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-earth-mover-s-distance-between-sets-of-geometric-objects-2104.08136"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-k-ell-median-clustering-under-the-fr-echet-distance-2104.09392</loc><lastmod>2021-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-k-ell-median-clustering-under-the-fr-echet-distance-2104.09392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-k-ell-median-clustering-under-the-fr-echet-distance-2104.09392"/></url>
<url><loc>https://scifaro.com/en/abs/finding-geometric-representations-of-apex-graphs-is-np-hard-2104.09976</loc><lastmod>2021-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-geometric-representations-of-apex-graphs-is-np-hard-2104.09976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-geometric-representations-of-apex-graphs-is-np-hard-2104.09976"/></url>
<url><loc>https://scifaro.com/en/abs/explaining-the-entombed-algorithm-2104.09982</loc><lastmod>2021-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explaining-the-entombed-algorithm-2104.09982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explaining-the-entombed-algorithm-2104.09982"/></url>
<url><loc>https://scifaro.com/en/abs/the-density-fingerprint-of-a-periodic-point-set-2104.11046</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-density-fingerprint-of-a-periodic-point-set-2104.11046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-density-fingerprint-of-a-periodic-point-set-2104.11046"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-largest-area-triangle-in-a-terrain-in-near-linear-time-2104.11420</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-largest-area-triangle-in-a-terrain-in-near-linear-time-2104.11420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-largest-area-triangle-in-a-terrain-in-near-linear-time-2104.11420"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-k-median-clustering-under-fr-e-chet-and-hausdorff-distances-2104.12141</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-k-median-clustering-under-fr-e-chet-and-hausdorff-distances-2104.12141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-k-median-clustering-under-fr-e-chet-and-hausdorff-distances-2104.12141"/></url>
<url><loc>https://scifaro.com/en/abs/move-schedules-fast-persistence-computations-in-coarse-dynamic-settings-2104.12285</loc><lastmod>2023-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/move-schedules-fast-persistence-computations-in-coarse-dynamic-settings-2104.12285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/move-schedules-fast-persistence-computations-in-coarse-dynamic-settings-2104.12285"/></url>
<url><loc>https://scifaro.com/en/abs/stronger-bounds-for-weak-epsilon-nets-in-higher-dimensions-2104.12654</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stronger-bounds-for-weak-epsilon-nets-in-higher-dimensions-2104.12654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stronger-bounds-for-weak-epsilon-nets-in-higher-dimensions-2104.12654"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-shortest-path-problem-for-unit-disk-graphs-2104.14476</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-shortest-path-problem-for-unit-disk-graphs-2104.14476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-shortest-path-problem-for-unit-disk-graphs-2104.14476"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-line-constrained-disk-coverage-and-related-problems-2104.14680</loc><lastmod>2021-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-line-constrained-disk-coverage-and-related-problems-2104.14680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-line-constrained-disk-coverage-and-related-problems-2104.14680"/></url>
<url><loc>https://scifaro.com/en/abs/negative-3d-gadgets-in-origami-extrusions-with-a-supporting-triangle-on-the-back-side-2105.00017</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negative-3d-gadgets-in-origami-extrusions-with-a-supporting-triangle-on-the-back-side-2105.00017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negative-3d-gadgets-in-origami-extrusions-with-a-supporting-triangle-on-the-back-side-2105.00017"/></url>
<url><loc>https://scifaro.com/en/abs/computing-optimal-persistent-cycles-for-levelset-zigzag-on-manifold-like-complexes-2105.00518</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-optimal-persistent-cycles-for-levelset-zigzag-on-manifold-like-complexes-2105.00518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-optimal-persistent-cycles-for-levelset-zigzag-on-manifold-like-complexes-2105.00518"/></url>
<url><loc>https://scifaro.com/en/abs/a-3d-advancing-front-delaunay-mesh-refinement-algorithm-2105.00656</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-3d-advancing-front-delaunay-mesh-refinement-algorithm-2105.00656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-3d-advancing-front-delaunay-mesh-refinement-algorithm-2105.00656"/></url>
<url><loc>https://scifaro.com/en/abs/stitch-fix-for-mapper-and-topological-gains-2105.01961</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stitch-fix-for-mapper-and-topological-gains-2105.01961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stitch-fix-for-mapper-and-topological-gains-2105.01961"/></url>
<url><loc>https://scifaro.com/en/abs/covering-convex-polygons-by-two-congruent-disks-2105.02483</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-convex-polygons-by-two-congruent-disks-2105.02483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-convex-polygons-by-two-congruent-disks-2105.02483"/></url>
<url><loc>https://scifaro.com/en/abs/tight-approximation-algorithms-for-geometric-bin-packing-with-skewed-items-2105.02827</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-approximation-algorithms-for-geometric-bin-packing-with-skewed-items-2105.02827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-approximation-algorithms-for-geometric-bin-packing-with-skewed-items-2105.02827"/></url>
<url><loc>https://scifaro.com/en/abs/dots-boxes-is-pspace-complete-2105.02837</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dots-boxes-is-pspace-complete-2105.02837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dots-boxes-is-pspace-complete-2105.02837"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximate-rips-filtrations-with-shifted-integer-lattices-and-cubical-complexes-2105.05151</loc><lastmod>2021-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximate-rips-filtrations-with-shifted-integer-lattices-and-cubical-complexes-2105.05151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximate-rips-filtrations-with-shifted-integer-lattices-and-cubical-complexes-2105.05151"/></url>
<url><loc>https://scifaro.com/en/abs/particle-based-assembly-using-precise-global-control-2105.05784</loc><lastmod>2022-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/particle-based-assembly-using-precise-global-control-2105.05784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/particle-based-assembly-using-precise-global-control-2105.05784"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-lr-drawings-of-trees-2105.06992</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-lr-drawings-of-trees-2105.06992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-lr-drawings-of-trees-2105.06992"/></url>
<url><loc>https://scifaro.com/en/abs/topology-for-substrate-routing-in-semiconductor-package-design-2105.07892</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-for-substrate-routing-in-semiconductor-package-design-2105.07892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-for-substrate-routing-in-semiconductor-package-design-2105.07892"/></url>
<url><loc>https://scifaro.com/en/abs/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares-2105.07997</loc><lastmod>2021-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares-2105.07997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares-2105.07997"/></url>
<url><loc>https://scifaro.com/en/abs/a-coupled-alpha-complex-2105.08113</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coupled-alpha-complex-2105.08113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coupled-alpha-complex-2105.08113"/></url>
<url><loc>https://scifaro.com/en/abs/topology-optimization-for-large-scale-additive-manufacturing-generating-designs-tailored-to-the-deposition-nozzle-size-2105.08115</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-optimization-for-large-scale-additive-manufacturing-generating-designs-tailored-to-the-deposition-nozzle-size-2105.08115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-optimization-for-large-scale-additive-manufacturing-generating-designs-tailored-to-the-deposition-nozzle-size-2105.08115"/></url>
<url><loc>https://scifaro.com/en/abs/planar-drawings-with-few-slopes-of-halin-graphs-and-nested-pseudotrees-2105.08124</loc><lastmod>2023-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-drawings-with-few-slopes-of-halin-graphs-and-nested-pseudotrees-2105.08124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-drawings-with-few-slopes-of-halin-graphs-and-nested-pseudotrees-2105.08124"/></url>
<url><loc>https://scifaro.com/en/abs/snipperclips-cutting-tools-into-desired-polygons-using-themselves-2105.08305</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/snipperclips-cutting-tools-into-desired-polygons-using-themselves-2105.08305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/snipperclips-cutting-tools-into-desired-polygons-using-themselves-2105.08305"/></url>
<url><loc>https://scifaro.com/en/abs/a-sat-attack-on-higher-dimensional-erd-h-o-s-szekeres-numbers-2105.08406</loc><lastmod>2022-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sat-attack-on-higher-dimensional-erd-h-o-s-szekeres-numbers-2105.08406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sat-attack-on-higher-dimensional-erd-h-o-s-szekeres-numbers-2105.08406"/></url>
<url><loc>https://scifaro.com/en/abs/obstructing-classification-via-projection-2105.09047</loc><lastmod>2021-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obstructing-classification-via-projection-2105.09047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obstructing-classification-via-projection-2105.09047"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-euclidean-dispersion-problems-2105.09217</loc><lastmod>2021-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-euclidean-dispersion-problems-2105.09217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-euclidean-dispersion-problems-2105.09217"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-dispersion-problems-in-a-metric-space-2105.09313</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-dispersion-problems-in-a-metric-space-2105.09313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-dispersion-problems-in-a-metric-space-2105.09313"/></url>
<url><loc>https://scifaro.com/en/abs/heesch-numbers-of-unmarked-polyforms-2105.09438</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heesch-numbers-of-unmarked-polyforms-2105.09438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heesch-numbers-of-unmarked-polyforms-2105.09438"/></url>
<url><loc>https://scifaro.com/en/abs/unreliable-sensors-for-reliable-efficient-robots-2105.09667</loc><lastmod>2021-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unreliable-sensors-for-reliable-efficient-robots-2105.09667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unreliable-sensors-for-reliable-efficient-robots-2105.09667"/></url>
<url><loc>https://scifaro.com/en/abs/indirect-predicates-for-geometric-constructions-2105.09772</loc><lastmod>2025-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indirect-predicates-for-geometric-constructions-2105.09772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indirect-predicates-for-geometric-constructions-2105.09772"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-fr-echet-distance-between-uncertain-curves-in-one-dimension-2105.09922</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-fr-echet-distance-between-uncertain-curves-in-one-dimension-2105.09922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-fr-echet-distance-between-uncertain-curves-in-one-dimension-2105.09922"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-flattening-of-all-polyhedral-manifolds-using-countably-infinite-creases-2105.10774</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-flattening-of-all-polyhedral-manifolds-using-countably-infinite-creases-2105.10774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-flattening-of-all-polyhedral-manifolds-using-countably-infinite-creases-2105.10774"/></url>
<url><loc>https://scifaro.com/en/abs/how-packed-is-it-really-2105.10776</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-packed-is-it-really-2105.10776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-packed-is-it-really-2105.10776"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-extension-complexity-of-polytopes-separating-subsets-of-the-boolean-cube-2105.11996</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-extension-complexity-of-polytopes-separating-subsets-of-the-boolean-cube-2105.11996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-extension-complexity-of-polytopes-separating-subsets-of-the-boolean-cube-2105.11996"/></url>
<url><loc>https://scifaro.com/en/abs/a-domain-oblivious-approach-for-learning-concise-representations-of-filtered-topological-spaces-for-clustering-2105.12208</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-domain-oblivious-approach-for-learning-concise-representations-of-filtered-topological-spaces-for-clustering-2105.12208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-domain-oblivious-approach-for-learning-concise-representations-of-filtered-topological-spaces-for-clustering-2105.12208"/></url>
<url><loc>https://scifaro.com/en/abs/a-multiresolution-discrete-element-method-for-triangulated-objects-with-implicit-timestepping-2105.12415</loc><lastmod>2022-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multiresolution-discrete-element-method-for-triangulated-objects-with-implicit-timestepping-2105.12415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multiresolution-discrete-element-method-for-triangulated-objects-with-implicit-timestepping-2105.12415"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-revisited-2105.12452</loc><lastmod>2021-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-revisited-2105.12452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-revisited-2105.12452"/></url>
<url><loc>https://scifaro.com/en/abs/on-morphing-1-planar-drawings-2105.13040</loc><lastmod>2021-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-morphing-1-planar-drawings-2105.13040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-morphing-1-planar-drawings-2105.13040"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-folding-algorithms-for-regular-polyhedra-2105.14305</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-folding-algorithms-for-regular-polyhedra-2105.14305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-folding-algorithms-for-regular-polyhedra-2105.14305"/></url>
<url><loc>https://scifaro.com/en/abs/a-2-epsilon-approximation-algorithm-for-maximum-independent-set-of-rectangles-2106.00623</loc><lastmod>2021-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-2-epsilon-approximation-algorithm-for-maximum-independent-set-of-rectangles-2106.00623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-2-epsilon-approximation-algorithm-for-maximum-independent-set-of-rectangles-2106.00623"/></url>
<url><loc>https://scifaro.com/en/abs/improved-spanning-on-theta-5-2106.01236</loc><lastmod>2021-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-spanning-on-theta-5-2106.01236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-spanning-on-theta-5-2106.01236"/></url>
<url><loc>https://scifaro.com/en/abs/covering-polygons-is-even-harder-2106.02335</loc><lastmod>2021-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-polygons-is-even-harder-2106.02335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-polygons-is-even-harder-2106.02335"/></url>
<url><loc>https://scifaro.com/en/abs/bottleneck-profiles-and-discrete-prokhorov-metrics-for-persistence-diagrams-2106.02538</loc><lastmod>2024-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottleneck-profiles-and-discrete-prokhorov-metrics-for-persistence-diagrams-2106.02538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottleneck-profiles-and-discrete-prokhorov-metrics-for-persistence-diagrams-2106.02538"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-frechet-distance-for-closed-curves-2106.02871</loc><lastmod>2021-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-frechet-distance-for-closed-curves-2106.02871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-frechet-distance-for-closed-curves-2106.02871"/></url>
<url><loc>https://scifaro.com/en/abs/baseline-skinning-for-point-sets-of-articulated-bodies-2106.03514</loc><lastmod>2021-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/baseline-skinning-for-point-sets-of-articulated-bodies-2106.03514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/baseline-skinning-for-point-sets-of-articulated-bodies-2106.03514"/></url>
<url><loc>https://scifaro.com/en/abs/arrangements-of-orthogonal-circles-with-many-intersections-2106.03557</loc><lastmod>2021-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrangements-of-orthogonal-circles-with-many-intersections-2106.03557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrangements-of-orthogonal-circles-with-many-intersections-2106.03557"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-tree-drawings-in-a-small-3d-grid-2106.04289</loc><lastmod>2021-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-tree-drawings-in-a-small-3d-grid-2106.04289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-tree-drawings-in-a-small-3d-grid-2106.04289"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-problems-for-transmission-graphs-2106.04973</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-problems-for-transmission-graphs-2106.04973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-problems-for-transmission-graphs-2106.04973"/></url>
<url><loc>https://scifaro.com/en/abs/relative-clustering-coefficient-2106.05145</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-clustering-coefficient-2106.05145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-clustering-coefficient-2106.05145"/></url>
<url><loc>https://scifaro.com/en/abs/on-clusters-that-are-separated-but-large-2106.05363</loc><lastmod>2021-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-clusters-that-are-separated-but-large-2106.05363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-clusters-that-are-separated-but-large-2106.05363"/></url>
<url><loc>https://scifaro.com/en/abs/an-adaptive-origin-destination-flows-cluster-detecting-method-to-identify-urban-mobility-trends-2106.05436</loc><lastmod>2021-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-adaptive-origin-destination-flows-cluster-detecting-method-to-identify-urban-mobility-trends-2106.05436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-adaptive-origin-destination-flows-cluster-detecting-method-to-identify-urban-mobility-trends-2106.05436"/></url>
<url><loc>https://scifaro.com/en/abs/an-instance-optimal-algorithm-for-bichromatic-rectangular-visibility-2106.05638</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-instance-optimal-algorithm-for-bichromatic-rectangular-visibility-2106.05638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-instance-optimal-algorithm-for-bichromatic-rectangular-visibility-2106.05638"/></url>
<url><loc>https://scifaro.com/en/abs/a-topology-shape-metrics-framework-for-ortho-radial-graph-drawing-2106.05734</loc><lastmod>2021-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-topology-shape-metrics-framework-for-ortho-radial-graph-drawing-2106.05734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-topology-shape-metrics-framework-for-ortho-radial-graph-drawing-2106.05734"/></url>
<url><loc>https://scifaro.com/en/abs/piercing-all-translates-of-a-set-of-axis-parallel-rectangles-2106.07459</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/piercing-all-translates-of-a-set-of-axis-parallel-rectangles-2106.07459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/piercing-all-translates-of-a-set-of-axis-parallel-rectangles-2106.07459"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-evolving-trees-2106.08843</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-evolving-trees-2106.08843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-evolving-trees-2106.08843"/></url>
<url><loc>https://scifaro.com/en/abs/curvature-of-point-clouds-through-principal-component-analysis-2106.09972</loc><lastmod>2022-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curvature-of-point-clouds-through-principal-component-analysis-2106.09972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curvature-of-point-clouds-through-principal-component-analysis-2106.09972"/></url>
<url><loc>https://scifaro.com/en/abs/separating-geometric-data-with-minimum-cost-two-disjoint-convex-hulls-2106.09974</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-geometric-data-with-minimum-cost-two-disjoint-convex-hulls-2106.09974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-geometric-data-with-minimum-cost-two-disjoint-convex-hulls-2106.09974"/></url>
<url><loc>https://scifaro.com/en/abs/searching-for-point-locations-using-lines-2106.10149</loc><lastmod>2021-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-for-point-locations-using-lines-2106.10149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-for-point-locations-using-lines-2106.10149"/></url>
<url><loc>https://scifaro.com/en/abs/hole-detection-and-healing-in-hybrid-sensor-networks-2106.10659</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hole-detection-and-healing-in-hybrid-sensor-networks-2106.10659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hole-detection-and-healing-in-hybrid-sensor-networks-2106.10659"/></url>
<url><loc>https://scifaro.com/en/abs/near-delaunay-metrics-2106.11621</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-delaunay-metrics-2106.11621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-delaunay-metrics-2106.11621"/></url>
<url><loc>https://scifaro.com/en/abs/morse-smale-complexes-on-convex-polyhedra-2106.11626</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morse-smale-complexes-on-convex-polyhedra-2106.11626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morse-smale-complexes-on-convex-polyhedra-2106.11626"/></url>
<url><loc>https://scifaro.com/en/abs/threshold-rounding-for-the-standard-lp-relaxation-of-some-geometric-stabbing-problems-2106.12385</loc><lastmod>2021-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/threshold-rounding-for-the-standard-lp-relaxation-of-some-geometric-stabbing-problems-2106.12385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/threshold-rounding-for-the-standard-lp-relaxation-of-some-geometric-stabbing-problems-2106.12385"/></url>
<url><loc>https://scifaro.com/en/abs/approximability-of-simultaneous-class-cover-for-boxes-2106.12969</loc><lastmod>2021-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximability-of-simultaneous-class-cover-for-boxes-2106.12969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximability-of-simultaneous-class-cover-for-boxes-2106.12969"/></url>
<url><loc>https://scifaro.com/en/abs/pheno-mapper-an-interactive-toolbox-for-the-visual-exploration-of-phenomics-data-2106.13397</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pheno-mapper-an-interactive-toolbox-for-the-visual-exploration-of-phenomics-data-2106.13397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pheno-mapper-an-interactive-toolbox-for-the-visual-exploration-of-phenomics-data-2106.13397"/></url>
<url><loc>https://scifaro.com/en/abs/extensions-of-the-maximum-bichromatic-separating-rectangle-problem-2106.13439</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensions-of-the-maximum-bichromatic-separating-rectangle-problem-2106.13439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensions-of-the-maximum-bichromatic-separating-rectangle-problem-2106.13439"/></url>
<url><loc>https://scifaro.com/en/abs/shortcut-hulls-vertex-restricted-outer-simplifications-of-polygons-2106.13620</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortcut-hulls-vertex-restricted-outer-simplifications-of-polygons-2106.13620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortcut-hulls-vertex-restricted-outer-simplifications-of-polygons-2106.13620"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-maximum-halfspace-discrepancy-2106.13851</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-maximum-halfspace-discrepancy-2106.13851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-maximum-halfspace-discrepancy-2106.13851"/></url>
<url><loc>https://scifaro.com/en/abs/planar-and-toroidal-morphs-made-easier-2106.14086</loc><lastmod>2021-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-and-toroidal-morphs-made-easier-2106.14086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-and-toroidal-morphs-made-easier-2106.14086"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-approximation-scheme-for-k-means-clustering-of-affine-subspaces-2106.14176</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-approximation-scheme-for-k-means-clustering-of-affine-subspaces-2106.14176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-approximation-scheme-for-k-means-clustering-of-affine-subspaces-2106.14176"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-link-shortest-paths-for-polygons-amidst-rectilinear-obstacles-2106.14185</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-link-shortest-paths-for-polygons-amidst-rectilinear-obstacles-2106.14185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-link-shortest-paths-for-polygons-amidst-rectilinear-obstacles-2106.14185"/></url>
<url><loc>https://scifaro.com/en/abs/edge-unfolding-prismatoids-tall-or-rectangular-base-2106.14262</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edge-unfolding-prismatoids-tall-or-rectangular-base-2106.14262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edge-unfolding-prismatoids-tall-or-rectangular-base-2106.14262"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-schnyder-woods-2106.14451</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-schnyder-woods-2106.14451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-schnyder-woods-2106.14451"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-and-local-search-heuristics-to-build-area-optimal-polygons-2106.14728</loc><lastmod>2022-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-and-local-search-heuristics-to-build-area-optimal-polygons-2106.14728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-and-local-search-heuristics-to-build-area-optimal-polygons-2106.14728"/></url>
<url><loc>https://scifaro.com/en/abs/higher-dimensional-power-diagrams-for-semi-discrete-optimal-transport-2106.14730</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-dimensional-power-diagrams-for-semi-discrete-optimal-transport-2106.14730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-dimensional-power-diagrams-for-semi-discrete-optimal-transport-2106.14730"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-connectivity-in-disk-graphs-2106.14935</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-connectivity-in-disk-graphs-2106.14935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-connectivity-in-disk-graphs-2106.14935"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-spanners-for-unit-ball-graphs-in-doubling-metrics-2106.15234</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-spanners-for-unit-ball-graphs-in-doubling-metrics-2106.15234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-spanners-for-unit-ball-graphs-in-doubling-metrics-2106.15234"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-unified-theory-of-light-spanners-i-fast-yet-optimal-constructions-2106.15596</loc><lastmod>2025-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-unified-theory-of-light-spanners-i-fast-yet-optimal-constructions-2106.15596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-unified-theory-of-light-spanners-i-fast-yet-optimal-constructions-2106.15596"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-construction-for-time-convex-hull-with-two-orthogonal-highways-in-the-l1-metric-2106.15885</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-construction-for-time-convex-hull-with-two-orthogonal-highways-in-the-l1-metric-2106.15885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-construction-for-time-convex-hull-with-two-orthogonal-highways-in-the-l1-metric-2106.15885"/></url>
<url><loc>https://scifaro.com/en/abs/online-euclidean-spanners-2107.00684</loc><lastmod>2021-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-euclidean-spanners-2107.00684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-euclidean-spanners-2107.00684"/></url>
<url><loc>https://scifaro.com/en/abs/learning-geometric-combinatorial-optimization-problems-using-self-attention-and-domain-knowledge-2107.01759</loc><lastmod>2023-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-geometric-combinatorial-optimization-problems-using-self-attention-and-domain-knowledge-2107.01759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-geometric-combinatorial-optimization-problems-using-self-attention-and-domain-knowledge-2107.01759"/></url>
<url><loc>https://scifaro.com/en/abs/practical-i-o-efficient-multiway-separators-2107.02570</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-i-o-efficient-multiway-separators-2107.02570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-i-o-efficient-multiway-separators-2107.02570"/></url>
<url><loc>https://scifaro.com/en/abs/space-efficient-two-dimensional-orthogonal-colored-range-counting-2107.02787</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-efficient-two-dimensional-orthogonal-colored-range-counting-2107.02787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-efficient-two-dimensional-orthogonal-colored-range-counting-2107.02787"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-constraint-removal-problem-for-line-segments-is-np-hard-2107.03140</loc><lastmod>2023-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-constraint-removal-problem-for-line-segments-is-np-hard-2107.03140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-constraint-removal-problem-for-line-segments-is-np-hard-2107.03140"/></url>
<url><loc>https://scifaro.com/en/abs/oblivious-median-slope-selection-2107.03193</loc><lastmod>2023-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oblivious-median-slope-selection-2107.03193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oblivious-median-slope-selection-2107.03193"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-averages-of-partitioned-datasets-2107.03460</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-averages-of-partitioned-datasets-2107.03460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-averages-of-partitioned-datasets-2107.03460"/></url>
<url><loc>https://scifaro.com/en/abs/angles-of-arc-polygons-and-lombardi-drawings-of-cacti-2107.03615</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angles-of-arc-polygons-and-lombardi-drawings-of-cacti-2107.03615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angles-of-arc-polygons-and-lombardi-drawings-of-cacti-2107.03615"/></url>
<url><loc>https://scifaro.com/en/abs/feedback-vertex-set-on-geometric-intersection-graphs-2107.03861</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feedback-vertex-set-on-geometric-intersection-graphs-2107.03861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feedback-vertex-set-on-geometric-intersection-graphs-2107.03861"/></url>
<url><loc>https://scifaro.com/en/abs/realizable-piecewise-linear-paths-of-persistence-diagrams-with-reeb-graphs-2107.04654</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizable-piecewise-linear-paths-of-persistence-diagrams-with-reeb-graphs-2107.04654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizable-piecewise-linear-paths-of-persistence-diagrams-with-reeb-graphs-2107.04654"/></url>
<url><loc>https://scifaro.com/en/abs/constant-delay-lattice-train-schedules-2107.04657</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-delay-lattice-train-schedules-2107.04657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-delay-lattice-train-schedules-2107.04657"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-floor-planning-with-proximity-requirements-2107.05036</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-floor-planning-with-proximity-requirements-2107.05036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-floor-planning-with-proximity-requirements-2107.05036"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-maximum-clique-in-a-grounded-1-bend-string-graph-2107.05198</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-maximum-clique-in-a-grounded-1-bend-string-graph-2107.05198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-maximum-clique-in-a-grounded-1-bend-string-graph-2107.05198"/></url>
<url><loc>https://scifaro.com/en/abs/giotto-ph-a-python-library-for-high-performance-computation-of-persistent-homology-of-vietoris-rips-filtrations-2107.05412</loc><lastmod>2021-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/giotto-ph-a-python-library-for-high-performance-computation-of-persistent-homology-of-vietoris-rips-filtrations-2107.05412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/giotto-ph-a-python-library-for-high-performance-computation-of-persistent-homology-of-vietoris-rips-filtrations-2107.05412"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-metaheuristic-approach-for-the-art-gallery-problem-2107.05540</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-metaheuristic-approach-for-the-art-gallery-problem-2107.05540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-metaheuristic-approach-for-the-art-gallery-problem-2107.05540"/></url>
<url><loc>https://scifaro.com/en/abs/an-fpt-algorithm-for-the-embeddability-of-graphs-into-two-dimensional-simplicial-complexes-2107.06236</loc><lastmod>2025-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-fpt-algorithm-for-the-embeddability-of-graphs-into-two-dimensional-simplicial-complexes-2107.06236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-fpt-algorithm-for-the-embeddability-of-graphs-into-two-dimensional-simplicial-complexes-2107.06236"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-spanners-in-euclidean-spaces-admit-sublinear-separators-2107.06490</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-spanners-in-euclidean-spaces-admit-sublinear-separators-2107.06490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-spanners-in-euclidean-spaces-admit-sublinear-separators-2107.06490"/></url>
<url><loc>https://scifaro.com/en/abs/a-qptas-for-stabbing-rectangles-2107.06571</loc><lastmod>2021-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-qptas-for-stabbing-rectangles-2107.06571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-qptas-for-stabbing-rectangles-2107.06571"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-approximate-near-neighbor-searching-for-time-series-under-the-fr-echet-distance-2107.07792</loc><lastmod>2021-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-approximate-near-neighbor-searching-for-time-series-under-the-fr-echet-distance-2107.07792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-approximate-near-neighbor-searching-for-time-series-under-the-fr-echet-distance-2107.07792"/></url>
<url><loc>https://scifaro.com/en/abs/separated-red-blue-center-clustering-2107.07914</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separated-red-blue-center-clustering-2107.07914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separated-red-blue-center-clustering-2107.07914"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bound-for-sculpture-garden-problem-2107.08175</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bound-for-sculpture-garden-problem-2107.08175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bound-for-sculpture-garden-problem-2107.08175"/></url>
<url><loc>https://scifaro.com/en/abs/fpt-approximation-for-fair-minimum-load-clustering-2107.09481</loc><lastmod>2021-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fpt-approximation-for-fair-minimum-load-clustering-2107.09481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fpt-approximation-for-fair-minimum-load-clustering-2107.09481"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-class-of-polar-log-aesthetic-curves-2107.09489</loc><lastmod>2021-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-class-of-polar-log-aesthetic-curves-2107.09489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-class-of-polar-log-aesthetic-curves-2107.09489"/></url>
<url><loc>https://scifaro.com/en/abs/separating-colored-points-with-minimum-number-of-rectangles-2107.09821</loc><lastmod>2021-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-colored-points-with-minimum-number-of-rectangles-2107.09821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-colored-points-with-minimum-number-of-rectangles-2107.09821"/></url>
<url><loc>https://scifaro.com/en/abs/random-simple-homotopy-theory-2107.09862</loc><lastmod>2021-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-simple-homotopy-theory-2107.09862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-simple-homotopy-theory-2107.09862"/></url>
<url><loc>https://scifaro.com/en/abs/finding-minimum-bounded-and-homologous-chains-in-simplicial-complexes-with-bounded-treewidth-1-skeleton-2107.10339</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-minimum-bounded-and-homologous-chains-in-simplicial-complexes-with-bounded-treewidth-1-skeleton-2107.10339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-minimum-bounded-and-homologous-chains-in-simplicial-complexes-with-bounded-treewidth-1-skeleton-2107.10339"/></url>
<url><loc>https://scifaro.com/en/abs/generating-n-point-spherical-configurations-with-low-mesh-ratios-using-spherical-area-coordinates-2107.11265</loc><lastmod>2021-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-n-point-spherical-configurations-with-low-mesh-ratios-using-spherical-area-coordinates-2107.11265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-n-point-spherical-configurations-with-low-mesh-ratios-using-spherical-area-coordinates-2107.11265"/></url>
<url><loc>https://scifaro.com/en/abs/red-blue-k-center-clustering-with-distance-constraints-2107.12411</loc><lastmod>2021-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/red-blue-k-center-clustering-with-distance-constraints-2107.12411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/red-blue-k-center-clustering-with-distance-constraints-2107.12411"/></url>
<url><loc>https://scifaro.com/en/abs/contact-detection-between-an-ellipsoid-and-a-combination-of-quadrics-2107.14234</loc><lastmod>2021-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contact-detection-between-an-ellipsoid-and-a-combination-of-quadrics-2107.14234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contact-detection-between-an-ellipsoid-and-a-combination-of-quadrics-2107.14234"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-random-geometric-graphs-breaking-the-omega-r-distortion-barrier-2107.14323</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-random-geometric-graphs-breaking-the-omega-r-distortion-barrier-2107.14323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-random-geometric-graphs-breaking-the-omega-r-distortion-barrier-2107.14323"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-covering-of-convex-domains-by-congruent-discs-2108.00707</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-covering-of-convex-domains-by-congruent-discs-2108.00707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-covering-of-convex-domains-by-congruent-discs-2108.00707"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-the-hausdorff-metric-in-digital-topology-2108.03114</loc><lastmod>2021-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-the-hausdorff-metric-in-digital-topology-2108.03114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-the-hausdorff-metric-in-digital-topology-2108.03114"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-simulated-annealing-with-greedy-search-for-the-circle-bin-packing-problem-2108.03203</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-simulated-annealing-with-greedy-search-for-the-circle-bin-packing-problem-2108.03203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-simulated-annealing-with-greedy-search-for-the-circle-bin-packing-problem-2108.03203"/></url>
<url><loc>https://scifaro.com/en/abs/topological-art-in-simple-galleries-2108.04007</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-art-in-simple-galleries-2108.04007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-art-in-simple-galleries-2108.04007"/></url>
<url><loc>https://scifaro.com/en/abs/symmetries-of-discrete-curves-and-point-clouds-via-trigonometric-interpolation-2108.04559</loc><lastmod>2021-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetries-of-discrete-curves-and-point-clouds-via-trigonometric-interpolation-2108.04559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetries-of-discrete-curves-and-point-clouds-via-trigonometric-interpolation-2108.04559"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-minimum-bounded-chains-2108.04563</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-minimum-bounded-chains-2108.04563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-minimum-bounded-chains-2108.04563"/></url>
<url><loc>https://scifaro.com/en/abs/distinguishing-classes-of-intersection-graphs-of-homothets-or-similarities-of-two-convex-disks-2108.04588</loc><lastmod>2021-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distinguishing-classes-of-intersection-graphs-of-homothets-or-similarities-of-two-convex-disks-2108.04588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distinguishing-classes-of-intersection-graphs-of-homothets-or-similarities-of-two-convex-disks-2108.04588"/></url>
<url><loc>https://scifaro.com/en/abs/pointwise-distance-distributions-for-detecting-near-duplicates-in-large-materials-databases-2108.04798</loc><lastmod>2026-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pointwise-distance-distributions-for-detecting-near-duplicates-in-large-materials-databases-2108.04798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pointwise-distance-distributions-for-detecting-near-duplicates-in-large-materials-databases-2108.04798"/></url>
<url><loc>https://scifaro.com/en/abs/the-visibility-center-of-a-simple-polygon-2108.07366</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-visibility-center-of-a-simple-polygon-2108.07366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-visibility-center-of-a-simple-polygon-2108.07366"/></url>
<url><loc>https://scifaro.com/en/abs/rectangular-approximation-and-stability-of-2-parameter-persistence-modules-2108.07429</loc><lastmod>2021-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangular-approximation-and-stability-of-2-parameter-persistence-modules-2108.07429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangular-approximation-and-stability-of-2-parameter-persistence-modules-2108.07429"/></url>
<url><loc>https://scifaro.com/en/abs/limitations-on-realistic-hyperbolic-graph-drawing-2108.07441</loc><lastmod>2021-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limitations-on-realistic-hyperbolic-graph-drawing-2108.07441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limitations-on-realistic-hyperbolic-graph-drawing-2108.07441"/></url>
<url><loc>https://scifaro.com/en/abs/distant-representatives-for-rectangles-in-the-plane-2108.07751</loc><lastmod>2021-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distant-representatives-for-rectangles-in-the-plane-2108.07751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distant-representatives-for-rectangles-in-the-plane-2108.07751"/></url>
<url><loc>https://scifaro.com/en/abs/worst-case-efficient-dynamic-geometric-independent-set-2108.08050</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/worst-case-efficient-dynamic-geometric-independent-set-2108.08050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/worst-case-efficient-dynamic-geometric-independent-set-2108.08050"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-aggregation-artery-architecture-of-constrained-origin-destination-flows-using-manhattan-l-function-2108.09042</loc><lastmod>2021-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-aggregation-artery-architecture-of-constrained-origin-destination-flows-using-manhattan-l-function-2108.09042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-aggregation-artery-architecture-of-constrained-origin-destination-flows-using-manhattan-l-function-2108.09042"/></url>
<url><loc>https://scifaro.com/en/abs/from-tutte-to-floater-and-gotsman-on-the-resolution-of-planar-straight-line-drawings-and-morphs-2108.09483</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-tutte-to-floater-and-gotsman-on-the-resolution-of-planar-straight-line-drawings-and-morphs-2108.09483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-tutte-to-floater-and-gotsman-on-the-resolution-of-planar-straight-line-drawings-and-morphs-2108.09483"/></url>
<url><loc>https://scifaro.com/en/abs/iclr-2021-challenge-for-computational-geometry-topology-design-and-results-2108.09810</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iclr-2021-challenge-for-computational-geometry-topology-design-and-results-2108.09810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iclr-2021-challenge-for-computational-geometry-topology-design-and-results-2108.09810"/></url>
<url><loc>https://scifaro.com/en/abs/on-universal-covers-for-carpenter-s-rule-folding-2108.09832</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-universal-covers-for-carpenter-s-rule-folding-2108.09832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-universal-covers-for-carpenter-s-rule-folding-2108.09832"/></url>
<url><loc>https://scifaro.com/en/abs/layered-area-proportional-rectangle-contact-representations-2108.10711</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layered-area-proportional-rectangle-contact-representations-2108.10711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layered-area-proportional-rectangle-contact-representations-2108.10711"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-upward-planar-drawings-with-minimum-curve-complexity-2108.10784</loc><lastmod>2021-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-upward-planar-drawings-with-minimum-curve-complexity-2108.10784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-upward-planar-drawings-with-minimum-curve-complexity-2108.10784"/></url>
<url><loc>https://scifaro.com/en/abs/consistent-simplification-of-polyline-tree-bundles-2108.10790</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistent-simplification-of-polyline-tree-bundles-2108.10790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistent-simplification-of-polyline-tree-bundles-2108.10790"/></url>
<url><loc>https://scifaro.com/en/abs/linear-size-universal-discretization-of-geometric-center-based-problems-in-fixed-dimensions-2108.10900</loc><lastmod>2021-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-size-universal-discretization-of-geometric-center-based-problems-in-fixed-dimensions-2108.10900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-size-universal-discretization-of-geometric-center-based-problems-in-fixed-dimensions-2108.10900"/></url>
<url><loc>https://scifaro.com/en/abs/art-gallery-plus-single-specular-reflection-2108.10940</loc><lastmod>2021-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/art-gallery-plus-single-specular-reflection-2108.10940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/art-gallery-plus-single-specular-reflection-2108.10940"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-area-visibility-representations-of-outer-1-plane-graphs-2108.11768</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-area-visibility-representations-of-outer-1-plane-graphs-2108.11768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-area-visibility-representations-of-outer-1-plane-graphs-2108.11768"/></url>
<url><loc>https://scifaro.com/en/abs/one-bend-drawings-of-outerplanar-graphs-inside-simple-polygons-2108.12321</loc><lastmod>2021-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-bend-drawings-of-outerplanar-graphs-inside-simple-polygons-2108.12321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-bend-drawings-of-outerplanar-graphs-inside-simple-polygons-2108.12321"/></url>
<url><loc>https://scifaro.com/en/abs/bottleneck-convex-subsets-finding-k-large-convex-sets-in-a-point-set-2108.12464</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottleneck-convex-subsets-finding-k-large-convex-sets-in-a-point-set-2108.12464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottleneck-convex-subsets-finding-k-large-convex-sets-in-a-point-set-2108.12464"/></url>
<url><loc>https://scifaro.com/en/abs/linking-disjoint-segments-into-a-simple-polygon-is-hard-2108.12812</loc><lastmod>2021-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linking-disjoint-segments-into-a-simple-polygon-is-hard-2108.12812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linking-disjoint-segments-into-a-simple-polygon-is-hard-2108.12812"/></url>
<url><loc>https://scifaro.com/en/abs/an-outer-totalistic-weakly-universal-cellular-automaton-in-the-dodecagrid-with-four-states-2108.13094</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-outer-totalistic-weakly-universal-cellular-automaton-in-the-dodecagrid-with-four-states-2108.13094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-outer-totalistic-weakly-universal-cellular-automaton-in-the-dodecagrid-with-four-states-2108.13094"/></url>
<url><loc>https://scifaro.com/en/abs/simplifying-non-simple-fan-planar-drawings-2108.13345</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplifying-non-simple-fan-planar-drawings-2108.13345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplifying-non-simple-fan-planar-drawings-2108.13345"/></url>
<url><loc>https://scifaro.com/en/abs/non-homotopic-loops-with-a-bounded-number-of-pairwise-intersections-2108.13953</loc><lastmod>2021-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-homotopic-loops-with-a-bounded-number-of-pairwise-intersections-2108.13953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-homotopic-loops-with-a-bounded-number-of-pairwise-intersections-2108.13953"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-ray-intersection-graphs-and-global-curve-simplification-2109.00042</loc><lastmod>2021-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-ray-intersection-graphs-and-global-curve-simplification-2109.00042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-ray-intersection-graphs-and-global-curve-simplification-2109.00042"/></url>
<url><loc>https://scifaro.com/en/abs/a-gradient-sampling-algorithm-for-stratified-maps-with-applications-to-topological-data-analysis-2109.00530</loc><lastmod>2021-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gradient-sampling-algorithm-for-stratified-maps-with-applications-to-topological-data-analysis-2109.00530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gradient-sampling-algorithm-for-stratified-maps-with-applications-to-topological-data-analysis-2109.00530"/></url>
<url><loc>https://scifaro.com/en/abs/moving-intervals-for-packing-and-covering-2109.00579</loc><lastmod>2021-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moving-intervals-for-packing-and-covering-2109.00579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moving-intervals-for-packing-and-covering-2109.00579"/></url>
<url><loc>https://scifaro.com/en/abs/smooth-surfaces-via-nets-of-geodesics-2109.01429</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smooth-surfaces-via-nets-of-geodesics-2109.01429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smooth-surfaces-via-nets-of-geodesics-2109.01429"/></url>
<url><loc>https://scifaro.com/en/abs/straight-line-drawings-of-1-planar-graphs-2109.01692</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straight-line-drawings-of-1-planar-graphs-2109.01692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straight-line-drawings-of-1-planar-graphs-2109.01692"/></url>
<url><loc>https://scifaro.com/en/abs/linking-disjoint-axis-parallel-segments-into-a-simple-polygon-is-hard-too-2109.02156</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linking-disjoint-axis-parallel-segments-into-a-simple-polygon-is-hard-too-2109.02156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linking-disjoint-axis-parallel-segments-into-a-simple-polygon-is-hard-too-2109.02156"/></url>
<url><loc>https://scifaro.com/en/abs/disjoint-axis-parallel-segments-without-a-circumscribing-polygon-2109.02617</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjoint-axis-parallel-segments-without-a-circumscribing-polygon-2109.02617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjoint-axis-parallel-segments-without-a-circumscribing-polygon-2109.02617"/></url>
<url><loc>https://scifaro.com/en/abs/any-regular-polyhedron-can-transform-to-another-by-o-1-refoldings-2109.03997</loc><lastmod>2023-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/any-regular-polyhedron-can-transform-to-another-by-o-1-refoldings-2109.03997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/any-regular-polyhedron-can-transform-to-another-by-o-1-refoldings-2109.03997"/></url>
<url><loc>https://scifaro.com/en/abs/online-search-for-a-hyperplane-in-high-dimensional-euclidean-space-2109.04340</loc><lastmod>2021-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-search-for-a-hyperplane-in-high-dimensional-euclidean-space-2109.04340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-search-for-a-hyperplane-in-high-dimensional-euclidean-space-2109.04340"/></url>
<url><loc>https://scifaro.com/en/abs/worbel-aggregating-point-labels-into-word-clouds-2109.04368</loc><lastmod>2021-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/worbel-aggregating-point-labels-into-word-clouds-2109.04368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/worbel-aggregating-point-labels-into-word-clouds-2109.04368"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-inapproximability-of-morse-matching-2109.04529</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-inapproximability-of-morse-matching-2109.04529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-inapproximability-of-morse-matching-2109.04529"/></url>
<url><loc>https://scifaro.com/en/abs/fast-algorithms-for-minimum-homology-basis-2109.04567</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-algorithms-for-minimum-homology-basis-2109.04567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-algorithms-for-minimum-homology-basis-2109.04567"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-29th-international-symposium-on-graph-drawing-and-network-visualization-gd-2021-2109.04863</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-29th-international-symposium-on-graph-drawing-and-network-visualization-gd-2021-2109.04863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-29th-international-symposium-on-graph-drawing-and-network-visualization-gd-2021-2109.04863"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-sweeping-line-spanners-2109.05689</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-sweeping-line-spanners-2109.05689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-sweeping-line-spanners-2109.05689"/></url>
<url><loc>https://scifaro.com/en/abs/on-shallow-packings-and-tusn-ady-s-problem-2109.05693</loc><lastmod>2022-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-shallow-packings-and-tusn-ady-s-problem-2109.05693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-shallow-packings-and-tusn-ady-s-problem-2109.05693"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-sharing-a-pizza-2109.06752</loc><lastmod>2021-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-sharing-a-pizza-2109.06752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-sharing-a-pizza-2109.06752"/></url>
<url><loc>https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-many-to-many-point-matching-in-the-plane-2109.07524</loc><lastmod>2021-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-many-to-many-point-matching-in-the-plane-2109.07524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-many-to-many-point-matching-in-the-plane-2109.07524"/></url>
<url><loc>https://scifaro.com/en/abs/subquadratic-algorithms-for-some-textsc-3sum-hard-geometric-problems-in-the-algebraic-decision-tree-model-2109.07587</loc><lastmod>2021-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subquadratic-algorithms-for-some-textsc-3sum-hard-geometric-problems-in-the-algebraic-decision-tree-model-2109.07587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subquadratic-algorithms-for-some-textsc-3sum-hard-geometric-problems-in-the-algebraic-decision-tree-model-2109.07587"/></url>
<url><loc>https://scifaro.com/en/abs/graph-skeletonization-of-high-dimensional-point-cloud-data-via-topological-method-2109.07606</loc><lastmod>2022-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-skeletonization-of-high-dimensional-point-cloud-data-via-topological-method-2109.07606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-skeletonization-of-high-dimensional-point-cloud-data-via-topological-method-2109.07606"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-exact-sign-of-sums-of-products-with-floating-point-arithmetic-2109.07838</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-exact-sign-of-sums-of-products-with-floating-point-arithmetic-2109.07838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-exact-sign-of-sums-of-products-with-floating-point-arithmetic-2109.07838"/></url>
<url><loc>https://scifaro.com/en/abs/clique-based-separators-for-geometric-intersection-graphs-2109.09874</loc><lastmod>2021-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-based-separators-for-geometric-intersection-graphs-2109.09874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-based-separators-for-geometric-intersection-graphs-2109.09874"/></url>
<url><loc>https://scifaro.com/en/abs/on-crossing-families-in-planar-point-sets-2109.10705</loc><lastmod>2022-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-crossing-families-in-planar-point-sets-2109.10705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-crossing-families-in-planar-point-sets-2109.10705"/></url>
<url><loc>https://scifaro.com/en/abs/geographic-style-maps-for-2-dimensional-lattices-2109.10885</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geographic-style-maps-for-2-dimensional-lattices-2109.10885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geographic-style-maps-for-2-dimensional-lattices-2109.10885"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-and-continuous-map-of-the-lattice-isometry-space-for-all-3-dimensional-lattices-2109.11538</loc><lastmod>2021-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-and-continuous-map-of-the-lattice-isometry-space-for-all-3-dimensional-lattices-2109.11538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-and-continuous-map-of-the-lattice-isometry-space-for-all-3-dimensional-lattices-2109.11538"/></url>
<url><loc>https://scifaro.com/en/abs/k-center-clustering-with-outliers-in-the-sliding-window-model-2109.11853</loc><lastmod>2021-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-center-clustering-with-outliers-in-the-sliding-window-model-2109.11853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-center-clustering-with-outliers-in-the-sliding-window-model-2109.11853"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-data-structures-for-k-nearest-neighbor-queries-2109.11854</loc><lastmod>2022-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-data-structures-for-k-nearest-neighbor-queries-2109.11854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-data-structures-for-k-nearest-neighbor-queries-2109.11854"/></url>
<url><loc>https://scifaro.com/en/abs/connected-coordinated-motion-planning-with-bounded-stretch-2109.12381</loc><lastmod>2023-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connected-coordinated-motion-planning-with-bounded-stretch-2109.12381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connected-coordinated-motion-planning-with-bounded-stretch-2109.12381"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-with-neighborhoods-2109.13302</loc><lastmod>2021-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-with-neighborhoods-2109.13302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-with-neighborhoods-2109.13302"/></url>
<url><loc>https://scifaro.com/en/abs/self-improving-voronoi-construction-for-a-hidden-mixture-of-product-distributions-2109.13460</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-improving-voronoi-construction-for-a-hidden-mixture-of-product-distributions-2109.13460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-improving-voronoi-construction-for-a-hidden-mixture-of-product-distributions-2109.13460"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-bundled-crossing-number-2109.14892</loc><lastmod>2021-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-bundled-crossing-number-2109.14892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-bundled-crossing-number-2109.14892"/></url>
<url><loc>https://scifaro.com/en/abs/rectangular-spiral-galaxies-are-still-hard-2110.00058</loc><lastmod>2022-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangular-spiral-galaxies-are-still-hard-2110.00058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangular-spiral-galaxies-are-still-hard-2110.00058"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-exact-convex-hull-simplification-2110.00671</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-exact-convex-hull-simplification-2110.00671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-exact-convex-hull-simplification-2110.00671"/></url>
<url><loc>https://scifaro.com/en/abs/tiling-rectangles-and-the-plane-using-squares-of-integral-sides-2110.00839</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tiling-rectangles-and-the-plane-using-squares-of-integral-sides-2110.00839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tiling-rectangles-and-the-plane-using-squares-of-integral-sides-2110.00839"/></url>
<url><loc>https://scifaro.com/en/abs/tsp-on-manifolds-2110.01093</loc><lastmod>2023-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tsp-on-manifolds-2110.01093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tsp-on-manifolds-2110.01093"/></url>
<url><loc>https://scifaro.com/en/abs/an-impossible-utopia-in-distance-geometry-2110.01231</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-impossible-utopia-in-distance-geometry-2110.01231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-impossible-utopia-in-distance-geometry-2110.01231"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-euclidean-metric-compression-2110.03152</loc><lastmod>2021-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-euclidean-metric-compression-2110.03152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-euclidean-metric-compression-2110.03152"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-area-decomposition-using-a-compactness-metric-2110.04043</loc><lastmod>2021-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-area-decomposition-using-a-compactness-metric-2110.04043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-area-decomposition-using-a-compactness-metric-2110.04043"/></url>
<url><loc>https://scifaro.com/en/abs/reeb-graph-metrics-from-the-ground-up-2110.05631</loc><lastmod>2022-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reeb-graph-metrics-from-the-ground-up-2110.05631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reeb-graph-metrics-from-the-ground-up-2110.05631"/></url>
<url><loc>https://scifaro.com/en/abs/dimensionality-reduction-for-k-distance-applied-to-persistent-homology-2110.05897</loc><lastmod>2021-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimensionality-reduction-for-k-distance-applied-to-persistent-homology-2110.05897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimensionality-reduction-for-k-distance-applied-to-persistent-homology-2110.05897"/></url>
<url><loc>https://scifaro.com/en/abs/on-association-between-absolute-and-relative-zigzag-persistence-2110.06315</loc><lastmod>2021-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-association-between-absolute-and-relative-zigzag-persistence-2110.06315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-association-between-absolute-and-relative-zigzag-persistence-2110.06315"/></url>
<url><loc>https://scifaro.com/en/abs/sum-of-squares-geometry-processing-2110.08451</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sum-of-squares-geometry-processing-2110.08451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sum-of-squares-geometry-processing-2110.08451"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-many-faces-in-arrangements-of-lines-and-segments-2110.08669</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-many-faces-in-arrangements-of-lines-and-segments-2110.08669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-many-faces-in-arrangements-of-lines-and-segments-2110.08669"/></url>
<url><loc>https://scifaro.com/en/abs/fine-grained-complexity-theory-conditional-lower-bounds-for-computational-geometry-2110.10283</loc><lastmod>2021-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fine-grained-complexity-theory-conditional-lower-bounds-for-computational-geometry-2110.10283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fine-grained-complexity-theory-conditional-lower-bounds-for-computational-geometry-2110.10283"/></url>
<url><loc>https://scifaro.com/en/abs/a-unifying-framework-for-n-dimensional-quasi-conformal-mappings-2110.10437</loc><lastmod>2022-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unifying-framework-for-n-dimensional-quasi-conformal-mappings-2110.10437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unifying-framework-for-n-dimensional-quasi-conformal-mappings-2110.10437"/></url>
<url><loc>https://scifaro.com/en/abs/multi-stable-design-of-triangulated-origami-structures-on-cones-of-revolution-2110.10986</loc><lastmod>2022-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-stable-design-of-triangulated-origami-structures-on-cones-of-revolution-2110.10986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-stable-design-of-triangulated-origami-structures-on-cones-of-revolution-2110.10986"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-approach-for-computing-the-kernel-of-a-polyhedron-2110.11054</loc><lastmod>2021-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-approach-for-computing-the-kernel-of-a-polyhedron-2110.11054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-approach-for-computing-the-kernel-of-a-polyhedron-2110.11054"/></url>
<url><loc>https://scifaro.com/en/abs/how-can-classical-multidimensional-scaling-go-wrong-2110.11430</loc><lastmod>2021-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-can-classical-multidimensional-scaling-go-wrong-2110.11430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-can-classical-multidimensional-scaling-go-wrong-2110.11430"/></url>
<url><loc>https://scifaro.com/en/abs/packing-d-dimensional-balls-into-a-d-1-dimensional-container-2110.12711</loc><lastmod>2025-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-d-dimensional-balls-into-a-d-1-dimensional-container-2110.12711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-d-dimensional-balls-into-a-d-1-dimensional-container-2110.12711"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-reconstruction-of-the-fiber-of-persistent-homology-on-cell-complexes-2110.14676</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-reconstruction-of-the-fiber-of-persistent-homology-on-cell-complexes-2110.14676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-reconstruction-of-the-fiber-of-persistent-homology-on-cell-complexes-2110.14676"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-1-wasserstein-distance-between-persistence-diagrams-by-graph-sparsification-2110.14734</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-1-wasserstein-distance-between-persistence-diagrams-by-graph-sparsification-2110.14734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-1-wasserstein-distance-between-persistence-diagrams-by-graph-sparsification-2110.14734"/></url>
<url><loc>https://scifaro.com/en/abs/cubic-upper-and-lower-bounds-for-subtrajectory-clustering-under-the-continuous-fr-echet-distance-2110.15554</loc><lastmod>2021-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubic-upper-and-lower-bounds-for-subtrajectory-clustering-under-the-continuous-fr-echet-distance-2110.15554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubic-upper-and-lower-bounds-for-subtrajectory-clustering-under-the-continuous-fr-echet-distance-2110.15554"/></url>
<url><loc>https://scifaro.com/en/abs/computational-aspects-of-problems-on-visibility-and-disk-graph-representations-2111.00609</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-aspects-of-problems-on-visibility-and-disk-graph-representations-2111.00609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-aspects-of-problems-on-visibility-and-disk-graph-representations-2111.00609"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-geometric-set-cover-revisited-2111.01196</loc><lastmod>2021-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-geometric-set-cover-revisited-2111.01196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-geometric-set-cover-revisited-2111.01196"/></url>
<url><loc>https://scifaro.com/en/abs/unfoldings-and-nets-of-regular-polytopes-2111.01359</loc><lastmod>2021-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfoldings-and-nets-of-regular-polytopes-2111.01359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfoldings-and-nets-of-regular-polytopes-2111.01359"/></url>
<url><loc>https://scifaro.com/en/abs/rectangular-partitions-of-a-rectilinear-polygon-2111.01970</loc><lastmod>2021-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangular-partitions-of-a-rectilinear-polygon-2111.01970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangular-partitions-of-a-rectilinear-polygon-2111.01970"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-optimization-problems-involving-semi-algebraic-range-searching-2111.02052</loc><lastmod>2022-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-optimization-problems-involving-semi-algebraic-range-searching-2111.02052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-optimization-problems-involving-semi-algebraic-range-searching-2111.02052"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-placement-revisited-degree-of-freedom-1-sum-hardness-and-an-improvement-via-offline-dynamic-rectangle-union-2111.02544</loc><lastmod>2021-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-placement-revisited-degree-of-freedom-1-sum-hardness-and-an-improvement-via-offline-dynamic-rectangle-union-2111.02544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-placement-revisited-degree-of-freedom-1-sum-hardness-and-an-improvement-via-offline-dynamic-rectangle-union-2111.02544"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-complexity-graph-simplification-under-fr-echet-like-distances-2111.02591</loc><lastmod>2021-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-complexity-graph-simplification-under-fr-echet-like-distances-2111.02591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-complexity-graph-simplification-under-fr-echet-like-distances-2111.02591"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-construction-of-canonical-3d-gadgets-in-origami-extrusions-2111.03280</loc><lastmod>2021-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-construction-of-canonical-3d-gadgets-in-origami-extrusions-2111.03280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-construction-of-canonical-3d-gadgets-in-origami-extrusions-2111.03280"/></url>
<url><loc>https://scifaro.com/en/abs/hopcroft-s-problem-log-star-shaving-2d-fractional-cascading-and-decision-trees-2111.03744</loc><lastmod>2022-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hopcroft-s-problem-log-star-shaving-2d-fractional-cascading-and-decision-trees-2111.03744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hopcroft-s-problem-log-star-shaving-2d-fractional-cascading-and-decision-trees-2111.03744"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-area-preserving-parameterization-of-open-and-closed-anatomical-surfaces-2111.04265</loc><lastmod>2022-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-area-preserving-parameterization-of-open-and-closed-anatomical-surfaces-2111.04265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-area-preserving-parameterization-of-open-and-closed-anatomical-surfaces-2111.04265"/></url>
<url><loc>https://scifaro.com/en/abs/isometry-invariant-shape-recognition-of-projectively-perturbed-point-clouds-by-the-mergegram-extending-0d-persistence-2111.04617</loc><lastmod>2021-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isometry-invariant-shape-recognition-of-projectively-perturbed-point-clouds-by-the-mergegram-extending-0d-persistence-2111.04617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isometry-invariant-shape-recognition-of-projectively-perturbed-point-clouds-by-the-mergegram-extending-0d-persistence-2111.04617"/></url>
<url><loc>https://scifaro.com/en/abs/a-ptas-for-the-horizontal-rectangle-stabbing-problem-2111.05197</loc><lastmod>2021-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ptas-for-the-horizontal-rectangle-stabbing-problem-2111.05197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ptas-for-the-horizontal-rectangle-stabbing-problem-2111.05197"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-structure-design-optimization-under-localized-linear-buckling-constraints-2111.05294</loc><lastmod>2021-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-structure-design-optimization-under-localized-linear-buckling-constraints-2111.05294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-structure-design-optimization-under-localized-linear-buckling-constraints-2111.05294"/></url>
<url><loc>https://scifaro.com/en/abs/computing-area-optimal-simple-polygonizations-2111.05386</loc><lastmod>2021-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-area-optimal-simple-polygonizations-2111.05386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-area-optimal-simple-polygonizations-2111.05386"/></url>
<url><loc>https://scifaro.com/en/abs/the-impact-of-changes-in-resolution-on-the-persistent-homology-of-images-2111.05663</loc><lastmod>2024-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-impact-of-changes-in-resolution-on-the-persistent-homology-of-images-2111.05663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-impact-of-changes-in-resolution-on-the-persistent-homology-of-images-2111.05663"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-bottleneck-spanning-trees-on-partitioned-tuples-of-points-2111.05780</loc><lastmod>2021-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-bottleneck-spanning-trees-on-partitioned-tuples-of-points-2111.05780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-bottleneck-spanning-trees-on-partitioned-tuples-of-points-2111.05780"/></url>
<url><loc>https://scifaro.com/en/abs/arbitrary-order-principal-directions-and-how-to-compute-them-2111.05800</loc><lastmod>2021-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arbitrary-order-principal-directions-and-how-to-compute-them-2111.05800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arbitrary-order-principal-directions-and-how-to-compute-them-2111.05800"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-window-queries-on-line-segments-using-the-trapezoidal-search-dag-2111.07024</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-window-queries-on-line-segments-using-the-trapezoidal-search-dag-2111.07024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-window-queries-on-line-segments-using-the-trapezoidal-search-dag-2111.07024"/></url>
<url><loc>https://scifaro.com/en/abs/area-optimal-simple-polygonalizations-the-cg-challenge-2019-2111.07304</loc><lastmod>2021-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/area-optimal-simple-polygonalizations-the-cg-challenge-2019-2111.07304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/area-optimal-simple-polygonalizations-the-cg-challenge-2019-2111.07304"/></url>
<url><loc>https://scifaro.com/en/abs/online-dominating-set-and-independent-set-2111.07812</loc><lastmod>2021-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-dominating-set-and-independent-set-2111.07812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-dominating-set-and-independent-set-2111.07812"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparison-of-o-1-and-cyrus-beck-line-clipping-algorithms-in-e2-and-e3-2111.07987</loc><lastmod>2021-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparison-of-o-1-and-cyrus-beck-line-clipping-algorithms-in-e2-and-e3-2111.07987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparison-of-o-1-and-cyrus-beck-line-clipping-algorithms-in-e2-and-e3-2111.07987"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-algorithm-for-computing-the-zone-of-a-line-in-an-arrangement-of-lines-2111.08238</loc><lastmod>2021-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-algorithm-for-computing-the-zone-of-a-line-in-an-arrangement-of-lines-2111.08238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-algorithm-for-computing-the-zone-of-a-line-in-an-arrangement-of-lines-2111.08238"/></url>
<url><loc>https://scifaro.com/en/abs/the-polygon-burning-problem-2111.09054</loc><lastmod>2021-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-polygon-burning-problem-2111.09054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-polygon-burning-problem-2111.09054"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-circular-drawings-algorithms-and-complexity-2111.09766</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-circular-drawings-algorithms-and-complexity-2111.09766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-circular-drawings-algorithms-and-complexity-2111.09766"/></url>
<url><loc>https://scifaro.com/en/abs/embeddings-and-labeling-schemes-for-a-2111.10041</loc><lastmod>2021-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embeddings-and-labeling-schemes-for-a-2111.10041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embeddings-and-labeling-schemes-for-a-2111.10041"/></url>
<url><loc>https://scifaro.com/en/abs/hex-me-if-you-can-2111.10295</loc><lastmod>2021-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hex-me-if-you-can-2111.10295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hex-me-if-you-can-2111.10295"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-approximability-of-edge-vertex-domination-in-udg-2111.13552</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-approximability-of-edge-vertex-domination-in-udg-2111.13552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-approximability-of-edge-vertex-domination-in-udg-2111.13552"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximating-shortest-paths-in-weighted-triangular-tessellations-2111.13912</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximating-shortest-paths-in-weighted-triangular-tessellations-2111.13912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximating-shortest-paths-in-weighted-triangular-tessellations-2111.13912"/></url>
<url><loc>https://scifaro.com/en/abs/projection-based-classification-of-surfaces-for-3d-human-mesh-sequence-retrieval-2111.13985</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/projection-based-classification-of-surfaces-for-3d-human-mesh-sequence-retrieval-2111.13985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/projection-based-classification-of-surfaces-for-3d-human-mesh-sequence-retrieval-2111.13985"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-geometrically-modeled-points-in-the-aggregated-uncertainty-model-2111.13989</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-geometrically-modeled-points-in-the-aggregated-uncertainty-model-2111.13989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-geometrically-modeled-points-in-the-aggregated-uncertainty-model-2111.13989"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-near-linear-time-algorithm-for-k-nearest-neighbor-search-using-a-compressed-cover-tree-2111.15478</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-near-linear-time-algorithm-for-k-nearest-neighbor-search-using-a-compressed-cover-tree-2111.15478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-near-linear-time-algorithm-for-k-nearest-neighbor-search-using-a-compressed-cover-tree-2111.15478"/></url>
<url><loc>https://scifaro.com/en/abs/acute-tours-in-the-plane-2112.00064</loc><lastmod>2022-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acute-tours-in-the-plane-2112.00064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acute-tours-in-the-plane-2112.00064"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-length-restricted-means-under-dynamic-time-warping-2112.00408</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-length-restricted-means-under-dynamic-time-warping-2112.00408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-length-restricted-means-under-dynamic-time-warping-2112.00408"/></url>
<url><loc>https://scifaro.com/en/abs/hyperbolae-are-the-locus-of-constant-angle-difference-2112.00454</loc><lastmod>2021-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperbolae-are-the-locus-of-constant-angle-difference-2112.00454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperbolae-are-the-locus-of-constant-angle-difference-2112.00454"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-geometric-median-problem-with-outliers-2112.00519</loc><lastmod>2021-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-geometric-median-problem-with-outliers-2112.00519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-geometric-median-problem-with-outliers-2112.00519"/></url>
<url><loc>https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-point-guarding-an-art-gallery-2112.01104</loc><lastmod>2021-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-point-guarding-an-art-gallery-2112.01104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-point-guarding-an-art-gallery-2112.01104"/></url>
<url><loc>https://scifaro.com/en/abs/tesselating-a-pascal-like-tetrahedron-for-the-subdivision-of-high-order-tetrahedral-finite-elements-2112.01365</loc><lastmod>2021-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tesselating-a-pascal-like-tetrahedron-for-the-subdivision-of-high-order-tetrahedral-finite-elements-2112.01365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tesselating-a-pascal-like-tetrahedron-for-the-subdivision-of-high-order-tetrahedral-finite-elements-2112.01365"/></url>
<url><loc>https://scifaro.com/en/abs/multicriteria-scalable-graph-drawing-via-stochastic-gradient-descent-sgd-2-2112.01571</loc><lastmod>2021-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multicriteria-scalable-graph-drawing-via-stochastic-gradient-descent-sgd-2-2112.01571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multicriteria-scalable-graph-drawing-via-stochastic-gradient-descent-sgd-2-2112.01571"/></url>
<url><loc>https://scifaro.com/en/abs/point-enclosure-problem-for-homothetic-polygons-2112.01860</loc><lastmod>2023-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-enclosure-problem-for-homothetic-polygons-2112.01860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-enclosure-problem-for-homothetic-polygons-2112.01860"/></url>
<url><loc>https://scifaro.com/en/abs/updating-barcodes-and-representatives-for-zigzag-persistence-2112.02352</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/updating-barcodes-and-representatives-for-zigzag-persistence-2112.02352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/updating-barcodes-and-representatives-for-zigzag-persistence-2112.02352"/></url>
<url><loc>https://scifaro.com/en/abs/on-complexity-of-computing-bottleneck-and-lexicographic-optimal-cycles-in-a-homology-class-2112.02380</loc><lastmod>2022-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexity-of-computing-bottleneck-and-lexicographic-optimal-cycles-in-a-homology-class-2112.02380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexity-of-computing-bottleneck-and-lexicographic-optimal-cycles-in-a-homology-class-2112.02380"/></url>
<url><loc>https://scifaro.com/en/abs/computing-voronoi-diagrams-in-the-polar-coordinate-model-of-the-hyperbolic-plane-2112.02553</loc><lastmod>2023-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-voronoi-diagrams-in-the-polar-coordinate-model-of-the-hyperbolic-plane-2112.02553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-voronoi-diagrams-in-the-polar-coordinate-model-of-the-hyperbolic-plane-2112.02553"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-rectangular-duals-2112.03040</loc><lastmod>2022-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-rectangular-duals-2112.03040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-rectangular-duals-2112.03040"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-diagrams-in-the-hilbert-metric-2112.03056</loc><lastmod>2021-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagrams-in-the-hilbert-metric-2112.03056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagrams-in-the-hilbert-metric-2112.03056"/></url>
<url><loc>https://scifaro.com/en/abs/aspect-ratio-universal-rectangular-layouts-2112.03242</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aspect-ratio-universal-rectangular-layouts-2112.03242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aspect-ratio-universal-rectangular-layouts-2112.03242"/></url>
<url><loc>https://scifaro.com/en/abs/a-family-of-density-scaled-filtered-complexes-2112.03334</loc><lastmod>2022-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-family-of-density-scaled-filtered-complexes-2112.03334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-family-of-density-scaled-filtered-complexes-2112.03334"/></url>
<url><loc>https://scifaro.com/en/abs/tighter-bounds-for-reconstruction-from-epsilon-samples-2112.03656</loc><lastmod>2022-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tighter-bounds-for-reconstruction-from-epsilon-samples-2112.03656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tighter-bounds-for-reconstruction-from-epsilon-samples-2112.03656"/></url>
<url><loc>https://scifaro.com/en/abs/online-sorting-and-translational-packing-of-convex-polygons-2112.03791</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-sorting-and-translational-packing-of-convex-polygons-2112.03791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-sorting-and-translational-packing-of-convex-polygons-2112.03791"/></url>
<url><loc>https://scifaro.com/en/abs/output-sensitive-computation-of-generalized-persistence-diagrams-for-2-filtrations-2112.03980</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/output-sensitive-computation-of-generalized-persistence-diagrams-for-2-filtrations-2112.03980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/output-sensitive-computation-of-generalized-persistence-diagrams-for-2-filtrations-2112.03980"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-the-hausdorff-distance-2112.04343</loc><lastmod>2022-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-the-hausdorff-distance-2112.04343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-the-hausdorff-distance-2112.04343"/></url>
<url><loc>https://scifaro.com/en/abs/unique-assembly-verification-in-two-handed-self-assembly-2112.05070</loc><lastmod>2021-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-assembly-verification-in-two-handed-self-assembly-2112.05070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-assembly-verification-in-two-handed-self-assembly-2112.05070"/></url>
<url><loc>https://scifaro.com/en/abs/stable-approximation-algorithms-for-the-dynamic-broadcast-range-assignment-problem-2112.05426</loc><lastmod>2021-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-approximation-algorithms-for-the-dynamic-broadcast-range-assignment-problem-2112.05426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-approximation-algorithms-for-the-dynamic-broadcast-range-assignment-problem-2112.05426"/></url>
<url><loc>https://scifaro.com/en/abs/piercing-pairwise-intersecting-geodesic-disks-by-five-points-2112.05962</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/piercing-pairwise-intersecting-geodesic-disks-by-five-points-2112.05962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/piercing-pairwise-intersecting-geodesic-disks-by-five-points-2112.05962"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-mmp-algorithm-wavefront-and-cut-locus-on-a-convex-polyhedron-2112.06164</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-mmp-algorithm-wavefront-and-cut-locus-on-a-convex-polyhedron-2112.06164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-mmp-algorithm-wavefront-and-cut-locus-on-a-convex-polyhedron-2112.06164"/></url>
<url><loc>https://scifaro.com/en/abs/hop-spanners-for-geometric-intersection-graphs-2112.07158</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hop-spanners-for-geometric-intersection-graphs-2112.07158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hop-spanners-for-geometric-intersection-graphs-2112.07158"/></url>
<url><loc>https://scifaro.com/en/abs/simplicial-approximation-to-cw-complexes-with-spherical-delaunay-triangulations-2112.07573</loc><lastmod>2026-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplicial-approximation-to-cw-complexes-with-spherical-delaunay-triangulations-2112.07573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplicial-approximation-to-cw-complexes-with-spherical-delaunay-triangulations-2112.07573"/></url>
<url><loc>https://scifaro.com/en/abs/advice-complexity-of-online-non-crossing-matching-2112.08295</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advice-complexity-of-online-non-crossing-matching-2112.08295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advice-complexity-of-online-non-crossing-matching-2112.08295"/></url>
<url><loc>https://scifaro.com/en/abs/ltb-curves-with-lipschitz-turn-are-par-regular-2112.09567</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltb-curves-with-lipschitz-turn-are-par-regular-2112.09567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltb-curves-with-lipschitz-turn-are-par-regular-2112.09567"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-lower-bounds-for-dynamic-geometric-measure-problems-2112.10095</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-lower-bounds-for-dynamic-geometric-measure-problems-2112.10095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-lower-bounds-for-dynamic-geometric-measure-problems-2112.10095"/></url>
<url><loc>https://scifaro.com/en/abs/an-interface-preserving-moving-mesh-in-multiple-space-dimensions-2112.11956</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interface-preserving-moving-mesh-in-multiple-space-dimensions-2112.11956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interface-preserving-moving-mesh-in-multiple-space-dimensions-2112.11956"/></url>
<url><loc>https://scifaro.com/en/abs/the-universal-ell-p-metric-on-merge-trees-2112.12165</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-universal-ell-p-metric-on-merge-trees-2112.12165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-universal-ell-p-metric-on-merge-trees-2112.12165"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-multiplicatively-weighted-voronoi-diagrams-efficient-construction-with-linear-size-2112.12350</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-multiplicatively-weighted-voronoi-diagrams-efficient-construction-with-linear-size-2112.12350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-multiplicatively-weighted-voronoi-diagrams-efficient-construction-with-linear-size-2112.12350"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-incidences-when-avoiding-an-induced-biclique-in-geometric-settings-2112.14829</loc><lastmod>2023-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-incidences-when-avoiding-an-induced-biclique-in-geometric-settings-2112.14829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-incidences-when-avoiding-an-induced-biclique-in-geometric-settings-2112.14829"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-enumerating-scaled-copies-of-point-set-patterns-2112.14980</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-enumerating-scaled-copies-of-point-set-patterns-2112.14980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-enumerating-scaled-copies-of-point-set-patterns-2112.14980"/></url>
<url><loc>https://scifaro.com/en/abs/realizations-of-rigid-graphs-2201.00533</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizations-of-rigid-graphs-2201.00533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizations-of-rigid-graphs-2201.00533"/></url>
<url><loc>https://scifaro.com/en/abs/on-automating-triangle-constructions-in-absolute-and-hyperbolic-geometry-2201.00534</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-automating-triangle-constructions-in-absolute-and-hyperbolic-geometry-2201.00534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-automating-triangle-constructions-in-absolute-and-hyperbolic-geometry-2201.00534"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-modeling-of-classical-folds-in-computational-origami-2201.00536</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-modeling-of-classical-folds-in-computational-origami-2201.00536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-modeling-of-classical-folds-in-computational-origami-2201.00536"/></url>
<url><loc>https://scifaro.com/en/abs/mechanization-of-incidence-projective-geometry-in-higher-dimensions-a-combinatorial-approach-2201.00539</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanization-of-incidence-projective-geometry-in-higher-dimensions-a-combinatorial-approach-2201.00539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanization-of-incidence-projective-geometry-in-higher-dimensions-a-combinatorial-approach-2201.00539"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-algorithm-for-pyramidal-clipping-of-line-segments-in-e3-2201.00587</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-algorithm-for-pyramidal-clipping-of-line-segments-in-e3-2201.00587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-algorithm-for-pyramidal-clipping-of-line-segments-in-e3-2201.00587"/></url>
<url><loc>https://scifaro.com/en/abs/two-new-algorithms-for-line-clipping-in-e2-and-their-comparison-2201.00590</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-new-algorithms-for-line-clipping-in-e2-and-their-comparison-2201.00590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-new-algorithms-for-line-clipping-in-e2-and-their-comparison-2201.00590"/></url>
<url><loc>https://scifaro.com/en/abs/line-clipping-in-e3-with-expected-complexity-o-1-2201.00592</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-clipping-in-e3-with-expected-complexity-o-1-2201.00592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-clipping-in-e3-with-expected-complexity-o-1-2201.00592"/></url>
<url><loc>https://scifaro.com/en/abs/catching-polygons-2201.01286</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catching-polygons-2201.01286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catching-polygons-2201.01286"/></url>
<url><loc>https://scifaro.com/en/abs/polyline-simplification-under-the-local-fr-echet-distance-has-almost-quadratic-runtime-in-2d-2201.01344</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyline-simplification-under-the-local-fr-echet-distance-has-almost-quadratic-runtime-in-2d-2201.01344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyline-simplification-under-the-local-fr-echet-distance-has-almost-quadratic-runtime-in-2d-2201.01344"/></url>
<url><loc>https://scifaro.com/en/abs/local-spanners-revisited-2201.01715</loc><lastmod>2022-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-spanners-revisited-2201.01715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-spanners-revisited-2201.01715"/></url>
<url><loc>https://scifaro.com/en/abs/sparsifying-disk-intersection-graphs-for-reliable-connectivity-2201.01844</loc><lastmod>2022-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparsifying-disk-intersection-graphs-for-reliable-connectivity-2201.01844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparsifying-disk-intersection-graphs-for-reliable-connectivity-2201.01844"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-maximum-matchings-in-geometric-intersection-graphs-2201.01849</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-maximum-matchings-in-geometric-intersection-graphs-2201.01849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-maximum-matchings-in-geometric-intersection-graphs-2201.01849"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-discrete-fr-echet-distance-in-a-graph-2201.02121</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-discrete-fr-echet-distance-in-a-graph-2201.02121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-discrete-fr-echet-distance-in-a-graph-2201.02121"/></url>
<url><loc>https://scifaro.com/en/abs/segment-visibility-counting-queries-in-polygons-2201.03490</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/segment-visibility-counting-queries-in-polygons-2201.03490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/segment-visibility-counting-queries-in-polygons-2201.03490"/></url>
<url><loc>https://scifaro.com/en/abs/implementation-of-polygon-guarding-algorithms-for-art-gallery-problems-2201.03535</loc><lastmod>2022-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementation-of-polygon-guarding-algorithms-for-art-gallery-problems-2201.03535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementation-of-polygon-guarding-algorithms-for-art-gallery-problems-2201.03535"/></url>
<url><loc>https://scifaro.com/en/abs/paired-compressed-cover-trees-guarantee-a-near-linear-parametrized-complexity-for-all-k-nearest-neighbors-search-in-an-arbitrary-metric-space-2201.06553</loc><lastmod>2022-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paired-compressed-cover-trees-guarantee-a-near-linear-parametrized-complexity-for-all-k-nearest-neighbors-search-in-an-arbitrary-metric-space-2201.06553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paired-compressed-cover-trees-guarantee-a-near-linear-parametrized-complexity-for-all-k-nearest-neighbors-search-in-an-arbitrary-metric-space-2201.06553"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-and-hexahedral-meshing-of-cerebral-arterial-networks-from-centerlines-2201.08279</loc><lastmod>2023-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-and-hexahedral-meshing-of-cerebral-arterial-networks-from-centerlines-2201.08279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-and-hexahedral-meshing-of-cerebral-arterial-networks-from-centerlines-2201.08279"/></url>
<url><loc>https://scifaro.com/en/abs/what-makes-the-recognition-problem-hard-for-classes-related-to-segment-and-string-graphs-2201.08498</loc><lastmod>2022-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-makes-the-recognition-problem-hard-for-classes-related-to-segment-and-string-graphs-2201.08498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-makes-the-recognition-problem-hard-for-classes-related-to-segment-and-string-graphs-2201.08498"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-discrete-and-continuous-median-line-segments-in-d-dimensions-2201.08900</loc><lastmod>2022-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-discrete-and-continuous-median-line-segments-in-d-dimensions-2201.08900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-discrete-and-continuous-median-line-segments-in-d-dimensions-2201.08900"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-of-two-dimensional-data-for-speeding-up-convex-hull-computation-2201.11412</loc><lastmod>2022-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-of-two-dimensional-data-for-speeding-up-convex-hull-computation-2201.11412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-of-two-dimensional-data-for-speeding-up-convex-hull-computation-2201.11412"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-judgement-algorithm-of-point-in-out-convex-polygons-2201.11542</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-judgement-algorithm-of-point-in-out-convex-polygons-2201.11542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-judgement-algorithm-of-point-in-out-convex-polygons-2201.11542"/></url>
<url><loc>https://scifaro.com/en/abs/budgeted-steiner-networks-three-terminals-with-equal-path-weights-2201.11602</loc><lastmod>2022-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/budgeted-steiner-networks-three-terminals-with-equal-path-weights-2201.11602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/budgeted-steiner-networks-three-terminals-with-equal-path-weights-2201.11602"/></url>
<url><loc>https://scifaro.com/en/abs/polylla-polygonal-meshing-algorithm-based-on-terminal-edge-regions-2201.11925</loc><lastmod>2022-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polylla-polygonal-meshing-algorithm-based-on-terminal-edge-regions-2201.11925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polylla-polygonal-meshing-algorithm-based-on-terminal-edge-regions-2201.11925"/></url>
<url><loc>https://scifaro.com/en/abs/practical-lowest-distortion-mapping-2201.12112</loc><lastmod>2022-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-lowest-distortion-mapping-2201.12112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-lowest-distortion-mapping-2201.12112"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-orthotubes-with-a-dual-hamiltonian-path-2201.12452</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-orthotubes-with-a-dual-hamiltonian-path-2201.12452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-orthotubes-with-a-dual-hamiltonian-path-2201.12452"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-and-fast-algorithm-for-computing-discrete-voronoi-johnson-mehl-or-laguerre-diagrams-of-points-2201.13234</loc><lastmod>2022-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-and-fast-algorithm-for-computing-discrete-voronoi-johnson-mehl-or-laguerre-diagrams-of-points-2201.13234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-and-fast-algorithm-for-computing-discrete-voronoi-johnson-mehl-or-laguerre-diagrams-of-points-2201.13234"/></url>
<url><loc>https://scifaro.com/en/abs/generic-families-of-finite-metric-spaces-with-identical-or-trivial-1-dimensional-persistence-2202.00577</loc><lastmod>2024-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-families-of-finite-metric-spaces-with-identical-or-trivial-1-dimensional-persistence-2202.00577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-families-of-finite-metric-spaces-with-identical-or-trivial-1-dimensional-persistence-2202.00577"/></url>
<url><loc>https://scifaro.com/en/abs/orthogonal-fold-cut-2202.01293</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthogonal-fold-cut-2202.01293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthogonal-fold-cut-2202.01293"/></url>
<url><loc>https://scifaro.com/en/abs/ripsnet-a-general-architecture-for-fast-and-robust-estimation-of-the-persistent-homology-of-point-clouds-2202.01725</loc><lastmod>2022-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ripsnet-a-general-architecture-for-fast-and-robust-estimation-of-the-persistent-homology-of-point-clouds-2202.01725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ripsnet-a-general-architecture-for-fast-and-robust-estimation-of-the-persistent-homology-of-point-clouds-2202.01725"/></url>
<url><loc>https://scifaro.com/en/abs/k-transmitter-watchman-routes-2202.01757</loc><lastmod>2023-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-transmitter-watchman-routes-2202.01757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-transmitter-watchman-routes-2202.01757"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-comparison-of-geometric-quantities-in-geogebra-2202.04626</loc><lastmod>2022-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-comparison-of-geometric-quantities-in-geogebra-2202.04626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-comparison-of-geometric-quantities-in-geogebra-2202.04626"/></url>
<url><loc>https://scifaro.com/en/abs/automated-discovery-of-geometrical-theorems-in-geogebra-2202.04627</loc><lastmod>2022-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-discovery-of-geometrical-theorems-in-geogebra-2202.04627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-discovery-of-geometrical-theorems-in-geogebra-2202.04627"/></url>
<url><loc>https://scifaro.com/en/abs/robust-sylvester-gallai-type-theorem-for-quadratic-polynomials-2202.04932</loc><lastmod>2022-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-sylvester-gallai-type-theorem-for-quadratic-polynomials-2202.04932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-sylvester-gallai-type-theorem-for-quadratic-polynomials-2202.04932"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedron-kernel-computation-using-a-geometric-approach-2202.06625</loc><lastmod>2022-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedron-kernel-computation-using-a-geometric-approach-2202.06625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedron-kernel-computation-using-a-geometric-approach-2202.06625"/></url>
<url><loc>https://scifaro.com/en/abs/forming-point-patterns-by-a-probabilistic-cellular-automata-rule-2202.06656</loc><lastmod>2022-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forming-point-patterns-by-a-probabilistic-cellular-automata-rule-2202.06656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forming-point-patterns-by-a-probabilistic-cellular-automata-rule-2202.06656"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-continuous-flexible-kokotsakis-belts-of-the-isogonal-type-2202.07777</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-continuous-flexible-kokotsakis-belts-of-the-isogonal-type-2202.07777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-continuous-flexible-kokotsakis-belts-of-the-isogonal-type-2202.07777"/></url>
<url><loc>https://scifaro.com/en/abs/local-decomposition-of-hexahedral-singular-nodes-into-singular-curves-2202.09686</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-decomposition-of-hexahedral-singular-nodes-into-singular-curves-2202.09686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-decomposition-of-hexahedral-singular-nodes-into-singular-curves-2202.09686"/></url>
<url><loc>https://scifaro.com/en/abs/online-spanners-in-metric-spaces-2202.09991</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-spanners-in-metric-spaces-2202.09991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-spanners-in-metric-spaces-2202.09991"/></url>
<url><loc>https://scifaro.com/en/abs/how-fast-can-we-play-tetris-greedily-with-rectangular-pieces-2202.10771</loc><lastmod>2022-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-fast-can-we-play-tetris-greedily-with-rectangular-pieces-2202.10771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-fast-can-we-play-tetris-greedily-with-rectangular-pieces-2202.10771"/></url>
<url><loc>https://scifaro.com/en/abs/flipping-plane-spanning-paths-2202.10831</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flipping-plane-spanning-paths-2202.10831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flipping-plane-spanning-paths-2202.10831"/></url>
<url><loc>https://scifaro.com/en/abs/topological-universality-of-the-art-gallery-problem-2202.11076</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-universality-of-the-art-gallery-problem-2202.11076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-universality-of-the-art-gallery-problem-2202.11076"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-the-k-shortcut-fr-echet-distance-2202.11534</loc><lastmod>2022-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-the-k-shortcut-fr-echet-distance-2202.11534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-the-k-shortcut-fr-echet-distance-2202.11534"/></url>
<url><loc>https://scifaro.com/en/abs/transitions-in-dynamic-point-labeling-2202.11562</loc><lastmod>2026-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transitions-in-dynamic-point-labeling-2202.11562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transitions-in-dynamic-point-labeling-2202.11562"/></url>
<url><loc>https://scifaro.com/en/abs/the-segment-number-algorithms-and-universal-lower-bounds-for-some-classes-of-planar-graphs-2202.11604</loc><lastmod>2022-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-segment-number-algorithms-and-universal-lower-bounds-for-some-classes-of-planar-graphs-2202.11604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-segment-number-algorithms-and-universal-lower-bounds-for-some-classes-of-planar-graphs-2202.11604"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-results-on-untangling-red-blue-matchings-2202.11857</loc><lastmod>2022-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-results-on-untangling-red-blue-matchings-2202.11857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-results-on-untangling-red-blue-matchings-2202.11857"/></url>
<url><loc>https://scifaro.com/en/abs/the-shortest-path-with-increasing-chords-in-a-simple-polygon-2202.12131</loc><lastmod>2022-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-shortest-path-with-increasing-chords-in-a-simple-polygon-2202.12131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-shortest-path-with-increasing-chords-in-a-simple-polygon-2202.12131"/></url>
<url><loc>https://scifaro.com/en/abs/removing-popular-faces-in-curve-arrangements-2202.12175</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/removing-popular-faces-in-curve-arrangements-2202.12175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/removing-popular-faces-in-curve-arrangements-2202.12175"/></url>
<url><loc>https://scifaro.com/en/abs/planarizing-graphs-and-their-drawings-by-vertex-splitting-2202.12293</loc><lastmod>2022-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planarizing-graphs-and-their-drawings-by-vertex-splitting-2202.12293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planarizing-graphs-and-their-drawings-by-vertex-splitting-2202.12293"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-outlier-fr-echet-distance-2202.12824</loc><lastmod>2022-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-outlier-fr-echet-distance-2202.12824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-outlier-fr-echet-distance-2202.12824"/></url>
<url><loc>https://scifaro.com/en/abs/outside-obstacle-representations-with-all-vertices-on-the-outer-face-2202.13015</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outside-obstacle-representations-with-all-vertices-on-the-outer-face-2202.13015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outside-obstacle-representations-with-all-vertices-on-the-outer-face-2202.13015"/></url>
<url><loc>https://scifaro.com/en/abs/parameterised-partially-predrawn-crossing-number-2202.13635</loc><lastmod>2022-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterised-partially-predrawn-crossing-number-2202.13635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterised-partially-predrawn-crossing-number-2202.13635"/></url>
<url><loc>https://scifaro.com/en/abs/a-review-on-geometric-constraint-solving-2202.13795</loc><lastmod>2022-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-review-on-geometric-constraint-solving-2202.13795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-review-on-geometric-constraint-solving-2202.13795"/></url>
<url><loc>https://scifaro.com/en/abs/cgal-made-more-accessible-2202.13889</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cgal-made-more-accessible-2202.13889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cgal-made-more-accessible-2202.13889"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-result-on-impulsive-noise-reduction-in-topological-data-analysis-through-group-equivariant-non-expansive-operators-2202.14021</loc><lastmod>2023-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-result-on-impulsive-noise-reduction-in-topological-data-analysis-through-group-equivariant-non-expansive-operators-2202.14021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-result-on-impulsive-noise-reduction-in-topological-data-analysis-through-group-equivariant-non-expansive-operators-2202.14021"/></url>
<url><loc>https://scifaro.com/en/abs/a-genetic-algorithm-for-straight-line-embedding-of-a-cycle-onto-a-given-set-of-points-inside-simple-polygons-2203.00453</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-genetic-algorithm-for-straight-line-embedding-of-a-cycle-onto-a-given-set-of-points-inside-simple-polygons-2203.00453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-genetic-algorithm-for-straight-line-embedding-of-a-cycle-onto-a-given-set-of-points-inside-simple-polygons-2203.00453"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-of-turn-sequences-2203.00855</loc><lastmod>2022-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-of-turn-sequences-2203.00855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-of-turn-sequences-2203.00855"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-fr-echet-distance-queries-for-segments-2203.01794</loc><lastmod>2022-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-fr-echet-distance-queries-for-segments-2203.01794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-fr-echet-distance-queries-for-segments-2203.01794"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-error-of-random-sampling-uniformly-distributed-random-points-on-parametric-curves-2203.02832</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-error-of-random-sampling-uniformly-distributed-random-points-on-parametric-curves-2203.02832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-error-of-random-sampling-uniformly-distributed-random-points-on-parametric-curves-2203.02832"/></url>
<url><loc>https://scifaro.com/en/abs/farthest-point-voronoi-diagrams-in-the-presence-of-rectangular-obstacles-2203.03198</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/farthest-point-voronoi-diagrams-in-the-presence-of-rectangular-obstacles-2203.03198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/farthest-point-voronoi-diagrams-in-the-presence-of-rectangular-obstacles-2203.03198"/></url>
<url><loc>https://scifaro.com/en/abs/improved-search-of-relevant-points-for-nearest-neighbor-classification-2203.03567</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-search-of-relevant-points-for-nearest-neighbor-classification-2203.03567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-search-of-relevant-points-for-nearest-neighbor-classification-2203.03567"/></url>
<url><loc>https://scifaro.com/en/abs/towards-sub-quadratic-diameter-computation-in-geometric-intersection-graphs-2203.03663</loc><lastmod>2022-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-sub-quadratic-diameter-computation-in-geometric-intersection-graphs-2203.03663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-sub-quadratic-diameter-computation-in-geometric-intersection-graphs-2203.03663"/></url>
<url><loc>https://scifaro.com/en/abs/computing-continuous-dynamic-time-warping-of-time-series-in-polynomial-time-2203.04531</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-continuous-dynamic-time-warping-of-time-series-in-polynomial-time-2203.04531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-continuous-dynamic-time-warping-of-time-series-in-polynomial-time-2203.04531"/></url>
<url><loc>https://scifaro.com/en/abs/on-flipping-the-fr-e-chet-distance-2203.04548</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-flipping-the-fr-e-chet-distance-2203.04548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-flipping-the-fr-e-chet-distance-2203.04548"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-algorithms-for-upward-planarity-2203.05364</loc><lastmod>2022-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-algorithms-for-upward-planarity-2203.05364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-algorithms-for-upward-planarity-2203.05364"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-triangulation-for-flat-tori-2203.05496</loc><lastmod>2024-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-triangulation-for-flat-tori-2203.05496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-triangulation-for-flat-tori-2203.05496"/></url>
<url><loc>https://scifaro.com/en/abs/finding-weakly-simple-closed-quasigeodesics-on-polyhedral-spheres-2203.05853</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-weakly-simple-closed-quasigeodesics-on-polyhedral-spheres-2203.05853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-weakly-simple-closed-quasigeodesics-on-polyhedral-spheres-2203.05853"/></url>
<url><loc>https://scifaro.com/en/abs/flat-delaunay-complexes-for-homeomorphic-manifold-reconstruction-2203.05943</loc><lastmod>2022-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flat-delaunay-complexes-for-homeomorphic-manifold-reconstruction-2203.05943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flat-delaunay-complexes-for-homeomorphic-manifold-reconstruction-2203.05943"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-like-triangulation-of-smooth-orientable-submanifolds-by-l1-norm-minimization-2203.06008</loc><lastmod>2025-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-like-triangulation-of-smooth-orientable-submanifolds-by-l1-norm-minimization-2203.06008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-like-triangulation-of-smooth-orientable-submanifolds-by-l1-norm-minimization-2203.06008"/></url>
<url><loc>https://scifaro.com/en/abs/twisted-ways-to-find-plane-structures-in-simple-drawings-of-complete-graphs-2203.06143</loc><lastmod>2022-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twisted-ways-to-find-plane-structures-in-simple-drawings-of-complete-graphs-2203.06143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twisted-ways-to-find-plane-structures-in-simple-drawings-of-complete-graphs-2203.06143"/></url>
<url><loc>https://scifaro.com/en/abs/short-topological-decompositions-of-non-orientable-surfaces-2203.06659</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-topological-decompositions-of-non-orientable-surfaces-2203.06659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-topological-decompositions-of-non-orientable-surfaces-2203.06659"/></url>
<url><loc>https://scifaro.com/en/abs/swap-shift-and-trim-to-edge-collapse-a-filtration-2203.07022</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/swap-shift-and-trim-to-edge-collapse-a-filtration-2203.07022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/swap-shift-and-trim-to-edge-collapse-a-filtration-2203.07022"/></url>
<url><loc>https://scifaro.com/en/abs/on-semialgebraic-range-reporting-2203.07096</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-semialgebraic-range-reporting-2203.07096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-semialgebraic-range-reporting-2203.07096"/></url>
<url><loc>https://scifaro.com/en/abs/on-cyclic-solutions-to-the-min-max-latency-multi-robot-patrolling-problem-2203.07280</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cyclic-solutions-to-the-min-max-latency-multi-robot-patrolling-problem-2203.07280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cyclic-solutions-to-the-min-max-latency-multi-robot-patrolling-problem-2203.07280"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-error-triangulations-for-sea-surface-reconstruction-2203.07325</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-error-triangulations-for-sea-surface-reconstruction-2203.07325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-error-triangulations-for-sea-surface-reconstruction-2203.07325"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-partition-into-plane-subgraphs-the-cg-shop-challenge-2022-2203.07444</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-partition-into-plane-subgraphs-the-cg-shop-challenge-2022-2203.07444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-partition-into-plane-subgraphs-the-cg-shop-challenge-2022-2203.07444"/></url>
<url><loc>https://scifaro.com/en/abs/eth-tight-algorithms-for-finding-surfaces-in-simplicial-complexes-of-bounded-treewidth-2203.07566</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eth-tight-algorithms-for-finding-surfaces-in-simplicial-complexes-of-bounded-treewidth-2203.07566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eth-tight-algorithms-for-finding-surfaces-in-simplicial-complexes-of-bounded-treewidth-2203.07566"/></url>
<url><loc>https://scifaro.com/en/abs/chains-koch-chains-and-point-sets-with-many-triangulations-2203.07584</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chains-koch-chains-and-point-sets-with-many-triangulations-2203.07584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chains-koch-chains-and-point-sets-with-many-triangulations-2203.07584"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-time-warping-under-translation-approximation-guided-by-space-filling-curves-2203.07898</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-time-warping-under-translation-approximation-guided-by-space-filling-curves-2203.07898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-time-warping-under-translation-approximation-guided-by-space-filling-curves-2203.07898"/></url>
<url><loc>https://scifaro.com/en/abs/point-separation-and-obstacle-removal-by-finding-and-hitting-odd-cycles-2203.08193</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-separation-and-obstacle-removal-by-finding-and-hitting-odd-cycles-2203.08193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-separation-and-obstacle-removal-by-finding-and-hitting-odd-cycles-2203.08193"/></url>
<url><loc>https://scifaro.com/en/abs/tight-lower-bounds-for-approximate-exact-k-center-in-mathbb-r-d-2203.08328</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-lower-bounds-for-approximate-exact-k-center-in-mathbb-r-d-2203.08328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-lower-bounds-for-approximate-exact-k-center-in-mathbb-r-d-2203.08328"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-height-drawings-of-ordered-trees-in-polynomial-time-homotopy-height-of-tree-duals-2203.08364</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-height-drawings-of-ordered-trees-in-polynomial-time-homotopy-height-of-tree-duals-2203.08364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-height-drawings-of-ordered-trees-in-polynomial-time-homotopy-height-of-tree-duals-2203.08364"/></url>
<url><loc>https://scifaro.com/en/abs/gpu-computation-of-the-euler-characteristic-curve-for-imaging-data-2203.09087</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gpu-computation-of-the-euler-characteristic-curve-for-imaging-data-2203.09087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gpu-computation-of-the-euler-characteristic-curve-for-imaging-data-2203.09087"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-queries-for-flat-semi-algebraic-objects-in-three-dimensions-and-related-problems-2203.10241</loc><lastmod>2025-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-queries-for-flat-semi-algebraic-objects-in-three-dimensions-and-related-problems-2203.10241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-queries-for-flat-semi-algebraic-objects-in-three-dimensions-and-related-problems-2203.10241"/></url>
<url><loc>https://scifaro.com/en/abs/on-practical-nearest-sub-trajectory-queries-under-the-fr-echet-distance-2203.10364</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-practical-nearest-sub-trajectory-queries-under-the-fr-echet-distance-2203.10364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-practical-nearest-sub-trajectory-queries-under-the-fr-echet-distance-2203.10364"/></url>
<url><loc>https://scifaro.com/en/abs/dbsop-an-efficient-heuristic-for-speedy-mcmc-sampling-on-polytopes-2203.10916</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dbsop-an-efficient-heuristic-for-speedy-mcmc-sampling-on-polytopes-2203.10916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dbsop-an-efficient-heuristic-for-speedy-mcmc-sampling-on-polytopes-2203.10916"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-maximum-exposure-problem-2203.11114</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-maximum-exposure-problem-2203.11114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-maximum-exposure-problem-2203.11114"/></url>
<url><loc>https://scifaro.com/en/abs/surface-patches-with-rounded-corners-2203.12345</loc><lastmod>2022-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-patches-with-rounded-corners-2203.12345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-patches-with-rounded-corners-2203.12345"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-dominating-sets-2203.13170</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-dominating-sets-2203.13170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-dominating-sets-2203.13170"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-centroidal-voronoi-tessellations-in-high-dimensional-spaces-2203.15507</loc><lastmod>2022-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-centroidal-voronoi-tessellations-in-high-dimensional-spaces-2203.15507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-centroidal-voronoi-tessellations-in-high-dimensional-spaces-2203.15507"/></url>
<url><loc>https://scifaro.com/en/abs/topological-optimization-with-big-steps-2203.16748</loc><lastmod>2023-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-optimization-with-big-steps-2203.16748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-optimization-with-big-steps-2203.16748"/></url>
<url><loc>https://scifaro.com/en/abs/force-directed-algorithms-for-schematic-drawings-and-placement-a-survey-2204.01006</loc><lastmod>2022-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/force-directed-algorithms-for-schematic-drawings-and-placement-a-survey-2204.01006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/force-directed-algorithms-for-schematic-drawings-and-placement-a-survey-2204.01006"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-axis-parallel-lines-in-3d-2204.01772</loc><lastmod>2023-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-axis-parallel-lines-in-3d-2204.01772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-axis-parallel-lines-in-3d-2204.01772"/></url>
<url><loc>https://scifaro.com/en/abs/branch-decomposition-independent-edit-distances-for-merge-trees-2204.02919</loc><lastmod>2022-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branch-decomposition-independent-edit-distances-for-merge-trees-2204.02919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branch-decomposition-independent-edit-distances-for-merge-trees-2204.02919"/></url>
<url><loc>https://scifaro.com/en/abs/flat-folding-an-unassigned-single-vertex-complex-combinatorially-embedded-planar-graph-with-specified-edge-lengths-without-flat-angles-2204.03696</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flat-folding-an-unassigned-single-vertex-complex-combinatorially-embedded-planar-graph-with-specified-edge-lengths-without-flat-angles-2204.03696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flat-folding-an-unassigned-single-vertex-complex-combinatorially-embedded-planar-graph-with-specified-edge-lengths-without-flat-angles-2204.03696"/></url>
<url><loc>https://scifaro.com/en/abs/single-line-apollonian-gaskets-is-the-limit-a-space-filling-fractal-curve-2204.05729</loc><lastmod>2022-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/single-line-apollonian-gaskets-is-the-limit-a-space-filling-fractal-curve-2204.05729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/single-line-apollonian-gaskets-is-the-limit-a-space-filling-fractal-curve-2204.05729"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-the-proximity-connected-two-center-problem-2204.08754</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-the-proximity-connected-two-center-problem-2204.08754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-the-proximity-connected-two-center-problem-2204.08754"/></url>
<url><loc>https://scifaro.com/en/abs/unit-disk-range-searching-and-applications-2204.08992</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-disk-range-searching-and-applications-2204.08992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-disk-range-searching-and-applications-2204.08992"/></url>
<url><loc>https://scifaro.com/en/abs/faster-approximate-covering-of-subcurves-under-the-fr-echet-distance-2204.09949</loc><lastmod>2022-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-approximate-covering-of-subcurves-under-the-fr-echet-distance-2204.09949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-approximate-covering-of-subcurves-under-the-fr-echet-distance-2204.09949"/></url>
<url><loc>https://scifaro.com/en/abs/time-window-frechet-and-metric-based-edit-distance-for-passively-collected-trajectories-2204.10053</loc><lastmod>2022-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-window-frechet-and-metric-based-edit-distance-for-passively-collected-trajectories-2204.10053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-window-frechet-and-metric-based-edit-distance-for-passively-collected-trajectories-2204.10053"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-and-non-lattice-piercing-of-axis-parallel-rectangles-2204.10385</loc><lastmod>2025-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-and-non-lattice-piercing-of-axis-parallel-rectangles-2204.10385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-and-non-lattice-piercing-of-axis-parallel-rectangles-2204.10385"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-graph-drawings-with-star-shaped-boundaries-in-the-plane-2204.10831</loc><lastmod>2022-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-graph-drawings-with-star-shaped-boundaries-in-the-plane-2204.10831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-graph-drawings-with-star-shaped-boundaries-in-the-plane-2204.10831"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-triangular-meshes-by-implicit-multi-sided-surfaces-2204.11070</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-triangular-meshes-by-implicit-multi-sided-surfaces-2204.11070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-triangular-meshes-by-implicit-multi-sided-surfaces-2204.11070"/></url>
<url><loc>https://scifaro.com/en/abs/fast-computation-of-zigzag-persistence-2204.11080</loc><lastmod>2022-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-computation-of-zigzag-persistence-2204.11080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-computation-of-zigzag-persistence-2204.11080"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-half-guarding-monotone-polygons-2204.13143</loc><lastmod>2022-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-half-guarding-monotone-polygons-2204.13143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-half-guarding-monotone-polygons-2204.13143"/></url>
<url><loc>https://scifaro.com/en/abs/np-hardness-of-computing-pl-geometric-category-in-dimension-2-2204.13981</loc><lastmod>2023-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-hardness-of-computing-pl-geometric-category-in-dimension-2-2204.13981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-hardness-of-computing-pl-geometric-category-in-dimension-2-2204.13981"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-k-nearest-neighbor-queries-2205.00277</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-k-nearest-neighbor-queries-2205.00277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-k-nearest-neighbor-queries-2205.00277"/></url>
<url><loc>https://scifaro.com/en/abs/multi-view-geometry-correspondences-refinement-based-on-algebraic-properties-2205.01634</loc><lastmod>2022-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-view-geometry-correspondences-refinement-based-on-algebraic-properties-2205.01634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-view-geometry-correspondences-refinement-based-on-algebraic-properties-2205.01634"/></url>
<url><loc>https://scifaro.com/en/abs/experiments-with-unit-disk-cover-algorithms-for-covering-massive-pointsets-2205.01716</loc><lastmod>2022-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experiments-with-unit-disk-cover-algorithms-for-covering-massive-pointsets-2205.01716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experiments-with-unit-disk-cover-algorithms-for-covering-massive-pointsets-2205.01716"/></url>
<url><loc>https://scifaro.com/en/abs/max-min-k-dispersion-on-a-convex-polygon-2205.02021</loc><lastmod>2022-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/max-min-k-dispersion-on-a-convex-polygon-2205.02021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/max-min-k-dispersion-on-a-convex-polygon-2205.02021"/></url>
<url><loc>https://scifaro.com/en/abs/density-functions-of-periodic-sequences-2205.02226</loc><lastmod>2022-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/density-functions-of-periodic-sequences-2205.02226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/density-functions-of-periodic-sequences-2205.02226"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-degree-plane-geometric-spanners-in-practice-2205.03204</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-degree-plane-geometric-spanners-in-practice-2205.03204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-degree-plane-geometric-spanners-in-practice-2205.03204"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-bounds-for-weak-consistent-digital-rays-in-2d-2205.03450</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-bounds-for-weak-consistent-digital-rays-in-2d-2205.03450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-bounds-for-weak-consistent-digital-rays-in-2d-2205.03450"/></url>
<url><loc>https://scifaro.com/en/abs/dispersing-facilities-on-planar-segment-and-circle-amidst-repulsion-2205.03651</loc><lastmod>2022-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dispersing-facilities-on-planar-segment-and-circle-amidst-repulsion-2205.03651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dispersing-facilities-on-planar-segment-and-circle-amidst-repulsion-2205.03651"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-geometric-tools-for-anomaly-detection-in-stock-markets-2205.03852</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-geometric-tools-for-anomaly-detection-in-stock-markets-2205.03852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-geometric-tools-for-anomaly-detection-in-stock-markets-2205.03852"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-wspds-and-their-applications-2205.04308</loc><lastmod>2022-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-wspds-and-their-applications-2205.04308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-wspds-and-their-applications-2205.04308"/></url>
<url><loc>https://scifaro.com/en/abs/exactly-computable-and-continuous-metrics-on-isometry-classes-of-finite-and-1-periodic-sequences-2205.04388</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exactly-computable-and-continuous-metrics-on-isometry-classes-of-finite-and-1-periodic-sequences-2205.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exactly-computable-and-continuous-metrics-on-isometry-classes-of-finite-and-1-periodic-sequences-2205.04388"/></url>
<url><loc>https://scifaro.com/en/abs/burning-number-for-the-points-in-the-plane-2205.04643</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/burning-number-for-the-points-in-the-plane-2205.04643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/burning-number-for-the-points-in-the-plane-2205.04643"/></url>
<url><loc>https://scifaro.com/en/abs/co-generation-of-collision-free-shapes-for-arbitrary-one-parametric-motion-2205.05760</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-generation-of-collision-free-shapes-for-arbitrary-one-parametric-motion-2205.05760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-generation-of-collision-free-shapes-for-arbitrary-one-parametric-motion-2205.05760"/></url>
<url><loc>https://scifaro.com/en/abs/bottleneck-matching-in-the-plane-2205.05887</loc><lastmod>2022-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottleneck-matching-in-the-plane-2205.05887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottleneck-matching-in-the-plane-2205.05887"/></url>
<url><loc>https://scifaro.com/en/abs/rectangular-mesh-contour-generation-algorithm-for-finite-differences-calculus-2205.06670</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectangular-mesh-contour-generation-algorithm-for-finite-differences-calculus-2205.06670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectangular-mesh-contour-generation-algorithm-for-finite-differences-calculus-2205.06670"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-perimeter-lattice-animals-and-the-constant-isomer-conjecture-2205.07025</loc><lastmod>2022-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-perimeter-lattice-animals-and-the-constant-isomer-conjecture-2205.07025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-perimeter-lattice-animals-and-the-constant-isomer-conjecture-2205.07025"/></url>
<url><loc>https://scifaro.com/en/abs/computing-bend-minimum-orthogonal-drawings-of-plane-series-parallel-graphs-in-linear-time-2205.07500</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-bend-minimum-orthogonal-drawings-of-plane-series-parallel-graphs-in-linear-time-2205.07500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-bend-minimum-orthogonal-drawings-of-plane-series-parallel-graphs-in-linear-time-2205.07500"/></url>
<url><loc>https://scifaro.com/en/abs/unlabeled-multi-robot-motion-planning-with-tighter-separation-bounds-2205.07777</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unlabeled-multi-robot-motion-planning-with-tighter-separation-bounds-2205.07777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unlabeled-multi-robot-motion-planning-with-tighter-separation-bounds-2205.07777"/></url>
<url><loc>https://scifaro.com/en/abs/frequency-competitive-query-strategies-to-maintain-low-congestion-potential-among-moving-entities-2205.09243</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frequency-competitive-query-strategies-to-maintain-low-congestion-potential-among-moving-entities-2205.09243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frequency-competitive-query-strategies-to-maintain-low-congestion-potential-among-moving-entities-2205.09243"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-compressed-cover-tree-for-k-nearest-neighbour-search-and-the-stable-under-noise-mergegram-of-a-point-cloud-2205.10194</loc><lastmod>2023-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-compressed-cover-tree-for-k-nearest-neighbour-search-and-the-stable-under-noise-mergegram-of-a-point-cloud-2205.10194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-compressed-cover-tree-for-k-nearest-neighbour-search-and-the-stable-under-noise-mergegram-of-a-point-cloud-2205.10194"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-network-analysis-using-zigzag-persistence-2205.11338</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-network-analysis-using-zigzag-persistence-2205.11338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-network-analysis-using-zigzag-persistence-2205.11338"/></url>
<url><loc>https://scifaro.com/en/abs/gaussian-persistence-curves-2205.11353</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gaussian-persistence-curves-2205.11353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gaussian-persistence-curves-2205.11353"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-manufacturing-process-planning-for-arbitrary-part-and-tool-shapes-2205.11805</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-manufacturing-process-planning-for-arbitrary-part-and-tool-shapes-2205.11805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-manufacturing-process-planning-for-arbitrary-part-and-tool-shapes-2205.11805"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-and-robust-mesh-booleans-2205.14151</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-and-robust-mesh-booleans-2205.14151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-and-robust-mesh-booleans-2205.14151"/></url>
<url><loc>https://scifaro.com/en/abs/topological-phase-estimation-method-for-reparameterized-periodic-functions-2205.14390</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-phase-estimation-method-for-reparameterized-periodic-functions-2205.14390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-phase-estimation-method-for-reparameterized-periodic-functions-2205.14390"/></url>
<url><loc>https://scifaro.com/en/abs/two-improvements-of-the-foliation-based-quad-meshing-method-2205.14968</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-improvements-of-the-foliation-based-quad-meshing-method-2205.14968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-improvements-of-the-foliation-based-quad-meshing-method-2205.14968"/></url>
<url><loc>https://scifaro.com/en/abs/packing-hitting-and-colouring-squares-2206.02185</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/packing-hitting-and-colouring-squares-2206.02185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/packing-hitting-and-colouring-squares-2206.02185"/></url>
<url><loc>https://scifaro.com/en/abs/large-k-gons-in-a-1-5d-terrain-2206.02396</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-k-gons-in-a-1-5d-terrain-2206.02396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-k-gons-in-a-1-5d-terrain-2206.02396"/></url>
<url><loc>https://scifaro.com/en/abs/forbidding-edges-between-points-in-the-plane-to-disconnect-the-triangulation-flip-graph-2206.02700</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidding-edges-between-points-in-the-plane-to-disconnect-the-triangulation-flip-graph-2206.02700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidding-edges-between-points-in-the-plane-to-disconnect-the-triangulation-flip-graph-2206.02700"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-non-crossing-spanning-trees-2206.03879</loc><lastmod>2022-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-non-crossing-spanning-trees-2206.03879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-non-crossing-spanning-trees-2206.03879"/></url>
<url><loc>https://scifaro.com/en/abs/distinct-angles-in-general-position-2206.04367</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distinct-angles-in-general-position-2206.04367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distinct-angles-in-general-position-2206.04367"/></url>
<url><loc>https://scifaro.com/en/abs/solid-nurbs-conforming-scaffolding-for-isogeometric-analysis-2206.04421</loc><lastmod>2022-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solid-nurbs-conforming-scaffolding-for-isogeometric-analysis-2206.04421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solid-nurbs-conforming-scaffolding-for-isogeometric-analysis-2206.04421"/></url>
<url><loc>https://scifaro.com/en/abs/persistent-homology-for-resource-coverage-a-case-study-of-access-to-polling-sites-2206.04834</loc><lastmod>2023-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/persistent-homology-for-resource-coverage-a-case-study-of-access-to-polling-sites-2206.04834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/persistent-homology-for-resource-coverage-a-case-study-of-access-to-polling-sites-2206.04834"/></url>
<url><loc>https://scifaro.com/en/abs/hamiltonian-quasigeodesics-yield-nets-2206.05353</loc><lastmod>2025-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hamiltonian-quasigeodesics-yield-nets-2206.05353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hamiltonian-quasigeodesics-yield-nets-2206.05353"/></url>
<url><loc>https://scifaro.com/en/abs/learning-joint-surface-atlases-2206.06273</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-joint-surface-atlases-2206.06273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-joint-surface-atlases-2206.06273"/></url>
<url><loc>https://scifaro.com/en/abs/fibered-fiberwise-dimensionality-reduction-of-topologically-complex-data-with-vector-bundles-2206.06513</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fibered-fiberwise-dimensionality-reduction-of-topologically-complex-data-with-vector-bundles-2206.06513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fibered-fiberwise-dimensionality-reduction-of-topologically-complex-data-with-vector-bundles-2206.06513"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-square-roots-and-the-exponential-and-logarithmic-maps-in-geometric-algebras-of-less-than-6d-2206.07496</loc><lastmod>2022-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-square-roots-and-the-exponential-and-logarithmic-maps-in-geometric-algebras-of-less-than-6d-2206.07496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-square-roots-and-the-exponential-and-logarithmic-maps-in-geometric-algebras-of-less-than-6d-2206.07496"/></url>
<url><loc>https://scifaro.com/en/abs/in-range-farthest-point-queries-and-related-problem-in-high-dimensions-2206.07592</loc><lastmod>2022-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/in-range-farthest-point-queries-and-related-problem-in-high-dimensions-2206.07592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/in-range-farthest-point-queries-and-related-problem-in-high-dimensions-2206.07592"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-optimal-linear-diagrams-2206.08631</loc><lastmod>2022-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-optimal-linear-diagrams-2206.08631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-optimal-linear-diagrams-2206.08631"/></url>
<url><loc>https://scifaro.com/en/abs/iclr-2022-challenge-for-computational-geometry-and-topology-design-and-results-2206.09048</loc><lastmod>2022-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iclr-2022-challenge-for-computational-geometry-and-topology-design-and-results-2206.09048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iclr-2022-challenge-for-computational-geometry-and-topology-design-and-results-2206.09048"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-steiner-spanners-light-and-sparse-2206.09648</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-steiner-spanners-light-and-sparse-2206.09648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-steiner-spanners-light-and-sparse-2206.09648"/></url>
<url><loc>https://scifaro.com/en/abs/for-2-m-recognition-and-repair-of-foldings-in-mesh-surfaces-application-to-3d-object-degradation-2206.09699</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/for-2-m-recognition-and-repair-of-foldings-in-mesh-surfaces-application-to-3d-object-degradation-2206.09699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/for-2-m-recognition-and-repair-of-foldings-in-mesh-surfaces-application-to-3d-object-degradation-2206.09699"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-for-the-learning-of-homotopy-a-la-niyogi-smale-and-weinberger-for-subsets-of-euclidean-spaces-and-of-riemannian-manifolds-2206.10485</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-for-the-learning-of-homotopy-a-la-niyogi-smale-and-weinberger-for-subsets-of-euclidean-spaces-and-of-riemannian-manifolds-2206.10485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-for-the-learning-of-homotopy-a-la-niyogi-smale-and-weinberger-for-subsets-of-euclidean-spaces-and-of-riemannian-manifolds-2206.10485"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-sub-barcodes-2206.10504</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-sub-barcodes-2206.10504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-sub-barcodes-2206.10504"/></url>
<url><loc>https://scifaro.com/en/abs/orthogonal-dissection-into-few-rectangles-2206.10675</loc><lastmod>2025-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthogonal-dissection-into-few-rectangles-2206.10675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthogonal-dissection-into-few-rectangles-2206.10675"/></url>
<url><loc>https://scifaro.com/en/abs/reflections-in-an-octagonal-mirror-maze-2206.11413</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflections-in-an-octagonal-mirror-maze-2206.11413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflections-in-an-octagonal-mirror-maze-2206.11413"/></url>
<url><loc>https://scifaro.com/en/abs/metric-optimization-in-penner-coordinates-2206.11456</loc><lastmod>2024-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-optimization-in-penner-coordinates-2206.11456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-optimization-in-penner-coordinates-2206.11456"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-algorithm-for-exact-concave-hull-extraction-2206.11481</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-algorithm-for-exact-concave-hull-extraction-2206.11481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-algorithm-for-exact-concave-hull-extraction-2206.11481"/></url>
<url><loc>https://scifaro.com/en/abs/vrkitchen2-0-indoorkit-a-tutorial-for-augmented-indoor-scene-building-in-omniverse-2206.11887</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vrkitchen2-0-indoorkit-a-tutorial-for-augmented-indoor-scene-building-in-omniverse-2206.11887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vrkitchen2-0-indoorkit-a-tutorial-for-augmented-indoor-scene-building-in-omniverse-2206.11887"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-minimum-bottleneck-moving-spanning-tree-2206.12500</loc><lastmod>2022-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-minimum-bottleneck-moving-spanning-tree-2206.12500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-minimum-bottleneck-moving-spanning-tree-2206.12500"/></url>
<url><loc>https://scifaro.com/en/abs/spectrum-sharing-among-multiple-seller-and-multiple-buyer-operators-of-a-mobile-network-a-stochastic-geometry-approach-2206.12852</loc><lastmod>2022-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectrum-sharing-among-multiple-seller-and-multiple-buyer-operators-of-a-mobile-network-a-stochastic-geometry-approach-2206.12852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectrum-sharing-among-multiple-seller-and-multiple-buyer-operators-of-a-mobile-network-a-stochastic-geometry-approach-2206.12852"/></url>
<url><loc>https://scifaro.com/en/abs/locked-and-unlocked-smooth-embeddings-of-surfaces-2206.12989</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locked-and-unlocked-smooth-embeddings-of-surfaces-2206.12989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locked-and-unlocked-smooth-embeddings-of-surfaces-2206.12989"/></url>
<url><loc>https://scifaro.com/en/abs/the-mutual-visibility-problem-for-fat-robots-with-lights-2206.14423</loc><lastmod>2026-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mutual-visibility-problem-for-fat-robots-with-lights-2206.14423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mutual-visibility-problem-for-fat-robots-with-lights-2206.14423"/></url>
<url><loc>https://scifaro.com/en/abs/rac-drawings-of-graphs-with-low-degree-2206.14909</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rac-drawings-of-graphs-with-low-degree-2206.14909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rac-drawings-of-graphs-with-low-degree-2206.14909"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-weight-euclidean-1-varepsilon-spanners-2206.14911</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-weight-euclidean-1-varepsilon-spanners-2206.14911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-weight-euclidean-1-varepsilon-spanners-2206.14911"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-heuristic-algorithm-for-3d-bin-packing-of-irregular-shaped-items-2206.15116</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-heuristic-algorithm-for-3d-bin-packing-of-irregular-shaped-items-2206.15116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-heuristic-algorithm-for-3d-bin-packing-of-irregular-shaped-items-2206.15116"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-morphing-using-the-hausdorff-distance-and-voronoi-diagrams-2206.15339</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-morphing-using-the-hausdorff-distance-and-voronoi-diagrams-2206.15339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-morphing-using-the-hausdorff-distance-and-voronoi-diagrams-2206.15339"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-and-computing-obstacle-numbers-of-graphs-2206.15414</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-and-computing-obstacle-numbers-of-graphs-2206.15414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-and-computing-obstacle-numbers-of-graphs-2206.15414"/></url>
<url><loc>https://scifaro.com/en/abs/on-streaming-algorithms-for-geometric-independent-set-and-clique-2207.01108</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-streaming-algorithms-for-geometric-independent-set-and-clique-2207.01108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-streaming-algorithms-for-geometric-independent-set-and-clique-2207.01108"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-spectral-coarsening-2207.01146</loc><lastmod>2023-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-spectral-coarsening-2207.01146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-spectral-coarsening-2207.01146"/></url>
<url><loc>https://scifaro.com/en/abs/pargeo-a-library-for-parallel-computational-geometry-2207.01834</loc><lastmod>2022-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pargeo-a-library-for-parallel-computational-geometry-2207.01834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pargeo-a-library-for-parallel-computational-geometry-2207.01834"/></url>
<url><loc>https://scifaro.com/en/abs/multi-target-search-in-euclidean-space-with-ray-shooting-full-version-2207.02436</loc><lastmod>2022-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-target-search-in-euclidean-space-with-ray-shooting-full-version-2207.02436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-target-search-in-euclidean-space-with-ray-shooting-full-version-2207.02436"/></url>
<url><loc>https://scifaro.com/en/abs/value-offset-bifiltrations-for-digital-images-2207.02990</loc><lastmod>2022-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/value-offset-bifiltrations-for-digital-images-2207.02990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/value-offset-bifiltrations-for-digital-images-2207.02990"/></url>
<url><loc>https://scifaro.com/en/abs/opposing-half-guards-2207.04474</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/opposing-half-guards-2207.04474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/opposing-half-guards-2207.04474"/></url>
<url><loc>https://scifaro.com/en/abs/apx-hardness-of-the-minimum-vision-points-problem-2207.04488</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/apx-hardness-of-the-minimum-vision-points-problem-2207.04488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/apx-hardness-of-the-minimum-vision-points-problem-2207.04488"/></url>
<url><loc>https://scifaro.com/en/abs/computing-optimal-kernels-in-two-dimensions-2207.07211</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-optimal-kernels-in-two-dimensions-2207.07211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-optimal-kernels-in-two-dimensions-2207.07211"/></url>
<url><loc>https://scifaro.com/en/abs/random-projections-for-curves-in-high-dimensions-2207.07442</loc><lastmod>2023-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-projections-for-curves-in-high-dimensions-2207.07442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-projections-for-curves-in-high-dimensions-2207.07442"/></url>
<url><loc>https://scifaro.com/en/abs/curve-simplification-and-clustering-under-fr-echet-distance-2207.07809</loc><lastmod>2022-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curve-simplification-and-clustering-under-fr-echet-distance-2207.07809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curve-simplification-and-clustering-under-fr-echet-distance-2207.07809"/></url>
<url><loc>https://scifaro.com/en/abs/on-non-negative-quadratic-programming-in-geometric-optimization-2207.07839</loc><lastmod>2023-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-non-negative-quadratic-programming-in-geometric-optimization-2207.07839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-non-negative-quadratic-programming-in-geometric-optimization-2207.07839"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-algorithms-for-continuous-metrics-on-atomic-clouds-of-unordered-points-2207.08502</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-continuous-metrics-on-atomic-clouds-of-unordered-points-2207.08502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-continuous-metrics-on-atomic-clouds-of-unordered-points-2207.08502"/></url>
<url><loc>https://scifaro.com/en/abs/edit-distance-between-merge-trees-2207.08511</loc><lastmod>2024-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edit-distance-between-merge-trees-2207.08511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edit-distance-between-merge-trees-2207.08511"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-of-the-shape-of-a-hydrokinetic-turbine-s-draft-tube-and-hub-assembly-using-design-by-morphing-with-bayesian-optimization-2207.11451</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-of-the-shape-of-a-hydrokinetic-turbine-s-draft-tube-and-hub-assembly-using-design-by-morphing-with-bayesian-optimization-2207.11451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-of-the-shape-of-a-hydrokinetic-turbine-s-draft-tube-and-hub-assembly-using-design-by-morphing-with-bayesian-optimization-2207.11451"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-weight-convex-polytope-2207.12915</loc><lastmod>2022-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-weight-convex-polytope-2207.12915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-weight-convex-polytope-2207.12915"/></url>
<url><loc>https://scifaro.com/en/abs/fractal-images-as-number-sequences-i-an-introduction-2207.12942</loc><lastmod>2022-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractal-images-as-number-sequences-i-an-introduction-2207.12942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractal-images-as-number-sequences-i-an-introduction-2207.12942"/></url>
<url><loc>https://scifaro.com/en/abs/recent-insights-on-the-uniqueness-problem-of-diffeomorphisms-determined-by-prescribed-jacobian-determinant-and-curl-2207.13053</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recent-insights-on-the-uniqueness-problem-of-diffeomorphisms-determined-by-prescribed-jacobian-determinant-and-curl-2207.13053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recent-insights-on-the-uniqueness-problem-of-diffeomorphisms-determined-by-prescribed-jacobian-determinant-and-curl-2207.13053"/></url>
<url><loc>https://scifaro.com/en/abs/rule-30-solving-the-chaos-2207.13237</loc><lastmod>2022-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rule-30-solving-the-chaos-2207.13237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rule-30-solving-the-chaos-2207.13237"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-diagrams-of-arbitrary-order-on-the-sphere-2207.13788</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-diagrams-of-arbitrary-order-on-the-sphere-2207.13788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-diagrams-of-arbitrary-order-on-the-sphere-2207.13788"/></url>
<url><loc>https://scifaro.com/en/abs/folding-polyiamonds-into-octahedra-2207.13989</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-polyiamonds-into-octahedra-2207.13989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-polyiamonds-into-octahedra-2207.13989"/></url>
<url><loc>https://scifaro.com/en/abs/colorful-two-piercing-theorem-for-boxes-2207.14368</loc><lastmod>2025-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colorful-two-piercing-theorem-for-boxes-2207.14368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colorful-two-piercing-theorem-for-boxes-2207.14368"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-random-points-combinatorial-complexity-and-algorithms-2208.03829</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-random-points-combinatorial-complexity-and-algorithms-2208.03829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-random-points-combinatorial-complexity-and-algorithms-2208.03829"/></url>
<url><loc>https://scifaro.com/en/abs/fast-o-expected-n-algorithm-for-finding-exact-maximum-distance-in-e-2-instead-of-o-n-2-or-o-n-lg-n-2208.04730</loc><lastmod>2022-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-o-expected-n-algorithm-for-finding-exact-maximum-distance-in-e-2-instead-of-o-n-2-or-o-n-lg-n-2208.04730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-o-expected-n-algorithm-for-finding-exact-maximum-distance-in-e-2-instead-of-o-n-2-or-o-n-lg-n-2208.04730"/></url>
<url><loc>https://scifaro.com/en/abs/high-order-mesh-morphing-for-boundary-and-interface-fitting-to-implicit-geometries-2208.05062</loc><lastmod>2023-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-order-mesh-morphing-for-boundary-and-interface-fitting-to-implicit-geometries-2208.05062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-order-mesh-morphing-for-boundary-and-interface-fitting-to-implicit-geometries-2208.05062"/></url>
<url><loc>https://scifaro.com/en/abs/stable-homology-based-cycle-centrality-measures-2208.05565</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-homology-based-cycle-centrality-measures-2208.05565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-homology-based-cycle-centrality-measures-2208.05565"/></url>
<url><loc>https://scifaro.com/en/abs/diamonds-are-forever-in-the-blockchain-geometric-polyhedral-point-set-pattern-matching-2208.05597</loc><lastmod>2022-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diamonds-are-forever-in-the-blockchain-geometric-polyhedral-point-set-pattern-matching-2208.05597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diamonds-are-forever-in-the-blockchain-geometric-polyhedral-point-set-pattern-matching-2208.05597"/></url>
<url><loc>https://scifaro.com/en/abs/empty-triangles-in-generalized-twisted-drawings-of-k-n-2208.05819</loc><lastmod>2022-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/empty-triangles-in-generalized-twisted-drawings-of-k-n-2208.05819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/empty-triangles-in-generalized-twisted-drawings-of-k-n-2208.05819"/></url>
<url><loc>https://scifaro.com/en/abs/a-deformation-based-edit-distance-for-merge-trees-2208.05850</loc><lastmod>2024-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deformation-based-edit-distance-for-merge-trees-2208.05850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deformation-based-edit-distance-for-merge-trees-2208.05850"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-ply-covering-of-points-with-unit-squares-2208.06122</loc><lastmod>2022-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-ply-covering-of-points-with-unit-squares-2208.06122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-ply-covering-of-points-with-unit-squares-2208.06122"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-searching-amid-tetrahedra-in-four-dimensions-2208.06703</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-searching-amid-tetrahedra-in-four-dimensions-2208.06703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-searching-amid-tetrahedra-in-four-dimensions-2208.06703"/></url>
<url><loc>https://scifaro.com/en/abs/degree-of-convexity-and-expected-distances-in-polygons-2208.07106</loc><lastmod>2022-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degree-of-convexity-and-expected-distances-in-polygons-2208.07106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degree-of-convexity-and-expected-distances-in-polygons-2208.07106"/></url>
<url><loc>https://scifaro.com/en/abs/tetrahedralization-of-a-hexahedral-mesh-2208.07128</loc><lastmod>2023-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tetrahedralization-of-a-hexahedral-mesh-2208.07128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tetrahedralization-of-a-hexahedral-mesh-2208.07128"/></url>
<url><loc>https://scifaro.com/en/abs/reduced-connectivity-for-local-bilinear-jacobi-sets-2208.07148</loc><lastmod>2022-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduced-connectivity-for-local-bilinear-jacobi-sets-2208.07148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduced-connectivity-for-local-bilinear-jacobi-sets-2208.07148"/></url>
<url><loc>https://scifaro.com/en/abs/computing-smallest-convex-intersecting-polygons-2208.07567</loc><lastmod>2022-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-smallest-convex-intersecting-polygons-2208.07567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-smallest-convex-intersecting-polygons-2208.07567"/></url>
<url><loc>https://scifaro.com/en/abs/a-heuristic-algorithm-for-straight-line-embedding-of-a-hamiltonian-cycle-onto-a-given-set-of-points-inside-simple-polygons-2208.09275</loc><lastmod>2022-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-heuristic-algorithm-for-straight-line-embedding-of-a-hamiltonian-cycle-onto-a-given-set-of-points-inside-simple-polygons-2208.09275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-heuristic-algorithm-for-straight-line-embedding-of-a-hamiltonian-cycle-onto-a-given-set-of-points-inside-simple-polygons-2208.09275"/></url>
<url><loc>https://scifaro.com/en/abs/counterexamples-expose-gaps-in-the-proof-of-time-complexity-for-cover-trees-introduced-in-2006-2208.09447</loc><lastmod>2022-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexamples-expose-gaps-in-the-proof-of-time-complexity-for-cover-trees-introduced-in-2006-2208.09447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexamples-expose-gaps-in-the-proof-of-time-complexity-for-cover-trees-introduced-in-2006-2208.09447"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-visible-edges-in-polyhedra-2208.09702</loc><lastmod>2023-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-visible-edges-in-polyhedra-2208.09702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-visible-edges-in-polyhedra-2208.09702"/></url>
<url><loc>https://scifaro.com/en/abs/forbid-fast-overlap-removal-by-stochastic-gradient-descent-for-graph-drawing-2208.10334</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbid-fast-overlap-removal-by-stochastic-gradient-descent-for-graph-drawing-2208.10334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbid-fast-overlap-removal-by-stochastic-gradient-descent-for-graph-drawing-2208.10334"/></url>
<url><loc>https://scifaro.com/en/abs/halving-by-a-thousand-cuts-or-punctures-2208.11275</loc><lastmod>2022-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/halving-by-a-thousand-cuts-or-punctures-2208.11275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/halving-by-a-thousand-cuts-or-punctures-2208.11275"/></url>
<url><loc>https://scifaro.com/en/abs/arrangements-of-pseudocircles-on-digons-and-triangles-2208.12110</loc><lastmod>2025-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrangements-of-pseudocircles-on-digons-and-triangles-2208.12110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrangements-of-pseudocircles-on-digons-and-triangles-2208.12110"/></url>
<url><loc>https://scifaro.com/en/abs/polar-spherical-and-orthogonal-space-subdivisions-for-an-algorithm-acceleration-o-1-point-in-polygon-polyhedron-test-2208.12488</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polar-spherical-and-orthogonal-space-subdivisions-for-an-algorithm-acceleration-o-1-point-in-polygon-polyhedron-test-2208.12488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polar-spherical-and-orthogonal-space-subdivisions-for-an-algorithm-acceleration-o-1-point-in-polygon-polyhedron-test-2208.12488"/></url>
<url><loc>https://scifaro.com/en/abs/a-subquadratic-n-epsilon-approximation-for-the-continuous-fr-echet-distance-2208.12721</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-subquadratic-n-epsilon-approximation-for-the-continuous-fr-echet-distance-2208.12721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-subquadratic-n-epsilon-approximation-for-the-continuous-fr-echet-distance-2208.12721"/></url>
<url><loc>https://scifaro.com/en/abs/ortho-unit-polygons-can-be-guarded-with-at-most-lfloor-frac-n-4-8-rfloor-guards-2208.12864</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ortho-unit-polygons-can-be-guarded-with-at-most-lfloor-frac-n-4-8-rfloor-guards-2208.12864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ortho-unit-polygons-can-be-guarded-with-at-most-lfloor-frac-n-4-8-rfloor-guards-2208.12864"/></url>
<url><loc>https://scifaro.com/en/abs/an-fpt-algorithm-for-bipartite-vertex-splitting-2208.12898</loc><lastmod>2022-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-fpt-algorithm-for-bipartite-vertex-splitting-2208.12898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-fpt-algorithm-for-bipartite-vertex-splitting-2208.12898"/></url>
<url><loc>https://scifaro.com/en/abs/distinct-angles-and-angle-chains-in-three-dimensions-2208.13284</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distinct-angles-and-angle-chains-in-three-dimensions-2208.13284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distinct-angles-and-angle-chains-in-three-dimensions-2208.13284"/></url>
<url><loc>https://scifaro.com/en/abs/strictly-convex-drawings-of-3-connected-planar-graphs-2208.13388</loc><lastmod>2022-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strictly-convex-drawings-of-3-connected-planar-graphs-2208.13388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strictly-convex-drawings-of-3-connected-planar-graphs-2208.13388"/></url>
<url><loc>https://scifaro.com/en/abs/planar-confluent-orthogonal-drawings-of-4-modal-digraphs-2208.13446</loc><lastmod>2022-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planar-confluent-orthogonal-drawings-of-4-modal-digraphs-2208.13446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planar-confluent-orthogonal-drawings-of-4-modal-digraphs-2208.13446"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-dags-with-page-number-2-is-np-complete-2208.13615</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-dags-with-page-number-2-is-np-complete-2208.13615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-dags-with-page-number-2-is-np-complete-2208.13615"/></url>
<url><loc>https://scifaro.com/en/abs/generating-regular-hyperbolic-honeycombs-2208.13816</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-regular-hyperbolic-honeycombs-2208.13816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-regular-hyperbolic-honeycombs-2208.13816"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-color-spanning-circle-of-imprecise-points-2208.13865</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-color-spanning-circle-of-imprecise-points-2208.13865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-color-spanning-circle-of-imprecise-points-2208.13865"/></url>
<url><loc>https://scifaro.com/en/abs/unit-length-rectangular-drawings-of-graphs-2208.14142</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-length-rectangular-drawings-of-graphs-2208.14142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-length-rectangular-drawings-of-graphs-2208.14142"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithm-for-minimum-p-union-under-a-geometric-setting-2208.14264</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithm-for-minimum-p-union-under-a-geometric-setting-2208.14264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithm-for-minimum-p-union-under-a-geometric-setting-2208.14264"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-the-complexity-of-the-sensor-target-coverage-problem-through-point-and-set-classification-2208.14800</loc><lastmod>2022-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-the-complexity-of-the-sensor-target-coverage-problem-through-point-and-set-classification-2208.14800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-the-complexity-of-the-sensor-target-coverage-problem-through-point-and-set-classification-2208.14800"/></url>
<url><loc>https://scifaro.com/en/abs/spherical-graph-drawing-by-multi-dimensional-scaling-2209.00191</loc><lastmod>2022-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spherical-graph-drawing-by-multi-dimensional-scaling-2209.00191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spherical-graph-drawing-by-multi-dimensional-scaling-2209.00191"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-representations-of-toroidal-and-klein-bottle-graphs-2209.00576</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-representations-of-toroidal-and-klein-bottle-graphs-2209.00576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-representations-of-toroidal-and-klein-bottle-graphs-2209.00576"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-a-greedy-heuristic-for-the-labeling-of-a-map-with-a-time-window-interface-2209.00913</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-a-greedy-heuristic-for-the-labeling-of-a-map-with-a-time-window-interface-2209.00913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-a-greedy-heuristic-for-the-labeling-of-a-map-with-a-time-window-interface-2209.00913"/></url>
<url><loc>https://scifaro.com/en/abs/mutual-witness-gabriel-drawings-of-complete-bipartite-graphs-2209.01004</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutual-witness-gabriel-drawings-of-complete-bipartite-graphs-2209.01004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutual-witness-gabriel-drawings-of-complete-bipartite-graphs-2209.01004"/></url>
<url><loc>https://scifaro.com/en/abs/can-an-nn-model-plainly-learn-planar-layouts-2209.01075</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-an-nn-model-plainly-learn-planar-layouts-2209.01075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-an-nn-model-plainly-learn-planar-layouts-2209.01075"/></url>
<url><loc>https://scifaro.com/en/abs/shooting-stars-in-simple-drawings-of-k-m-n-2209.01190</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shooting-stars-in-simple-drawings-of-k-m-n-2209.01190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shooting-stars-in-simple-drawings-of-k-m-n-2209.01190"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-spatial-trajectories-2209.01322</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-spatial-trajectories-2209.01322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-spatial-trajectories-2209.01322"/></url>
<url><loc>https://scifaro.com/en/abs/algorithm-for-finding-an-exact-maximum-distance-in-e2-with-oexp-n-complexity-analysis-and-experimental-results-2209.01543</loc><lastmod>2022-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithm-for-finding-an-exact-maximum-distance-in-e2-with-oexp-n-complexity-analysis-and-experimental-results-2209.01543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithm-for-finding-an-exact-maximum-distance-in-e2-with-oexp-n-complexity-analysis-and-experimental-results-2209.01543"/></url>
<url><loc>https://scifaro.com/en/abs/effective-estimation-of-the-dimensions-of-a-manifold-from-random-samples-2209.01839</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-estimation-of-the-dimensions-of-a-manifold-from-random-samples-2209.01839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-estimation-of-the-dimensions-of-a-manifold-from-random-samples-2209.01839"/></url>
<url><loc>https://scifaro.com/en/abs/unique-sink-orientations-of-grids-is-in-unique-end-of-potential-line-2209.02101</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-sink-orientations-of-grids-is-in-unique-end-of-potential-line-2209.02101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-sink-orientations-of-grids-is-in-unique-end-of-potential-line-2209.02101"/></url>
<url><loc>https://scifaro.com/en/abs/nearest-neighbor-decompositions-of-drawings-2209.02103</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearest-neighbor-decompositions-of-drawings-2209.02103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearest-neighbor-decompositions-of-drawings-2209.02103"/></url>
<url><loc>https://scifaro.com/en/abs/well-separation-and-hyperplane-transversals-in-high-dimensions-2209.02319</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-separation-and-hyperplane-transversals-in-high-dimensions-2209.02319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-separation-and-hyperplane-transversals-in-high-dimensions-2209.02319"/></url>
<url><loc>https://scifaro.com/en/abs/on-plane-subgraphs-of-complete-topological-drawings-2209.03072</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-plane-subgraphs-of-complete-topological-drawings-2209.03072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-plane-subgraphs-of-complete-topological-drawings-2209.03072"/></url>
<url><loc>https://scifaro.com/en/abs/trajectory-range-visibility-2209.04013</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trajectory-range-visibility-2209.04013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trajectory-range-visibility-2209.04013"/></url>
<url><loc>https://scifaro.com/en/abs/separating-bichromatic-point-sets-in-the-plane-by-restricted-orientation-convex-hulls-2209.04258</loc><lastmod>2022-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-bichromatic-point-sets-in-the-plane-by-restricted-orientation-convex-hulls-2209.04258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-bichromatic-point-sets-in-the-plane-by-restricted-orientation-convex-hulls-2209.04258"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-30th-international-symposium-on-graph-drawing-and-network-visualization-gd-2022-2209.04402</loc><lastmod>2022-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-30th-international-symposium-on-graph-drawing-and-network-visualization-gd-2022-2209.04402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-30th-international-symposium-on-graph-drawing-and-network-visualization-gd-2022-2209.04402"/></url>
<url><loc>https://scifaro.com/en/abs/localization-with-single-or-antipodal-distance-measurements-2209.04838</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localization-with-single-or-antipodal-distance-measurements-2209.04838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localization-with-single-or-antipodal-distance-measurements-2209.04838"/></url>
<url><loc>https://scifaro.com/en/abs/topological-measures-for-pattern-quantification-of-impact-centers-in-piezo-vibration-striking-treatment-pvst-2209.05531</loc><lastmod>2022-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-measures-for-pattern-quantification-of-impact-centers-in-piezo-vibration-striking-treatment-pvst-2209.05531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-measures-for-pattern-quantification-of-impact-centers-in-piezo-vibration-striking-treatment-pvst-2209.05531"/></url>
<url><loc>https://scifaro.com/en/abs/rectilinear-convex-hull-of-points-in-3d-2209.06020</loc><lastmod>2022-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rectilinear-convex-hull-of-points-in-3d-2209.06020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rectilinear-convex-hull-of-points-in-3d-2209.06020"/></url>
<url><loc>https://scifaro.com/en/abs/red-blue-set-cover-problem-on-axis-parallel-hyperplanes-and-other-objects-2209.06661</loc><lastmod>2022-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/red-blue-set-cover-problem-on-axis-parallel-hyperplanes-and-other-objects-2209.06661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/red-blue-set-cover-problem-on-axis-parallel-hyperplanes-and-other-objects-2209.06661"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-total-variation-processing-of-shapes-theory-and-applications-2209.07517</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-total-variation-processing-of-shapes-theory-and-applications-2209.07517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-total-variation-processing-of-shapes-theory-and-applications-2209.07517"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimal-coverage-of-a-tree-with-multiple-robots-2209.07557</loc><lastmod>2022-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimal-coverage-of-a-tree-with-multiple-robots-2209.07557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimal-coverage-of-a-tree-with-multiple-robots-2209.07557"/></url>
<url><loc>https://scifaro.com/en/abs/the-dispersive-art-gallery-problem-2209.10291</loc><lastmod>2023-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dispersive-art-gallery-problem-2209.10291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dispersive-art-gallery-problem-2209.10291"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-reconfiguring-a-connected-swarm-of-labeled-robots-2209.11028</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-reconfiguring-a-connected-swarm-of-labeled-robots-2209.11028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-reconfiguring-a-connected-swarm-of-labeled-robots-2209.11028"/></url>
<url><loc>https://scifaro.com/en/abs/piercing-diametral-disks-induced-by-edges-of-maximum-spanning-tree-2209.11260</loc><lastmod>2022-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/piercing-diametral-disks-induced-by-edges-of-maximum-spanning-tree-2209.11260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/piercing-diametral-disks-induced-by-edges-of-maximum-spanning-tree-2209.11260"/></url>
<url><loc>https://scifaro.com/en/abs/distance-measures-for-geometric-graphs-2209.12869</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distance-measures-for-geometric-graphs-2209.12869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distance-measures-for-geometric-graphs-2209.12869"/></url>
<url><loc>https://scifaro.com/en/abs/improved-and-generalized-algorithms-for-burning-a-planar-point-set-2209.13024</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-and-generalized-algorithms-for-burning-a-planar-point-set-2209.13024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-and-generalized-algorithms-for-burning-a-planar-point-set-2209.13024"/></url>
<url><loc>https://scifaro.com/en/abs/an-o-3-82-k-time-fpt-algorithm-for-convex-flip-distance-2209.13134</loc><lastmod>2023-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-o-3-82-k-time-fpt-algorithm-for-convex-flip-distance-2209.13134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-o-3-82-k-time-fpt-algorithm-for-convex-flip-distance-2209.13134"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-placement-of-base-stations-in-border-surveillance-using-limited-capacity-drones-2209.13311</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-placement-of-base-stations-in-border-surveillance-using-limited-capacity-drones-2209.13311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-placement-of-base-stations-in-border-surveillance-using-limited-capacity-drones-2209.13311"/></url>
<url><loc>https://scifaro.com/en/abs/mathematics-and-flamenco-an-unexpected-partnership-2209.13538</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematics-and-flamenco-an-unexpected-partnership-2209.13538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematics-and-flamenco-an-unexpected-partnership-2209.13538"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-link-fencing-2209.14804</loc><lastmod>2022-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-link-fencing-2209.14804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-link-fencing-2209.14804"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-algorithm-for-generalized-v-c-ech-complex-construction-2209.15574</loc><lastmod>2022-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-algorithm-for-generalized-v-c-ech-complex-construction-2209.15574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-algorithm-for-generalized-v-c-ech-complex-construction-2209.15574"/></url>
<url><loc>https://scifaro.com/en/abs/closed-cap-condition-under-the-cap-construction-algorithm-2210.00198</loc><lastmod>2024-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closed-cap-condition-under-the-cap-construction-algorithm-2210.00198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closed-cap-condition-under-the-cap-construction-algorithm-2210.00198"/></url>
<url><loc>https://scifaro.com/en/abs/no-selection-lemma-for-empty-triangles-2210.00630</loc><lastmod>2022-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-selection-lemma-for-empty-triangles-2210.00630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-selection-lemma-for-empty-triangles-2210.00630"/></url>
<url><loc>https://scifaro.com/en/abs/apud-1-1-recognition-in-polynomial-time-2210.04090</loc><lastmod>2022-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/apud-1-1-recognition-in-polynomial-time-2210.04090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/apud-1-1-recognition-in-polynomial-time-2210.04090"/></url>
<url><loc>https://scifaro.com/en/abs/developable-quad-meshes-and-contact-element-nets-2210.04099</loc><lastmod>2023-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/developable-quad-meshes-and-contact-element-nets-2210.04099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/developable-quad-meshes-and-contact-element-nets-2210.04099"/></url>
<url><loc>https://scifaro.com/en/abs/the-rectilinear-steiner-forest-arborescence-problem-2210.04576</loc><lastmod>2022-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rectilinear-steiner-forest-arborescence-problem-2210.04576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rectilinear-steiner-forest-arborescence-problem-2210.04576"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-approaches-to-orthogonal-compaction-2210.05019</loc><lastmod>2025-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-approaches-to-orthogonal-compaction-2210.05019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-approaches-to-orthogonal-compaction-2210.05019"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-planar-graph-drawings-through-3d-2210.05384</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-planar-graph-drawings-through-3d-2210.05384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-planar-graph-drawings-through-3d-2210.05384"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-reachability-and-distance-oracles-for-transmission-graphs-2210.05788</loc><lastmod>2022-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-reachability-and-distance-oracles-for-transmission-graphs-2210.05788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-reachability-and-distance-oracles-for-transmission-graphs-2210.05788"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-characterization-using-topological-data-analysis-application-to-piezo-vibration-striking-treatment-2210.06333</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-characterization-using-topological-data-analysis-application-to-piezo-vibration-striking-treatment-2210.06333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-characterization-using-topological-data-analysis-application-to-piezo-vibration-striking-treatment-2210.06333"/></url>
<url><loc>https://scifaro.com/en/abs/acute-triangulation-of-constant-curvature-polygonal-complexes-2210.08597</loc><lastmod>2022-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acute-triangulation-of-constant-curvature-polygonal-complexes-2210.08597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acute-triangulation-of-constant-curvature-polygonal-complexes-2210.08597"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-stable-distance-on-merge-trees-2210.08644</loc><lastmod>2022-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-stable-distance-on-merge-trees-2210.08644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-stable-distance-on-merge-trees-2210.08644"/></url>
<url><loc>https://scifaro.com/en/abs/simplex-range-searching-revisited-how-to-shave-logs-in-multi-level-data-structures-2210.10172</loc><lastmod>2022-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplex-range-searching-revisited-how-to-shave-logs-in-multi-level-data-structures-2210.10172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplex-range-searching-revisited-how-to-shave-logs-in-multi-level-data-structures-2210.10172"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-embedded-graphs-using-average-branching-distance-2210.10181</loc><lastmod>2022-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-embedded-graphs-using-average-branching-distance-2210.10181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-embedded-graphs-using-average-branching-distance-2210.10181"/></url>
<url><loc>https://scifaro.com/en/abs/stability-of-entropic-wasserstein-barycenters-and-application-to-random-geometric-graphs-2210.10535</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-of-entropic-wasserstein-barycenters-and-application-to-random-geometric-graphs-2210.10535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-of-entropic-wasserstein-barycenters-and-application-to-random-geometric-graphs-2210.10535"/></url>
<url><loc>https://scifaro.com/en/abs/blocking-delaunay-triangulations-from-the-exterior-2210.12015</loc><lastmod>2022-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blocking-delaunay-triangulations-from-the-exterior-2210.12015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blocking-delaunay-triangulations-from-the-exterior-2210.12015"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-longest-flip-sequence-to-untangle-segments-in-the-plane-2210.12036</loc><lastmod>2023-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-longest-flip-sequence-to-untangle-segments-in-the-plane-2210.12036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-longest-flip-sequence-to-untangle-segments-in-the-plane-2210.12036"/></url>
<url><loc>https://scifaro.com/en/abs/the-point-boundary-art-gallery-problem-is-exists-mathbb-r-hard-2210.12817</loc><lastmod>2025-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-point-boundary-art-gallery-problem-is-exists-mathbb-r-hard-2210.12817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-point-boundary-art-gallery-problem-is-exists-mathbb-r-hard-2210.12817"/></url>
<url><loc>https://scifaro.com/en/abs/net-separation-oriented-printed-circuit-board-placement-via-margin-maximization-2210.14259</loc><lastmod>2022-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/net-separation-oriented-printed-circuit-board-placement-via-margin-maximization-2210.14259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/net-separation-oriented-printed-circuit-board-placement-via-margin-maximization-2210.14259"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-lower-bound-for-simplex-range-reporting-2210.14736</loc><lastmod>2022-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-lower-bound-for-simplex-range-reporting-2210.14736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-lower-bound-for-simplex-range-reporting-2210.14736"/></url>
<url><loc>https://scifaro.com/en/abs/partitioning-a-polygon-into-small-pieces-2211.01359</loc><lastmod>2024-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partitioning-a-polygon-into-small-pieces-2211.01359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partitioning-a-polygon-into-small-pieces-2211.01359"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-approximation-schemes-on-disk-graphs-2211.02717</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-approximation-schemes-on-disk-graphs-2211.02717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-approximation-schemes-on-disk-graphs-2211.02717"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-of-discs-by-octagons-on-pixel-plane-via-jaccards-proximity-criterion-theoretical-approach-and-experimental-results-analysis-2211.02835</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-of-discs-by-octagons-on-pixel-plane-via-jaccards-proximity-criterion-theoretical-approach-and-experimental-results-analysis-2211.02835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-of-discs-by-octagons-on-pixel-plane-via-jaccards-proximity-criterion-theoretical-approach-and-experimental-results-analysis-2211.02835"/></url>
<url><loc>https://scifaro.com/en/abs/density-of-triangulated-ternary-disc-packings-2211.02905</loc><lastmod>2022-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/density-of-triangulated-ternary-disc-packings-2211.02905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/density-of-triangulated-ternary-disc-packings-2211.02905"/></url>
<url><loc>https://scifaro.com/en/abs/map-matching-queries-on-realistic-input-graphs-under-the-fr-echet-distance-2211.02951</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/map-matching-queries-on-realistic-input-graphs-under-the-fr-echet-distance-2211.02951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/map-matching-queries-on-realistic-input-graphs-under-the-fr-echet-distance-2211.02951"/></url>
<url><loc>https://scifaro.com/en/abs/metricizing-the-euclidean-space-towards-desired-distance-relations-in-point-clouds-2211.03674</loc><lastmod>2024-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metricizing-the-euclidean-space-towards-desired-distance-relations-in-point-clouds-2211.03674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metricizing-the-euclidean-space-towards-desired-distance-relations-in-point-clouds-2211.03674"/></url>
<url><loc>https://scifaro.com/en/abs/a-deterministic-near-linear-time-approximation-scheme-for-geometric-transportation-2211.03891</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deterministic-near-linear-time-approximation-scheme-for-geometric-transportation-2211.03891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deterministic-near-linear-time-approximation-scheme-for-geometric-transportation-2211.03891"/></url>
<url><loc>https://scifaro.com/en/abs/certified-numerical-real-root-isolation-of-zero-dimensional-multivariate-real-nonlinear-systems-2211.05266</loc><lastmod>2022-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-numerical-real-root-isolation-of-zero-dimensional-multivariate-real-nonlinear-systems-2211.05266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-numerical-real-root-isolation-of-zero-dimensional-multivariate-real-nonlinear-systems-2211.05266"/></url>
<url><loc>https://scifaro.com/en/abs/finding-triangles-and-other-small-subgraphs-in-geometric-intersection-graphs-2211.05345</loc><lastmod>2022-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-triangles-and-other-small-subgraphs-in-geometric-intersection-graphs-2211.05345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-triangles-and-other-small-subgraphs-in-geometric-intersection-graphs-2211.05345"/></url>
<url><loc>https://scifaro.com/en/abs/filtration-domination-in-bifiltered-graphs-2211.05574</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filtration-domination-in-bifiltered-graphs-2211.05574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filtration-domination-in-bifiltered-graphs-2211.05574"/></url>
<url><loc>https://scifaro.com/en/abs/a-closer-cut-computing-near-optimal-lawn-mowing-tours-2211.05891</loc><lastmod>2022-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-closer-cut-computing-near-optimal-lawn-mowing-tours-2211.05891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-closer-cut-computing-near-optimal-lawn-mowing-tours-2211.05891"/></url>
<url><loc>https://scifaro.com/en/abs/the-stackelberg-game-responses-to-regular-strategies-2211.06472</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stackelberg-game-responses-to-regular-strategies-2211.06472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stackelberg-game-responses-to-regular-strategies-2211.06472"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-lambda-low-density-value-2211.07039</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-lambda-low-density-value-2211.07039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-lambda-low-density-value-2211.07039"/></url>
<url><loc>https://scifaro.com/en/abs/shellability-is-hard-even-for-balls-2211.07978</loc><lastmod>2024-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shellability-is-hard-even-for-balls-2211.07978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shellability-is-hard-even-for-balls-2211.07978"/></url>
<url><loc>https://scifaro.com/en/abs/reconstruction-of-convex-sets-from-one-or-two-x-rays-2211.08091</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstruction-of-convex-sets-from-one-or-two-x-rays-2211.08091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstruction-of-convex-sets-from-one-or-two-x-rays-2211.08091"/></url>
<url><loc>https://scifaro.com/en/abs/improved-coresets-for-euclidean-k-means-2211.08184</loc><lastmod>2022-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-coresets-for-euclidean-k-means-2211.08184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-coresets-for-euclidean-k-means-2211.08184"/></url>
<url><loc>https://scifaro.com/en/abs/keeping-it-sparse-computing-persistent-homology-revisited-2211.09075</loc><lastmod>2024-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/keeping-it-sparse-computing-persistent-homology-revisited-2211.09075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/keeping-it-sparse-computing-persistent-homology-revisited-2211.09075"/></url>
<url><loc>https://scifaro.com/en/abs/re-packing-equal-disks-into-rectangle-2211.09603</loc><lastmod>2022-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/re-packing-equal-disks-into-rectangle-2211.09603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/re-packing-equal-disks-into-rectangle-2211.09603"/></url>
<url><loc>https://scifaro.com/en/abs/the-tight-spanning-ratio-of-the-rectangle-delaunay-triangulation-2211.11987</loc><lastmod>2025-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tight-spanning-ratio-of-the-rectangle-delaunay-triangulation-2211.11987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tight-spanning-ratio-of-the-rectangle-delaunay-triangulation-2211.11987"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-approximation-algorithms-for-volumes-of-spectrahedra-2211.12541</loc><lastmod>2022-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-approximation-algorithms-for-volumes-of-spectrahedra-2211.12541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-approximation-algorithms-for-volumes-of-spectrahedra-2211.12541"/></url>
<url><loc>https://scifaro.com/en/abs/universal-convex-covering-problems-under-translation-and-discrete-rotations-2211.14807</loc><lastmod>2022-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-convex-covering-problems-under-translation-and-discrete-rotations-2211.14807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-convex-covering-problems-under-translation-and-discrete-rotations-2211.14807"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-between-se-3-equivariant-networks-via-steerable-kernels-and-group-convolution-2211.15903</loc><lastmod>2022-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-between-se-3-equivariant-networks-via-steerable-kernels-and-group-convolution-2211.15903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-between-se-3-equivariant-networks-via-steerable-kernels-and-group-convolution-2211.15903"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-robot-reachable-space-using-convex-polytopes-2211.17054</loc><lastmod>2022-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-robot-reachable-space-using-convex-polytopes-2211.17054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-robot-reachable-space-using-convex-polytopes-2211.17054"/></url>
<url><loc>https://scifaro.com/en/abs/tutte-embeddings-of-tetrahedral-meshes-2212.00452</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tutte-embeddings-of-tetrahedral-meshes-2212.00452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tutte-embeddings-of-tetrahedral-meshes-2212.00452"/></url>
<url><loc>https://scifaro.com/en/abs/the-medial-axis-of-closed-bounded-sets-is-lipschitz-stable-with-respect-to-the-hausdorff-distance-under-ambient-diffeomorphisms-2212.01118</loc><lastmod>2024-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-medial-axis-of-closed-bounded-sets-is-lipschitz-stable-with-respect-to-the-hausdorff-distance-under-ambient-diffeomorphisms-2212.01118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-medial-axis-of-closed-bounded-sets-is-lipschitz-stable-with-respect-to-the-hausdorff-distance-under-ambient-diffeomorphisms-2212.01118"/></url>
<url><loc>https://scifaro.com/en/abs/sometimes-two-irrational-guards-are-needed-2212.01211</loc><lastmod>2026-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sometimes-two-irrational-guards-are-needed-2212.01211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sometimes-two-irrational-guards-are-needed-2212.01211"/></url>
<url><loc>https://scifaro.com/en/abs/stabbing-balls-with-line-segments-and-polygonal-paths-2212.01458</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabbing-balls-with-line-segments-and-polygonal-paths-2212.01458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabbing-balls-with-line-segments-and-polygonal-paths-2212.01458"/></url>
<url><loc>https://scifaro.com/en/abs/cup-product-persistence-and-its-efficient-computation-2212.01633</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cup-product-persistence-and-its-efficient-computation-2212.01633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cup-product-persistence-and-its-efficient-computation-2212.01633"/></url>
<url><loc>https://scifaro.com/en/abs/computing-a-dirichlet-domain-for-a-hyperbolic-surface-2212.01934</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-a-dirichlet-domain-for-a-hyperbolic-surface-2212.01934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-a-dirichlet-domain-for-a-hyperbolic-surface-2212.01934"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algebraic-degeneracy-testing-2212.03030</loc><lastmod>2022-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algebraic-degeneracy-testing-2212.03030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algebraic-degeneracy-testing-2212.03030"/></url>
<url><loc>https://scifaro.com/en/abs/isometrically-deformable-cones-and-cylinders-carrying-planar-curves-2212.05484</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isometrically-deformable-cones-and-cylinders-carrying-planar-curves-2212.05484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isometrically-deformable-cones-and-cylinders-carrying-planar-curves-2212.05484"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-vertex-connectivity-of-1-plane-graphs-2212.06782</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-vertex-connectivity-of-1-plane-graphs-2212.06782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-vertex-connectivity-of-1-plane-graphs-2212.06782"/></url>
<url><loc>https://scifaro.com/en/abs/data-structures-for-approximate-discrete-fr-echet-distance-2212.07124</loc><lastmod>2024-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-structures-for-approximate-discrete-fr-echet-distance-2212.07124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-structures-for-approximate-discrete-fr-echet-distance-2212.07124"/></url>
<url><loc>https://scifaro.com/en/abs/toroidal-coordinates-decorrelating-circular-coordinates-with-lattice-reduction-2212.07201</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toroidal-coordinates-decorrelating-circular-coordinates-with-lattice-reduction-2212.07201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toroidal-coordinates-decorrelating-circular-coordinates-with-lattice-reduction-2212.07201"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-simulation-of-simplicity-for-geometric-degeneracies-2212.08226</loc><lastmod>2022-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-simulation-of-simplicity-for-geometric-degeneracies-2212.08226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-simulation-of-simplicity-for-geometric-degeneracies-2212.08226"/></url>
<url><loc>https://scifaro.com/en/abs/learning-on-persistence-diagrams-as-radon-measures-2212.08295</loc><lastmod>2022-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-on-persistence-diagrams-as-radon-measures-2212.08295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-on-persistence-diagrams-as-radon-measures-2212.08295"/></url>
<url><loc>https://scifaro.com/en/abs/surfacevoronoi-efficiently-computing-voronoi-diagrams-over-mesh-surfaces-with-arbitrary-distance-solvers-2212.09029</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surfacevoronoi-efficiently-computing-voronoi-diagrams-over-mesh-surfaces-with-arbitrary-distance-solvers-2212.09029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surfacevoronoi-efficiently-computing-voronoi-diagrams-over-mesh-surfaces-with-arbitrary-distance-solvers-2212.09029"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-and-adaptive-landmark-sets-for-finite-pseudometric-spaces-2212.09826</loc><lastmod>2023-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-and-adaptive-landmark-sets-for-finite-pseudometric-spaces-2212.09826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-and-adaptive-landmark-sets-for-finite-pseudometric-spaces-2212.09826"/></url>
<url><loc>https://scifaro.com/en/abs/reasonable-thickness-determination-for-implicit-porous-sheet-structure-using-persistent-homology-2212.10185</loc><lastmod>2022-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasonable-thickness-determination-for-implicit-porous-sheet-structure-using-persistent-homology-2212.10185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasonable-thickness-determination-for-implicit-porous-sheet-structure-using-persistent-homology-2212.10185"/></url>
<url><loc>https://scifaro.com/en/abs/circle-packing-in-regular-polygons-2212.12287</loc><lastmod>2023-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circle-packing-in-regular-polygons-2212.12287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circle-packing-in-regular-polygons-2212.12287"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-flattening-fixed-angle-orthogonal-chains-2212.12450</loc><lastmod>2022-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-flattening-fixed-angle-orthogonal-chains-2212.12450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-flattening-fixed-angle-orthogonal-chains-2212.12450"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-graph-reconstruction-and-representation-using-augmented-persistence-diagrams-2212.13206</loc><lastmod>2022-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-graph-reconstruction-and-representation-using-augmented-persistence-diagrams-2212.13206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-graph-reconstruction-and-representation-using-augmented-persistence-diagrams-2212.13206"/></url>
<url><loc>https://scifaro.com/en/abs/intersecting-ellipses-induced-by-a-max-sum-matching-2212.14200</loc><lastmod>2023-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersecting-ellipses-induced-by-a-max-sum-matching-2212.14200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersecting-ellipses-induced-by-a-max-sum-matching-2212.14200"/></url>
<url><loc>https://scifaro.com/en/abs/every-combinatorial-polyhedron-can-unfold-with-overlap-2212.14721</loc><lastmod>2023-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/every-combinatorial-polyhedron-can-unfold-with-overlap-2212.14721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/every-combinatorial-polyhedron-can-unfold-with-overlap-2212.14721"/></url>
<url><loc>https://scifaro.com/en/abs/implicitization-of-biquadratic-b-ezier-triangle-and-quadrilateral-surfaces-2301.01318</loc><lastmod>2023-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicitization-of-biquadratic-b-ezier-triangle-and-quadrilateral-surfaces-2301.01318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicitization-of-biquadratic-b-ezier-triangle-and-quadrilateral-surfaces-2301.01318"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-width-of-the-regular-n-simplex-2301.02616</loc><lastmod>2023-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-width-of-the-regular-n-simplex-2301.02616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-width-of-the-regular-n-simplex-2301.02616"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-overlap-area-of-a-convex-polyhedron-and-a-convex-polygon-under-translation-2301.02949</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-overlap-area-of-a-convex-polyhedron-and-a-convex-polygon-under-translation-2301.02949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-overlap-area-of-a-convex-polyhedron-and-a-convex-polygon-under-translation-2301.02949"/></url>
<url><loc>https://scifaro.com/en/abs/machining-feature-recognition-using-descriptors-with-range-constraints-for-mechanical-3d-models-2301.03167</loc><lastmod>2023-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/machining-feature-recognition-using-descriptors-with-range-constraints-for-mechanical-3d-models-2301.03167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/machining-feature-recognition-using-descriptors-with-range-constraints-for-mechanical-3d-models-2301.03167"/></url>
<url><loc>https://scifaro.com/en/abs/dimensionality-reduction-for-persistent-homology-with-gaussian-kernels-2301.03321</loc><lastmod>2023-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimensionality-reduction-for-persistent-homology-with-gaussian-kernels-2301.03321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimensionality-reduction-for-persistent-homology-with-gaussian-kernels-2301.03321"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-geometric-set-systems-and-the-beck-fiala-conjecture-2301.03329</loc><lastmod>2023-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-geometric-set-systems-and-the-beck-fiala-conjecture-2301.03329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-geometric-set-systems-and-the-beck-fiala-conjecture-2301.03329"/></url>
<url><loc>https://scifaro.com/en/abs/strong-collapse-of-random-simplicial-complexes-2301.03514</loc><lastmod>2023-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-collapse-of-random-simplicial-complexes-2301.03514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-collapse-of-random-simplicial-complexes-2301.03514"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-centre-disjoint-mergeable-disks-2301.04350</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-centre-disjoint-mergeable-disks-2301.04350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-centre-disjoint-mergeable-disks-2301.04350"/></url>
<url><loc>https://scifaro.com/en/abs/fast-persistent-homology-computation-for-functions-on-mathbb-r-2301.04745</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-persistent-homology-computation-for-functions-on-mathbb-r-2301.04745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-persistent-homology-computation-for-functions-on-mathbb-r-2301.04745"/></url>
<url><loc>https://scifaro.com/en/abs/on-voronoi-visibility-maps-of-1-5d-terrains-with-multiple-viewpoints-2301.05049</loc><lastmod>2023-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-voronoi-visibility-maps-of-1-5d-terrains-with-multiple-viewpoints-2301.05049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-voronoi-visibility-maps-of-1-5d-terrains-with-multiple-viewpoints-2301.05049"/></url>
<url><loc>https://scifaro.com/en/abs/density-functions-of-periodic-sequences-of-continuous-events-2301.05137</loc><lastmod>2023-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/density-functions-of-periodic-sequences-of-continuous-events-2301.05137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/density-functions-of-periodic-sequences-of-continuous-events-2301.05137"/></url>
<url><loc>https://scifaro.com/en/abs/recognizing-unit-disk-graphs-in-hyperbolic-geometry-is-exists-mathbb-r-complete-2301.05550</loc><lastmod>2023-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognizing-unit-disk-graphs-in-hyperbolic-geometry-is-exists-mathbb-r-complete-2301.05550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognizing-unit-disk-graphs-in-hyperbolic-geometry-is-exists-mathbb-r-complete-2301.05550"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-k-colored-crossing-ratio-of-dense-geometric-graphs-2301.07261</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-k-colored-crossing-ratio-of-dense-geometric-graphs-2301.07261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-k-colored-crossing-ratio-of-dense-geometric-graphs-2301.07261"/></url>
<url><loc>https://scifaro.com/en/abs/robust-zero-crossings-detection-in-noisy-signals-using-topological-signal-processing-2301.07703</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-zero-crossings-detection-in-noisy-signals-using-topological-signal-processing-2301.07703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-zero-crossings-detection-in-noisy-signals-using-topological-signal-processing-2301.07703"/></url>
<url><loc>https://scifaro.com/en/abs/freeze-tag-is-np-hard-in-3d-with-l-1-distance-2301.07757</loc><lastmod>2023-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/freeze-tag-is-np-hard-in-3d-with-l-1-distance-2301.07757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/freeze-tag-is-np-hard-in-3d-with-l-1-distance-2301.07757"/></url>
<url><loc>https://scifaro.com/en/abs/splitting-plane-graphs-to-outerplanarity-2301.09440</loc><lastmod>2023-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/splitting-plane-graphs-to-outerplanarity-2301.09440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/splitting-plane-graphs-to-outerplanarity-2301.09440"/></url>
<url><loc>https://scifaro.com/en/abs/fast-merge-tree-computation-via-sycl-2301.10838</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-merge-tree-computation-via-sycl-2301.10838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-merge-tree-computation-via-sycl-2301.10838"/></url>
<url><loc>https://scifaro.com/en/abs/splitting-vertices-in-2-layer-graph-drawings-2301.10872</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/splitting-vertices-in-2-layer-graph-drawings-2301.10872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/splitting-vertices-in-2-layer-graph-drawings-2301.10872"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithm-for-minimum-ply-covering-of-points-with-unit-squares-2301.13108</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithm-for-minimum-ply-covering-of-points-with-unit-squares-2301.13108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithm-for-minimum-ply-covering-of-points-with-unit-squares-2301.13108"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-nearest-neighbor-training-sets-optimally-and-exactly-2302.02132</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-nearest-neighbor-training-sets-optimally-and-exactly-2302.02132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-nearest-neighbor-training-sets-optimally-and-exactly-2302.02132"/></url>
<url><loc>https://scifaro.com/en/abs/topological-analysis-of-temporal-hypergraphs-2302.02857</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-analysis-of-temporal-hypergraphs-2302.02857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-analysis-of-temporal-hypergraphs-2302.02857"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-and-probabilistic-topology-tracking-with-partial-optimal-transport-2302.02895</loc><lastmod>2025-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-and-probabilistic-topology-tracking-with-partial-optimal-transport-2302.02895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-and-probabilistic-topology-tracking-with-partial-optimal-transport-2302.02895"/></url>
<url><loc>https://scifaro.com/en/abs/certified-simultaneous-isotopic-approximation-of-curves-via-subdivision-2302.04908</loc><lastmod>2024-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-simultaneous-isotopic-approximation-of-curves-via-subdivision-2302.04908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-simultaneous-isotopic-approximation-of-curves-via-subdivision-2302.04908"/></url>
<url><loc>https://scifaro.com/en/abs/the-two-squirrel-problem-and-its-relatives-2302.05937</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-two-squirrel-problem-and-its-relatives-2302.05937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-two-squirrel-problem-and-its-relatives-2302.05937"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-link-c-oriented-paths-visiting-a-sequence-of-regions-in-the-plane-2302.06776</loc><lastmod>2023-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-link-c-oriented-paths-visiting-a-sequence-of-regions-in-the-plane-2302.06776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-link-c-oriented-paths-visiting-a-sequence-of-regions-in-the-plane-2302.06776"/></url>
<url><loc>https://scifaro.com/en/abs/adversarial-path-planning-for-optimal-camera-positioning-2302.07051</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adversarial-path-planning-for-optimal-camera-positioning-2302.07051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adversarial-path-planning-for-optimal-camera-positioning-2302.07051"/></url>
<url><loc>https://scifaro.com/en/abs/two-sided-convexity-testing-with-certificates-2302.07423</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-sided-convexity-testing-with-certificates-2302.07423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-sided-convexity-testing-with-certificates-2302.07423"/></url>
<url><loc>https://scifaro.com/en/abs/polar-zonohedra-edge-unfold-to-nets-2302.07747</loc><lastmod>2023-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polar-zonohedra-edge-unfold-to-nets-2302.07747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polar-zonohedra-edge-unfold-to-nets-2302.07747"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-depth-measures-for-hyperplane-arrangements-2302.07768</loc><lastmod>2023-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-depth-measures-for-hyperplane-arrangements-2302.07768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-depth-measures-for-hyperplane-arrangements-2302.07768"/></url>
<url><loc>https://scifaro.com/en/abs/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2302.10046</loc><lastmod>2023-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2302.10046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2302.10046"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-euclidean-bottleneck-matching-2302.10513</loc><lastmod>2023-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-euclidean-bottleneck-matching-2302.10513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-euclidean-bottleneck-matching-2302.10513"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-intersection-reporting-among-flat-objects-2302.11433</loc><lastmod>2023-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-intersection-reporting-among-flat-objects-2302.11433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-intersection-reporting-among-flat-objects-2302.11433"/></url>
<url><loc>https://scifaro.com/en/abs/hitting-sets-when-the-shallow-cell-complexity-is-small-2302.11637</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hitting-sets-when-the-shallow-cell-complexity-is-small-2302.11637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hitting-sets-when-the-shallow-cell-complexity-is-small-2302.11637"/></url>
<url><loc>https://scifaro.com/en/abs/storage-in-computational-geometry-2302.11821</loc><lastmod>2023-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/storage-in-computational-geometry-2302.11821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/storage-in-computational-geometry-2302.11821"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-graph-persistence-for-updates-and-efficiency-2302.12796</loc><lastmod>2023-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-graph-persistence-for-updates-and-efficiency-2302.12796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-graph-persistence-for-updates-and-efficiency-2302.12796"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-recognizing-nerves-of-convex-sets-2302.13276</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-recognizing-nerves-of-convex-sets-2302.13276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-recognizing-nerves-of-convex-sets-2302.13276"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-recognizing-geometric-hypergraphs-2302.13597</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-recognizing-geometric-hypergraphs-2302.13597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-recognizing-geometric-hypergraphs-2302.13597"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-faces-of-the-dual-koch-arrangement-2302.14125</loc><lastmod>2023-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-faces-of-the-dual-koch-arrangement-2302.14125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-faces-of-the-dual-koch-arrangement-2302.14125"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-minimization-in-time-interval-storylines-2302.14213</loc><lastmod>2023-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-minimization-in-time-interval-storylines-2302.14213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-minimization-in-time-interval-storylines-2302.14213"/></url>
<url><loc>https://scifaro.com/en/abs/linear-size-universal-point-sets-for-classes-of-planar-graphs-2303.00109</loc><lastmod>2023-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-size-universal-point-sets-for-classes-of-planar-graphs-2303.00109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-size-universal-point-sets-for-classes-of-planar-graphs-2303.00109"/></url>
<url><loc>https://scifaro.com/en/abs/non-crossing-hamiltonian-paths-and-cycles-in-output-polynomial-time-2303.00147</loc><lastmod>2024-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-crossing-hamiltonian-paths-and-cycles-in-output-polynomial-time-2303.00147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-crossing-hamiltonian-paths-and-cycles-in-output-polynomial-time-2303.00147"/></url>
<url><loc>https://scifaro.com/en/abs/towards-space-efficient-two-point-shortest-path-queries-in-a-polygonal-domain-2303.00666</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-space-efficient-two-point-shortest-path-queries-in-a-polygonal-domain-2303.00666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-space-efficient-two-point-shortest-path-queries-in-a-polygonal-domain-2303.00666"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-exploration-of-the-temporal-alpha-shape-2303.00878</loc><lastmod>2026-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-exploration-of-the-temporal-alpha-shape-2303.00878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-exploration-of-the-temporal-alpha-shape-2303.00878"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-spanning-trees-minimizing-the-wiener-index-2303.01096</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-spanning-trees-minimizing-the-wiener-index-2303.01096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-spanning-trees-minimizing-the-wiener-index-2303.01096"/></url>
<url><loc>https://scifaro.com/en/abs/coresets-for-clustering-in-geometric-intersection-graphs-2303.01400</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coresets-for-clustering-in-geometric-intersection-graphs-2303.01400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coresets-for-clustering-in-geometric-intersection-graphs-2303.01400"/></url>
<url><loc>https://scifaro.com/en/abs/some-results-on-minimum-consistent-subsets-of-trees-2303.02337</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-results-on-minimum-consistent-subsets-of-trees-2303.02337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-results-on-minimum-consistent-subsets-of-trees-2303.02337"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-batch-optimization-for-the-packing-equal-circles-in-a-circle-problem-on-large-scale-2303.02650</loc><lastmod>2023-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-batch-optimization-for-the-packing-equal-circles-in-a-circle-problem-on-large-scale-2303.02650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-batch-optimization-for-the-packing-equal-circles-in-a-circle-problem-on-large-scale-2303.02650"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-geodesic-spanners-2303.02997</loc><lastmod>2024-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-geodesic-spanners-2303.02997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-geodesic-spanners-2303.02997"/></url>
<url><loc>https://scifaro.com/en/abs/hausdorff-and-gromov-hausdorff-stable-subsets-of-the-medial-axis-2303.04014</loc><lastmod>2023-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hausdorff-and-gromov-hausdorff-stable-subsets-of-the-medial-axis-2303.04014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hausdorff-and-gromov-hausdorff-stable-subsets-of-the-medial-axis-2303.04014"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounds-for-covering-paths-and-trees-in-the-plane-2303.04350</loc><lastmod>2023-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounds-for-covering-paths-and-trees-in-the-plane-2303.04350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounds-for-covering-paths-and-trees-in-the-plane-2303.04350"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-heuristic-for-rectilinear-crossing-minimization-2303.05136</loc><lastmod>2023-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-heuristic-for-rectilinear-crossing-minimization-2303.05136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-heuristic-for-rectilinear-crossing-minimization-2303.05136"/></url>
<url><loc>https://scifaro.com/en/abs/betti-number-for-point-sets-2303.06354</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/betti-number-for-point-sets-2303.06354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/betti-number-for-point-sets-2303.06354"/></url>
<url><loc>https://scifaro.com/en/abs/a-convergent-single-loop-algorithm-for-relaxation-of-gromov-wasserstein-in-graph-data-2303.06595</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-convergent-single-loop-algorithm-for-relaxation-of-gromov-wasserstein-in-graph-data-2303.06595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-convergent-single-loop-algorithm-for-relaxation-of-gromov-wasserstein-in-graph-data-2303.06595"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-higher-order-v-c-ech-filtrations-2303.06666</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-higher-order-v-c-ech-filtrations-2303.06666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-higher-order-v-c-ech-filtrations-2303.06666"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-voronoi-like-graphs-extending-delaunay-s-theorem-and-applications-2303.06669</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-voronoi-like-graphs-extending-delaunay-s-theorem-and-applications-2303.06669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-voronoi-like-graphs-extending-delaunay-s-theorem-and-applications-2303.06669"/></url>
<url><loc>https://scifaro.com/en/abs/new-approximation-algorithms-for-touring-regions-2303.06759</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-approximation-algorithms-for-touring-regions-2303.06759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-approximation-algorithms-for-touring-regions-2303.06759"/></url>
<url><loc>https://scifaro.com/en/abs/the-localized-union-of-balls-bifiltration-2303.07002</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-localized-union-of-balls-bifiltration-2303.07002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-localized-union-of-balls-bifiltration-2303.07002"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-coverage-by-convex-polygons-the-cg-shop-challenge-2023-2303.07007</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-coverage-by-convex-polygons-the-cg-shop-challenge-2023-2303.07007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-coverage-by-convex-polygons-the-cg-shop-challenge-2023-2303.07007"/></url>
<url><loc>https://scifaro.com/en/abs/multilevel-skeletonization-using-local-separators-2303.07210</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multilevel-skeletonization-using-local-separators-2303.07210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multilevel-skeletonization-using-local-separators-2303.07210"/></url>
<url><loc>https://scifaro.com/en/abs/drawings-of-complete-multipartite-graphs-up-to-triangle-flips-2303.07401</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawings-of-complete-multipartite-graphs-up-to-triangle-flips-2303.07401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawings-of-complete-multipartite-graphs-up-to-triangle-flips-2303.07401"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-maximum-clique-in-a-disk-graph-2303.07645</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-maximum-clique-in-a-disk-graph-2303.07645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-maximum-clique-in-a-disk-graph-2303.07645"/></url>
<url><loc>https://scifaro.com/en/abs/convex-covering-using-collections-of-convex-polygons-and-set-cover-2303.07696</loc><lastmod>2025-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-covering-using-collections-of-convex-polygons-and-set-cover-2303.07696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-covering-using-collections-of-convex-polygons-and-set-cover-2303.07696"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-flip-distance-between-non-crossing-spanning-trees-2303.07710</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-flip-distance-between-non-crossing-spanning-trees-2303.07710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-flip-distance-between-non-crossing-spanning-trees-2303.07710"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-yao-graph-construction-2303.07858</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-yao-graph-construction-2303.07858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-yao-graph-construction-2303.07858"/></url>
<url><loc>https://scifaro.com/en/abs/a-structural-approach-to-tree-decompositions-of-knots-and-spatial-graphs-2303.07982</loc><lastmod>2023-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-structural-approach-to-tree-decompositions-of-knots-and-spatial-graphs-2303.07982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-structural-approach-to-tree-decompositions-of-knots-and-spatial-graphs-2303.07982"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-length-spectra-of-combinatorial-tori-2303.08036</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-length-spectra-of-combinatorial-tori-2303.08036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-length-spectra-of-combinatorial-tori-2303.08036"/></url>
<url><loc>https://scifaro.com/en/abs/economical-convex-coverings-and-applications-2303.08349</loc><lastmod>2023-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/economical-convex-coverings-and-applications-2303.08349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/economical-convex-coverings-and-applications-2303.08349"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-learning-on-measures-an-application-to-persistence-diagrams-2303.08456</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-learning-on-measures-an-application-to-persistence-diagrams-2303.08456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-learning-on-measures-an-application-to-persistence-diagrams-2303.08456"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-designs-meet-hypercliques-higher-lower-bounds-for-klee-s-measure-problem-and-related-problems-in-dimensions-d-ge-4-2303.08612</loc><lastmod>2023-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-designs-meet-hypercliques-higher-lower-bounds-for-klee-s-measure-problem-and-related-problems-in-dimensions-d-ge-4-2303.08612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-designs-meet-hypercliques-higher-lower-bounds-for-klee-s-measure-problem-and-related-problems-in-dimensions-d-ge-4-2303.08612"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-in-portalgons-2303.08937</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-in-portalgons-2303.08937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-in-portalgons-2303.08937"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-l-infty-hausdorff-distance-of-point-sets-under-translation-generalizing-klee-s-measure-problem-2303.09122</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-l-infty-hausdorff-distance-of-point-sets-under-translation-generalizing-klee-s-measure-problem-2303.09122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-l-infty-hausdorff-distance-of-point-sets-under-translation-generalizing-klee-s-measure-problem-2303.09122"/></url>
<url><loc>https://scifaro.com/en/abs/online-and-dynamic-algorithms-for-geometric-set-cover-and-hitting-set-2303.09524</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-and-dynamic-algorithms-for-geometric-set-cover-and-hitting-set-2303.09524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-and-dynamic-algorithms-for-geometric-set-cover-and-hitting-set-2303.09524"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-volume-sensitive-bounds-for-polytope-approximation-2303.09586</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-volume-sensitive-bounds-for-polytope-approximation-2303.09586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-volume-sensitive-bounds-for-polytope-approximation-2303.09586"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-optimization-for-binary-csp-applied-to-minimum-partition-into-plane-subgraphs-and-graph-coloring-2303.09632</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-optimization-for-binary-csp-applied-to-minimum-partition-into-plane-subgraphs-and-graph-coloring-2303.09632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-optimization-for-binary-csp-applied-to-minimum-partition-into-plane-subgraphs-and-graph-coloring-2303.09632"/></url>
<url><loc>https://scifaro.com/en/abs/the-geodesic-edge-center-of-a-simple-polygon-2303.09702</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geodesic-edge-center-of-a-simple-polygon-2303.09702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geodesic-edge-center-of-a-simple-polygon-2303.09702"/></url>
<url><loc>https://scifaro.com/en/abs/connectivity-with-uncertainty-regions-given-as-line-segments-2303.10028</loc><lastmod>2023-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connectivity-with-uncertainty-regions-given-as-line-segments-2303.10028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connectivity-with-uncertainty-regions-given-as-line-segments-2303.10028"/></url>
<url><loc>https://scifaro.com/en/abs/online-hitting-of-unit-balls-and-hypercubes-in-mathbb-r-d-using-points-from-mathbb-z-d-2303.11779</loc><lastmod>2025-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-hitting-of-unit-balls-and-hypercubes-in-mathbb-r-d-using-points-from-mathbb-z-d-2303.11779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-hitting-of-unit-balls-and-hypercubes-in-mathbb-r-d-using-points-from-mathbb-z-d-2303.11779"/></url>
<url><loc>https://scifaro.com/en/abs/dual-quaternion-interpolation-2303.13395</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-quaternion-interpolation-2303.13395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-quaternion-interpolation-2303.13395"/></url>
<url><loc>https://scifaro.com/en/abs/dual-quaternion-julia-fractals-2303.14827</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-quaternion-julia-fractals-2303.14827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-quaternion-julia-fractals-2303.14827"/></url>
<url><loc>https://scifaro.com/en/abs/an-analytical-representation-of-the-2d-generalized-balanced-power-diagram-2303.15275</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analytical-representation-of-the-2d-generalized-balanced-power-diagram-2303.15275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analytical-representation-of-the-2d-generalized-balanced-power-diagram-2303.15275"/></url>
<url><loc>https://scifaro.com/en/abs/online-embedding-of-metrics-2303.15945</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-embedding-of-metrics-2303.15945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-embedding-of-metrics-2303.15945"/></url>
<url><loc>https://scifaro.com/en/abs/constant-hop-spanners-for-more-geometric-intersection-graphs-with-even-smaller-size-2303.16303</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-hop-spanners-for-more-geometric-intersection-graphs-with-even-smaller-size-2303.16303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-hop-spanners-for-more-geometric-intersection-graphs-with-even-smaller-size-2303.16303"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-embedding-in-graph-products-2303.17028</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-embedding-in-graph-products-2303.17028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-embedding-in-graph-products-2303.17028"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-dynamic-voronoi-diagrams-in-the-hilbert-metric-2304.02745</loc><lastmod>2024-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-dynamic-voronoi-diagrams-in-the-hilbert-metric-2304.02745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-dynamic-voronoi-diagrams-in-the-hilbert-metric-2304.02745"/></url>
<url><loc>https://scifaro.com/en/abs/maximal-distortion-of-geodesic-diameters-in-polygonal-domains-2304.03484</loc><lastmod>2026-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximal-distortion-of-geodesic-diameters-in-polygonal-domains-2304.03484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximal-distortion-of-geodesic-diameters-in-polygonal-domains-2304.03484"/></url>
<url><loc>https://scifaro.com/en/abs/convex-hulls-surface-mapping-onto-a-sphere-2304.04079</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-hulls-surface-mapping-onto-a-sphere-2304.04079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-hulls-surface-mapping-onto-a-sphere-2304.04079"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-tangent-based-implicit-curves-2304.04577</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-tangent-based-implicit-curves-2304.04577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-tangent-based-implicit-curves-2304.04577"/></url>
<url><loc>https://scifaro.com/en/abs/online-geometric-hitting-set-and-set-cover-beyond-unit-balls-in-mathbb-r-2-2304.06780</loc><lastmod>2025-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-geometric-hitting-set-and-set-cover-beyond-unit-balls-in-mathbb-r-2-2304.06780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-geometric-hitting-set-and-set-cover-beyond-unit-balls-in-mathbb-r-2-2304.06780"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-cluttering-edges-in-near-planar-graphs-2304.07274</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-cluttering-edges-in-near-planar-graphs-2304.07274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-cluttering-edges-in-near-planar-graphs-2304.07274"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-3d-pivoting-modular-robots-2304.09990</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-3d-pivoting-modular-robots-2304.09990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-3d-pivoting-modular-robots-2304.09990"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-the-size-of-the-uncertainty-regions-for-centers-of-moving-entities-2304.10028</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-the-size-of-the-uncertainty-regions-for-centers-of-moving-entities-2304.10028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-the-size-of-the-uncertainty-regions-for-centers-of-moving-entities-2304.10028"/></url>
<url><loc>https://scifaro.com/en/abs/the-voronoi-diagram-of-rotating-rays-with-applications-to-floodlight-illumination-2304.11429</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-voronoi-diagram-of-rotating-rays-with-applications-to-floodlight-illumination-2304.11429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-voronoi-diagram-of-rotating-rays-with-applications-to-floodlight-illumination-2304.11429"/></url>
<url><loc>https://scifaro.com/en/abs/simply-realising-an-imprecise-polyline-is-np-hard-2304.13094</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simply-realising-an-imprecise-polyline-is-np-hard-2304.13094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simply-realising-an-imprecise-polyline-is-np-hard-2304.13094"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbor-for-polygonal-curves-under-fr-echet-distance-2304.14643</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-for-polygonal-curves-under-fr-echet-distance-2304.14643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-for-polygonal-curves-under-fr-echet-distance-2304.14643"/></url>
<url><loc>https://scifaro.com/en/abs/ortho-radial-drawing-in-near-linear-time-2305.00425</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ortho-radial-drawing-in-near-linear-time-2305.00425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ortho-radial-drawing-in-near-linear-time-2305.00425"/></url>
<url><loc>https://scifaro.com/en/abs/collision-detection-for-modular-robots-it-is-easy-to-cause-collisions-and-hard-to-avoid-them-2305.01015</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collision-detection-for-modular-robots-it-is-easy-to-cause-collisions-and-hard-to-avoid-them-2305.01015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collision-detection-for-modular-robots-it-is-easy-to-cause-collisions-and-hard-to-avoid-them-2305.01015"/></url>
<url><loc>https://scifaro.com/en/abs/a-quadtree-a-steiner-spanner-and-approximate-nearest-neighbours-in-hyperbolic-space-2305.01356</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quadtree-a-steiner-spanner-and-approximate-nearest-neighbours-in-hyperbolic-space-2305.01356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quadtree-a-steiner-spanner-and-approximate-nearest-neighbours-in-hyperbolic-space-2305.01356"/></url>
<url><loc>https://scifaro.com/en/abs/folding-every-point-on-a-polygon-boundary-to-a-point-2305.01467</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-every-point-on-a-polygon-boundary-to-a-point-2305.01467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-every-point-on-a-polygon-boundary-to-a-point-2305.01467"/></url>
<url><loc>https://scifaro.com/en/abs/the-impacts-of-dimensionality-diffusion-and-directedness-on-intrinsic-cross-model-simulation-in-tile-based-self-assembly-2305.01877</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-impacts-of-dimensionality-diffusion-and-directedness-on-intrinsic-cross-model-simulation-in-tile-based-self-assembly-2305.01877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-impacts-of-dimensionality-diffusion-and-directedness-on-intrinsic-cross-model-simulation-in-tile-based-self-assembly-2305.01877"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-small-size-geometric-set-cover-and-discrete-k-center-for-small-k-2305.01892</loc><lastmod>2023-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-small-size-geometric-set-cover-and-discrete-k-center-for-small-k-2305.01892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-small-size-geometric-set-cover-and-discrete-k-center-for-small-k-2305.01892"/></url>
<url><loc>https://scifaro.com/en/abs/online-geometric-covering-and-piercing-2305.02445</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-geometric-covering-and-piercing-2305.02445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-geometric-covering-and-piercing-2305.02445"/></url>
<url><loc>https://scifaro.com/en/abs/towards-stratified-space-learning-2-complexes-2305.02724</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-stratified-space-learning-2-complexes-2305.02724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-stratified-space-learning-2-complexes-2305.02724"/></url>
<url><loc>https://scifaro.com/en/abs/on-range-summary-queries-2305.03180</loc><lastmod>2023-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-range-summary-queries-2305.03180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-range-summary-queries-2305.03180"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-ptas-for-covering-targets-with-mobile-sensors-2305.03946</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-ptas-for-covering-targets-with-mobile-sensors-2305.03946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-ptas-for-covering-targets-with-mobile-sensors-2305.03946"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-membership-geometric-set-cover-revisited-2305.03985</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-membership-geometric-set-cover-revisited-2305.03985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-membership-geometric-set-cover-revisited-2305.03985"/></url>
<url><loc>https://scifaro.com/en/abs/nervepool-a-simplicial-pooling-layer-2305.06315</loc><lastmod>2025-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nervepool-a-simplicial-pooling-layer-2305.06315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nervepool-a-simplicial-pooling-layer-2305.06315"/></url>
<url><loc>https://scifaro.com/en/abs/a-circular-parameterization-for-multi-sided-patches-2305.07534</loc><lastmod>2023-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-circular-parameterization-for-multi-sided-patches-2305.07534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-circular-parameterization-for-multi-sided-patches-2305.07534"/></url>
<url><loc>https://scifaro.com/en/abs/feature-aware-manifold-meshing-and-remeshing-of-point-clouds-and-polyhedral-surfaces-with-guaranteed-smallest-edge-length-2305.07570</loc><lastmod>2025-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feature-aware-manifold-meshing-and-remeshing-of-point-clouds-and-polyhedral-surfaces-with-guaranteed-smallest-edge-length-2305.07570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feature-aware-manifold-meshing-and-remeshing-of-point-clouds-and-polyhedral-surfaces-with-guaranteed-smallest-edge-length-2305.07570"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-convex-hulls-under-window-sliding-updates-2305.08055</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-convex-hulls-under-window-sliding-updates-2305.08055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-convex-hulls-under-window-sliding-updates-2305.08055"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-hitting-set-for-line-constrained-disks-and-related-problems-2305.09045</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-hitting-set-for-line-constrained-disks-and-related-problems-2305.09045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-hitting-set-for-line-constrained-disks-and-related-problems-2305.09045"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-width-rainbow-bisecting-empty-annulus-2305.09248</loc><lastmod>2024-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-width-rainbow-bisecting-empty-annulus-2305.09248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-width-rainbow-bisecting-empty-annulus-2305.09248"/></url>
<url><loc>https://scifaro.com/en/abs/using-sat-to-study-plane-hamiltonian-substructures-in-simple-drawings-2305.09432</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-sat-to-study-plane-hamiltonian-substructures-in-simple-drawings-2305.09432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-sat-to-study-plane-hamiltonian-substructures-in-simple-drawings-2305.09432"/></url>
<url><loc>https://scifaro.com/en/abs/a-scalable-method-for-readable-tree-layouts-2305.09925</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scalable-method-for-readable-tree-layouts-2305.09925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scalable-method-for-readable-tree-layouts-2305.09925"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-solution-space-exploring-and-descent-method-for-packing-equal-spheres-in-a-sphere-2305.10023</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-solution-space-exploring-and-descent-method-for-packing-equal-spheres-in-a-sphere-2305.10023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-solution-space-exploring-and-descent-method-for-packing-equal-spheres-in-a-sphere-2305.10023"/></url>
<url><loc>https://scifaro.com/en/abs/convex-cover-and-hidden-set-in-funnel-polygons-2305.10341</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-cover-and-hidden-set-in-funnel-polygons-2305.10341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-cover-and-hidden-set-in-funnel-polygons-2305.10341"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-means-for-segments-and-polylines-2305.10922</loc><lastmod>2023-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-means-for-segments-and-polylines-2305.10922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-means-for-segments-and-polylines-2305.10922"/></url>
<url><loc>https://scifaro.com/en/abs/engineering-an-algorithm-for-constructing-low-stretch-geometric-graphs-with-near-greedy-average-degrees-2305.11312</loc><lastmod>2023-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/engineering-an-algorithm-for-constructing-low-stretch-geometric-graphs-with-near-greedy-average-degrees-2305.11312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/engineering-an-algorithm-for-constructing-low-stretch-geometric-graphs-with-near-greedy-average-degrees-2305.11312"/></url>
<url><loc>https://scifaro.com/en/abs/advancing-front-mapping-2305.11552</loc><lastmod>2024-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advancing-front-mapping-2305.11552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advancing-front-mapping-2305.11552"/></url>
<url><loc>https://scifaro.com/en/abs/robust-estimation-of-surface-curvature-information-from-point-cloud-data-2306.00299</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-estimation-of-surface-curvature-information-from-point-cloud-data-2306.00299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-estimation-of-surface-curvature-information-from-point-cloud-data-2306.00299"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-simple-folding-of-mixed-orthogonal-crease-patterns-2306.00702</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-simple-folding-of-mixed-orthogonal-crease-patterns-2306.00702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-simple-folding-of-mixed-orthogonal-crease-patterns-2306.00702"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithms-for-distance-selection-and-related-problems-2306.01073</loc><lastmod>2024-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithms-for-distance-selection-and-related-problems-2306.01073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithms-for-distance-selection-and-related-problems-2306.01073"/></url>
<url><loc>https://scifaro.com/en/abs/labeled-interleaving-distance-for-reeb-graphs-2306.01186</loc><lastmod>2023-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labeled-interleaving-distance-for-reeb-graphs-2306.01186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labeled-interleaving-distance-for-reeb-graphs-2306.01186"/></url>
<url><loc>https://scifaro.com/en/abs/does-it-pay-to-optimize-auc-2306.01528</loc><lastmod>2023-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/does-it-pay-to-optimize-auc-2306.01528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/does-it-pay-to-optimize-auc-2306.01528"/></url>
<url><loc>https://scifaro.com/en/abs/no-dimensional-tverberg-partitions-revisited-2306.01678</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-dimensional-tverberg-partitions-revisited-2306.01678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-dimensional-tverberg-partitions-revisited-2306.01678"/></url>
<url><loc>https://scifaro.com/en/abs/graph-mover-s-distance-an-efficiently-computable-distance-measure-for-geometric-graphs-2306.02133</loc><lastmod>2023-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-mover-s-distance-an-efficiently-computable-distance-measure-for-geometric-graphs-2306.02133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-mover-s-distance-an-efficiently-computable-distance-measure-for-geometric-graphs-2306.02133"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-budgeted-hausdorff-distance-problem-2306.02151</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-budgeted-hausdorff-distance-problem-2306.02151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-budgeted-hausdorff-distance-problem-2306.02151"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-exact-enumeration-of-single-source-geodesics-on-a-non-convex-polyhedron-2306.02559</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-exact-enumeration-of-single-source-geodesics-on-a-non-convex-polyhedron-2306.02559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-exact-enumeration-of-single-source-geodesics-on-a-non-convex-polyhedron-2306.02559"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-lombardi-graph-drawing-2306.02649</loc><lastmod>2023-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-lombardi-graph-drawing-2306.02649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-lombardi-graph-drawing-2306.02649"/></url>
<url><loc>https://scifaro.com/en/abs/point-in-polygon-calculation-using-vector-geometric-methods-with-application-to-geospatial-data-2306.04316</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-in-polygon-calculation-using-vector-geometric-methods-with-application-to-geospatial-data-2306.04316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-in-polygon-calculation-using-vector-geometric-methods-with-application-to-geospatial-data-2306.04316"/></url>
<url><loc>https://scifaro.com/en/abs/scenic-routes-with-weighted-points-in-2d-2306.04858</loc><lastmod>2023-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scenic-routes-with-weighted-points-in-2d-2306.04858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scenic-routes-with-weighted-points-in-2d-2306.04858"/></url>
<url><loc>https://scifaro.com/en/abs/scenic-routes-over-points-in-2d-space-2306.04953</loc><lastmod>2023-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scenic-routes-over-points-in-2d-space-2306.04953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scenic-routes-over-points-in-2d-space-2306.04953"/></url>
<url><loc>https://scifaro.com/en/abs/a-normalized-bottleneck-distance-on-persistence-diagrams-and-homology-preservation-under-dimension-reduction-2306.06727</loc><lastmod>2024-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-normalized-bottleneck-distance-on-persistence-diagrams-and-homology-preservation-under-dimension-reduction-2306.06727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-normalized-bottleneck-distance-on-persistence-diagrams-and-homology-preservation-under-dimension-reduction-2306.06727"/></url>
<url><loc>https://scifaro.com/en/abs/three-edge-disjoint-plane-spanning-paths-in-a-point-set-2306.07237</loc><lastmod>2025-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-edge-disjoint-plane-spanning-paths-in-a-point-set-2306.07237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-edge-disjoint-plane-spanning-paths-in-a-point-set-2306.07237"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-restricted-k-steiner-tree-problem-2306.08504</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-restricted-k-steiner-tree-problem-2306.08504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-restricted-k-steiner-tree-problem-2306.08504"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-an-uncrossed-collection-of-drawings-2306.09550</loc><lastmod>2025-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-an-uncrossed-collection-of-drawings-2306.09550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-an-uncrossed-collection-of-drawings-2306.09550"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-surface-meshes-from-harmonic-maps-2306.10115</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-surface-meshes-from-harmonic-maps-2306.10115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-surface-meshes-from-harmonic-maps-2306.10115"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-fast-and-stable-representations-of-multiparameter-persistent-homology-decompositions-2306.11170</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-fast-and-stable-representations-of-multiparameter-persistent-homology-decompositions-2306.11170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-fast-and-stable-representations-of-multiparameter-persistent-homology-decompositions-2306.11170"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-fault-tolerant-spanners-in-euclidean-and-doubling-metrics-breaking-the-omega-log-n-lightness-barrier-2306.11226</loc><lastmod>2024-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-fault-tolerant-spanners-in-euclidean-and-doubling-metrics-breaking-the-omega-log-n-lightness-barrier-2306.11226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-fault-tolerant-spanners-in-euclidean-and-doubling-metrics-breaking-the-omega-log-n-lightness-barrier-2306.11226"/></url>
<url><loc>https://scifaro.com/en/abs/observation-routes-and-external-watchman-routes-2306.11522</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observation-routes-and-external-watchman-routes-2306.11522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observation-routes-and-external-watchman-routes-2306.11522"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterized-algorithm-for-flat-folding-2306.11939</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterized-algorithm-for-flat-folding-2306.11939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterized-algorithm-for-flat-folding-2306.11939"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-graphs-with-unbounded-flip-width-2306.12611</loc><lastmod>2023-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-graphs-with-unbounded-flip-width-2306.12611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-graphs-with-unbounded-flip-width-2306.12611"/></url>
<url><loc>https://scifaro.com/en/abs/effective-data-reduction-algorithm-for-topological-data-analysis-2306.13312</loc><lastmod>2023-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-data-reduction-algorithm-for-topological-data-analysis-2306.13312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-data-reduction-algorithm-for-topological-data-analysis-2306.13312"/></url>
<url><loc>https://scifaro.com/en/abs/using-topological-data-analysis-to-compare-inter-subject-variability-across-resting-state-functional-mri-brain-representations-2306.13802</loc><lastmod>2025-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-topological-data-analysis-to-compare-inter-subject-variability-across-resting-state-functional-mri-brain-representations-2306.13802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-topological-data-analysis-to-compare-inter-subject-variability-across-resting-state-functional-mri-brain-representations-2306.13802"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-formation-for-fat-robots-with-lights-2306.14440</loc><lastmod>2025-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-formation-for-fat-robots-with-lights-2306.14440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-formation-for-fat-robots-with-lights-2306.14440"/></url>
<url><loc>https://scifaro.com/en/abs/scenic-routes-in-r-d-2306.14569</loc><lastmod>2023-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scenic-routes-in-r-d-2306.14569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scenic-routes-in-r-d-2306.14569"/></url>
<url><loc>https://scifaro.com/en/abs/heuristic-approaches-to-obtain-low-discrepancy-point-sets-via-subset-selection-2306.15276</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristic-approaches-to-obtain-low-discrepancy-point-sets-via-subset-selection-2306.15276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristic-approaches-to-obtain-low-discrepancy-point-sets-via-subset-selection-2306.15276"/></url>
<url><loc>https://scifaro.com/en/abs/insertion-only-dynamic-connectivity-in-general-disk-graphs-2306.15338</loc><lastmod>2023-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/insertion-only-dynamic-connectivity-in-general-disk-graphs-2306.15338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/insertion-only-dynamic-connectivity-in-general-disk-graphs-2306.15338"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-nearest-neighbor-searching-with-non-euclidean-and-weighted-distances-2306.15621</loc><lastmod>2023-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-searching-with-non-euclidean-and-weighted-distances-2306.15621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-nearest-neighbor-searching-with-non-euclidean-and-weighted-distances-2306.15621"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-area-sensitive-bounds-for-polytope-approximation-2306.15648</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-area-sensitive-bounds-for-polytope-approximation-2306.15648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-area-sensitive-bounds-for-polytope-approximation-2306.15648"/></url>
<url><loc>https://scifaro.com/en/abs/dimension-independent-kernel-epsilon-covers-2306.16516</loc><lastmod>2025-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimension-independent-kernel-epsilon-covers-2306.16516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimension-independent-kernel-epsilon-covers-2306.16516"/></url>
<url><loc>https://scifaro.com/en/abs/oriented-spanners-2306.17097</loc><lastmod>2025-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oriented-spanners-2306.17097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oriented-spanners-2306.17097"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-euclidean-steiner-minimal-tree-on-near-convex-terminal-sets-2307.00254</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-euclidean-steiner-minimal-tree-on-near-convex-terminal-sets-2307.00254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-euclidean-steiner-minimal-tree-on-near-convex-terminal-sets-2307.00254"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-overlap-area-of-several-convex-polygons-under-translations-2307.00409</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-overlap-area-of-several-convex-polygons-under-translations-2307.00409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-overlap-area-of-several-convex-polygons-under-translations-2307.00409"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-polygonal-subdivisions-via-recombination-2307.00704</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-polygonal-subdivisions-via-recombination-2307.00704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-polygonal-subdivisions-via-recombination-2307.00704"/></url>
<url><loc>https://scifaro.com/en/abs/short-flip-sequences-to-untangle-segments-in-the-plane-2307.00853</loc><lastmod>2023-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-flip-sequences-to-untangle-segments-in-the-plane-2307.00853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-flip-sequences-to-untangle-segments-in-the-plane-2307.00853"/></url>
<url><loc>https://scifaro.com/en/abs/the-lawn-mowing-problem-from-algebra-to-algorithms-2307.01092</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lawn-mowing-problem-from-algebra-to-algorithms-2307.01092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lawn-mowing-problem-from-algebra-to-algorithms-2307.01092"/></url>
<url><loc>https://scifaro.com/en/abs/the-calissons-puzzle-2307.02475</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-calissons-puzzle-2307.02475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-calissons-puzzle-2307.02475"/></url>
<url><loc>https://scifaro.com/en/abs/line-constrained-k-semi-obnoxious-facility-location-2307.03488</loc><lastmod>2023-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/line-constrained-k-semi-obnoxious-facility-location-2307.03488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/line-constrained-k-semi-obnoxious-facility-location-2307.03488"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-geometric-multigrid-method-for-curved-surfaces-2307.04886</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-geometric-multigrid-method-for-curved-surfaces-2307.04886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-geometric-multigrid-method-for-curved-surfaces-2307.04886"/></url>
<url><loc>https://scifaro.com/en/abs/computing-zigzag-vineyard-efficiently-including-expansions-and-contractions-2307.07462</loc><lastmod>2024-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-zigzag-vineyard-efficiently-including-expansions-and-contractions-2307.07462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-zigzag-vineyard-efficiently-including-expansions-and-contractions-2307.07462"/></url>
<url><loc>https://scifaro.com/en/abs/faster-approximation-scheme-for-euclidean-k-tsp-2307.08069</loc><lastmod>2024-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-approximation-scheme-for-euclidean-k-tsp-2307.08069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-approximation-scheme-for-euclidean-k-tsp-2307.08069"/></url>
<url><loc>https://scifaro.com/en/abs/1-varepsilon-ann-data-structure-for-curves-via-subspaces-of-bounded-doubling-dimension-2307.08521</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-varepsilon-ann-data-structure-for-curves-via-subspaces-of-bounded-doubling-dimension-2307.08521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-varepsilon-ann-data-structure-for-curves-via-subspaces-of-bounded-doubling-dimension-2307.08521"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-strongly-polynomial-algorithms-for-quantile-regression-2307.08706</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-strongly-polynomial-algorithms-for-quantile-regression-2307.08706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-strongly-polynomial-algorithms-for-quantile-regression-2307.08706"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-methods-in-grid-based-meshing-2307.08825</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-methods-in-grid-based-meshing-2307.08825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-methods-in-grid-based-meshing-2307.08825"/></url>
<url><loc>https://scifaro.com/en/abs/manipulating-weights-to-improve-stress-graph-drawings-of-3-connected-planar-graphs-2307.10527</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/manipulating-weights-to-improve-stress-graph-drawings-of-3-connected-planar-graphs-2307.10527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/manipulating-weights-to-improve-stress-graph-drawings-of-3-connected-planar-graphs-2307.10527"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-gromov-hausdorff-distance-using-gradient-methods-2307.13660</loc><lastmod>2024-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-gromov-hausdorff-distance-using-gradient-methods-2307.13660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-gromov-hausdorff-distance-using-gradient-methods-2307.13660"/></url>
<url><loc>https://scifaro.com/en/abs/the-weighted-euler-characteristic-transform-for-image-shape-classification-2307.13940</loc><lastmod>2023-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weighted-euler-characteristic-transform-for-image-shape-classification-2307.13940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weighted-euler-characteristic-transform-for-image-shape-classification-2307.13940"/></url>
<url><loc>https://scifaro.com/en/abs/the-unweighted-and-weighted-reverse-shortest-path-problem-for-disk-graphs-2307.14663</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-unweighted-and-weighted-reverse-shortest-path-problem-for-disk-graphs-2307.14663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-unweighted-and-weighted-reverse-shortest-path-problem-for-disk-graphs-2307.14663"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-the-interleaving-distance-for-mapper-graphs-with-a-loss-function-2307.15130</loc><lastmod>2025-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-the-interleaving-distance-for-mapper-graphs-with-a-loss-function-2307.15130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-the-interleaving-distance-for-mapper-graphs-with-a-loss-function-2307.15130"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-polyominoes-under-k-hop-visibility-2308.00334</loc><lastmod>2024-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-polyominoes-under-k-hop-visibility-2308.00334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-polyominoes-under-k-hop-visibility-2308.00334"/></url>
<url><loc>https://scifaro.com/en/abs/side-contact-representations-with-convex-polygons-in-3d-new-results-for-complete-bipartite-graphs-2308.00380</loc><lastmod>2023-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/side-contact-representations-with-convex-polygons-in-3d-new-results-for-complete-bipartite-graphs-2308.00380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/side-contact-representations-with-convex-polygons-in-3d-new-results-for-complete-bipartite-graphs-2308.00380"/></url>
<url><loc>https://scifaro.com/en/abs/vector-field-based-volume-peeling-for-multi-axis-machining-2308.00472</loc><lastmod>2023-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vector-field-based-volume-peeling-for-multi-axis-machining-2308.00472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vector-field-based-volume-peeling-for-multi-axis-machining-2308.00472"/></url>
<url><loc>https://scifaro.com/en/abs/approximately-independence-implies-vertex-cover-2308.00840</loc><lastmod>2026-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximately-independence-implies-vertex-cover-2308.00840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximately-independence-implies-vertex-cover-2308.00840"/></url>
<url><loc>https://scifaro.com/en/abs/metric-and-path-connectedness-properties-of-the-frechet-distance-for-paths-and-graphs-2308.00900</loc><lastmod>2023-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-and-path-connectedness-properties-of-the-frechet-distance-for-paths-and-graphs-2308.00900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-and-path-connectedness-properties-of-the-frechet-distance-for-paths-and-graphs-2308.00900"/></url>
<url><loc>https://scifaro.com/en/abs/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2308.00979</loc><lastmod>2023-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2308.00979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2308.00979"/></url>
<url><loc>https://scifaro.com/en/abs/fast-fiber-line-extraction-for-2d-bivariate-scalar-fields-2308.04389</loc><lastmod>2024-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-fiber-line-extraction-for-2d-bivariate-scalar-fields-2308.04389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-fiber-line-extraction-for-2d-bivariate-scalar-fields-2308.04389"/></url>
<url><loc>https://scifaro.com/en/abs/topological-k-metrics-2308.04609</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-k-metrics-2308.04609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-k-metrics-2308.04609"/></url>
<url><loc>https://scifaro.com/en/abs/bijective-density-equalizing-quasiconformal-map-for-multiply-connected-open-surfaces-2308.05579</loc><lastmod>2024-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bijective-density-equalizing-quasiconformal-map-for-multiply-connected-open-surfaces-2308.05579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bijective-density-equalizing-quasiconformal-map-for-multiply-connected-open-surfaces-2308.05579"/></url>
<url><loc>https://scifaro.com/en/abs/simplified-and-improved-bounds-on-the-vc-dimension-for-elastic-distance-measures-2308.05998</loc><lastmod>2023-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplified-and-improved-bounds-on-the-vc-dimension-for-elastic-distance-measures-2308.05998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplified-and-improved-bounds-on-the-vc-dimension-for-elastic-distance-measures-2308.05998"/></url>
<url><loc>https://scifaro.com/en/abs/a-parallel-algorithm-for-delaunay-triangulation-of-moving-points-on-the-plane-2308.06484</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parallel-algorithm-for-delaunay-triangulation-of-moving-points-on-the-plane-2308.06484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parallel-algorithm-for-delaunay-triangulation-of-moving-points-on-the-plane-2308.06484"/></url>
<url><loc>https://scifaro.com/en/abs/online-class-cover-problem-2308.07020</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-class-cover-problem-2308.07020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-class-cover-problem-2308.07020"/></url>
<url><loc>https://scifaro.com/en/abs/kernelization-for-spreading-points-2308.07099</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kernelization-for-spreading-points-2308.07099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kernelization-for-spreading-points-2308.07099"/></url>
<url><loc>https://scifaro.com/en/abs/taming-horizontal-instability-in-merge-trees-on-the-computation-of-a-comprehensive-deformation-based-edit-distance-2308.08484</loc><lastmod>2024-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-horizontal-instability-in-merge-trees-on-the-computation-of-a-comprehensive-deformation-based-edit-distance-2308.08484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-horizontal-instability-in-merge-trees-on-the-computation-of-a-comprehensive-deformation-based-edit-distance-2308.08484"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximations-for-translational-packing-of-convex-polygons-2308.08523</loc><lastmod>2023-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximations-for-translational-packing-of-convex-polygons-2308.08523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximations-for-translational-packing-of-convex-polygons-2308.08523"/></url>
<url><loc>https://scifaro.com/en/abs/smooth-distance-approximation-2308.08791</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smooth-distance-approximation-2308.08791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smooth-distance-approximation-2308.08791"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs-2308.10600</loc><lastmod>2023-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs-2308.10600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-parameter-algorithms-for-computing-rac-drawings-of-graphs-2308.10600"/></url>
<url><loc>https://scifaro.com/en/abs/degenerate-crossing-number-and-signed-reversal-distance-2308.10666</loc><lastmod>2025-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degenerate-crossing-number-and-signed-reversal-distance-2308.10666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degenerate-crossing-number-and-signed-reversal-distance-2308.10666"/></url>
<url><loc>https://scifaro.com/en/abs/different-types-of-isomorphisms-of-drawings-of-complete-multipartite-graphs-2308.10735</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/different-types-of-isomorphisms-of-drawings-of-complete-multipartite-graphs-2308.10735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/different-types-of-isomorphisms-of-drawings-of-complete-multipartite-graphs-2308.10735"/></url>
<url><loc>https://scifaro.com/en/abs/tree-drawings-with-columns-2308.10811</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-drawings-with-columns-2308.10811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-drawings-with-columns-2308.10811"/></url>
<url><loc>https://scifaro.com/en/abs/min-k-planar-drawings-of-graphs-2308.13401</loc><lastmod>2024-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/min-k-planar-drawings-of-graphs-2308.13401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/min-k-planar-drawings-of-graphs-2308.13401"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-bend-minimum-orthogonal-planarity-2308.13665</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-bend-minimum-orthogonal-planarity-2308.13665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-bend-minimum-orthogonal-planarity-2308.13665"/></url>
<url><loc>https://scifaro.com/en/abs/solving-fr-echet-distance-problems-by-algebraic-geometric-methods-2308.14569</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-fr-echet-distance-problems-by-algebraic-geometric-methods-2308.14569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-fr-echet-distance-problems-by-algebraic-geometric-methods-2308.14569"/></url>
<url><loc>https://scifaro.com/en/abs/finding-complex-patterns-in-trajectory-data-via-geometric-set-cover-2308.14865</loc><lastmod>2025-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-complex-patterns-in-trajectory-data-via-geometric-set-cover-2308.14865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-complex-patterns-in-trajectory-data-via-geometric-set-cover-2308.14865"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-construction-of-yao-graph-in-data-distributed-settings-2308.15065</loc><lastmod>2023-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-construction-of-yao-graph-in-data-distributed-settings-2308.15065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-construction-of-yao-graph-in-data-distributed-settings-2308.15065"/></url>
<url><loc>https://scifaro.com/en/abs/when-can-you-tile-an-integer-rectangle-with-integer-squares-2308.15317</loc><lastmod>2023-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-can-you-tile-an-integer-rectangle-with-integer-squares-2308.15317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-can-you-tile-an-integer-rectangle-with-integer-squares-2308.15317"/></url>
<url><loc>https://scifaro.com/en/abs/the-parametrized-complexity-of-the-segment-number-2308.15416</loc><lastmod>2024-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parametrized-complexity-of-the-segment-number-2308.15416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parametrized-complexity-of-the-segment-number-2308.15416"/></url>
<url><loc>https://scifaro.com/en/abs/computing-geodesic-paths-encoding-a-curvature-prior-2308.15729</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-geodesic-paths-encoding-a-curvature-prior-2308.15729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-geodesic-paths-encoding-a-curvature-prior-2308.15729"/></url>
<url><loc>https://scifaro.com/en/abs/circle-packing-in-arbitrary-domains-2308.16523</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circle-packing-in-arbitrary-domains-2308.16523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circle-packing-in-arbitrary-domains-2308.16523"/></url>
<url><loc>https://scifaro.com/en/abs/a-massively-parallel-dynamic-programming-for-approximate-rectangle-escape-problem-2309.00242</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-massively-parallel-dynamic-programming-for-approximate-rectangle-escape-problem-2309.00242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-massively-parallel-dynamic-programming-for-approximate-rectangle-escape-problem-2309.00242"/></url>
<url><loc>https://scifaro.com/en/abs/bichromatic-perfect-matchings-with-crossings-2309.00546</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bichromatic-perfect-matchings-with-crossings-2309.00546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bichromatic-perfect-matchings-with-crossings-2309.00546"/></url>
<url><loc>https://scifaro.com/en/abs/the-information-geometry-of-umap-2309.01237</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-information-geometry-of-umap-2309.01237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-information-geometry-of-umap-2309.01237"/></url>
<url><loc>https://scifaro.com/en/abs/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth-2309.01264</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth-2309.01264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth-2309.01264"/></url>
<url><loc>https://scifaro.com/en/abs/mutual-witness-proximity-drawings-of-isomorphic-trees-2309.01463</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutual-witness-proximity-drawings-of-isomorphic-trees-2309.01463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutual-witness-proximity-drawings-of-isomorphic-trees-2309.01463"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-pipeline-for-orthogonal-graph-drawing-2309.01671</loc><lastmod>2023-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-pipeline-for-orthogonal-graph-drawing-2309.01671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-pipeline-for-orthogonal-graph-drawing-2309.01671"/></url>
<url><loc>https://scifaro.com/en/abs/computing-hive-plots-a-combinatorial-framework-2309.02273</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-hive-plots-a-combinatorial-framework-2309.02273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-hive-plots-a-combinatorial-framework-2309.02273"/></url>
<url><loc>https://scifaro.com/en/abs/from-curves-to-words-and-back-again-geometric-computation-of-minimum-area-homotopy-2309.02383</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-curves-to-words-and-back-again-geometric-computation-of-minimum-area-homotopy-2309.02383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-curves-to-words-and-back-again-geometric-computation-of-minimum-area-homotopy-2309.02383"/></url>
<url><loc>https://scifaro.com/en/abs/on-minimizing-the-energy-of-a-spherical-graph-representation-2309.02817</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-minimizing-the-energy-of-a-spherical-graph-representation-2309.02817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-minimizing-the-energy-of-a-spherical-graph-representation-2309.02817"/></url>
<url><loc>https://scifaro.com/en/abs/celticgraph-drawing-graphs-as-celtic-knots-and-links-2309.02852</loc><lastmod>2023-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/celticgraph-drawing-graphs-as-celtic-knots-and-links-2309.02852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/celticgraph-drawing-graphs-as-celtic-knots-and-links-2309.02852"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-line-separable-unit-disk-coverage-and-related-problems-2309.03162</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-line-separable-unit-disk-coverage-and-related-problems-2309.03162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-line-separable-unit-disk-coverage-and-related-problems-2309.03162"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-reduction-of-the-spherical-point-in-polygon-problem-for-antipode-excluding-spherical-polygons-2309.03822</loc><lastmod>2026-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-reduction-of-the-spherical-point-in-polygon-problem-for-antipode-excluding-spherical-polygons-2309.03822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-reduction-of-the-spherical-point-in-polygon-problem-for-antipode-excluding-spherical-polygons-2309.03822"/></url>
<url><loc>https://scifaro.com/en/abs/a-2-approximation-algorithm-for-data-distributed-metric-k-center-2309.04327</loc><lastmod>2023-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-2-approximation-algorithm-for-data-distributed-metric-k-center-2309.04327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-2-approximation-algorithm-for-data-distributed-metric-k-center-2309.04327"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-morse-complexes-using-optimal-transport-an-experimental-study-2309.04681</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-morse-complexes-using-optimal-transport-an-experimental-study-2309.04681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-morse-complexes-using-optimal-transport-an-experimental-study-2309.04681"/></url>
<url><loc>https://scifaro.com/en/abs/learning-topological-operations-on-meshes-with-application-to-block-decomposition-of-polygons-2309.06484</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-topological-operations-on-meshes-with-application-to-block-decomposition-of-polygons-2309.06484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-topological-operations-on-meshes-with-application-to-block-decomposition-of-polygons-2309.06484"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-31st-international-symposium-on-graph-drawing-and-network-visualization-gd-2023-2309.07166</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-31st-international-symposium-on-graph-drawing-and-network-visualization-gd-2023-2309.07166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-31st-international-symposium-on-graph-drawing-and-network-visualization-gd-2023-2309.07166"/></url>
<url><loc>https://scifaro.com/en/abs/malicious-cyber-activity-detection-using-zigzag-persistence-2309.08010</loc><lastmod>2023-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/malicious-cyber-activity-detection-using-zigzag-persistence-2309.08010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/malicious-cyber-activity-detection-using-zigzag-persistence-2309.08010"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-upper-bound-for-angular-resolution-2309.08401</loc><lastmod>2023-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-upper-bound-for-angular-resolution-2309.08401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-upper-bound-for-angular-resolution-2309.08401"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-delaunay-tetrahedrization-a-robust-and-practical-approach-2309.09805</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-delaunay-tetrahedrization-a-robust-and-practical-approach-2309.09805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-delaunay-tetrahedrization-a-robust-and-practical-approach-2309.09805"/></url>
<url><loc>https://scifaro.com/en/abs/o-k-equivariant-dimensionality-reduction-on-stiefel-manifolds-2309.10775</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/o-k-equivariant-dimensionality-reduction-on-stiefel-manifolds-2309.10775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/o-k-equivariant-dimensionality-reduction-on-stiefel-manifolds-2309.10775"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-two-watchman-route-in-a-simple-polygon-2309.13428</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-two-watchman-route-in-a-simple-polygon-2309.13428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-two-watchman-route-in-a-simple-polygon-2309.13428"/></url>
<url><loc>https://scifaro.com/en/abs/trime-multi-threaded-triangular-meshing-in-two-dimensions-2309.13824</loc><lastmod>2024-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trime-multi-threaded-triangular-meshing-in-two-dimensions-2309.13824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trime-multi-threaded-triangular-meshing-in-two-dimensions-2309.13824"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-formation-for-fat-robots-with-memory-2309.14649</loc><lastmod>2025-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-formation-for-fat-robots-with-memory-2309.14649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-formation-for-fat-robots-with-memory-2309.14649"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-3d-morton-and-hilbert-orderings-2309.15199</loc><lastmod>2023-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-3d-morton-and-hilbert-orderings-2309.15199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-3d-morton-and-hilbert-orderings-2309.15199"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-cover-with-rotating-field-of-view-2309.15573</loc><lastmod>2023-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-cover-with-rotating-field-of-view-2309.15573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-cover-with-rotating-field-of-view-2309.15573"/></url>
<url><loc>https://scifaro.com/en/abs/multi-swap-k-means-2309.16384</loc><lastmod>2024-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-swap-k-means-2309.16384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-swap-k-means-2309.16384"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-paths-of-mutually-visible-robots-2309.16901</loc><lastmod>2025-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-paths-of-mutually-visible-robots-2309.16901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-paths-of-mutually-visible-robots-2309.16901"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-symbol-visibility-through-displacement-2310.01147</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-symbol-visibility-through-displacement-2310.01147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-symbol-visibility-through-displacement-2310.01147"/></url>
<url><loc>https://scifaro.com/en/abs/rf-ulm-ultrasound-localization-microscopy-learned-from-radio-frequency-wavefronts-2310.01545</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rf-ulm-ultrasound-localization-microscopy-learned-from-radio-frequency-wavefronts-2310.01545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rf-ulm-ultrasound-localization-microscopy-learned-from-radio-frequency-wavefronts-2310.01545"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-matching-and-bottleneck-problems-2310.02637</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-matching-and-bottleneck-problems-2310.02637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-matching-and-bottleneck-problems-2310.02637"/></url>
<url><loc>https://scifaro.com/en/abs/3d-polylla-polyhedral-meshing-algorithm-based-on-terminal-edge-regions-and-terminal-face-regions-2310.03665</loc><lastmod>2025-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3d-polylla-polyhedral-meshing-algorithm-based-on-terminal-edge-regions-and-terminal-face-regions-2310.03665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3d-polylla-polyhedral-meshing-algorithm-based-on-terminal-edge-regions-and-terminal-face-regions-2310.03665"/></url>
<url><loc>https://scifaro.com/en/abs/sub-quadratic-1-eps-approximate-euclidean-spanners-with-applications-2310.05315</loc><lastmod>2023-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sub-quadratic-1-eps-approximate-euclidean-spanners-with-applications-2310.05315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sub-quadratic-1-eps-approximate-euclidean-spanners-with-applications-2310.05315"/></url>
<url><loc>https://scifaro.com/en/abs/manifold-augmented-eikonal-equations-geodesic-distances-and-flows-on-differentiable-manifolds-2310.06157</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/manifold-augmented-eikonal-equations-geodesic-distances-and-flows-on-differentiable-manifolds-2310.06157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/manifold-augmented-eikonal-equations-geodesic-distances-and-flows-on-differentiable-manifolds-2310.06157"/></url>
<url><loc>https://scifaro.com/en/abs/p-kappa-curves-interpolatory-curves-with-curvature-approximating-a-parabola-2310.07191</loc><lastmod>2023-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/p-kappa-curves-interpolatory-curves-with-curvature-approximating-a-parabola-2310.07191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/p-kappa-curves-interpolatory-curves-with-curvature-approximating-a-parabola-2310.07191"/></url>
<url><loc>https://scifaro.com/en/abs/an-invitation-to-the-euler-characteristic-transform-2310.10395</loc><lastmod>2023-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-invitation-to-the-euler-characteristic-transform-2310.10395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-invitation-to-the-euler-characteristic-transform-2310.10395"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-euclidean-locality-sensitive-orderings-2310.12792</loc><lastmod>2025-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-euclidean-locality-sensitive-orderings-2310.12792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-euclidean-locality-sensitive-orderings-2310.12792"/></url>
<url><loc>https://scifaro.com/en/abs/curved-space-filling-tiles-using-voronoi-decomposition-with-line-and-curve-segments-closed-under-wallpaper-symmetries-2310.15361</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curved-space-filling-tiles-using-voronoi-decomposition-with-line-and-curve-segments-closed-under-wallpaper-symmetries-2310.15361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curved-space-filling-tiles-using-voronoi-decomposition-with-line-and-curve-segments-closed-under-wallpaper-symmetries-2310.15361"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-higher-order-voronoi-diagrams-in-the-plane-the-usefulness-of-nondeterminism-2310.15363</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-higher-order-voronoi-diagrams-in-the-plane-the-usefulness-of-nondeterminism-2310.15363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-higher-order-voronoi-diagrams-in-the-plane-the-usefulness-of-nondeterminism-2310.15363"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-bifiltrations-of-functions-on-point-clouds-2310.15902</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-bifiltrations-of-functions-on-point-clouds-2310.15902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-bifiltrations-of-functions-on-point-clouds-2310.15902"/></url>
<url><loc>https://scifaro.com/en/abs/simple-and-robust-dynamic-two-dimensional-convex-hull-2310.18068</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-and-robust-dynamic-two-dimensional-convex-hull-2310.18068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-and-robust-dynamic-two-dimensional-convex-hull-2310.18068"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-dynamic-time-warping-2310.18128</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-dynamic-time-warping-2310.18128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-dynamic-time-warping-2310.18128"/></url>
<url><loc>https://scifaro.com/en/abs/testing-tensor-product-b-e-zier-surfaces-for-coincidence-a-comprehensive-solution-2310.18337</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-tensor-product-b-e-zier-surfaces-for-coincidence-a-comprehensive-solution-2310.18337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-tensor-product-b-e-zier-surfaces-for-coincidence-a-comprehensive-solution-2310.18337"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-plane-trees-in-convex-geometric-graphs-2310.18518</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-plane-trees-in-convex-geometric-graphs-2310.18518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-plane-trees-in-convex-geometric-graphs-2310.18518"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-text-opt-epsilon-approximation-algorithm-for-maximum-independent-set-of-connected-subgraphs-in-a-planar-graph-2310.20325</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-text-opt-epsilon-approximation-algorithm-for-maximum-independent-set-of-connected-subgraphs-in-a-planar-graph-2310.20325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-text-opt-epsilon-approximation-algorithm-for-maximum-independent-set-of-connected-subgraphs-in-a-planar-graph-2310.20325"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-graphs-on-surfaces-2311.00437</loc><lastmod>2025-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-graphs-on-surfaces-2311.00437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-graphs-on-surfaces-2311.00437"/></url>
<url><loc>https://scifaro.com/en/abs/vertical-decomposition-in-3d-and-4d-with-applications-to-line-nearest-neighbor-searching-in-3d-2311.01597</loc><lastmod>2023-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vertical-decomposition-in-3d-and-4d-with-applications-to-line-nearest-neighbor-searching-in-3d-2311.01597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vertical-decomposition-in-3d-and-4d-with-applications-to-line-nearest-neighbor-searching-in-3d-2311.01597"/></url>
<url><loc>https://scifaro.com/en/abs/fast-ellipsoidal-conformal-and-quasi-conformal-parameterization-of-genus-0-closed-surfaces-2311.01788</loc><lastmod>2024-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-ellipsoidal-conformal-and-quasi-conformal-parameterization-of-genus-0-closed-surfaces-2311.01788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-ellipsoidal-conformal-and-quasi-conformal-parameterization-of-genus-0-closed-surfaces-2311.01788"/></url>
<url><loc>https://scifaro.com/en/abs/fast-approximation-algorithms-for-piercing-boxes-by-points-2311.02050</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-approximation-algorithms-for-piercing-boxes-by-points-2311.02050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-approximation-algorithms-for-piercing-boxes-by-points-2311.02050"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-accurate-approximations-of-the-optimal-transport-in-semi-discrete-and-discrete-settings-2311.02172</loc><lastmod>2023-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-accurate-approximations-of-the-optimal-transport-in-semi-discrete-and-discrete-settings-2311.02172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-accurate-approximations-of-the-optimal-transport-in-semi-discrete-and-discrete-settings-2311.02172"/></url>
<url><loc>https://scifaro.com/en/abs/automated-mathematical-discovery-and-verification-minimizing-pentagons-in-the-plane-2311.03645</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-mathematical-discovery-and-verification-minimizing-pentagons-in-the-plane-2311.03645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-mathematical-discovery-and-verification-minimizing-pentagons-in-the-plane-2311.03645"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-cycle-hitting-problems-on-disk-graphs-2311.03665</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-cycle-hitting-problems-on-disk-graphs-2311.03665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-cycle-hitting-problems-on-disk-graphs-2311.03665"/></url>
<url><loc>https://scifaro.com/en/abs/on-mergable-coresets-for-polytope-distance-2311.05651</loc><lastmod>2023-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-mergable-coresets-for-polytope-distance-2311.05651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-mergable-coresets-for-polytope-distance-2311.05651"/></url>
<url><loc>https://scifaro.com/en/abs/spanners-under-the-hausdorff-and-fr-echet-distances-2311.06013</loc><lastmod>2023-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanners-under-the-hausdorff-and-fr-echet-distances-2311.06013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanners-under-the-hausdorff-and-fr-echet-distances-2311.06013"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-of-free-spaces-of-curves-2311.07573</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-of-free-spaces-of-curves-2311.07573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-of-free-spaces-of-curves-2311.07573"/></url>
<url><loc>https://scifaro.com/en/abs/curve-stabbing-depth-data-depth-for-plane-curves-2311.07907</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curve-stabbing-depth-data-depth-for-plane-curves-2311.07907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curve-stabbing-depth-data-depth-for-plane-curves-2311.07907"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-tambara-yamagami-quantum-invariants-of-3-manifolds-parameterized-by-the-first-betti-number-2311.08514</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-tambara-yamagami-quantum-invariants-of-3-manifolds-parameterized-by-the-first-betti-number-2311.08514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-tambara-yamagami-quantum-invariants-of-3-manifolds-parameterized-by-the-first-betti-number-2311.08514"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-non-locality-of-edge-insertions-2311.09794</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-non-locality-of-edge-insertions-2311.09794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-non-locality-of-edge-insertions-2311.09794"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-star-partitions-of-simple-polygons-in-polynomial-time-2311.10631</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-star-partitions-of-simple-polygons-in-polynomial-time-2311.10631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-star-partitions-of-simple-polygons-in-polynomial-time-2311.10631"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-rectangles-induced-by-points-2311.10637</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-rectangles-induced-by-points-2311.10637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-rectangles-induced-by-points-2311.10637"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-triangulation-in-geometrically-noisy-environments-using-mathematics-2311.11480</loc><lastmod>2023-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-triangulation-in-geometrically-noisy-environments-using-mathematics-2311.11480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-triangulation-in-geometrically-noisy-environments-using-mathematics-2311.11480"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-and-scalable-computational-topology-framework-for-the-euler-characteristic-2311.11740</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-and-scalable-computational-topology-framework-for-the-euler-characteristic-2311.11740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-and-scalable-computational-topology-framework-for-the-euler-characteristic-2311.11740"/></url>
<url><loc>https://scifaro.com/en/abs/outerplanar-and-forest-storyplans-2311.13523</loc><lastmod>2025-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outerplanar-and-forest-storyplans-2311.13523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outerplanar-and-forest-storyplans-2311.13523"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-corners-in-colored-rectilinear-grids-2311.14134</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-corners-in-colored-rectilinear-grids-2311.14134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-corners-in-colored-rectilinear-grids-2311.14134"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-graph-drawings-in-the-presence-of-point-obstacles-2311.14516</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-graph-drawings-in-the-presence-of-point-obstacles-2311.14516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-graph-drawings-in-the-presence-of-point-obstacles-2311.14516"/></url>
<url><loc>https://scifaro.com/en/abs/new-bounds-on-the-local-and-global-edge-length-ratio-of-planar-graphs-2311.14634</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-bounds-on-the-local-and-global-edge-length-ratio-of-planar-graphs-2311.14634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-bounds-on-the-local-and-global-edge-length-ratio-of-planar-graphs-2311.14634"/></url>
<url><loc>https://scifaro.com/en/abs/on-layered-area-proportional-rectangle-contact-representations-2311.15057</loc><lastmod>2026-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-layered-area-proportional-rectangle-contact-representations-2311.15057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-layered-area-proportional-rectangle-contact-representations-2311.15057"/></url>
<url><loc>https://scifaro.com/en/abs/eulermerge-simplifying-euler-diagrams-through-set-merges-2311.15396</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eulermerge-simplifying-euler-diagrams-through-set-merges-2311.15396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eulermerge-simplifying-euler-diagrams-through-set-merges-2311.15396"/></url>
<url><loc>https://scifaro.com/en/abs/exceptional-mechanical-performance-by-spatial-printing-with-continuous-fiber-curved-slicing-toolpath-generation-and-physical-verification-2311.17265</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exceptional-mechanical-performance-by-spatial-printing-with-continuous-fiber-curved-slicing-toolpath-generation-and-physical-verification-2311.17265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exceptional-mechanical-performance-by-spatial-printing-with-continuous-fiber-curved-slicing-toolpath-generation-and-physical-verification-2311.17265"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-optimal-l-infty-star-discrepancy-sets-2311.17463</loc><lastmod>2024-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-optimal-l-infty-star-discrepancy-sets-2311.17463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-optimal-l-infty-star-discrepancy-sets-2311.17463"/></url>
<url><loc>https://scifaro.com/en/abs/fully-dynamic-algorithms-for-euclidean-steiner-tree-2311.18365</loc><lastmod>2023-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-dynamic-algorithms-for-euclidean-steiner-tree-2311.18365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-dynamic-algorithms-for-euclidean-steiner-tree-2311.18365"/></url>
<url><loc>https://scifaro.com/en/abs/online-dominating-set-and-coloring-for-geometric-intersection-graphs-2312.01467</loc><lastmod>2023-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-dominating-set-and-coloring-for-geometric-intersection-graphs-2312.01467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-dominating-set-and-coloring-for-geometric-intersection-graphs-2312.01467"/></url>
<url><loc>https://scifaro.com/en/abs/skeletal-cut-loci-on-convex-polyhedra-2312.01534</loc><lastmod>2025-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skeletal-cut-loci-on-convex-polyhedra-2312.01534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skeletal-cut-loci-on-convex-polyhedra-2312.01534"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-bottleneck-steiner-tree-is-fixed-parameter-tractable-2312.01589</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-bottleneck-steiner-tree-is-fixed-parameter-tractable-2312.01589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-bottleneck-steiner-tree-is-fixed-parameter-tractable-2312.01589"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-bound-on-sums-of-square-roots-via-the-subspace-theorem-2312.02057</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-bound-on-sums-of-square-roots-via-the-subspace-theorem-2312.02057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-bound-on-sums-of-square-roots-via-the-subspace-theorem-2312.02057"/></url>
<url><loc>https://scifaro.com/en/abs/inapproximability-of-maximum-diameter-clustering-for-few-clusters-2312.02097</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inapproximability-of-maximum-diameter-clustering-for-few-clusters-2312.02097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inapproximability-of-maximum-diameter-clustering-for-few-clusters-2312.02097"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-symmetric-self-intersecting-surfaces-2312.02113</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-symmetric-self-intersecting-surfaces-2312.02113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-symmetric-self-intersecting-surfaces-2312.02113"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithms-for-minimum-membership-geometric-set-cover-2312.02722</loc><lastmod>2023-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithms-for-minimum-membership-geometric-set-cover-2312.02722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithms-for-minimum-membership-geometric-set-cover-2312.02722"/></url>
<url><loc>https://scifaro.com/en/abs/computing-k-crossing-visibility-through-k-levels-2312.02827</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-k-crossing-visibility-through-k-levels-2312.02827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-k-crossing-visibility-through-k-levels-2312.02827"/></url>
<url><loc>https://scifaro.com/en/abs/switch-points-of-bi-persistence-matching-distance-2312.02955</loc><lastmod>2023-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/switch-points-of-bi-persistence-matching-distance-2312.02955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/switch-points-of-bi-persistence-matching-distance-2312.02955"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-thickness-of-multigraphs-is-exists-mathbb-r-complete-2312.05010</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-thickness-of-multigraphs-is-exists-mathbb-r-complete-2312.05010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-thickness-of-multigraphs-is-exists-mathbb-r-complete-2312.05010"/></url>
<url><loc>https://scifaro.com/en/abs/delaunay-triangulations-in-the-hilbert-metric-2312.05987</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delaunay-triangulations-in-the-hilbert-metric-2312.05987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delaunay-triangulations-in-the-hilbert-metric-2312.05987"/></url>
<url><loc>https://scifaro.com/en/abs/covering-rectilinear-polygons-with-area-weighted-rectangles-2312.08540</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-rectilinear-polygons-with-area-weighted-rectangles-2312.08540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-rectilinear-polygons-with-area-weighted-rectangles-2312.08540"/></url>
<url><loc>https://scifaro.com/en/abs/clustering-with-few-disks-to-minimize-the-sum-of-radii-2312.08803</loc><lastmod>2024-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustering-with-few-disks-to-minimize-the-sum-of-radii-2312.08803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustering-with-few-disks-to-minimize-the-sum-of-radii-2312.08803"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-simultaneous-geometric-embedding-for-edge-disjoint-graphs-2312.09025</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-simultaneous-geometric-embedding-for-edge-disjoint-graphs-2312.09025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-simultaneous-geometric-embedding-for-edge-disjoint-graphs-2312.09025"/></url>
<url><loc>https://scifaro.com/en/abs/hopf-arborescent-links-minor-theory-and-decidability-of-the-genus-defect-2312.09094</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hopf-arborescent-links-minor-theory-and-decidability-of-the-genus-defect-2312.09094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hopf-arborescent-links-minor-theory-and-decidability-of-the-genus-defect-2312.09094"/></url>
<url><loc>https://scifaro.com/en/abs/fast-approximations-and-coresets-for-k-l-median-under-dynamic-time-warping-2312.09838</loc><lastmod>2024-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-approximations-and-coresets-for-k-l-median-under-dynamic-time-warping-2312.09838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-approximations-and-coresets-for-k-l-median-under-dynamic-time-warping-2312.09838"/></url>
<url><loc>https://scifaro.com/en/abs/two-trees-are-better-than-one-2312.09916</loc><lastmod>2024-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-trees-are-better-than-one-2312.09916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-trees-are-better-than-one-2312.09916"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-injectivity-of-euler-integral-transforms-with-hyperplanes-and-quadric-hypersurfaces-2312.10002</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-injectivity-of-euler-integral-transforms-with-hyperplanes-and-quadric-hypersurfaces-2312.10002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-injectivity-of-euler-integral-transforms-with-hyperplanes-and-quadric-hypersurfaces-2312.10002"/></url>
<url><loc>https://scifaro.com/en/abs/topological-hierarchical-decompositions-2312.10239</loc><lastmod>2023-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-hierarchical-decompositions-2312.10239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-hierarchical-decompositions-2312.10239"/></url>
<url><loc>https://scifaro.com/en/abs/on-selecting-a-fraction-of-leaves-with-disjoint-neighborhoods-in-a-plane-tree-2312.10245</loc><lastmod>2023-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-selecting-a-fraction-of-leaves-with-disjoint-neighborhoods-in-a-plane-tree-2312.10245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-selecting-a-fraction-of-leaves-with-disjoint-neighborhoods-in-a-plane-tree-2312.10245"/></url>
<url><loc>https://scifaro.com/en/abs/relating-interleaving-and-fr-echet-distances-via-ordered-merge-trees-2312.11113</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-interleaving-and-fr-echet-distances-via-ordered-merge-trees-2312.11113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-interleaving-and-fr-echet-distances-via-ordered-merge-trees-2312.11113"/></url>
<url><loc>https://scifaro.com/en/abs/mend-the-gap-a-smart-repair-algorithm-for-noisy-polygonal-tilings-2312.11415</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mend-the-gap-a-smart-repair-algorithm-for-noisy-polygonal-tilings-2312.11415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mend-the-gap-a-smart-repair-algorithm-for-noisy-polygonal-tilings-2312.11415"/></url>
<url><loc>https://scifaro.com/en/abs/the-exact-spanning-ratio-of-the-parallelogram-delaunay-graph-2312.14305</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-exact-spanning-ratio-of-the-parallelogram-delaunay-graph-2312.14305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-exact-spanning-ratio-of-the-parallelogram-delaunay-graph-2312.14305"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-in-place-compaction-of-sliding-cubes-2312.15096</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-in-place-compaction-of-sliding-cubes-2312.15096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-in-place-compaction-of-sliding-cubes-2312.15096"/></url>
<url><loc>https://scifaro.com/en/abs/routing-on-heavy-path-wspd-spanners-2312.15145</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routing-on-heavy-path-wspd-spanners-2312.15145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routing-on-heavy-path-wspd-spanners-2312.15145"/></url>
<url><loc>https://scifaro.com/en/abs/a-method-for-auto-differentiation-of-the-voronoi-tessellation-2312.16192</loc><lastmod>2024-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-method-for-auto-differentiation-of-the-voronoi-tessellation-2312.16192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-method-for-auto-differentiation-of-the-voronoi-tessellation-2312.16192"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-feasibility-and-minimizing-the-height-of-tangles-2312.16213</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-feasibility-and-minimizing-the-height-of-tangles-2312.16213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-feasibility-and-minimizing-the-height-of-tangles-2312.16213"/></url>
<url><loc>https://scifaro.com/en/abs/polygon-detection-from-a-set-of-lines-2312.16363</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygon-detection-from-a-set-of-lines-2312.16363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygon-detection-from-a-set-of-lines-2312.16363"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-distance-and-shortest-path-oracles-for-fault-tolerant-geometric-spanners-2312.16397</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-distance-and-shortest-path-oracles-for-fault-tolerant-geometric-spanners-2312.16397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-distance-and-shortest-path-oracles-for-fault-tolerant-geometric-spanners-2312.16397"/></url>
<url><loc>https://scifaro.com/en/abs/void-shape-identification-in-a-2d-point-distribution-2312.17533</loc><lastmod>2024-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/void-shape-identification-in-a-2d-point-distribution-2312.17533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/void-shape-identification-in-a-2d-point-distribution-2312.17533"/></url>
<url><loc>https://scifaro.com/en/abs/competitive-searching-over-terrains-2401.01289</loc><lastmod>2024-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/competitive-searching-over-terrains-2401.01289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/competitive-searching-over-terrains-2401.01289"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-of-unit-segment-and-polyline-graphs-is-exists-mathbb-r-complete-2401.02172</loc><lastmod>2025-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-of-unit-segment-and-polyline-graphs-is-exists-mathbb-r-complete-2401.02172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-of-unit-segment-and-polyline-graphs-is-exists-mathbb-r-complete-2401.02172"/></url>
<url><loc>https://scifaro.com/en/abs/point-location-in-constant-time-2401.02440</loc><lastmod>2024-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-location-in-constant-time-2401.02440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-location-in-constant-time-2401.02440"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-computing-closest-points-for-segments-2401.02636</loc><lastmod>2024-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-computing-closest-points-for-segments-2401.02636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-computing-closest-points-for-segments-2401.02636"/></url>
<url><loc>https://scifaro.com/en/abs/robust-bichromatic-classification-using-two-lines-2401.02897</loc><lastmod>2024-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-bichromatic-classification-using-two-lines-2401.02897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-bichromatic-classification-using-two-lines-2401.02897"/></url>
<url><loc>https://scifaro.com/en/abs/on-1-bend-upward-point-set-embeddings-of-st-digraphs-2401.03226</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-1-bend-upward-point-set-embeddings-of-st-digraphs-2401.03226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-1-bend-upward-point-set-embeddings-of-st-digraphs-2401.03226"/></url>
<url><loc>https://scifaro.com/en/abs/colored-points-traveling-salesman-problem-2401.03297</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-points-traveling-salesman-problem-2401.03297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-points-traveling-salesman-problem-2401.03297"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-fr-echet-distance-between-piecewise-smooth-curves-2401.03339</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-fr-echet-distance-between-piecewise-smooth-curves-2401.03339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-fr-echet-distance-between-piecewise-smooth-curves-2401.03339"/></url>
<url><loc>https://scifaro.com/en/abs/range-reporting-for-time-series-via-rectangle-stabbing-2401.03762</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-reporting-for-time-series-via-rectangle-stabbing-2401.03762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-reporting-for-time-series-via-rectangle-stabbing-2401.03762"/></url>
<url><loc>https://scifaro.com/en/abs/from-axial-c-hedra-to-general-p-nets-2401.04649</loc><lastmod>2024-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-axial-c-hedra-to-general-p-nets-2401.04649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-axial-c-hedra-to-general-p-nets-2401.04649"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-properties-of-finite-disk-collections-2401.05661</loc><lastmod>2024-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-properties-of-finite-disk-collections-2401.05661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-properties-of-finite-disk-collections-2401.05661"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-iterations-of-the-dba-algorithm-2401.05841</loc><lastmod>2024-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-iterations-of-the-dba-algorithm-2401.05841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-iterations-of-the-dba-algorithm-2401.05841"/></url>
<url><loc>https://scifaro.com/en/abs/hybridoctree-hex-hybrid-octree-based-adaptive-all-hexahedral-mesh-generation-with-jacobian-control-2401.05984</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybridoctree-hex-hybrid-octree-based-adaptive-all-hexahedral-mesh-generation-with-jacobian-control-2401.05984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybridoctree-hex-hybrid-octree-based-adaptive-all-hexahedral-mesh-generation-with-jacobian-control-2401.05984"/></url>
<url><loc>https://scifaro.com/en/abs/measure-theoretic-reeb-graphs-and-reeb-spaces-2401.06748</loc><lastmod>2024-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measure-theoretic-reeb-graphs-and-reeb-spaces-2401.06748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measure-theoretic-reeb-graphs-and-reeb-spaces-2401.06748"/></url>
<url><loc>https://scifaro.com/en/abs/polygonal-sequence-driven-triangulation-validator-an-incremental-approach-to-2d-triangulation-verification-2401.08242</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polygonal-sequence-driven-triangulation-validator-an-incremental-approach-to-2d-triangulation-verification-2401.08242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polygonal-sequence-driven-triangulation-validator-an-incremental-approach-to-2d-triangulation-verification-2401.08242"/></url>
<url><loc>https://scifaro.com/en/abs/reliability-based-g1-continuous-arc-spline-approximation-2401.09770</loc><lastmod>2024-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reliability-based-g1-continuous-arc-spline-approximation-2401.09770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reliability-based-g1-continuous-arc-spline-approximation-2401.09770"/></url>
<url><loc>https://scifaro.com/en/abs/3d-space-trajectories-and-beyond-abstract-art-creation-with-3d-printing-2401.11909</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3d-space-trajectories-and-beyond-abstract-art-creation-with-3d-printing-2401.11909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3d-space-trajectories-and-beyond-abstract-art-creation-with-3d-printing-2401.11909"/></url>
<url><loc>https://scifaro.com/en/abs/improving-angular-speed-uniformity-by-piecewise-radical-reparameterization-2401.11910</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-angular-speed-uniformity-by-piecewise-radical-reparameterization-2401.11910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-angular-speed-uniformity-by-piecewise-radical-reparameterization-2401.11910"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-discovery-amongst-cyclic-polygons-2401.13002</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-discovery-amongst-cyclic-polygons-2401.13002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-discovery-amongst-cyclic-polygons-2401.13002"/></url>
<url><loc>https://scifaro.com/en/abs/faster-fr-echet-distance-approximation-through-truncated-smoothing-2401.14815</loc><lastmod>2025-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-fr-echet-distance-approximation-through-truncated-smoothing-2401.14815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-fr-echet-distance-approximation-through-truncated-smoothing-2401.14815"/></url>
<url><loc>https://scifaro.com/en/abs/integrable-frame-fields-using-odeco-tensors-2401.17175</loc><lastmod>2024-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrable-frame-fields-using-odeco-tensors-2401.17175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrable-frame-fields-using-odeco-tensors-2401.17175"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-smallest-k-enclosing-geodesic-disc-in-a-simple-polygon-2402.00336</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-smallest-k-enclosing-geodesic-disc-in-a-simple-polygon-2402.00336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-smallest-k-enclosing-geodesic-disc-in-a-simple-polygon-2402.00336"/></url>
<url><loc>https://scifaro.com/en/abs/surface-reconstruction-using-rotation-systems-2402.01893</loc><lastmod>2025-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-reconstruction-using-rotation-systems-2402.01893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-reconstruction-using-rotation-systems-2402.01893"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximation-schemes-for-stabbing-rectilinear-polygons-2402.02412</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximation-schemes-for-stabbing-rectilinear-polygons-2402.02412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximation-schemes-for-stabbing-rectilinear-polygons-2402.02412"/></url>
<url><loc>https://scifaro.com/en/abs/bezier-surfaces-with-prescribed-diagonals-2402.03892</loc><lastmod>2024-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bezier-surfaces-with-prescribed-diagonals-2402.03892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bezier-surfaces-with-prescribed-diagonals-2402.03892"/></url>
<url><loc>https://scifaro.com/en/abs/a-modified-de-casteljau-subdivision-that-supports-smooth-stitching-with-hierarchically-organized-bicubic-bezier-patches-2402.04319</loc><lastmod>2024-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modified-de-casteljau-subdivision-that-supports-smooth-stitching-with-hierarchically-organized-bicubic-bezier-patches-2402.04319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modified-de-casteljau-subdivision-that-supports-smooth-stitching-with-hierarchically-organized-bicubic-bezier-patches-2402.04319"/></url>
<url><loc>https://scifaro.com/en/abs/making-multicurves-cross-minimally-on-surfaces-2402.04789</loc><lastmod>2024-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-multicurves-cross-minimally-on-surfaces-2402.04789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-multicurves-cross-minimally-on-surfaces-2402.04789"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-geometric-connectivity-in-the-plane-with-constant-query-time-2402.05357</loc><lastmod>2024-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-geometric-connectivity-in-the-plane-with-constant-query-time-2402.05357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-geometric-connectivity-in-the-plane-with-constant-query-time-2402.05357"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-visibility-based-search-in-polygonal-domains-2402.05420</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-visibility-based-search-in-polygonal-domains-2402.05420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-visibility-based-search-in-polygonal-domains-2402.05420"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-mathematical-foundation-of-the-minimum-enclosing-ball-and-related-problems-2402.06629</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-mathematical-foundation-of-the-minimum-enclosing-ball-and-related-problems-2402.06629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-mathematical-foundation-of-the-minimum-enclosing-ball-and-related-problems-2402.06629"/></url>
<url><loc>https://scifaro.com/en/abs/core-gd-a-hierarchical-framework-for-scalable-graph-visualization-with-gnns-2402.06706</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/core-gd-a-hierarchical-framework-for-scalable-graph-visualization-with-gnns-2402.06706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/core-gd-a-hierarchical-framework-for-scalable-graph-visualization-with-gnns-2402.06706"/></url>
<url><loc>https://scifaro.com/en/abs/fully-dynamic-geometric-vertex-cover-and-matching-2402.07441</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-dynamic-geometric-vertex-cover-and-matching-2402.07441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-dynamic-geometric-vertex-cover-and-matching-2402.07441"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-maximum-independent-set-of-convex-polygons-with-a-bounded-number-of-directions-2402.07666</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-maximum-independent-set-of-convex-polygons-with-a-bounded-number-of-directions-2402.07666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-maximum-independent-set-of-convex-polygons-with-a-bounded-number-of-directions-2402.07666"/></url>
<url><loc>https://scifaro.com/en/abs/nearly-orthogonal-sets-over-finite-fields-2402.08274</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearly-orthogonal-sets-over-finite-fields-2402.08274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearly-orthogonal-sets-over-finite-fields-2402.08274"/></url>
<url><loc>https://scifaro.com/en/abs/reeb-complements-for-exploring-inclusions-between-isosurfaces-from-two-scalar-fields-2402.09768</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reeb-complements-for-exploring-inclusions-between-isosurfaces-from-two-scalar-fields-2402.09768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reeb-complements-for-exploring-inclusions-between-isosurfaces-from-two-scalar-fields-2402.09768"/></url>
<url><loc>https://scifaro.com/en/abs/two-online-map-matching-algorithms-based-on-analytic-hierarchy-process-and-fuzzy-logic-2402.11866</loc><lastmod>2024-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-online-map-matching-algorithms-based-on-analytic-hierarchy-process-and-fuzzy-logic-2402.11866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-online-map-matching-algorithms-based-on-analytic-hierarchy-process-and-fuzzy-logic-2402.11866"/></url>
<url><loc>https://scifaro.com/en/abs/exact-solutions-to-the-weighted-region-problem-2402.12028</loc><lastmod>2026-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-solutions-to-the-weighted-region-problem-2402.12028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-solutions-to-the-weighted-region-problem-2402.12028"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-geodesic-spanners-using-steiner-points-2402.12110</loc><lastmod>2024-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-geodesic-spanners-using-steiner-points-2402.12110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-geodesic-spanners-using-steiner-points-2402.12110"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-boundary-labeling-2402.12245</loc><lastmod>2025-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-boundary-labeling-2402.12245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-boundary-labeling-2402.12245"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-the-shape-of-a-point-set-with-a-line-segment-2402.12285</loc><lastmod>2024-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-the-shape-of-a-point-set-with-a-line-segment-2402.12285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-the-shape-of-a-point-set-with-a-line-segment-2402.12285"/></url>
<url><loc>https://scifaro.com/en/abs/flip-graphs-of-pseudo-triangulations-with-face-degree-at-most-4-2402.12357</loc><lastmod>2024-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flip-graphs-of-pseudo-triangulations-with-face-degree-at-most-4-2402.12357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flip-graphs-of-pseudo-triangulations-with-face-degree-at-most-4-2402.12357"/></url>
<url><loc>https://scifaro.com/en/abs/computing-enclosing-depth-2402.12371</loc><lastmod>2024-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-enclosing-depth-2402.12371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-enclosing-depth-2402.12371"/></url>
<url><loc>https://scifaro.com/en/abs/faster-deterministic-and-space-efficient-subtrajectory-clustering-2402.13117</loc><lastmod>2025-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-deterministic-and-space-efficient-subtrajectory-clustering-2402.13117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-deterministic-and-space-efficient-subtrajectory-clustering-2402.13117"/></url>
<url><loc>https://scifaro.com/en/abs/clustered-planarity-variants-for-level-graphs-2402.13153</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustered-planarity-variants-for-level-graphs-2402.13153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustered-planarity-variants-for-level-graphs-2402.13153"/></url>
<url><loc>https://scifaro.com/en/abs/barking-dogs-a-fr-echet-distance-variant-for-detour-detection-2402.13159</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/barking-dogs-a-fr-echet-distance-variant-for-detour-detection-2402.13159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/barking-dogs-a-fr-echet-distance-variant-for-detour-detection-2402.13159"/></url>
<url><loc>https://scifaro.com/en/abs/greedy-monochromatic-island-partitions-2402.13340</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greedy-monochromatic-island-partitions-2402.13340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greedy-monochromatic-island-partitions-2402.13340"/></url>
<url><loc>https://scifaro.com/en/abs/how-small-can-faithful-sets-be-ordering-topological-descriptors-2402.13632</loc><lastmod>2026-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-small-can-faithful-sets-be-ordering-topological-descriptors-2402.13632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-small-can-faithful-sets-be-ordering-topological-descriptors-2402.13632"/></url>
<url><loc>https://scifaro.com/en/abs/asymmetric-separation-problem-for-bichromatic-point-set-2402.13767</loc><lastmod>2025-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymmetric-separation-problem-for-bichromatic-point-set-2402.13767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymmetric-separation-problem-for-bichromatic-point-set-2402.13767"/></url>
<url><loc>https://scifaro.com/en/abs/improved-lower-bound-on-the-number-of-pseudoline-arrangements-2402.13923</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-lower-bound-on-the-number-of-pseudoline-arrangements-2402.13923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-lower-bound-on-the-number-of-pseudoline-arrangements-2402.13923"/></url>
<url><loc>https://scifaro.com/en/abs/a-class-of-topological-pseudodistances-for-fast-comparison-of-persistence-diagrams-2402.14489</loc><lastmod>2024-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-class-of-topological-pseudodistances-for-fast-comparison-of-persistence-diagrams-2402.14489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-class-of-topological-pseudodistances-for-fast-comparison-of-persistence-diagrams-2402.14489"/></url>
<url><loc>https://scifaro.com/en/abs/on-k-plane-insertion-into-plane-drawings-2402.14552</loc><lastmod>2024-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-k-plane-insertion-into-plane-drawings-2402.14552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-k-plane-insertion-into-plane-drawings-2402.14552"/></url>
<url><loc>https://scifaro.com/en/abs/embeddings-and-near-neighbor-searching-with-constant-additive-error-for-hyperbolic-spaces-2402.14604</loc><lastmod>2024-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embeddings-and-near-neighbor-searching-with-constant-additive-error-for-hyperbolic-spaces-2402.14604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embeddings-and-near-neighbor-searching-with-constant-additive-error-for-hyperbolic-spaces-2402.14604"/></url>
<url><loc>https://scifaro.com/en/abs/folding-polyominoes-into-cubes-2402.14965</loc><lastmod>2024-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-polyominoes-into-cubes-2402.14965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-polyominoes-into-cubes-2402.14965"/></url>
<url><loc>https://scifaro.com/en/abs/grid-peeling-of-parabolas-2402.15787</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grid-peeling-of-parabolas-2402.15787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grid-peeling-of-parabolas-2402.15787"/></url>
<url><loc>https://scifaro.com/en/abs/an-o-n-log-n-time-approximation-scheme-for-geometric-many-to-many-matching-2402.15837</loc><lastmod>2024-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-o-n-log-n-time-approximation-scheme-for-geometric-many-to-many-matching-2402.15837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-o-n-log-n-time-approximation-scheme-for-geometric-many-to-many-matching-2402.15837"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-halfplane-coverage-and-related-problems-2402.16323</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-halfplane-coverage-and-related-problems-2402.16323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-halfplane-coverage-and-related-problems-2402.16323"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-and-approximation-algorithms-for-coverings-points-with-segments-in-the-plane-2402.16466</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-and-approximation-algorithms-for-coverings-points-with-segments-in-the-plane-2402.16466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-and-approximation-algorithms-for-coverings-points-with-segments-in-the-plane-2402.16466"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-simplet-frequency-distribution-for-simplicial-complexes-2402.16777</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-simplet-frequency-distribution-for-simplicial-complexes-2402.16777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-simplet-frequency-distribution-for-simplicial-complexes-2402.16777"/></url>
<url><loc>https://scifaro.com/en/abs/enclosing-points-with-geometric-objects-2402.17322</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enclosing-points-with-geometric-objects-2402.17322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enclosing-points-with-geometric-objects-2402.17322"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-deep-learning-for-computer-aided-design-a-survey-2402.17695</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-deep-learning-for-computer-aided-design-a-survey-2402.17695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-deep-learning-for-computer-aided-design-a-survey-2402.17695"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-motion-planning-for-rectangular-robots-2402.17846</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-motion-planning-for-rectangular-robots-2402.17846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-motion-planning-for-rectangular-robots-2402.17846"/></url>
<url><loc>https://scifaro.com/en/abs/happy-ending-an-empty-hexagon-in-every-set-of-30-points-2403.00737</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/happy-ending-an-empty-hexagon-in-every-set-of-30-points-2403.00737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/happy-ending-an-empty-hexagon-in-every-set-of-30-points-2403.00737"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-distance-compression-via-deep-random-features-2403.01327</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-distance-compression-via-deep-random-features-2403.01327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-distance-compression-via-deep-random-features-2403.01327"/></url>
<url><loc>https://scifaro.com/en/abs/an-overview-of-minimum-convex-cover-and-maximum-hidden-set-2403.01354</loc><lastmod>2026-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-overview-of-minimum-convex-cover-and-maximum-hidden-set-2403.01354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-overview-of-minimum-convex-cover-and-maximum-hidden-set-2403.01354"/></url>
<url><loc>https://scifaro.com/en/abs/on-efficient-approximation-of-the-maximum-distance-to-a-point-over-an-intersection-of-balls-2403.02071</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-efficient-approximation-of-the-maximum-distance-to-a-point-over-an-intersection-of-balls-2403.02071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-efficient-approximation-of-the-maximum-distance-to-a-point-over-an-intersection-of-balls-2403.02071"/></url>
<url><loc>https://scifaro.com/en/abs/eight-partitioning-points-in-3d-and-efficiently-too-2403.02627</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eight-partitioning-points-in-3d-and-efficiently-too-2403.02627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eight-partitioning-points-in-3d-and-efficiently-too-2403.02627"/></url>
<url><loc>https://scifaro.com/en/abs/space-complexity-of-euclidean-clustering-2403.02971</loc><lastmod>2025-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-complexity-of-euclidean-clustering-2403.02971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-complexity-of-euclidean-clustering-2403.02971"/></url>
<url><loc>https://scifaro.com/en/abs/maintaining-light-spanners-via-minimal-updates-2403.03290</loc><lastmod>2024-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maintaining-light-spanners-via-minimal-updates-2403.03290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maintaining-light-spanners-via-minimal-updates-2403.03290"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-of-rectangular-euler-diagrams-2403.03801</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-of-rectangular-euler-diagrams-2403.03801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-of-rectangular-euler-diagrams-2403.03801"/></url>
<url><loc>https://scifaro.com/en/abs/fine-grained-complexity-of-earth-mover-s-distance-under-translation-2403.04356</loc><lastmod>2025-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fine-grained-complexity-of-earth-mover-s-distance-under-translation-2403.04356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fine-grained-complexity-of-earth-mover-s-distance-under-translation-2403.04356"/></url>
<url><loc>https://scifaro.com/en/abs/a-coreset-for-approximate-furthest-neighbor-queries-in-a-simple-polygon-2403.04513</loc><lastmod>2024-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coreset-for-approximate-furthest-neighbor-queries-in-a-simple-polygon-2403.04513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coreset-for-approximate-furthest-neighbor-queries-in-a-simple-polygon-2403.04513"/></url>
<url><loc>https://scifaro.com/en/abs/a-clique-based-separator-for-intersection-graphs-of-geodesic-disks-in-mathbb-r-2-2403.04905</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-clique-based-separator-for-intersection-graphs-of-geodesic-disks-in-mathbb-r-2-2403.04905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-clique-based-separator-for-intersection-graphs-of-geodesic-disks-in-mathbb-r-2-2403.04905"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-convex-hulls-for-simple-paths-2403.05697</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-convex-hulls-for-simple-paths-2403.05697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-convex-hulls-for-simple-paths-2403.05697"/></url>
<url><loc>https://scifaro.com/en/abs/solution-hashing-search-based-on-layout-graph-transformation-for-unequal-circle-packing-2403.06211</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solution-hashing-search-based-on-layout-graph-transformation-for-unequal-circle-packing-2403.06211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solution-hashing-search-based-on-layout-graph-transformation-for-unequal-circle-packing-2403.06211"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-solution-to-the-2d-visibility-problem-in-cartesian-grid-maps-and-its-application-in-heuristic-path-planning-2403.06494</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-solution-to-the-2d-visibility-problem-in-cartesian-grid-maps-and-its-application-in-heuristic-path-planning-2403.06494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-solution-to-the-2d-visibility-problem-in-cartesian-grid-maps-and-its-application-in-heuristic-path-planning-2403.06494"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-fast-and-correct-computation-of-reeb-spaces-for-pl-bivariate-fields-2403.06564</loc><lastmod>2026-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-fast-and-correct-computation-of-reeb-spaces-for-pl-bivariate-fields-2403.06564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-fast-and-correct-computation-of-reeb-spaces-for-pl-bivariate-fields-2403.06564"/></url>
<url><loc>https://scifaro.com/en/abs/computing-p-presentation-distances-is-hard-2403.07200</loc><lastmod>2025-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-p-presentation-distances-is-hard-2403.07200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-p-presentation-distances-is-hard-2403.07200"/></url>
<url><loc>https://scifaro.com/en/abs/on-maximum-sum-matchings-of-bichromatic-points-2403.08977</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-maximum-sum-matchings-of-bichromatic-points-2403.08977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-maximum-sum-matchings-of-bichromatic-points-2403.08977"/></url>
<url><loc>https://scifaro.com/en/abs/ipelets-for-the-convex-polygonal-geometry-2403.10033</loc><lastmod>2024-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ipelets-for-the-convex-polygonal-geometry-2403.10033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ipelets-for-the-convex-polygonal-geometry-2403.10033"/></url>
<url><loc>https://scifaro.com/en/abs/the-euclidean-mst-ratio-for-bi-colored-lattices-2403.10204</loc><lastmod>2024-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-euclidean-mst-ratio-for-bi-colored-lattices-2403.10204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-euclidean-mst-ratio-for-bi-colored-lattices-2403.10204"/></url>
<url><loc>https://scifaro.com/en/abs/a-canonical-tree-decomposition-for-order-types-and-some-applications-2403.10311</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-canonical-tree-decomposition-for-order-types-and-some-applications-2403.10311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-canonical-tree-decomposition-for-order-types-and-some-applications-2403.10311"/></url>
<url><loc>https://scifaro.com/en/abs/computing-shortest-closed-curves-on-non-orientable-surfaces-2403.11749</loc><lastmod>2025-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-shortest-closed-curves-on-non-orientable-surfaces-2403.11749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-shortest-closed-curves-on-non-orientable-surfaces-2403.11749"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-2-approximation-algorithm-for-minimum-manhattan-network-problem-2403.11811</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-2-approximation-algorithm-for-minimum-manhattan-network-problem-2403.11811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-2-approximation-algorithm-for-minimum-manhattan-network-problem-2403.11811"/></url>
<url><loc>https://scifaro.com/en/abs/robustly-guarding-polygons-2403.11861</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustly-guarding-polygons-2403.11861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustly-guarding-polygons-2403.11861"/></url>
<url><loc>https://scifaro.com/en/abs/semi-algebraic-off-line-range-searching-and-biclique-partitions-in-the-plane-2403.12276</loc><lastmod>2024-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-algebraic-off-line-range-searching-and-biclique-partitions-in-the-plane-2403.12276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-algebraic-off-line-range-searching-and-biclique-partitions-in-the-plane-2403.12276"/></url>
<url><loc>https://scifaro.com/en/abs/semialgebraic-range-stabbing-ray-shooting-and-intersection-counting-in-the-plane-2403.12303</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semialgebraic-range-stabbing-ray-shooting-and-intersection-counting-in-the-plane-2403.12303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semialgebraic-range-stabbing-ray-shooting-and-intersection-counting-in-the-plane-2403.12303"/></url>
<url><loc>https://scifaro.com/en/abs/structural-validation-of-synthetic-power-distribution-networks-using-the-multiscale-flat-norm-2403.12334</loc><lastmod>2025-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-validation-of-synthetic-power-distribution-networks-using-the-multiscale-flat-norm-2403.12334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-validation-of-synthetic-power-distribution-networks-using-the-multiscale-flat-norm-2403.12334"/></url>
<url><loc>https://scifaro.com/en/abs/morse-theory-for-the-k-nn-distance-function-2403.12792</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morse-theory-for-the-k-nn-distance-function-2403.12792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morse-theory-for-the-k-nn-distance-function-2403.12792"/></url>
<url><loc>https://scifaro.com/en/abs/fr-e-chet-edit-distance-2403.12878</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-e-chet-edit-distance-2403.12878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-e-chet-edit-distance-2403.12878"/></url>
<url><loc>https://scifaro.com/en/abs/plane-hamiltonian-cycles-in-convex-drawings-2403.12898</loc><lastmod>2026-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plane-hamiltonian-cycles-in-convex-drawings-2403.12898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plane-hamiltonian-cycles-in-convex-drawings-2403.12898"/></url>
<url><loc>https://scifaro.com/en/abs/convex-polygon-containment-improving-quadratic-to-near-linear-time-2403.13292</loc><lastmod>2024-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-polygon-containment-improving-quadratic-to-near-linear-time-2403.13292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-polygon-containment-improving-quadratic-to-near-linear-time-2403.13292"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-and-ordered-level-planarity-parameterized-by-the-number-of-levels-2403.13702</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-and-ordered-level-planarity-parameterized-by-the-number-of-levels-2403.13702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-and-ordered-level-planarity-parameterized-by-the-number-of-levels-2403.13702"/></url>
<url><loc>https://scifaro.com/en/abs/filming-runners-with-drones-is-hard-2403.14033</loc><lastmod>2024-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filming-runners-with-drones-is-hard-2403.14033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filming-runners-with-drones-is-hard-2403.14033"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-polygon-packing-the-cg-shop-challenge-2024-2403.16203</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-polygon-packing-the-cg-shop-challenge-2024-2403.16203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-polygon-packing-the-cg-shop-challenge-2024-2403.16203"/></url>
<url><loc>https://scifaro.com/en/abs/sweeping-arrangements-of-non-piercing-curves-in-plane-2403.16474</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sweeping-arrangements-of-non-piercing-curves-in-plane-2403.16474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sweeping-arrangements-of-non-piercing-curves-in-plane-2403.16474"/></url>
<url><loc>https://scifaro.com/en/abs/free-sets-in-planar-graphs-history-and-applications-2403.17090</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-sets-in-planar-graphs-history-and-applications-2403.17090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-sets-in-planar-graphs-history-and-applications-2403.17090"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-the-empty-hexagon-number-2403.17370</loc><lastmod>2024-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-the-empty-hexagon-number-2403.17370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-the-empty-hexagon-number-2403.17370"/></url>
<url><loc>https://scifaro.com/en/abs/robust-containment-queries-over-collections-of-rational-parametric-curves-via-generalized-winding-numbers-2403.17371</loc><lastmod>2026-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-containment-queries-over-collections-of-rational-parametric-curves-via-generalized-winding-numbers-2403.17371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-containment-queries-over-collections-of-rational-parametric-curves-via-generalized-winding-numbers-2403.17371"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-euclidean-tree-covers-2403.17754</loc><lastmod>2024-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-euclidean-tree-covers-2403.17754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-euclidean-tree-covers-2403.17754"/></url>
<url><loc>https://scifaro.com/en/abs/convexity-of-near-optimal-orthogonal-pair-free-sets-on-the-unit-sphere-2403.18404</loc><lastmod>2024-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convexity-of-near-optimal-orthogonal-pair-free-sets-on-the-unit-sphere-2403.18404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convexity-of-near-optimal-orthogonal-pair-free-sets-on-the-unit-sphere-2403.18404"/></url>
<url><loc>https://scifaro.com/en/abs/boundary-labeling-in-a-circular-orbit-2403.19052</loc><lastmod>2024-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boundary-labeling-in-a-circular-orbit-2403.19052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boundary-labeling-in-a-circular-orbit-2403.19052"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-illumination-of-implicit-surfaces-2403.19679</loc><lastmod>2026-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-illumination-of-implicit-surfaces-2403.19679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-illumination-of-implicit-surfaces-2403.19679"/></url>
<url><loc>https://scifaro.com/en/abs/shadoks-approach-to-knapsack-polygonal-packing-2403.20123</loc><lastmod>2026-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shadoks-approach-to-knapsack-polygonal-packing-2403.20123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shadoks-approach-to-knapsack-polygonal-packing-2403.20123"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-singular-patterns-in-discrete-planar-vector-fields-via-persistent-path-homology-2404.01007</loc><lastmod>2025-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-singular-patterns-in-discrete-planar-vector-fields-via-persistent-path-homology-2404.01007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-singular-patterns-in-discrete-planar-vector-fields-via-persistent-path-homology-2404.01007"/></url>
<url><loc>https://scifaro.com/en/abs/improved-total-domination-and-total-roman-domination-in-unit-disk-graphs-2404.03511</loc><lastmod>2024-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-total-domination-and-total-roman-domination-in-unit-disk-graphs-2404.03511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-total-domination-and-total-roman-domination-in-unit-disk-graphs-2404.03511"/></url>
<url><loc>https://scifaro.com/en/abs/the-maximum-clique-problem-in-a-disk-graph-made-easy-2404.03751</loc><lastmod>2024-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maximum-clique-problem-in-a-disk-graph-made-easy-2404.03751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maximum-clique-problem-in-a-disk-graph-made-easy-2404.03751"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-schemes-for-geometric-knapsack-for-packing-spheres-and-fat-objects-2404.03981</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-schemes-for-geometric-knapsack-for-packing-spheres-and-fat-objects-2404.03981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-schemes-for-geometric-knapsack-for-packing-spheres-and-fat-objects-2404.03981"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-fr-echet-distance-oracles-2404.04065</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-fr-echet-distance-oracles-2404.04065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-fr-echet-distance-oracles-2404.04065"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-speedup-for-some-geometric-3sum-hard-problems-and-beyond-2404.04535</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-speedup-for-some-geometric-3sum-hard-problems-and-beyond-2404.04535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-speedup-for-some-geometric-3sum-hard-problems-and-beyond-2404.04535"/></url>
<url><loc>https://scifaro.com/en/abs/super-guarding-and-dark-rays-in-art-galleries-2404.04613</loc><lastmod>2025-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/super-guarding-and-dark-rays-in-art-galleries-2404.04613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/super-guarding-and-dark-rays-in-art-galleries-2404.04613"/></url>
<url><loc>https://scifaro.com/en/abs/spanners-in-planar-domains-via-steiner-spanners-and-non-steiner-tree-covers-2404.05045</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanners-in-planar-domains-via-steiner-spanners-and-non-steiner-tree-covers-2404.05045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanners-in-planar-domains-via-steiner-spanners-and-non-steiner-tree-covers-2404.05045"/></url>
<url><loc>https://scifaro.com/en/abs/walking-your-frog-fast-in-4-loc-2404.05708</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/walking-your-frog-fast-in-4-loc-2404.05708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/walking-your-frog-fast-in-4-loc-2404.05708"/></url>
<url><loc>https://scifaro.com/en/abs/box-filtration-2404.05859</loc><lastmod>2025-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/box-filtration-2404.05859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/box-filtration-2404.05859"/></url>
<url><loc>https://scifaro.com/en/abs/the-voronoi-diagram-of-weakly-smooth-planar-point-sets-in-o-log-n-deterministic-rounds-on-the-congested-clique-2404.06068</loc><lastmod>2024-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-voronoi-diagram-of-weakly-smooth-planar-point-sets-in-o-log-n-deterministic-rounds-on-the-congested-clique-2404.06068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-voronoi-diagram-of-weakly-smooth-planar-point-sets-in-o-log-n-deterministic-rounds-on-the-congested-clique-2404.06068"/></url>
<url><loc>https://scifaro.com/en/abs/concise-plane-arrangements-for-low-poly-surface-and-volume-modelling-2404.06154</loc><lastmod>2024-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concise-plane-arrangements-for-low-poly-surface-and-volume-modelling-2404.06154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concise-plane-arrangements-for-low-poly-surface-and-volume-modelling-2404.06154"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-identifying-rainbow-ortho-convex-4-sets-in-k-colored-point-sets-2404.06376</loc><lastmod>2024-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-identifying-rainbow-ortho-convex-4-sets-in-k-colored-point-sets-2404.06376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-identifying-rainbow-ortho-convex-4-sets-in-k-colored-point-sets-2404.06376"/></url>
<url><loc>https://scifaro.com/en/abs/data-driven-quasiconformal-morphodynamic-flows-2404.07073</loc><lastmod>2025-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-driven-quasiconformal-morphodynamic-flows-2404.07073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-driven-quasiconformal-morphodynamic-flows-2404.07073"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-shortest-paths-in-weighted-square-and-hexagonal-meshes-2404.07562</loc><lastmod>2024-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-shortest-paths-in-weighted-square-and-hexagonal-meshes-2404.07562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-shortest-paths-in-weighted-square-and-hexagonal-meshes-2404.07562"/></url>
<url><loc>https://scifaro.com/en/abs/simplicity-reconstructing-buildings-with-simple-regularized-3d-models-2404.08104</loc><lastmod>2024-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplicity-reconstructing-buildings-with-simple-regularized-3d-models-2404.08104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplicity-reconstructing-buildings-with-simple-regularized-3d-models-2404.08104"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-curves-from-sparse-samples-on-riemannian-manifolds-2404.09661</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-curves-from-sparse-samples-on-riemannian-manifolds-2404.09661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-curves-from-sparse-samples-on-riemannian-manifolds-2404.09661"/></url>
<url><loc>https://scifaro.com/en/abs/eliminating-crossings-in-ordered-graphs-2404.09771</loc><lastmod>2024-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eliminating-crossings-in-ordered-graphs-2404.09771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eliminating-crossings-in-ordered-graphs-2404.09771"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-packing-covering-and-partitioning-simple-polygons-with-unit-squares-2404.09835</loc><lastmod>2024-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-packing-covering-and-partitioning-simple-polygons-with-unit-squares-2404.09835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-packing-covering-and-partitioning-simple-polygons-with-unit-squares-2404.09835"/></url>
<url><loc>https://scifaro.com/en/abs/neural-slicer-for-multi-axis-3d-printing-2404.15061</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neural-slicer-for-multi-axis-3d-printing-2404.15061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neural-slicer-for-multi-axis-3d-printing-2404.15061"/></url>
<url><loc>https://scifaro.com/en/abs/new-complexity-and-algorithmic-bounds-for-minimum-consistent-subsets-2404.15487</loc><lastmod>2025-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-complexity-and-algorithmic-bounds-for-minimum-consistent-subsets-2404.15487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-complexity-and-algorithmic-bounds-for-minimum-consistent-subsets-2404.15487"/></url>
<url><loc>https://scifaro.com/en/abs/filling-holes-in-lod2-building-models-2404.15892</loc><lastmod>2024-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filling-holes-in-lod2-building-models-2404.15892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filling-holes-in-lod2-building-models-2404.15892"/></url>
<url><loc>https://scifaro.com/en/abs/sibson-s-formula-for-higher-order-voronoi-diagrams-2404.17422</loc><lastmod>2024-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sibson-s-formula-for-higher-order-voronoi-diagrams-2404.17422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sibson-s-formula-for-higher-order-voronoi-diagrams-2404.17422"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-adaptive-anisotropic-meshing-on-cc-numa-machines-2404.18030</loc><lastmod>2024-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-adaptive-anisotropic-meshing-on-cc-numa-machines-2404.18030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-adaptive-anisotropic-meshing-on-cc-numa-machines-2404.18030"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-algorithm-for-the-fr-echet-distance-in-1d-for-the-imbalanced-case-2404.18738</loc><lastmod>2024-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-algorithm-for-the-fr-echet-distance-in-1d-for-the-imbalanced-case-2404.18738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-algorithm-for-the-fr-echet-distance-in-1d-for-the-imbalanced-case-2404.18738"/></url>
<url><loc>https://scifaro.com/en/abs/on-clustering-induced-voronoi-diagrams-2404.18906</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-clustering-induced-voronoi-diagrams-2404.18906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-clustering-induced-voronoi-diagrams-2404.18906"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-bridge-twin-bridges-and-beyond-inserting-edges-into-a-road-network-to-minimize-the-constrained-diameters-2404.19164</loc><lastmod>2024-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-bridge-twin-bridges-and-beyond-inserting-edges-into-a-road-network-to-minimize-the-constrained-diameters-2404.19164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-bridge-twin-bridges-and-beyond-inserting-edges-into-a-road-network-to-minimize-the-constrained-diameters-2404.19164"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-efficient-approximation-schemes-on-geometric-packing-problems-of-d-dimensional-fat-objects-2405.00246</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-efficient-approximation-schemes-on-geometric-packing-problems-of-d-dimensional-fat-objects-2405.00246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-efficient-approximation-schemes-on-geometric-packing-problems-of-d-dimensional-fat-objects-2405.00246"/></url>
<url><loc>https://scifaro.com/en/abs/robust-algorithms-for-finding-triangles-and-computing-the-girth-in-unit-disk-and-transmission-graphs-2405.01180</loc><lastmod>2024-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-algorithms-for-finding-triangles-and-computing-the-girth-in-unit-disk-and-transmission-graphs-2405.01180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-algorithms-for-finding-triangles-and-computing-the-girth-in-unit-disk-and-transmission-graphs-2405.01180"/></url>
<url><loc>https://scifaro.com/en/abs/a-hypergraph-model-shows-the-carbon-reduction-potential-of-effective-space-use-in-housing-2405.01290</loc><lastmod>2024-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hypergraph-model-shows-the-carbon-reduction-potential-of-effective-space-use-in-housing-2405.01290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hypergraph-model-shows-the-carbon-reduction-potential-of-effective-space-use-in-housing-2405.01290"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-topological-integral-transforms-2405.02256</loc><lastmod>2024-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-topological-integral-transforms-2405.02256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-topological-integral-transforms-2405.02256"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-of-the-abstract-tile-assembly-model-using-crisscross-slats-2405.06205</loc><lastmod>2024-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-of-the-abstract-tile-assembly-model-using-crisscross-slats-2405.06205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-of-the-abstract-tile-assembly-model-using-crisscross-slats-2405.06205"/></url>
<url><loc>https://scifaro.com/en/abs/translating-tpms-models-to-step-files-2405.07946</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-tpms-models-to-step-files-2405.07946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-tpms-models-to-step-files-2405.07946"/></url>
<url><loc>https://scifaro.com/en/abs/voronoi-graph-improved-raycasting-and-integration-schemes-for-high-dimensional-voronoi-diagrams-2405.10050</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voronoi-graph-improved-raycasting-and-integration-schemes-for-high-dimensional-voronoi-diagrams-2405.10050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voronoi-graph-improved-raycasting-and-integration-schemes-for-high-dimensional-voronoi-diagrams-2405.10050"/></url>
<url><loc>https://scifaro.com/en/abs/exact-predicates-exact-constructions-and-combinatorics-for-mesh-csg-2405.12949</loc><lastmod>2025-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-predicates-exact-constructions-and-combinatorics-for-mesh-csg-2405.12949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-predicates-exact-constructions-and-combinatorics-for-mesh-csg-2405.12949"/></url>
<url><loc>https://scifaro.com/en/abs/on-connections-between-k-coloring-and-euclidean-k-means-2405.13877</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-connections-between-k-coloring-and-euclidean-k-means-2405.13877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-connections-between-k-coloring-and-euclidean-k-means-2405.13877"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-consistent-subset-in-interval-graphs-and-circle-graphs-2405.14493</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-consistent-subset-in-interval-graphs-and-circle-graphs-2405.14493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-consistent-subset-in-interval-graphs-and-circle-graphs-2405.14493"/></url>
<url><loc>https://scifaro.com/en/abs/necgs-neural-compression-for-3d-geometry-sets-2405.15034</loc><lastmod>2025-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/necgs-neural-compression-for-3d-geometry-sets-2405.15034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/necgs-neural-compression-for-3d-geometry-sets-2405.15034"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-interlocking-assemblies-with-crystallographic-symmetries-2405.15080</loc><lastmod>2024-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-interlocking-assemblies-with-crystallographic-symmetries-2405.15080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-interlocking-assemblies-with-crystallographic-symmetries-2405.15080"/></url>
<url><loc>https://scifaro.com/en/abs/warp-centric-gpu-meta-meshing-and-fast-triangulation-of-billion-scale-lattice-structures-2405.15197</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/warp-centric-gpu-meta-meshing-and-fast-triangulation-of-billion-scale-lattice-structures-2405.15197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/warp-centric-gpu-meta-meshing-and-fast-triangulation-of-billion-scale-lattice-structures-2405.15197"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-algorithms-for-cubic-modular-robots-with-realistic-movement-constraints-2405.15724</loc><lastmod>2024-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-algorithms-for-cubic-modular-robots-with-realistic-movement-constraints-2405.15724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-algorithms-for-cubic-modular-robots-with-realistic-movement-constraints-2405.15724"/></url>
<url><loc>https://scifaro.com/en/abs/topological-reconstruction-of-sampled-surfaces-via-morse-theory-2405.17257</loc><lastmod>2024-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-reconstruction-of-sampled-surfaces-via-morse-theory-2405.17257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-reconstruction-of-sampled-surfaces-via-morse-theory-2405.17257"/></url>
<url><loc>https://scifaro.com/en/abs/metric-and-geometric-spanners-that-are-resilient-to-degree-bounded-edge-faults-2405.18134</loc><lastmod>2025-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-and-geometric-spanners-that-are-resilient-to-degree-bounded-edge-faults-2405.18134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-and-geometric-spanners-that-are-resilient-to-degree-bounded-edge-faults-2405.18134"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-densest-subgraph-in-geometric-intersection-graphs-2405.18337</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-densest-subgraph-in-geometric-intersection-graphs-2405.18337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-densest-subgraph-in-geometric-intersection-graphs-2405.18337"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-strict-consistent-subset-in-paths-spiders-combs-and-trees-2405.18569</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-strict-consistent-subset-in-paths-spiders-combs-and-trees-2405.18569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-strict-consistent-subset-in-paths-spiders-combs-and-trees-2405.18569"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-bipartite-matching-is-in-nc-2405.18833</loc><lastmod>2024-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-bipartite-matching-is-in-nc-2405.18833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-bipartite-matching-is-in-nc-2405.18833"/></url>
<url><loc>https://scifaro.com/en/abs/euclidean-maximum-matchings-in-the-plane-local-to-global-2405.20424</loc><lastmod>2024-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euclidean-maximum-matchings-in-the-plane-local-to-global-2405.20424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euclidean-maximum-matchings-in-the-plane-local-to-global-2405.20424"/></url>
<url><loc>https://scifaro.com/en/abs/the-gestalt-computational-model-by-persistent-homology-2405.20583</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-gestalt-computational-model-by-persistent-homology-2405.20583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-gestalt-computational-model-by-persistent-homology-2405.20583"/></url>
<url><loc>https://scifaro.com/en/abs/multirobot-watchman-routes-in-a-simple-polygon-2405.21034</loc><lastmod>2025-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multirobot-watchman-routes-in-a-simple-polygon-2405.21034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multirobot-watchman-routes-in-a-simple-polygon-2405.21034"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-localization-of-homology-cycles-2406.03183</loc><lastmod>2024-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-localization-of-homology-cycles-2406.03183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-localization-of-homology-cycles-2406.03183"/></url>
<url><loc>https://scifaro.com/en/abs/finding-maximum-matchings-in-rdv-graphs-efficiently-2406.03632</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-maximum-matchings-in-rdv-graphs-efficiently-2406.03632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-maximum-matchings-in-rdv-graphs-efficiently-2406.03632"/></url>
<url><loc>https://scifaro.com/en/abs/high-order-continuous-geometrical-validity-2406.03756</loc><lastmod>2025-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-order-continuous-geometrical-validity-2406.03756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-order-continuous-geometrical-validity-2406.03756"/></url>
<url><loc>https://scifaro.com/en/abs/chromatic-topological-data-analysis-2406.04102</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chromatic-topological-data-analysis-2406.04102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chromatic-topological-data-analysis-2406.04102"/></url>
<url><loc>https://scifaro.com/en/abs/the-dual-of-philo-s-shortest-line-segment-problem-2406.05702</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dual-of-philo-s-shortest-line-segment-problem-2406.05702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dual-of-philo-s-shortest-line-segment-problem-2406.05702"/></url>
<url><loc>https://scifaro.com/en/abs/dispersive-vertex-guarding-for-simple-and-non-simple-polygons-2406.05861</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dispersive-vertex-guarding-for-simple-and-non-simple-polygons-2406.05861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dispersive-vertex-guarding-for-simple-and-non-simple-polygons-2406.05861"/></url>
<url><loc>https://scifaro.com/en/abs/differentiability-and-optimization-of-multiparameter-persistent-homology-2406.07224</loc><lastmod>2024-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentiability-and-optimization-of-multiparameter-persistent-homology-2406.07224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentiability-and-optimization-of-multiparameter-persistent-homology-2406.07224"/></url>
<url><loc>https://scifaro.com/en/abs/deepjeb-3d-deep-learning-based-synthetic-jet-engine-bracket-dataset-2406.09047</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deepjeb-3d-deep-learning-based-synthetic-jet-engine-bracket-dataset-2406.09047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deepjeb-3d-deep-learning-based-synthetic-jet-engine-bracket-dataset-2406.09047"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-tensors-and-subdivision-methods-for-finding-the-zero-set-of-polynomial-equations-2406.09857</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-tensors-and-subdivision-methods-for-finding-the-zero-set-of-polynomial-equations-2406.09857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-tensors-and-subdivision-methods-for-finding-the-zero-set-of-polynomial-equations-2406.09857"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-smallest-intersecting-balls-2406.11369</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-smallest-intersecting-balls-2406.11369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-smallest-intersecting-balls-2406.11369"/></url>
<url><loc>https://scifaro.com/en/abs/wasserstein-convergence-of-v-c-ech-persistence-diagrams-for-samplings-of-submanifolds-2406.14919</loc><lastmod>2024-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wasserstein-convergence-of-v-c-ech-persistence-diagrams-for-samplings-of-submanifolds-2406.14919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wasserstein-convergence-of-v-c-ech-persistence-diagrams-for-samplings-of-submanifolds-2406.14919"/></url>
<url><loc>https://scifaro.com/en/abs/covering-simple-orthogonal-polygons-with-rectangles-2406.16209</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-simple-orthogonal-polygons-with-rectangles-2406.16209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-simple-orthogonal-polygons-with-rectangles-2406.16209"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-outerstring-graphs-have-logarithmic-treewidth-2406.17424</loc><lastmod>2024-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-outerstring-graphs-have-logarithmic-treewidth-2406.17424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-outerstring-graphs-have-logarithmic-treewidth-2406.17424"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-intersection-graphs-of-lines-in-space-and-circle-orders-2406.17504</loc><lastmod>2024-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-intersection-graphs-of-lines-in-space-and-circle-orders-2406.17504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-intersection-graphs-of-lines-in-space-and-circle-orders-2406.17504"/></url>
<url><loc>https://scifaro.com/en/abs/outperforming-the-best-1d-low-discrepancy-constructions-with-a-greedy-algorithm-2406.18132</loc><lastmod>2024-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outperforming-the-best-1d-low-discrepancy-constructions-with-a-greedy-algorithm-2406.18132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outperforming-the-best-1d-low-discrepancy-constructions-with-a-greedy-algorithm-2406.18132"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-number-is-np-hard-for-constant-path-width-and-tree-width-2406.18933</loc><lastmod>2026-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-number-is-np-hard-for-constant-path-width-and-tree-width-2406.18933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-number-is-np-hard-for-constant-path-width-and-tree-width-2406.18933"/></url>
<url><loc>https://scifaro.com/en/abs/robust-classification-of-dynamic-bichromatic-point-sets-in-r2-2406.19161</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-classification-of-dynamic-bichromatic-point-sets-in-r2-2406.19161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-classification-of-dynamic-bichromatic-point-sets-in-r2-2406.19161"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-optimal-homology-problems-and-their-applications-2406.19422</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-optimal-homology-problems-and-their-applications-2406.19422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-optimal-homology-problems-and-their-applications-2406.19422"/></url>
<url><loc>https://scifaro.com/en/abs/strict-self-assembly-of-discrete-self-similar-fractals-in-the-abstract-tile-assembly-model-2406.19595</loc><lastmod>2024-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-self-assembly-of-discrete-self-similar-fractals-in-the-abstract-tile-assembly-model-2406.19595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-self-assembly-of-discrete-self-similar-fractals-in-the-abstract-tile-assembly-model-2406.19595"/></url>
<url><loc>https://scifaro.com/en/abs/fully-adaptive-dynamic-connectivity-of-square-intersection-graphs-2406.20065</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-adaptive-dynamic-connectivity-of-square-intersection-graphs-2406.20065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-adaptive-dynamic-connectivity-of-square-intersection-graphs-2406.20065"/></url>
<url><loc>https://scifaro.com/en/abs/further-connectivity-results-on-plane-spanning-path-reconfiguration-2407.00244</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-connectivity-results-on-plane-spanning-path-reconfiguration-2407.00244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-connectivity-results-on-plane-spanning-path-reconfiguration-2407.00244"/></url>
<url><loc>https://scifaro.com/en/abs/on-line-separable-weighted-unit-disk-coverage-and-related-problems-2407.00329</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-line-separable-weighted-unit-disk-coverage-and-related-problems-2407.00329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-line-separable-weighted-unit-disk-coverage-and-related-problems-2407.00329"/></url>
<url><loc>https://scifaro.com/en/abs/unweighted-geometric-hitting-set-for-line-constrained-disks-and-related-problems-2407.00331</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unweighted-geometric-hitting-set-for-line-constrained-disks-and-related-problems-2407.00331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unweighted-geometric-hitting-set-for-line-constrained-disks-and-related-problems-2407.00331"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-polycubes-with-orthogonally-convex-layers-2407.01326</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-polycubes-with-orthogonally-convex-layers-2407.01326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-polycubes-with-orthogonally-convex-layers-2407.01326"/></url>
<url><loc>https://scifaro.com/en/abs/dependable-spanners-via-unreliable-edges-2407.01466</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependable-spanners-via-unreliable-edges-2407.01466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependable-spanners-via-unreliable-edges-2407.01466"/></url>
<url><loc>https://scifaro.com/en/abs/spanner-for-the-0-1-infty-weighted-region-problem-2407.01951</loc><lastmod>2024-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanner-for-the-0-1-infty-weighted-region-problem-2407.01951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanner-for-the-0-1-infty-weighted-region-problem-2407.01951"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-exact-algorithms-for-minimum-covering-of-orthogonal-polygons-with-squares-2407.02658</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-exact-algorithms-for-minimum-covering-of-orthogonal-polygons-with-squares-2407.02658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-exact-algorithms-for-minimum-covering-of-orthogonal-polygons-with-squares-2407.02658"/></url>
<url><loc>https://scifaro.com/en/abs/the-fr-echet-distance-unleashed-approximating-a-dog-with-a-frog-2407.03101</loc><lastmod>2026-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fr-echet-distance-unleashed-approximating-a-dog-with-a-frog-2407.03101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fr-echet-distance-unleashed-approximating-a-dog-with-a-frog-2407.03101"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-algorithm-for-shortest-paths-in-weighted-unit-disk-graphs-2407.03176</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-algorithm-for-shortest-paths-in-weighted-unit-disk-graphs-2407.03176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-algorithm-for-shortest-paths-in-weighted-unit-disk-graphs-2407.03176"/></url>
<url><loc>https://scifaro.com/en/abs/constraints-matrices-and-convergence-proof-of-tpms2step-2407.03352</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraints-matrices-and-convergence-proof-of-tpms2step-2407.03352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraints-matrices-and-convergence-proof-of-tpms2step-2407.03352"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-connectivity-of-the-flip-graph-of-plane-spanning-paths-2407.03912</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-connectivity-of-the-flip-graph-of-plane-spanning-paths-2407.03912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-connectivity-of-the-flip-graph-of-plane-spanning-paths-2407.03912"/></url>
<url><loc>https://scifaro.com/en/abs/bicriteria-approximation-for-minimum-dilation-graph-augmentation-2407.04614</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bicriteria-approximation-for-minimum-dilation-graph-augmentation-2407.04614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bicriteria-approximation-for-minimum-dilation-graph-augmentation-2407.04614"/></url>
<url><loc>https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-re-revisited-a-framework-approach-2407.05057</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-re-revisited-a-framework-approach-2407.05057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crossing-numbers-of-beyond-planar-graphs-re-revisited-a-framework-approach-2407.05057"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-fr-echet-distance-when-only-one-curve-is-c-packed-2407.05114</loc><lastmod>2024-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-fr-echet-distance-when-only-one-curve-is-c-packed-2407.05114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-fr-echet-distance-when-only-one-curve-is-c-packed-2407.05114"/></url>
<url><loc>https://scifaro.com/en/abs/fr-echet-distance-in-subquadratic-time-2407.05231</loc><lastmod>2024-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-echet-distance-in-subquadratic-time-2407.05231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-echet-distance-in-subquadratic-time-2407.05231"/></url>
<url><loc>https://scifaro.com/en/abs/connected-matchings-2407.06131</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connected-matchings-2407.06131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connected-matchings-2407.06131"/></url>
<url><loc>https://scifaro.com/en/abs/topological-offsets-2407.07725</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-offsets-2407.07725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-offsets-2407.07725"/></url>
<url><loc>https://scifaro.com/en/abs/fast-approximation-algorithms-for-euclidean-minimum-weight-perfect-matching-2407.07749</loc><lastmod>2026-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-approximation-algorithms-for-euclidean-minimum-weight-perfect-matching-2407.07749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-approximation-algorithms-for-euclidean-minimum-weight-perfect-matching-2407.07749"/></url>
<url><loc>https://scifaro.com/en/abs/structure-and-independence-in-hyperbolic-uniform-disk-graphs-2407.09362</loc><lastmod>2025-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-and-independence-in-hyperbolic-uniform-disk-graphs-2407.09362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-and-independence-in-hyperbolic-uniform-disk-graphs-2407.09362"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-the-challenge-of-constructing-low-discrepancy-point-sets-into-a-permutation-selection-problem-2407.11533</loc><lastmod>2024-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-the-challenge-of-constructing-low-discrepancy-point-sets-into-a-permutation-selection-problem-2407.11533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-the-challenge-of-constructing-low-discrepancy-point-sets-into-a-permutation-selection-problem-2407.11533"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-second-and-third-systoles-of-a-combinatorial-surface-2407.13479</loc><lastmod>2025-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-second-and-third-systoles-of-a-combinatorial-surface-2407.13479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-second-and-third-systoles-of-a-combinatorial-surface-2407.13479"/></url>
<url><loc>https://scifaro.com/en/abs/simplesets-capturing-categorical-point-patterns-with-simple-shapes-2407.14433</loc><lastmod>2024-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplesets-capturing-categorical-point-patterns-with-simple-shapes-2407.14433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplesets-capturing-categorical-point-patterns-with-simple-shapes-2407.14433"/></url>
<url><loc>https://scifaro.com/en/abs/hemispheroidal-parameterization-and-harmonic-decomposition-of-simply-connected-open-surfaces-2407.15417</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hemispheroidal-parameterization-and-harmonic-decomposition-of-simply-connected-open-surfaces-2407.15417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hemispheroidal-parameterization-and-harmonic-decomposition-of-simply-connected-open-surfaces-2407.15417"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-regularity-lemma-for-semi-algebraic-hypergraphs-2407.15518</loc><lastmod>2024-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-regularity-lemma-for-semi-algebraic-hypergraphs-2407.15518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-regularity-lemma-for-semi-algebraic-hypergraphs-2407.15518"/></url>
<url><loc>https://scifaro.com/en/abs/shortest-path-separators-in-unit-disk-graphs-2407.15980</loc><lastmod>2024-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shortest-path-separators-in-unit-disk-graphs-2407.15980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shortest-path-separators-in-unit-disk-graphs-2407.15980"/></url>
<url><loc>https://scifaro.com/en/abs/carving-polytopes-with-saws-in-3d-2407.15981</loc><lastmod>2024-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/carving-polytopes-with-saws-in-3d-2407.15981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/carving-polytopes-with-saws-in-3d-2407.15981"/></url>
<url><loc>https://scifaro.com/en/abs/certified-simultaneous-isotopic-approximation-of-curves-via-subdivision-2407.16911</loc><lastmod>2024-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-simultaneous-isotopic-approximation-of-curves-via-subdivision-2407.16911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-simultaneous-isotopic-approximation-of-curves-via-subdivision-2407.16911"/></url>
<url><loc>https://scifaro.com/en/abs/simple-grid-polygon-online-exploration-revisited-2407.17208</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-grid-polygon-online-exploration-revisited-2407.17208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-grid-polygon-online-exploration-revisited-2407.17208"/></url>
<url><loc>https://scifaro.com/en/abs/on-approximating-the-weighted-region-problem-in-square-tessellations-2407.18758</loc><lastmod>2024-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-approximating-the-weighted-region-problem-in-square-tessellations-2407.18758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-approximating-the-weighted-region-problem-in-square-tessellations-2407.18758"/></url>
<url><loc>https://scifaro.com/en/abs/map-matching-queries-under-fr-echet-distance-on-low-density-spanners-2407.19304</loc><lastmod>2024-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/map-matching-queries-under-fr-echet-distance-on-low-density-spanners-2407.19304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/map-matching-queries-under-fr-echet-distance-on-low-density-spanners-2407.19304"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-linear-time-algorithm-for-smallest-enclosing-circles-on-the-hemi-sphere-2407.19840</loc><lastmod>2024-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-linear-time-algorithm-for-smallest-enclosing-circles-on-the-hemi-sphere-2407.19840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-linear-time-algorithm-for-smallest-enclosing-circles-on-the-hemi-sphere-2407.19840"/></url>
<url><loc>https://scifaro.com/en/abs/fast-static-and-dynamic-approximation-algorithms-for-geometric-optimization-problems-piercing-independent-set-vertex-cover-and-matching-2407.20659</loc><lastmod>2024-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-static-and-dynamic-approximation-algorithms-for-geometric-optimization-problems-piercing-independent-set-vertex-cover-and-matching-2407.20659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-static-and-dynamic-approximation-algorithms-for-geometric-optimization-problems-piercing-independent-set-vertex-cover-and-matching-2407.20659"/></url>
<url><loc>https://scifaro.com/en/abs/ironing-the-graphs-toward-a-correct-geometric-analysis-of-large-scale-graphs-2407.21609</loc><lastmod>2024-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ironing-the-graphs-toward-a-correct-geometric-analysis-of-large-scale-graphs-2407.21609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ironing-the-graphs-toward-a-correct-geometric-analysis-of-large-scale-graphs-2407.21609"/></url>
<url><loc>https://scifaro.com/en/abs/size-should-not-matter-scale-invariant-stress-metrics-2408.04688</loc><lastmod>2024-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-should-not-matter-scale-invariant-stress-metrics-2408.04688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-should-not-matter-scale-invariant-stress-metrics-2408.04688"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-augmentation-hypersweeps-and-branch-decomposition-of-contour-trees-for-scientific-exploration-2408.04836</loc><lastmod>2024-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-augmentation-hypersweeps-and-branch-decomposition-of-contour-trees-for-scientific-exploration-2408.04836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-augmentation-hypersweeps-and-branch-decomposition-of-contour-trees-for-scientific-exploration-2408.04836"/></url>
<url><loc>https://scifaro.com/en/abs/searching-in-euclidean-spaces-with-predictions-2408.04964</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-in-euclidean-spaces-with-predictions-2408.04964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-in-euclidean-spaces-with-predictions-2408.04964"/></url>
<url><loc>https://scifaro.com/en/abs/gromov-s-approximating-tree-and-the-all-pairs-bottleneck-paths-problem-2408.05338</loc><lastmod>2025-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gromov-s-approximating-tree-and-the-all-pairs-bottleneck-paths-problem-2408.05338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gromov-s-approximating-tree-and-the-all-pairs-bottleneck-paths-problem-2408.05338"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-2d-green-coordinates-for-high-order-cages-2408.06831</loc><lastmod>2025-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-2d-green-coordinates-for-high-order-cages-2408.06831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-2d-green-coordinates-for-high-order-cages-2408.06831"/></url>
<url><loc>https://scifaro.com/en/abs/topological-simplifcation-of-jacobi-sets-for-piecewise-linear-bivariate-2d-scalar-fields-with-adjustment-of-the-underlying-data-2408.08097</loc><lastmod>2024-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-simplifcation-of-jacobi-sets-for-piecewise-linear-bivariate-2d-scalar-fields-with-adjustment-of-the-underlying-data-2408.08097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-simplifcation-of-jacobi-sets-for-piecewise-linear-bivariate-2d-scalar-fields-with-adjustment-of-the-underlying-data-2408.08097"/></url>
<url><loc>https://scifaro.com/en/abs/targeted-drug-delivery-algorithmic-methods-for-collecting-a-swarm-of-particles-with-uniform-external-forces-2408.09729</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/targeted-drug-delivery-algorithmic-methods-for-collecting-a-swarm-of-particles-with-uniform-external-forces-2408.09729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/targeted-drug-delivery-algorithmic-methods-for-collecting-a-swarm-of-particles-with-uniform-external-forces-2408.09729"/></url>
<url><loc>https://scifaro.com/en/abs/ten-problems-in-geobotics-2408.12657</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ten-problems-in-geobotics-2408.12657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ten-problems-in-geobotics-2408.12657"/></url>
<url><loc>https://scifaro.com/en/abs/critical-point-extraction-from-multivariate-functional-approximation-2408.13193</loc><lastmod>2024-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-point-extraction-from-multivariate-functional-approximation-2408.13193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-point-extraction-from-multivariate-functional-approximation-2408.13193"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-minimum-sum-of-moving-distance-and-opening-costs-target-coverage-problem-2408.13797</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-minimum-sum-of-moving-distance-and-opening-costs-target-coverage-problem-2408.13797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-minimum-sum-of-moving-distance-and-opening-costs-target-coverage-problem-2408.13797"/></url>
<url><loc>https://scifaro.com/en/abs/image-triangulation-using-the-sobel-operator-for-vertex-selection-2408.16112</loc><lastmod>2024-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/image-triangulation-using-the-sobel-operator-for-vertex-selection-2408.16112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/image-triangulation-using-the-sobel-operator-for-vertex-selection-2408.16112"/></url>
<url><loc>https://scifaro.com/en/abs/best-of-two-worlds-cartesian-sampling-and-volume-computation-for-distance-constrained-configuration-spaces-using-cayley-coordinates-2408.16946</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-of-two-worlds-cartesian-sampling-and-volume-computation-for-distance-constrained-configuration-spaces-using-cayley-coordinates-2408.16946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-of-two-worlds-cartesian-sampling-and-volume-computation-for-distance-constrained-configuration-spaces-using-cayley-coordinates-2408.16946"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-anchored-multiwatchman-routes-2408.17343</loc><lastmod>2024-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-anchored-multiwatchman-routes-2408.17343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-anchored-multiwatchman-routes-2408.17343"/></url>
<url><loc>https://scifaro.com/en/abs/the-price-of-upwardness-2409.01475</loc><lastmod>2025-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-price-of-upwardness-2409.01475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-price-of-upwardness-2409.01475"/></url>
<url><loc>https://scifaro.com/en/abs/holes-in-convex-and-simple-drawings-2409.01723</loc><lastmod>2026-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/holes-in-convex-and-simple-drawings-2409.01723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/holes-in-convex-and-simple-drawings-2409.01723"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-leveled-planarity-with-bounded-span-2409.01889</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-leveled-planarity-with-bounded-span-2409.01889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-leveled-planarity-with-bounded-span-2409.01889"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-extending-stack-layouts-2409.02833</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-extending-stack-layouts-2409.02833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-extending-stack-layouts-2409.02833"/></url>
<url><loc>https://scifaro.com/en/abs/disjoint-compatibility-via-graph-classes-2409.03579</loc><lastmod>2024-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjoint-compatibility-via-graph-classes-2409.03579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjoint-compatibility-via-graph-classes-2409.03579"/></url>
<url><loc>https://scifaro.com/en/abs/morphing-planar-graph-drawings-via-orthogonal-box-drawings-2409.04074</loc><lastmod>2024-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/morphing-planar-graph-drawings-via-orthogonal-box-drawings-2409.04074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/morphing-planar-graph-drawings-via-orthogonal-box-drawings-2409.04074"/></url>
<url><loc>https://scifaro.com/en/abs/covid19-cbabm-a-city-based-agent-based-disease-spread-modeling-framework-2409.05235</loc><lastmod>2024-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covid19-cbabm-a-city-based-agent-based-disease-spread-modeling-framework-2409.05235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covid19-cbabm-a-city-based-agent-based-disease-spread-modeling-framework-2409.05235"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-accurate-geometry-for-morse-smale-complexes-2409.05532</loc><lastmod>2024-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-accurate-geometry-for-morse-smale-complexes-2409.05532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-accurate-geometry-for-morse-smale-complexes-2409.05532"/></url>
<url><loc>https://scifaro.com/en/abs/hypersteiner-computing-heuristic-hyperbolic-steiner-minimal-trees-2409.05671</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypersteiner-computing-heuristic-hyperbolic-steiner-minimal-trees-2409.05671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypersteiner-computing-heuristic-hyperbolic-steiner-minimal-trees-2409.05671"/></url>
<url><loc>https://scifaro.com/en/abs/harmonic-chain-barcode-and-stability-2409.06093</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/harmonic-chain-barcode-and-stability-2409.06093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/harmonic-chain-barcode-and-stability-2409.06093"/></url>
<url><loc>https://scifaro.com/en/abs/coordinated-motion-planning-multi-agent-path-finding-in-a-densely-packed-bounded-domain-2409.06486</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coordinated-motion-planning-multi-agent-path-finding-in-a-densely-packed-bounded-domain-2409.06486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coordinated-motion-planning-multi-agent-path-finding-in-a-densely-packed-bounded-domain-2409.06486"/></url>
<url><loc>https://scifaro.com/en/abs/towards-instance-optimal-euclidean-spanners-2409.08227</loc><lastmod>2024-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-instance-optimal-euclidean-spanners-2409.08227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-instance-optimal-euclidean-spanners-2409.08227"/></url>
<url><loc>https://scifaro.com/en/abs/fast-comparative-analysis-of-merge-trees-using-locality-sensitive-hashing-2409.08519</loc><lastmod>2024-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-comparative-analysis-of-merge-trees-using-locality-sensitive-hashing-2409.08519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-comparative-analysis-of-merge-trees-using-locality-sensitive-hashing-2409.08519"/></url>
<url><loc>https://scifaro.com/en/abs/computing-shortest-paths-amid-non-overlapping-weighted-disks-2409.08869</loc><lastmod>2024-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-shortest-paths-amid-non-overlapping-weighted-disks-2409.08869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-shortest-paths-amid-non-overlapping-weighted-disks-2409.08869"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mst-ratio-theoretical-bounds-and-complexity-of-finding-the-maximum-2409.11079</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mst-ratio-theoretical-bounds-and-complexity-of-finding-the-maximum-2409.11079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mst-ratio-theoretical-bounds-and-complexity-of-finding-the-maximum-2409.11079"/></url>
<url><loc>https://scifaro.com/en/abs/new-lower-bound-and-algorithms-for-online-geometric-hitting-set-problem-2409.11166</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-lower-bound-and-algorithms-for-online-geometric-hitting-set-problem-2409.11166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-lower-bound-and-algorithms-for-online-geometric-hitting-set-problem-2409.11166"/></url>
<url><loc>https://scifaro.com/en/abs/tiling-with-three-polygons-is-undecidable-2409.11582</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tiling-with-three-polygons-is-undecidable-2409.11582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tiling-with-three-polygons-is-undecidable-2409.11582"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-plane-bichromatic-spanning-trees-2409.11614</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-plane-bichromatic-spanning-trees-2409.11614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-plane-bichromatic-spanning-trees-2409.11614"/></url>
<url><loc>https://scifaro.com/en/abs/evolving-distributions-under-local-motion-2409.11779</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evolving-distributions-under-local-motion-2409.11779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evolving-distributions-under-local-motion-2409.11779"/></url>
<url><loc>https://scifaro.com/en/abs/nesting-of-touching-polygons-2409.13040</loc><lastmod>2024-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nesting-of-touching-polygons-2409.13040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nesting-of-touching-polygons-2409.13040"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-two-line-center-problems-2409.13304</loc><lastmod>2024-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-two-line-center-problems-2409.13304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-two-line-center-problems-2409.13304"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-single-interval-cayley-configuration-spaces-in-3-dimensions-2409.14227</loc><lastmod>2025-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-single-interval-cayley-configuration-spaces-in-3-dimensions-2409.14227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-single-interval-cayley-configuration-spaces-in-3-dimensions-2409.14227"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-nearest-neighbor-search-using-dynamic-programming-2409.15023</loc><lastmod>2025-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-nearest-neighbor-search-using-dynamic-programming-2409.15023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-nearest-neighbor-search-using-dynamic-programming-2409.15023"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-graph-drawing-algorithm-for-bipartite-planar-graphs-2409.15400</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-graph-drawing-algorithm-for-bipartite-planar-graphs-2409.15400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-graph-drawing-algorithm-for-bipartite-planar-graphs-2409.15400"/></url>
<url><loc>https://scifaro.com/en/abs/making-quickhull-more-like-quicksort-a-simple-randomized-output-sensitive-convex-hull-algorithm-2409.19784</loc><lastmod>2024-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-quickhull-more-like-quicksort-a-simple-randomized-output-sensitive-convex-hull-algorithm-2409.19784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-quickhull-more-like-quicksort-a-simple-randomized-output-sensitive-convex-hull-algorithm-2409.19784"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-fpt-framework-for-crossing-number-problems-2410.00206</loc><lastmod>2026-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-fpt-framework-for-crossing-number-problems-2410.00206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-fpt-framework-for-crossing-number-problems-2410.00206"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-klee-s-measure-problem-and-a-lower-bound-for-union-volume-estimation-2410.00996</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-klee-s-measure-problem-and-a-lower-bound-for-union-volume-estimation-2410.00996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-klee-s-measure-problem-and-a-lower-bound-for-union-volume-estimation-2410.00996"/></url>
<url><loc>https://scifaro.com/en/abs/influence-of-control-polygon-on-the-generalization-of-the-conversion-between-ancf-and-b-spline-surfaces-2410.01918</loc><lastmod>2024-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/influence-of-control-polygon-on-the-generalization-of-the-conversion-between-ancf-and-b-spline-surfaces-2410.01918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/influence-of-control-polygon-on-the-generalization-of-the-conversion-between-ancf-and-b-spline-surfaces-2410.01918"/></url>
<url><loc>https://scifaro.com/en/abs/general-conversion-between-ancf-and-b-spline-surfaces-2410.01992</loc><lastmod>2024-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-conversion-between-ancf-and-b-spline-surfaces-2410.01992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-conversion-between-ancf-and-b-spline-surfaces-2410.01992"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-algorithm-for-computing-a-planar-support-for-non-piercing-rectangles-2410.02449</loc><lastmod>2024-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-algorithm-for-computing-a-planar-support-for-non-piercing-rectangles-2410.02449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-algorithm-for-computing-a-planar-support-for-non-piercing-rectangles-2410.02449"/></url>
<url><loc>https://scifaro.com/en/abs/computing-largest-minimum-color-spanning-intervals-of-imprecise-points-2410.03213</loc><lastmod>2024-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-largest-minimum-color-spanning-intervals-of-imprecise-points-2410.03213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-largest-minimum-color-spanning-intervals-of-imprecise-points-2410.03213"/></url>
<url><loc>https://scifaro.com/en/abs/identification-of-anomalous-geospatial-trajectories-via-persistent-homology-2410.03889</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identification-of-anomalous-geospatial-trajectories-via-persistent-homology-2410.03889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identification-of-anomalous-geospatial-trajectories-via-persistent-homology-2410.03889"/></url>
<url><loc>https://scifaro.com/en/abs/fast-area-weighted-peeling-of-convex-hulls-for-outlier-detection-2410.04544</loc><lastmod>2025-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-area-weighted-peeling-of-convex-hulls-for-outlier-detection-2410.04544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-area-weighted-peeling-of-convex-hulls-for-outlier-detection-2410.04544"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-assisted-dynamic-beampattern-optimization-in-integrated-sensing-and-communication-systems-2410.04862</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-assisted-dynamic-beampattern-optimization-in-integrated-sensing-and-communication-systems-2410.04862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-assisted-dynamic-beampattern-optimization-in-integrated-sensing-and-communication-systems-2410.04862"/></url>
<url><loc>https://scifaro.com/en/abs/visdiff-sdf-guided-polygon-generation-for-visibility-reconstruction-and-recognition-2410.05530</loc><lastmod>2025-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visdiff-sdf-guided-polygon-generation-for-visibility-reconstruction-and-recognition-2410.05530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visdiff-sdf-guided-polygon-generation-for-visibility-reconstruction-and-recognition-2410.05530"/></url>
<url><loc>https://scifaro.com/en/abs/noncrossing-longest-paths-and-cycles-2410.05580</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noncrossing-longest-paths-and-cycles-2410.05580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noncrossing-longest-paths-and-cycles-2410.05580"/></url>
<url><loc>https://scifaro.com/en/abs/flips-in-odd-matchings-2410.06139</loc><lastmod>2024-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flips-in-odd-matchings-2410.06139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flips-in-odd-matchings-2410.06139"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexities-of-folding-2410.07666</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexities-of-folding-2410.07666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexities-of-folding-2410.07666"/></url>
<url><loc>https://scifaro.com/en/abs/complete-and-bi-continuous-invariant-of-protein-backbones-under-rigid-motion-2410.08203</loc><lastmod>2025-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-and-bi-continuous-invariant-of-protein-backbones-under-rigid-motion-2410.08203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-and-bi-continuous-invariant-of-protein-backbones-under-rigid-motion-2410.08203"/></url>
<url><loc>https://scifaro.com/en/abs/separable-drawings-extendability-and-crossing-free-hamiltonian-cycles-2410.09922</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separable-drawings-extendability-and-crossing-free-hamiltonian-cycles-2410.09922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separable-drawings-extendability-and-crossing-free-hamiltonian-cycles-2410.09922"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computations-of-discrete-cubical-homology-2410.09939</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computations-of-discrete-cubical-homology-2410.09939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computations-of-discrete-cubical-homology-2410.09939"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-methodology-for-solving-the-minimum-enclosing-ball-and-related-problems-2410.11063</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-methodology-for-solving-the-minimum-enclosing-ball-and-related-problems-2410.11063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-methodology-for-solving-the-minimum-enclosing-ball-and-related-problems-2410.11063"/></url>
<url><loc>https://scifaro.com/en/abs/fast-and-robust-hexahedral-mesh-optimization-via-augmented-lagrangian-l-bfgs-and-line-search-2410.11656</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-and-robust-hexahedral-mesh-optimization-via-augmented-lagrangian-l-bfgs-and-line-search-2410.11656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-and-robust-hexahedral-mesh-optimization-via-augmented-lagrangian-l-bfgs-and-line-search-2410.11656"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-planar-graphs-and-1-planar-graphs-using-cubic-b-ezier-curves-with-bounded-curvature-2410.12083</loc><lastmod>2024-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-planar-graphs-and-1-planar-graphs-using-cubic-b-ezier-curves-with-bounded-curvature-2410.12083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-planar-graphs-and-1-planar-graphs-using-cubic-b-ezier-curves-with-bounded-curvature-2410.12083"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-partially-embedded-planarity-test-based-on-vertex-addition-2410.13536</loc><lastmod>2024-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-partially-embedded-planarity-test-based-on-vertex-addition-2410.13536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-partially-embedded-planarity-test-based-on-vertex-addition-2410.13536"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-field-aligned-reparameterization-for-trimmed-nurbs-2410.14318</loc><lastmod>2024-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-field-aligned-reparameterization-for-trimmed-nurbs-2410.14318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-field-aligned-reparameterization-for-trimmed-nurbs-2410.14318"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-computation-of-persistent-cohomology-2410.16553</loc><lastmod>2024-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-computation-of-persistent-cohomology-2410.16553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-computation-of-persistent-cohomology-2410.16553"/></url>
<url><loc>https://scifaro.com/en/abs/polycubes-via-dual-loops-2410.16865</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polycubes-via-dual-loops-2410.16865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polycubes-via-dual-loops-2410.16865"/></url>
<url><loc>https://scifaro.com/en/abs/pillow-box-design-2410.17593</loc><lastmod>2024-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pillow-box-design-2410.17593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pillow-box-design-2410.17593"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-symmetries-of-rational-surfaces-2410.18609</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-symmetries-of-rational-surfaces-2410.18609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-symmetries-of-rational-surfaces-2410.18609"/></url>
<url><loc>https://scifaro.com/en/abs/dl-polycube-deep-learning-enhanced-polycube-method-for-high-quality-hexahedral-mesh-generation-and-volumetric-spline-construction-2410.18852</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dl-polycube-deep-learning-enhanced-polycube-method-for-high-quality-hexahedral-mesh-generation-and-volumetric-spline-construction-2410.18852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dl-polycube-deep-learning-enhanced-polycube-method-for-high-quality-hexahedral-mesh-generation-and-volumetric-spline-construction-2410.18852"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-geometric-interpretation-of-the-subset-sum-problem-2410.19024</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-geometric-interpretation-of-the-subset-sum-problem-2410.19024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-geometric-interpretation-of-the-subset-sum-problem-2410.19024"/></url>
<url><loc>https://scifaro.com/en/abs/faithful-reeb-graph-reconstruction-of-a-tectonic-subduction-zone-from-earthquake-hypocenters-2410.19410</loc><lastmod>2025-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faithful-reeb-graph-reconstruction-of-a-tectonic-subduction-zone-from-earthquake-hypocenters-2410.19410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faithful-reeb-graph-reconstruction-of-a-tectonic-subduction-zone-from-earthquake-hypocenters-2410.19410"/></url>
<url><loc>https://scifaro.com/en/abs/a-fast-algorithm-for-computing-zigzag-representatives-2410.20565</loc><lastmod>2026-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fast-algorithm-for-computing-zigzag-representatives-2410.20565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fast-algorithm-for-computing-zigzag-representatives-2410.20565"/></url>
<url><loc>https://scifaro.com/en/abs/computing-betti-tables-and-minimal-presentations-of-zero-dimensional-persistent-homology-2410.22242</loc><lastmod>2026-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-betti-tables-and-minimal-presentations-of-zero-dimensional-persistent-homology-2410.22242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-betti-tables-and-minimal-presentations-of-zero-dimensional-persistent-homology-2410.22242"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-bridge-length-the-key-ingredient-in-a-continuous-isometry-classification-of-periodic-point-sets-2410.23288</loc><lastmod>2026-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-bridge-length-the-key-ingredient-in-a-continuous-isometry-classification-of-periodic-point-sets-2410.23288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-bridge-length-the-key-ingredient-in-a-continuous-isometry-classification-of-periodic-point-sets-2410.23288"/></url>
<url><loc>https://scifaro.com/en/abs/flipping-non-crossing-spanning-trees-2410.23809</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flipping-non-crossing-spanning-trees-2410.23809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flipping-non-crossing-spanning-trees-2410.23809"/></url>
<url><loc>https://scifaro.com/en/abs/a-hilbert-geometric-algorithm-for-approximating-the-halfspace-depth-of-a-point-in-a-convex-body-2411.01482</loc><lastmod>2025-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hilbert-geometric-algorithm-for-approximating-the-halfspace-depth-of-a-point-in-a-convex-body-2411.01482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hilbert-geometric-algorithm-for-approximating-the-halfspace-depth-of-a-point-in-a-convex-body-2411.01482"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-algorithms-for-the-freeze-tag-problem-inside-polygons-2411.02882</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-freeze-tag-problem-inside-polygons-2411.02882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-algorithms-for-the-freeze-tag-problem-inside-polygons-2411.02882"/></url>
<url><loc>https://scifaro.com/en/abs/error-controlled-cubic-spline-interpolation-in-cnc-technology-2411.03935</loc><lastmod>2024-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/error-controlled-cubic-spline-interpolation-in-cnc-technology-2411.03935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/error-controlled-cubic-spline-interpolation-in-cnc-technology-2411.03935"/></url>
<url><loc>https://scifaro.com/en/abs/clustergraph-a-new-tool-for-visualization-and-compression-of-multidimensional-data-2411.05443</loc><lastmod>2024-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clustergraph-a-new-tool-for-visualization-and-compression-of-multidimensional-data-2411.05443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clustergraph-a-new-tool-for-visualization-and-compression-of-multidimensional-data-2411.05443"/></url>
<url><loc>https://scifaro.com/en/abs/generating-cofaces-in-vietoris-rips-filtration-order-2411.05495</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-cofaces-in-vietoris-rips-filtration-order-2411.05495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-cofaces-in-vietoris-rips-filtration-order-2411.05495"/></url>
<url><loc>https://scifaro.com/en/abs/hyperplane-distance-depth-2411.06114</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperplane-distance-depth-2411.06114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperplane-distance-depth-2411.06114"/></url>
<url><loc>https://scifaro.com/en/abs/on-inside-out-dissections-of-polygons-and-polyhedra-2411.06584</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-inside-out-dissections-of-polygons-and-polyhedra-2411.06584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-inside-out-dissections-of-polygons-and-polyhedra-2411.06584"/></url>
<url><loc>https://scifaro.com/en/abs/a-sparse-multicover-bifiltration-of-linear-size-2411.06986</loc><lastmod>2025-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sparse-multicover-bifiltration-of-linear-size-2411.06986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sparse-multicover-bifiltration-of-linear-size-2411.06986"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-of-non-planar-slicer-for-improved-surface-quality-in-material-extrusion-3d-printing-2411.07225</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-of-non-planar-slicer-for-improved-surface-quality-in-material-extrusion-3d-printing-2411.07225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-of-non-planar-slicer-for-improved-surface-quality-in-material-extrusion-3d-printing-2411.07225"/></url>
<url><loc>https://scifaro.com/en/abs/a-well-separated-pair-decomposition-for-low-density-graphs-2411.08204</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-well-separated-pair-decomposition-for-low-density-graphs-2411.08204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-well-separated-pair-decomposition-for-low-density-graphs-2411.08204"/></url>
<url><loc>https://scifaro.com/en/abs/constant-workspace-algorithms-for-computing-relative-hulls-in-the-plane-2411.10043</loc><lastmod>2025-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-workspace-algorithms-for-computing-relative-hulls-in-the-plane-2411.10043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-workspace-algorithms-for-computing-relative-hulls-in-the-plane-2411.10043"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-and-unranking-of-the-planar-embeddings-of-a-planar-graph-2411.10319</loc><lastmod>2024-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-and-unranking-of-the-planar-embeddings-of-a-planar-graph-2411.10319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-and-unranking-of-the-planar-embeddings-of-a-planar-graph-2411.10319"/></url>
<url><loc>https://scifaro.com/en/abs/when-alpha-complexes-collapse-onto-codimension-1-submanifolds-2411.10388</loc><lastmod>2025-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-alpha-complexes-collapse-onto-codimension-1-submanifolds-2411.10388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-alpha-complexes-collapse-onto-codimension-1-submanifolds-2411.10388"/></url>
<url><loc>https://scifaro.com/en/abs/computing-conforming-partitions-with-low-stabbing-number-for-rectilinear-polygons-2411.11274</loc><lastmod>2025-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-conforming-partitions-with-low-stabbing-number-for-rectilinear-polygons-2411.11274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-conforming-partitions-with-low-stabbing-number-for-rectilinear-polygons-2411.11274"/></url>
<url><loc>https://scifaro.com/en/abs/multipacking-in-euclidean-metric-space-2411.12351</loc><lastmod>2025-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multipacking-in-euclidean-metric-space-2411.12351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multipacking-in-euclidean-metric-space-2411.12351"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-geometric-graph-modification-with-disk-scaling-2411.13171</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-geometric-graph-modification-with-disk-scaling-2411.13171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-geometric-graph-modification-with-disk-scaling-2411.13171"/></url>
<url><loc>https://scifaro.com/en/abs/representing-hypergraphs-by-point-line-incidences-2411.13985</loc><lastmod>2025-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-hypergraphs-by-point-line-incidences-2411.13985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-hypergraphs-by-point-line-incidences-2411.13985"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-monotone-spanning-trees-2411.14038</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-monotone-spanning-trees-2411.14038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-monotone-spanning-trees-2411.14038"/></url>
<url><loc>https://scifaro.com/en/abs/a-review-of-geometric-modeling-methods-in-microstructure-design-and-manufacturing-2411.15833</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-review-of-geometric-modeling-methods-in-microstructure-design-and-manufacturing-2411.15833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-review-of-geometric-modeling-methods-in-microstructure-design-and-manufacturing-2411.15833"/></url>
<url><loc>https://scifaro.com/en/abs/instantiation-of-jerboa-rule-schemes-a-set-based-explanation-2411.15986</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instantiation-of-jerboa-rule-schemes-a-set-based-explanation-2411.15986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instantiation-of-jerboa-rule-schemes-a-set-based-explanation-2411.15986"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-distortion-continuous-cartograms-by-numerically-optimized-meshes-2411.17129</loc><lastmod>2024-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-distortion-continuous-cartograms-by-numerically-optimized-meshes-2411.17129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-distortion-continuous-cartograms-by-numerically-optimized-meshes-2411.17129"/></url>
<url><loc>https://scifaro.com/en/abs/visual-complexity-of-point-set-mappings-2411.17920</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visual-complexity-of-point-set-mappings-2411.17920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visual-complexity-of-point-set-mappings-2411.17920"/></url>
<url><loc>https://scifaro.com/en/abs/a-fractional-helly-theorem-for-set-systems-with-slowly-growing-homological-shatter-function-2411.18605</loc><lastmod>2024-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fractional-helly-theorem-for-set-systems-with-slowly-growing-homological-shatter-function-2411.18605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fractional-helly-theorem-for-set-systems-with-slowly-growing-homological-shatter-function-2411.18605"/></url>
<url><loc>https://scifaro.com/en/abs/extraction-theorems-with-small-extraction-numbers-2411.18655</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extraction-theorems-with-small-extraction-numbers-2411.18655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extraction-theorems-with-small-extraction-numbers-2411.18655"/></url>
<url><loc>https://scifaro.com/en/abs/noncommutative-model-selection-and-the-data-driven-estimation-of-real-cohomology-groups-2411.19894</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noncommutative-model-selection-and-the-data-driven-estimation-of-real-cohomology-groups-2411.19894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noncommutative-model-selection-and-the-data-driven-estimation-of-real-cohomology-groups-2411.19894"/></url>
<url><loc>https://scifaro.com/en/abs/all-polyhedral-manifolds-are-connected-by-a-2-step-refolding-2412.02174</loc><lastmod>2025-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-polyhedral-manifolds-are-connected-by-a-2-step-refolding-2412.02174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-polyhedral-manifolds-are-connected-by-a-2-step-refolding-2412.02174"/></url>
<url><loc>https://scifaro.com/en/abs/simple-construction-of-greedy-trees-and-greedy-permutations-2412.02554</loc><lastmod>2024-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-construction-of-greedy-trees-and-greedy-permutations-2412.02554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-construction-of-greedy-trees-and-greedy-permutations-2412.02554"/></url>
<url><loc>https://scifaro.com/en/abs/dudeney-s-dissection-is-optimal-2412.03865</loc><lastmod>2025-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dudeney-s-dissection-is-optimal-2412.03865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dudeney-s-dissection-is-optimal-2412.03865"/></url>
<url><loc>https://scifaro.com/en/abs/soft-cells-kelvin-s-foam-and-the-minimal-surfaces-of-schwarz-2412.04491</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soft-cells-kelvin-s-foam-and-the-minimal-surfaces-of-schwarz-2412.04491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soft-cells-kelvin-s-foam-and-the-minimal-surfaces-of-schwarz-2412.04491"/></url>
<url><loc>https://scifaro.com/en/abs/online-hitting-sets-for-disks-of-bounded-radii-2412.04646</loc><lastmod>2025-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-hitting-sets-for-disks-of-bounded-radii-2412.04646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-hitting-sets-for-disks-of-bounded-radii-2412.04646"/></url>
<url><loc>https://scifaro.com/en/abs/a-free-lunch-manifolds-of-positive-reach-can-be-smoothed-without-decreasing-the-reach-2412.04899</loc><lastmod>2024-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-free-lunch-manifolds-of-positive-reach-can-be-smoothed-without-decreasing-the-reach-2412.04899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-free-lunch-manifolds-of-positive-reach-can-be-smoothed-without-decreasing-the-reach-2412.04899"/></url>
<url><loc>https://scifaro.com/en/abs/manifolds-of-positive-reach-differentiability-tangent-variation-and-attaining-the-reach-2412.04906</loc><lastmod>2024-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/manifolds-of-positive-reach-differentiability-tangent-variation-and-attaining-the-reach-2412.04906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/manifolds-of-positive-reach-differentiability-tangent-variation-and-attaining-the-reach-2412.04906"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-erd-h-o-s-s-mysterious-remark-2412.05190</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-erd-h-o-s-s-mysterious-remark-2412.05190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-erd-h-o-s-s-mysterious-remark-2412.05190"/></url>
<url><loc>https://scifaro.com/en/abs/sliding-squares-in-parallel-2412.05523</loc><lastmod>2025-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sliding-squares-in-parallel-2412.05523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sliding-squares-in-parallel-2412.05523"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-computation-of-path-homology-for-stratified-digraphs-2412.05684</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-computation-of-path-homology-for-stratified-digraphs-2412.05684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-computation-of-path-homology-for-stratified-digraphs-2412.05684"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-spanners-of-bounded-tree-width-2412.06316</loc><lastmod>2024-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-spanners-of-bounded-tree-width-2412.06316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-spanners-of-bounded-tree-width-2412.06316"/></url>
<url><loc>https://scifaro.com/en/abs/np-hardness-and-a-ptas-for-the-euclidean-steiner-line-problem-2412.07046</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-hardness-and-a-ptas-for-the-euclidean-steiner-line-problem-2412.07046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-hardness-and-a-ptas-for-the-euclidean-steiner-line-problem-2412.07046"/></url>
<url><loc>https://scifaro.com/en/abs/computing-oriented-spanners-and-their-dilation-2412.08165</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-oriented-spanners-and-their-dilation-2412.08165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-oriented-spanners-and-their-dilation-2412.08165"/></url>
<url><loc>https://scifaro.com/en/abs/an-o-n-algorithm-for-solving-the-smallest-enclosing-sphere-problem-in-the-presence-of-degeneracies-2412.10120</loc><lastmod>2024-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-o-n-algorithm-for-solving-the-smallest-enclosing-sphere-problem-in-the-presence-of-degeneracies-2412.10120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-o-n-algorithm-for-solving-the-smallest-enclosing-sphere-problem-in-the-presence-of-degeneracies-2412.10120"/></url>
<url><loc>https://scifaro.com/en/abs/computing-crossing-numbers-with-topological-and-geometric-restrictions-2412.13092</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-crossing-numbers-with-topological-and-geometric-restrictions-2412.13092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-crossing-numbers-with-topological-and-geometric-restrictions-2412.13092"/></url>
<url><loc>https://scifaro.com/en/abs/on-stable-approximation-algorithms-for-geometric-coverage-problems-2412.13357</loc><lastmod>2024-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-stable-approximation-algorithms-for-geometric-coverage-problems-2412.13357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-stable-approximation-algorithms-for-geometric-coverage-problems-2412.13357"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-realizations-existence-np-completeness-on-sparse-graphs-and-algorithms-2412.13721</loc><lastmod>2025-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-realizations-existence-np-completeness-on-sparse-graphs-and-algorithms-2412.13721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-realizations-existence-np-completeness-on-sparse-graphs-and-algorithms-2412.13721"/></url>
<url><loc>https://scifaro.com/en/abs/the-contiguous-art-gallery-problem-is-solvable-in-polynomial-time-2412.13938</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-contiguous-art-gallery-problem-is-solvable-in-polynomial-time-2412.13938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-contiguous-art-gallery-problem-is-solvable-in-polynomial-time-2412.13938"/></url>
<url><loc>https://scifaro.com/en/abs/contiguous-boundary-guarding-2412.15053</loc><lastmod>2025-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contiguous-boundary-guarding-2412.15053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contiguous-boundary-guarding-2412.15053"/></url>
<url><loc>https://scifaro.com/en/abs/folding-one-polyhedral-metric-graph-into-another-2412.15121</loc><lastmod>2024-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-one-polyhedral-metric-graph-into-another-2412.15121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-one-polyhedral-metric-graph-into-another-2412.15121"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-flattening-and-reversing-of-convex-polyhedral-linkages-2412.15130</loc><lastmod>2024-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-flattening-and-reversing-of-convex-polyhedral-linkages-2412.15130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-flattening-and-reversing-of-convex-polyhedral-linkages-2412.15130"/></url>
<url><loc>https://scifaro.com/en/abs/tracking-the-persistence-of-harmonic-chains-barcode-and-stability-2412.15419</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracking-the-persistence-of-harmonic-chains-barcode-and-stability-2412.15419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracking-the-persistence-of-harmonic-chains-barcode-and-stability-2412.15419"/></url>
<url><loc>https://scifaro.com/en/abs/the-analytic-arc-cover-problem-and-its-applications-to-contiguous-art-gallery-polygon-separation-and-shape-carving-2412.15567</loc><lastmod>2025-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-analytic-arc-cover-problem-and-its-applications-to-contiguous-art-gallery-polygon-separation-and-shape-carving-2412.15567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-analytic-arc-cover-problem-and-its-applications-to-contiguous-art-gallery-polygon-separation-and-shape-carving-2412.15567"/></url>
<url><loc>https://scifaro.com/en/abs/construction-transformation-and-structures-of-2x2-space-filling-curves-2412.16962</loc><lastmod>2025-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/construction-transformation-and-structures-of-2x2-space-filling-curves-2412.16962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/construction-transformation-and-structures-of-2x2-space-filling-curves-2412.16962"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-heine-borel-property-and-minimum-enclosing-balls-2412.17138</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-heine-borel-property-and-minimum-enclosing-balls-2412.17138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-heine-borel-property-and-minimum-enclosing-balls-2412.17138"/></url>
<url><loc>https://scifaro.com/en/abs/initial-placement-for-fruchterman-reingold-force-model-with-coordinate-newton-direction-2412.20317</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-placement-for-fruchterman-reingold-force-model-with-coordinate-newton-direction-2412.20317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-placement-for-fruchterman-reingold-force-model-with-coordinate-newton-direction-2412.20317"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-of-unit-squares-and-disks-pspace-hardness-in-simple-settings-2412.21017</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-of-unit-squares-and-disks-pspace-hardness-in-simple-settings-2412.21017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-of-unit-squares-and-disks-pspace-hardness-in-simple-settings-2412.21017"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-unit-disk-range-reporting-2501.00120</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-unit-disk-range-reporting-2501.00120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-unit-disk-range-reporting-2501.00120"/></url>
<url><loc>https://scifaro.com/en/abs/dominating-set-independent-set-discrete-k-center-dispersion-and-related-problems-for-planar-points-in-convex-position-2501.00207</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dominating-set-independent-set-discrete-k-center-dispersion-and-related-problems-for-planar-points-in-convex-position-2501.00207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dominating-set-independent-set-discrete-k-center-dispersion-and-related-problems-for-planar-points-in-convex-position-2501.00207"/></url>
<url><loc>https://scifaro.com/en/abs/sweeping-orders-for-simplicial-complex-reconstruction-2501.01901</loc><lastmod>2025-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sweeping-orders-for-simplicial-complex-reconstruction-2501.01901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sweeping-orders-for-simplicial-complex-reconstruction-2501.01901"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-algorithm-for-half-plane-hitting-set-2501.02195</loc><lastmod>2025-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-half-plane-hitting-set-2501.02195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-algorithm-for-half-plane-hitting-set-2501.02195"/></url>
<url><loc>https://scifaro.com/en/abs/the-geodesic-fr-echet-distance-between-two-curves-bounding-a-simple-polygon-2501.03834</loc><lastmod>2025-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geodesic-fr-echet-distance-between-two-curves-bounding-a-simple-polygon-2501.03834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geodesic-fr-echet-distance-between-two-curves-bounding-a-simple-polygon-2501.03834"/></url>
<url><loc>https://scifaro.com/en/abs/counting-equilibria-of-the-electrostatic-potential-2501.05315</loc><lastmod>2025-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-equilibria-of-the-electrostatic-potential-2501.05315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-equilibria-of-the-electrostatic-potential-2501.05315"/></url>
<url><loc>https://scifaro.com/en/abs/accelerating-computation-of-stable-merge-tree-edit-distances-using-parameterized-heuristics-2501.05529</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accelerating-computation-of-stable-merge-tree-edit-distances-using-parameterized-heuristics-2501.05529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accelerating-computation-of-stable-merge-tree-edit-distances-using-parameterized-heuristics-2501.05529"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-vc-dimension-analysis-of-clustering-coresets-with-applications-2501.06588</loc><lastmod>2025-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-vc-dimension-analysis-of-clustering-coresets-with-applications-2501.06588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-vc-dimension-analysis-of-clustering-coresets-with-applications-2501.06588"/></url>
<url><loc>https://scifaro.com/en/abs/a-greedy-algorithm-for-low-crossing-partitions-for-general-set-systems-2501.07617</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-greedy-algorithm-for-low-crossing-partitions-for-general-set-systems-2501.07617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-greedy-algorithm-for-low-crossing-partitions-for-general-set-systems-2501.07617"/></url>
<url><loc>https://scifaro.com/en/abs/computational-geometry-with-probabilistically-noisy-primitive-operations-2501.07707</loc><lastmod>2025-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-geometry-with-probabilistically-noisy-primitive-operations-2501.07707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-geometry-with-probabilistically-noisy-primitive-operations-2501.07707"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-continuity-for-smooth-as-rigid-as-possible-shape-modeling-2501.10335</loc><lastmod>2026-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-continuity-for-smooth-as-rigid-as-possible-shape-modeling-2501.10335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-continuity-for-smooth-as-rigid-as-possible-shape-modeling-2501.10335"/></url>
<url><loc>https://scifaro.com/en/abs/parkview-visualizing-monotone-interleavings-2501.10728</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parkview-visualizing-monotone-interleavings-2501.10728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parkview-visualizing-monotone-interleavings-2501.10728"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-the-design-of-efficient-diversification-algorithms-to-np-hard-problems-2501.12261</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-the-design-of-efficient-diversification-algorithms-to-np-hard-problems-2501.12261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-the-design-of-efficient-diversification-algorithms-to-np-hard-problems-2501.12261"/></url>
<url><loc>https://scifaro.com/en/abs/untangling-segments-in-the-plane-2501.12306</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untangling-segments-in-the-plane-2501.12306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untangling-segments-in-the-plane-2501.12306"/></url>
<url><loc>https://scifaro.com/en/abs/faster-fr-echet-distance-under-transformations-2501.12814</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-fr-echet-distance-under-transformations-2501.12814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-fr-echet-distance-under-transformations-2501.12814"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-dogs-on-the-line-on-the-fr-echet-distance-under-translation-or-scaling-in-1d-2501.12821</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-dogs-on-the-line-on-the-fr-echet-distance-under-translation-or-scaling-in-1d-2501.12821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-dogs-on-the-line-on-the-fr-echet-distance-under-translation-or-scaling-in-1d-2501.12821"/></url>
<url><loc>https://scifaro.com/en/abs/polyhedral-collision-detection-via-vertex-enumeration-2501.13201</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyhedral-collision-detection-via-vertex-enumeration-2501.13201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyhedral-collision-detection-via-vertex-enumeration-2501.13201"/></url>
<url><loc>https://scifaro.com/en/abs/point-cloud-surface-parametrization-with-hand-and-leg-hausdorff-approximation-from-node-wise-distances-and-localized-energy-for-geometry-2501.13737</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/point-cloud-surface-parametrization-with-hand-and-leg-hausdorff-approximation-from-node-wise-distances-and-localized-energy-for-geometry-2501.13737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/point-cloud-surface-parametrization-with-hand-and-leg-hausdorff-approximation-from-node-wise-distances-and-localized-energy-for-geometry-2501.13737"/></url>
<url><loc>https://scifaro.com/en/abs/lipschitz-decompositions-of-finite-ell-p-metrics-2502.01120</loc><lastmod>2026-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lipschitz-decompositions-of-finite-ell-p-metrics-2502.01120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lipschitz-decompositions-of-finite-ell-p-metrics-2502.01120"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-orthogonal-drawings-in-linear-time-2502.03309</loc><lastmod>2025-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-orthogonal-drawings-in-linear-time-2502.03309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-orthogonal-drawings-in-linear-time-2502.03309"/></url>
<url><loc>https://scifaro.com/en/abs/preprocessing-disks-for-convex-hulls-revisited-2502.03633</loc><lastmod>2026-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preprocessing-disks-for-convex-hulls-revisited-2502.03633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preprocessing-disks-for-convex-hulls-revisited-2502.03633"/></url>
<url><loc>https://scifaro.com/en/abs/validity-first-automatic-polycube-labeling-for-cad-models-2502.05712</loc><lastmod>2025-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/validity-first-automatic-polycube-labeling-for-cad-models-2502.05712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/validity-first-automatic-polycube-labeling-for-cad-models-2502.05712"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-reconfiguration-of-tile-arrangements-by-a-single-active-robot-2502.09299</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-reconfiguration-of-tile-arrangements-by-a-single-active-robot-2502.09299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-reconfiguration-of-tile-arrangements-by-a-single-active-robot-2502.09299"/></url>
<url><loc>https://scifaro.com/en/abs/augmenting-plane-straight-line-graphs-to-meet-parity-constraints-2502.10066</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/augmenting-plane-straight-line-graphs-to-meet-parity-constraints-2502.10066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/augmenting-plane-straight-line-graphs-to-meet-parity-constraints-2502.10066"/></url>
<url><loc>https://scifaro.com/en/abs/tusqh-topological-control-of-volume-fraction-meshes-near-small-features-and-dirty-geometry-2502.10609</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tusqh-topological-control-of-volume-fraction-meshes-near-small-features-and-dirty-geometry-2502.10609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tusqh-topological-control-of-volume-fraction-meshes-near-small-features-and-dirty-geometry-2502.10609"/></url>
<url><loc>https://scifaro.com/en/abs/fast-kd-trees-for-the-kullback-leibler-divergence-and-other-decomposable-bregman-divergences-2502.13425</loc><lastmod>2025-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-kd-trees-for-the-kullback-leibler-divergence-and-other-decomposable-bregman-divergences-2502.13425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-kd-trees-for-the-kullback-leibler-divergence-and-other-decomposable-bregman-divergences-2502.13425"/></url>
<url><loc>https://scifaro.com/en/abs/the-euclidean-k-matching-problem-is-np-hard-2502.15660</loc><lastmod>2025-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-euclidean-k-matching-problem-is-np-hard-2502.15660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-euclidean-k-matching-problem-is-np-hard-2502.15660"/></url>
<url><loc>https://scifaro.com/en/abs/a-purely-geometric-variant-of-the-gale-berlekamp-switching-game-2502.16305</loc><lastmod>2025-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-purely-geometric-variant-of-the-gale-berlekamp-switching-game-2502.16305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-purely-geometric-variant-of-the-gale-berlekamp-switching-game-2502.16305"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-gpu-native-adaptive-mesh-refinement-scheme-for-the-lattice-boltzmann-method-in-complex-geometries-2502.16310</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-gpu-native-adaptive-mesh-refinement-scheme-for-the-lattice-boltzmann-method-in-complex-geometries-2502.16310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-gpu-native-adaptive-mesh-refinement-scheme-for-the-lattice-boltzmann-method-in-complex-geometries-2502.16310"/></url>
<url><loc>https://scifaro.com/en/abs/segment-intersection-representations-level-planarity-and-constrained-ordering-problems-2502.16621</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/segment-intersection-representations-level-planarity-and-constrained-ordering-problems-2502.16621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/segment-intersection-representations-level-planarity-and-constrained-ordering-problems-2502.16621"/></url>
<url><loc>https://scifaro.com/en/abs/property-testing-of-curve-similarity-2502.17277</loc><lastmod>2025-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-testing-of-curve-similarity-2502.17277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-testing-of-curve-similarity-2502.17277"/></url>
<url><loc>https://scifaro.com/en/abs/tight-bounds-on-the-number-of-closest-pairs-in-vertical-slabs-2502.17600</loc><lastmod>2025-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-bounds-on-the-number-of-closest-pairs-in-vertical-slabs-2502.17600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-bounds-on-the-number-of-closest-pairs-in-vertical-slabs-2502.17600"/></url>
<url><loc>https://scifaro.com/en/abs/apex-representatives-2502.17704</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/apex-representatives-2502.17704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/apex-representatives-2502.17704"/></url>
<url><loc>https://scifaro.com/en/abs/exact-algorithms-for-minimum-dilation-triangulation-2502.18189</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-algorithms-for-minimum-dilation-triangulation-2502.18189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-algorithms-for-minimum-dilation-triangulation-2502.18189"/></url>
<url><loc>https://scifaro.com/en/abs/unbent-collections-of-orthogonal-drawings-2502.18390</loc><lastmod>2026-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unbent-collections-of-orthogonal-drawings-2502.18390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unbent-collections-of-orthogonal-drawings-2502.18390"/></url>
<url><loc>https://scifaro.com/en/abs/a-nonlinear-extension-of-the-variable-projection-varpro-method-for-nurbs-based-conformal-surface-flattening-2502.19088</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-nonlinear-extension-of-the-variable-projection-varpro-method-for-nurbs-based-conformal-surface-flattening-2502.19088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-nonlinear-extension-of-the-variable-projection-varpro-method-for-nurbs-based-conformal-surface-flattening-2502.19088"/></url>
<url><loc>https://scifaro.com/en/abs/topological-autoencoders-fast-and-accurate-cycle-aware-dimensionality-reduction-2502.20215</loc><lastmod>2025-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-autoencoders-fast-and-accurate-cycle-aware-dimensionality-reduction-2502.20215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-autoencoders-fast-and-accurate-cycle-aware-dimensionality-reduction-2502.20215"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bound-on-the-number-of-pseudoline-arrangements-via-the-zone-theorem-2502.20909</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bound-on-the-number-of-pseudoline-arrangements-via-the-zone-theorem-2502.20909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bound-on-the-number-of-pseudoline-arrangements-via-the-zone-theorem-2502.20909"/></url>
<url><loc>https://scifaro.com/en/abs/unit-edge-length-rectilinear-drawings-with-crossings-and-rectangular-faces-2503.01526</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unit-edge-length-rectilinear-drawings-with-crossings-and-rectangular-faces-2503.01526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unit-edge-length-rectilinear-drawings-with-crossings-and-rectangular-faces-2503.01526"/></url>
<url><loc>https://scifaro.com/en/abs/counterexamples-to-proofs-for-volumetric-parameterization-of-topological-sweeps-2503.01573</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexamples-to-proofs-for-volumetric-parameterization-of-topological-sweeps-2503.01573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexamples-to-proofs-for-volumetric-parameterization-of-topological-sweeps-2503.01573"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-time-complexity-of-using-subdivision-methods-for-the-approximation-of-fibers-2503.01626</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-time-complexity-of-using-subdivision-methods-for-the-approximation-of-fibers-2503.01626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-time-complexity-of-using-subdivision-methods-for-the-approximation-of-fibers-2503.01626"/></url>
<url><loc>https://scifaro.com/en/abs/visualization-of-event-graphs-for-train-schedules-2503.01808</loc><lastmod>2025-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualization-of-event-graphs-for-train-schedules-2503.01808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualization-of-event-graphs-for-train-schedules-2503.01808"/></url>
<url><loc>https://scifaro.com/en/abs/french-onion-soup-ipelets-for-points-and-polygons-2503.01979</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/french-onion-soup-ipelets-for-points-and-polygons-2503.01979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/french-onion-soup-ipelets-for-points-and-polygons-2503.01979"/></url>
<url><loc>https://scifaro.com/en/abs/software-for-the-thompson-and-funk-polygonal-geometry-2503.01988</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/software-for-the-thompson-and-funk-polygonal-geometry-2503.01988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/software-for-the-thompson-and-funk-polygonal-geometry-2503.01988"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-length-coordinated-motions-for-two-convex-centrally-symmetric-robots-2503.02010</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-length-coordinated-motions-for-two-convex-centrally-symmetric-robots-2503.02010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-length-coordinated-motions-for-two-convex-centrally-symmetric-robots-2503.02010"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-spanning-blob-trees-2503.02439</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-spanning-blob-trees-2503.02439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-spanning-blob-trees-2503.02439"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-k-centers-of-point-sets-under-l-infty-bottleneck-distance-2503.02715</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-k-centers-of-point-sets-under-l-infty-bottleneck-distance-2503.02715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-k-centers-of-point-sets-under-l-infty-bottleneck-distance-2503.02715"/></url>
<url><loc>https://scifaro.com/en/abs/flipping-matchings-is-hard-2503.02842</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flipping-matchings-is-hard-2503.02842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flipping-matchings-is-hard-2503.02842"/></url>
<url><loc>https://scifaro.com/en/abs/nearest-neighbor-searching-in-a-dynamic-simple-polygon-2503.03435</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearest-neighbor-searching-in-a-dynamic-simple-polygon-2503.03435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearest-neighbor-searching-in-a-dynamic-simple-polygon-2503.03435"/></url>
<url><loc>https://scifaro.com/en/abs/saturated-drawings-of-geometric-thickness-k-2503.03577</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/saturated-drawings-of-geometric-thickness-k-2503.03577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/saturated-drawings-of-geometric-thickness-k-2503.03577"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-indexing-through-learned-indices-with-worst-case-guarantees-2503.05007</loc><lastmod>2025-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-indexing-through-learned-indices-with-worst-case-guarantees-2503.05007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-indexing-through-learned-indices-with-worst-case-guarantees-2503.05007"/></url>
<url><loc>https://scifaro.com/en/abs/object-packing-and-scheduling-for-sequential-3d-printing-a-linear-arithmetic-model-and-a-cegar-inspired-optimal-solver-2503.05071</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/object-packing-and-scheduling-for-sequential-3d-printing-a-linear-arithmetic-model-and-a-cegar-inspired-optimal-solver-2503.05071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/object-packing-and-scheduling-for-sequential-3d-printing-a-linear-arithmetic-model-and-a-cegar-inspired-optimal-solver-2503.05071"/></url>
<url><loc>https://scifaro.com/en/abs/on-triangular-separation-of-bichromatic-point-sets-2503.05178</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-triangular-separation-of-bichromatic-point-sets-2503.05178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-triangular-separation-of-bichromatic-point-sets-2503.05178"/></url>
<url><loc>https://scifaro.com/en/abs/chasing-puppies-on-orthogonal-straight-line-plane-graphs-2503.05216</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chasing-puppies-on-orthogonal-straight-line-plane-graphs-2503.05216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chasing-puppies-on-orthogonal-straight-line-plane-graphs-2503.05216"/></url>
<url><loc>https://scifaro.com/en/abs/general-position-subset-selection-in-line-arrangements-2503.06857</loc><lastmod>2025-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-position-subset-selection-in-line-arrangements-2503.06857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-position-subset-selection-in-line-arrangements-2503.06857"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-realizations-of-dichotomous-ordinal-graphs-2503.07361</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-realizations-of-dichotomous-ordinal-graphs-2503.07361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-realizations-of-dichotomous-ordinal-graphs-2503.07361"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-distance-problems-in-continuous-graphs-2503.07769</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-distance-problems-in-continuous-graphs-2503.07769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-distance-problems-in-continuous-graphs-2503.07769"/></url>
<url><loc>https://scifaro.com/en/abs/improved-approximation-algorithms-for-three-dimensional-bin-packing-2503.08863</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-approximation-algorithms-for-three-dimensional-bin-packing-2503.08863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-approximation-algorithms-for-three-dimensional-bin-packing-2503.08863"/></url>
<url><loc>https://scifaro.com/en/abs/the-zarankiewicz-problem-for-polygon-visibility-graphs-2503.09115</loc><lastmod>2026-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-zarankiewicz-problem-for-polygon-visibility-graphs-2503.09115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-zarankiewicz-problem-for-polygon-visibility-graphs-2503.09115"/></url>
<url><loc>https://scifaro.com/en/abs/external-incremental-delaunay-triangulation-2503.10786</loc><lastmod>2025-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/external-incremental-delaunay-triangulation-2503.10786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/external-incremental-delaunay-triangulation-2503.10786"/></url>
<url><loc>https://scifaro.com/en/abs/constant-approximation-of-fr-echet-distance-in-strongly-subquadratic-time-2503.12746</loc><lastmod>2025-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constant-approximation-of-fr-echet-distance-in-strongly-subquadratic-time-2503.12746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constant-approximation-of-fr-echet-distance-in-strongly-subquadratic-time-2503.12746"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-greedy-discrete-subtrajectory-clustering-2503.14115</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-greedy-discrete-subtrajectory-clustering-2503.14115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-greedy-discrete-subtrajectory-clustering-2503.14115"/></url>
<url><loc>https://scifaro.com/en/abs/duality-between-lines-and-points-2503.17372</loc><lastmod>2025-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duality-between-lines-and-points-2503.17372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duality-between-lines-and-points-2503.17372"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-recursive-embeddings-for-ell-p-metrics-2503.18508</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-recursive-embeddings-for-ell-p-metrics-2503.18508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-recursive-embeddings-for-ell-p-metrics-2503.18508"/></url>
<url><loc>https://scifaro.com/en/abs/when-distances-lie-euclidean-embeddings-in-the-presence-of-outliers-and-distance-violations-2503.19093</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-distances-lie-euclidean-embeddings-in-the-presence-of-outliers-and-distance-violations-2503.19093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-distances-lie-euclidean-embeddings-in-the-presence-of-outliers-and-distance-violations-2503.19093"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-illuminating-n-nonoverlapping-circular-discs-boundaries-on-the-plane-with-application-to-tree-stem-illumination-problem-2503.20440</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-illuminating-n-nonoverlapping-circular-discs-boundaries-on-the-plane-with-application-to-tree-stem-illumination-problem-2503.20440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-illuminating-n-nonoverlapping-circular-discs-boundaries-on-the-plane-with-application-to-tree-stem-illumination-problem-2503.20440"/></url>
<url><loc>https://scifaro.com/en/abs/surface-guided-analysis-of-breast-changes-during-post-operative-radiotherapy-by-using-a-functional-map-framework-2503.21317</loc><lastmod>2025-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-guided-analysis-of-breast-changes-during-post-operative-radiotherapy-by-using-a-functional-map-framework-2503.21317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-guided-analysis-of-breast-changes-during-post-operative-radiotherapy-by-using-a-functional-map-framework-2503.21317"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-the-directional-extremal-boundary-of-a-union-of-equal-radius-circles-2503.21711</loc><lastmod>2025-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-the-directional-extremal-boundary-of-a-union-of-equal-radius-circles-2503.21711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-the-directional-extremal-boundary-of-a-union-of-equal-radius-circles-2503.21711"/></url>
<url><loc>https://scifaro.com/en/abs/polychromatic-coloring-of-tuples-in-hypergraphs-2503.22449</loc><lastmod>2025-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polychromatic-coloring-of-tuples-in-hypergraphs-2503.22449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polychromatic-coloring-of-tuples-in-hypergraphs-2503.22449"/></url>
<url><loc>https://scifaro.com/en/abs/simplification-of-trajectory-streams-2503.23025</loc><lastmod>2025-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplification-of-trajectory-streams-2503.23025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplification-of-trajectory-streams-2503.23025"/></url>
<url><loc>https://scifaro.com/en/abs/matching-random-colored-points-with-rectangles-corrigendum-2504.00067</loc><lastmod>2025-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-random-colored-points-with-rectangles-corrigendum-2504.00067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-random-colored-points-with-rectangles-corrigendum-2504.00067"/></url>
<url><loc>https://scifaro.com/en/abs/determining-sphere-radius-through-pairwise-distances-2504.02334</loc><lastmod>2025-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determining-sphere-radius-through-pairwise-distances-2504.02334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determining-sphere-radius-through-pairwise-distances-2504.02334"/></url>
<url><loc>https://scifaro.com/en/abs/instance-optimal-imprecise-convex-hull-2504.02611</loc><lastmod>2025-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instance-optimal-imprecise-convex-hull-2504.02611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instance-optimal-imprecise-convex-hull-2504.02611"/></url>
<url><loc>https://scifaro.com/en/abs/investigating-simple-drawings-of-k-n-using-sat-2504.02650</loc><lastmod>2025-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/investigating-simple-drawings-of-k-n-using-sat-2504.02650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/investigating-simple-drawings-of-k-n-using-sat-2504.02650"/></url>
<url><loc>https://scifaro.com/en/abs/finding-a-shortest-curve-that-separates-few-objects-from-many-2504.03558</loc><lastmod>2025-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-a-shortest-curve-that-separates-few-objects-from-many-2504.03558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-a-shortest-curve-that-separates-few-objects-from-many-2504.03558"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-of-a-triangular-delaunay-mesh-generator-using-reinforcement-learning-2504.03610</loc><lastmod>2025-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-of-a-triangular-delaunay-mesh-generator-using-reinforcement-learning-2504.03610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-of-a-triangular-delaunay-mesh-generator-using-reinforcement-learning-2504.03610"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-optimal-bound-for-the-interleaving-distance-on-mapper-graphs-2504.03865</loc><lastmod>2026-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-optimal-bound-for-the-interleaving-distance-on-mapper-graphs-2504.03865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-optimal-bound-for-the-interleaving-distance-on-mapper-graphs-2504.03865"/></url>
<url><loc>https://scifaro.com/en/abs/minimum-non-obtuse-triangulations-the-cg-shop-challenge-2025-2504.04412</loc><lastmod>2025-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimum-non-obtuse-triangulations-the-cg-shop-challenge-2025-2504.04412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimum-non-obtuse-triangulations-the-cg-shop-challenge-2025-2504.04412"/></url>
<url><loc>https://scifaro.com/en/abs/shelling-and-sinking-graphs-on-the-sphere-2504.05098</loc><lastmod>2025-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shelling-and-sinking-graphs-on-the-sphere-2504.05098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shelling-and-sinking-graphs-on-the-sphere-2504.05098"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-bounded-hop-spanners-for-geometric-intersection-graphs-2504.05861</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-bounded-hop-spanners-for-geometric-intersection-graphs-2504.05861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-bounded-hop-spanners-for-geometric-intersection-graphs-2504.05861"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-bipartite-matching-based-exact-algorithms-for-server-problems-2504.06079</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-bipartite-matching-based-exact-algorithms-for-server-problems-2504.06079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-bipartite-matching-based-exact-algorithms-for-server-problems-2504.06079"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-combine-and-conquer-and-its-applications-to-sublinear-quantum-convex-hull-and-maxima-set-construction-2504.06376</loc><lastmod>2025-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-combine-and-conquer-and-its-applications-to-sublinear-quantum-convex-hull-and-maxima-set-construction-2504.06376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-combine-and-conquer-and-its-applications-to-sublinear-quantum-convex-hull-and-maxima-set-construction-2504.06376"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-graphs-as-euclidean-knn-graphs-2504.06503</loc><lastmod>2025-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-graphs-as-euclidean-knn-graphs-2504.06503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-graphs-as-euclidean-knn-graphs-2504.06503"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-color-voronoi-diagrams-and-the-colorful-clarkson-shor-framework-2504.06960</loc><lastmod>2025-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-color-voronoi-diagrams-and-the-colorful-clarkson-shor-framework-2504.06960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-color-voronoi-diagrams-and-the-colorful-clarkson-shor-framework-2504.06960"/></url>
<url><loc>https://scifaro.com/en/abs/convexity-helps-iterated-search-in-3d-2504.07545</loc><lastmod>2025-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convexity-helps-iterated-search-in-3d-2504.07545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convexity-helps-iterated-search-in-3d-2504.07545"/></url>
<url><loc>https://scifaro.com/en/abs/soap-film-inspired-subdivisional-lattice-structure-construction-2504.08847</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soap-film-inspired-subdivisional-lattice-structure-construction-2504.08847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soap-film-inspired-subdivisional-lattice-structure-construction-2504.08847"/></url>
<url><loc>https://scifaro.com/en/abs/commutative-algebra-enhanced-topological-data-analysis-2504.09174</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/commutative-algebra-enhanced-topological-data-analysis-2504.09174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/commutative-algebra-enhanced-topological-data-analysis-2504.09174"/></url>
<url><loc>https://scifaro.com/en/abs/square-packing-with-asymptotically-smallest-waste-only-needs-good-squares-2504.09489</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-packing-with-asymptotically-smallest-waste-only-needs-good-squares-2504.09489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-packing-with-asymptotically-smallest-waste-only-needs-good-squares-2504.09489"/></url>
<url><loc>https://scifaro.com/en/abs/counting-number-of-triangulations-of-point-sets-reinterpreting-and-generalizing-the-triangulation-polynomials-2504.09615</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-number-of-triangulations-of-point-sets-reinterpreting-and-generalizing-the-triangulation-polynomials-2504.09615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-number-of-triangulations-of-point-sets-reinterpreting-and-generalizing-the-triangulation-polynomials-2504.09615"/></url>
<url><loc>https://scifaro.com/en/abs/epsilon-neighborhood-decision-boundary-governed-estimation-edge-of-2d-black-box-classifier-functions-2504.09733</loc><lastmod>2026-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epsilon-neighborhood-decision-boundary-governed-estimation-edge-of-2d-black-box-classifier-functions-2504.09733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epsilon-neighborhood-decision-boundary-governed-estimation-edge-of-2d-black-box-classifier-functions-2504.09733"/></url>
<url><loc>https://scifaro.com/en/abs/balanced-tsp-partitioning-2504.10657</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balanced-tsp-partitioning-2504.10657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balanced-tsp-partitioning-2504.10657"/></url>
<url><loc>https://scifaro.com/en/abs/a-sublinear-algorithm-for-path-feasibility-among-rectangular-obstacles-2504.10859</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sublinear-algorithm-for-path-feasibility-among-rectangular-obstacles-2504.10859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sublinear-algorithm-for-path-feasibility-among-rectangular-obstacles-2504.10859"/></url>
<url><loc>https://scifaro.com/en/abs/braiding-vineyards-2504.11203</loc><lastmod>2026-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/braiding-vineyards-2504.11203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/braiding-vineyards-2504.11203"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-and-approximation-schemes-for-discrete-packing-and-domination-2504.12022</loc><lastmod>2025-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-and-approximation-schemes-for-discrete-packing-and-domination-2504.12022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-and-approximation-schemes-for-discrete-packing-and-domination-2504.12022"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-the-shortest-vector-problem-in-2-dimensional-lattices-revisited-2504.12948</loc><lastmod>2025-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-the-shortest-vector-problem-in-2-dimensional-lattices-revisited-2504.12948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-the-shortest-vector-problem-in-2-dimensional-lattices-revisited-2504.12948"/></url>
<url><loc>https://scifaro.com/en/abs/a-near-linear-time-exact-algorithm-for-the-l-1-geodesic-fr-echet-distance-between-two-curves-on-the-boundary-of-a-simple-polygon-2504.13704</loc><lastmod>2025-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-near-linear-time-exact-algorithm-for-the-l-1-geodesic-fr-echet-distance-between-two-curves-on-the-boundary-of-a-simple-polygon-2504.13704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-near-linear-time-exact-algorithm-for-the-l-1-geodesic-fr-echet-distance-between-two-curves-on-the-boundary-of-a-simple-polygon-2504.13704"/></url>
<url><loc>https://scifaro.com/en/abs/the-mid-sphere-cousin-of-the-medial-axis-transform-2504.14743</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mid-sphere-cousin-of-the-medial-axis-transform-2504.14743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mid-sphere-cousin-of-the-medial-axis-transform-2504.14743"/></url>
<url><loc>https://scifaro.com/en/abs/range-counting-oracles-for-geometric-problems-2504.15292</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-counting-oracles-for-geometric-problems-2504.15292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-counting-oracles-for-geometric-problems-2504.15292"/></url>
<url><loc>https://scifaro.com/en/abs/hitting-and-covering-affine-families-of-convex-polyhedra-with-applications-to-robust-optimization-2504.16642</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hitting-and-covering-affine-families-of-convex-polyhedra-with-applications-to-robust-optimization-2504.16642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hitting-and-covering-affine-families-of-convex-polyhedra-with-applications-to-robust-optimization-2504.16642"/></url>
<url><loc>https://scifaro.com/en/abs/drainability-and-fillability-of-polyominoes-in-diverse-models-of-global-control-2504.16762</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drainability-and-fillability-of-polyominoes-in-diverse-models-of-global-control-2504.16762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drainability-and-fillability-of-polyominoes-in-diverse-models-of-global-control-2504.16762"/></url>
<url><loc>https://scifaro.com/en/abs/separating-two-points-with-obstacles-in-the-plane-improved-upper-and-lower-bounds-2504.17289</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-two-points-with-obstacles-in-the-plane-improved-upper-and-lower-bounds-2504.17289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-two-points-with-obstacles-in-the-plane-improved-upper-and-lower-bounds-2504.17289"/></url>
<url><loc>https://scifaro.com/en/abs/fr-echet-distance-in-unweighted-planar-graphs-2504.17342</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fr-echet-distance-in-unweighted-planar-graphs-2504.17342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fr-echet-distance-in-unweighted-planar-graphs-2504.17342"/></url>
<url><loc>https://scifaro.com/en/abs/subtrajectory-clustering-and-coverage-maximization-in-cubic-time-or-better-2504.17381</loc><lastmod>2025-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subtrajectory-clustering-and-coverage-maximization-in-cubic-time-or-better-2504.17381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subtrajectory-clustering-and-coverage-maximization-in-cubic-time-or-better-2504.17381"/></url>
<url><loc>https://scifaro.com/en/abs/the-marco-polo-problem-a-combinatorial-approach-to-geometric-localization-2504.17955</loc><lastmod>2025-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-marco-polo-problem-a-combinatorial-approach-to-geometric-localization-2504.17955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-marco-polo-problem-a-combinatorial-approach-to-geometric-localization-2504.17955"/></url>
<url><loc>https://scifaro.com/en/abs/smallest-intersecting-and-enclosing-balls-2504.18178</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smallest-intersecting-and-enclosing-balls-2504.18178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smallest-intersecting-and-enclosing-balls-2504.18178"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-maximum-overlap-of-two-convex-polygons-under-translation-2504.18352</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-maximum-overlap-of-two-convex-polygons-under-translation-2504.18352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-maximum-overlap-of-two-convex-polygons-under-translation-2504.18352"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-reeb-graphs-2504.21329</loc><lastmod>2025-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-reeb-graphs-2504.21329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-reeb-graphs-2504.21329"/></url>
<url><loc>https://scifaro.com/en/abs/relative-position-of-a-parabola-or-a-hyperbola-and-an-ellipse-without-computing-intersection-points-2505.00706</loc><lastmod>2025-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-position-of-a-parabola-or-a-hyperbola-and-an-ellipse-without-computing-intersection-points-2505.00706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-position-of-a-parabola-or-a-hyperbola-and-an-ellipse-without-computing-intersection-points-2505.00706"/></url>
<url><loc>https://scifaro.com/en/abs/a-combinatorial-proof-of-universal-optimality-for-computing-a-planar-convex-hull-2505.01194</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-combinatorial-proof-of-universal-optimality-for-computing-a-planar-convex-hull-2505.01194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-combinatorial-proof-of-universal-optimality-for-computing-a-planar-convex-hull-2505.01194"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-maps-on-oriented-surfaces-2505.01480</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-maps-on-oriented-surfaces-2505.01480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-maps-on-oriented-surfaces-2505.01480"/></url>
<url><loc>https://scifaro.com/en/abs/on-solving-simple-curved-nonograms-2505.01554</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-solving-simple-curved-nonograms-2505.01554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-solving-simple-curved-nonograms-2505.01554"/></url>
<url><loc>https://scifaro.com/en/abs/guarding-terrains-with-guards-on-a-line-2505.02373</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarding-terrains-with-guards-on-a-line-2505.02373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarding-terrains-with-guards-on-a-line-2505.02373"/></url>
<url><loc>https://scifaro.com/en/abs/trajectory-minimum-touching-ball-2505.02472</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trajectory-minimum-touching-ball-2505.02472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trajectory-minimum-touching-ball-2505.02472"/></url>
<url><loc>https://scifaro.com/en/abs/report-on-nearest-dominating-point-queries-2505.04617</loc><lastmod>2025-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/report-on-nearest-dominating-point-queries-2505.04617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/report-on-nearest-dominating-point-queries-2505.04617"/></url>
<url><loc>https://scifaro.com/en/abs/designing-3d-anisotropic-frame-fields-with-odeco-tensors-2505.05639</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/designing-3d-anisotropic-frame-fields-with-odeco-tensors-2505.05639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/designing-3d-anisotropic-frame-fields-with-odeco-tensors-2505.05639"/></url>
<url><loc>https://scifaro.com/en/abs/orthogonal-emptiness-queries-for-random-points-2505.06090</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthogonal-emptiness-queries-for-random-points-2505.06090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthogonal-emptiness-queries-for-random-points-2505.06090"/></url>
<url><loc>https://scifaro.com/en/abs/a-wspd-separator-and-small-tree-cover-for-c-packed-graphs-2505.06884</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-wspd-separator-and-small-tree-cover-for-c-packed-graphs-2505.06884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-wspd-separator-and-small-tree-cover-for-c-packed-graphs-2505.06884"/></url>
<url><loc>https://scifaro.com/en/abs/hand-shadow-poser-2505.07012</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hand-shadow-poser-2505.07012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hand-shadow-poser-2505.07012"/></url>
<url><loc>https://scifaro.com/en/abs/all-polyhedral-manifolds-are-connected-by-a-2-step-refolding-2505.07147</loc><lastmod>2025-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-polyhedral-manifolds-are-connected-by-a-2-step-refolding-2505.07147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-polyhedral-manifolds-are-connected-by-a-2-step-refolding-2505.07147"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-toolpath-generation-for-functionally-graded-additive-manufacturing-via-gradient-informed-slicing-2505.08093</loc><lastmod>2025-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-toolpath-generation-for-functionally-graded-additive-manufacturing-via-gradient-informed-slicing-2505.08093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-toolpath-generation-for-functionally-graded-additive-manufacturing-via-gradient-informed-slicing-2505.08093"/></url>
<url><loc>https://scifaro.com/en/abs/even-faster-algorithm-for-the-chamfer-distance-2505.08957</loc><lastmod>2025-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/even-faster-algorithm-for-the-chamfer-distance-2505.08957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/even-faster-algorithm-for-the-chamfer-distance-2505.08957"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-the-directed-hausdorff-distance-2505.09046</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-the-directed-hausdorff-distance-2505.09046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-the-directed-hausdorff-distance-2505.09046"/></url>
<url><loc>https://scifaro.com/en/abs/topology-driven-identification-of-repetitions-in-multi-variate-time-series-2505.10004</loc><lastmod>2025-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-driven-identification-of-repetitions-in-multi-variate-time-series-2505.10004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-driven-identification-of-repetitions-in-multi-variate-time-series-2505.10004"/></url>
<url><loc>https://scifaro.com/en/abs/tracking-low-level-cloud-systems-with-topology-2505.10850</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracking-low-level-cloud-systems-with-topology-2505.10850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracking-low-level-cloud-systems-with-topology-2505.10850"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-approach-for-computing-the-diameter-of-a-point-set-2505.11317</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-approach-for-computing-the-diameter-of-a-point-set-2505.11317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-approach-for-computing-the-diameter-of-a-point-set-2505.11317"/></url>
</urlset>