Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDSergio Cabello
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j63]Sergio Cabello
, Wolfgang Mulzer:
Minimum cuts in geometric intersection graphs. Comput. Geom. 94: 101720 (2021)- [i34]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long plane trees. CoRR abs/2101.00445 (2021) - 2020
- [j62]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82(10): 3018-3040 (2020) - [j61]Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum shared-power edge cut. Networks 75(3): 321-333 (2020) - [j60]Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. Theor. Comput. Sci. 835: 120-133 (2020) - [c43]Sergio Cabello:
Some Open Problems in Computational Geometry (Invited Talk). MFCS 2020: 2:1-2:6 - [c42]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. STACS 2020: 31:1-31:17 - [e1]Sergio Cabello, Danny Z. Chen:
36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland. LIPIcs 164, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-143-6 [contents] - [i33]Sergio Cabello, Wolfgang Mulzer:
Minimum Cuts in Geometric Intersection Graphs. CoRR abs/2005.00858 (2020) - [i32]Édouard Bonnet, Sergio Cabello:
The Complexity of Mixed-Connectivity. CoRR abs/2010.04799 (2020) - [i31]Sergio Cabello:
Faster Distance-Based Representative Skyline and $k$-Center Along Pareto Front in the Plane. CoRR abs/2012.15381 (2020)
2010 – 2019
- 2019
- [j59]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. J. Comput. Geom. 10(1): 207-222 (2019) - [j58]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. 33(4): 2092-2110 (2019) - [j57]Sergio Cabello:
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. ACM Trans. Algorithms 15(2): 21:1-21:38 (2019) - [c41]Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. Symposium on Computational Geometry 2019: 20:1-20:19 - [c40]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c39]Jong Min Choi, Sergio Cabello, Hee-Kap Ahn:
Maximizing Dominance in the Plane and Its Applications. WADS 2019: 325-338 - [i30]Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms:
Encoding 3SUM. CoRR abs/1903.02645 (2019) - [i29]Sergio Cabello:
Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. CoRR abs/1908.01317 (2019) - [i28]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. CoRR abs/1910.02123 (2019) - [i27]Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. CoRR abs/1910.04228 (2019) - 2018
- [j56]Sergio Cabello, Lazar Milinkovic:
Two optimization problems for unit disks. Comput. Geom. 70-71: 1-12 (2018) - [j55]Andrej Brodnik, Sergio Cabello:
Editorial: EuroCG2015. Comput. Geom. 73: 1 (2018) - [j54]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. 22(1): 23-49 (2018) - [c38]Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. Symposium on Computational Geometry 2018: 6:1-6:13 - [i26]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR abs/1802.07175 (2018) - [i25]Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. CoRR abs/1803.00849 (2018) - [i24]Sergio Cabello:
Computing Shapley values in the plane. CoRR abs/1804.03894 (2018) - [i23]Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum Shared-Power Edge Cut. CoRR abs/1806.04742 (2018) - [i22]Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. CoRR abs/1810.09232 (2018) - [i21]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The inverse Voronoi problem in graphs. CoRR abs/1811.12547 (2018) - 2017
- [j53]Sergio Cabello, Miha Jejcic:
Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. J. Comb. 24(1): P1.33 (2017) - [j52]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27(3): 159-176 (2017) - [j51]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46(5): 1574-1602 (2017) - [j50]Sergio Cabello, Pablo Pérez-Lantero:
Interval selection in the streaming model. Theor. Comput. Sci. 702: 77-96 (2017) - [c37]Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. Symposium on Computational Geometry 2017: 22:1-22:15 - [c36]Sergio Cabello:
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. SODA 2017: 2143-2152 - [c35]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS 2017: 18:1-18:14 - [i20]Sergio Cabello, Lazar Milinkovic:
Two Optimization Problems for Unit Disks. CoRR abs/1702.03266 (2017) - [i19]Sergio Cabello:
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. CoRR abs/1702.07815 (2017) - 2016
- [j49]Sergio Cabello, Panos Giannopoulos:
The Complexity of Separating Points in the Plane. Algorithmica 74(2): 643-663 (2016) - [j48]Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf:
Finding largest rectangles in convex polygons. Comput. Geom. 51: 67-74 (2016) - [j47]Sergio Cabello, Miha Jejcic:
Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. Notes Discret. Math. 54: 223-228 (2016) - [j46]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. 7(1): 123-148 (2016) - [i18]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. CoRR abs/1612.02149 (2016) - 2015
- [j45]Sergio Cabello, Miha Jejcic:
Shortest paths in intersection graphs of unit disks. Comput. Geom. 48(4): 360-367 (2015) - [j44]Sergio Cabello, David Gajser:
Simple PTAS's for families of graphs excluding a minor. Discret. Appl. Math. 189: 41-48 (2015) - [j43]Sergio Cabello, Maria Saumell:
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discret. Math. Theor. Comput. Sci. 17(1): 1-12 (2015) - [j42]Sergio Cabello, Bojan Mohar, Robert Sámal:
Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. 49: 779-786 (2015) - [c34]Drago Bokal, Sergio Cabello, David Eppstein:
Finding All Maximal Subsequences with Hereditary Properties. Symposium on Computational Geometry 2015: 240-254 - [c33]Sergio Cabello, Michael Kerber:
Semi-dynamic Connectivity in the Plane. WADS 2015: 115-126 - [c32]Sergio Cabello, Pablo Pérez-Lantero:
Interval Selection in the Streaming Model. WADS 2015: 127-139 - [i17]Sergio Cabello, Pablo Pérez-Lantero:
Interval Selection in the Streaming Model. CoRR abs/1501.02285 (2015) - [i16]Sergio Cabello, Michael Kerber:
Semi-dynamic connectivity in the plane. CoRR abs/1502.03690 (2015) - 2014
- [j41]Sergio Cabello, Markus Chimani, Petr Hlinený:
Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. 28(3): 1391-1401 (2014) - [c31]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling Potatoes Near-Optimally in Near-Linear Time. Symposium on Computational Geometry 2014: 224 - [i15]Sergio Cabello, Miha Jejcic:
Shortest Paths in Intersection Graphs of Unit Disks. CoRR abs/1402.4855 (2014) - [i14]Sergio Cabello, Otfried Cheong, Lena Schlipf:
Finding Largest Rectangles in Convex Polygons. CoRR abs/1405.1223 (2014) - [i13]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling potatoes near-optimally in near-linear time. CoRR abs/1406.1368 (2014) - [i12]Sergio Cabello, David Gajser:
Simple PTAS's for families of graphs excluding a minor. CoRR abs/1410.5778 (2014) - 2013
- [j40]Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero:
Covering a bichromatic point set with two disjoint monochromatic disks. Comput. Geom. 46(3): 203-212 (2013) - [j39]Sergio Cabello:
Hardness of Approximation for Crossing Number. Discret. Comput. Geom. 49(2): 348-358 (2013) - [j38]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. 50(3): 771-783 (2013) - [j37]Sergio Cabello, Erin W. Chambers, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42(4): 1542-1571 (2013) - [j36]Sergio Cabello, Bojan Mohar:
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. SIAM J. Comput. 42(5): 1803-1829 (2013) - [c30]Sergio Cabello, Panos Giannopoulos:
The complexity of separating points in the plane. Symposium on Computational Geometry 2013: 379-386 - [c29]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. WADS 2013: 97-108 - [i11]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. CoRR abs/1304.5591 (2013) - 2012
- [j35]Sergio Cabello:
Many Distances in Planar Graphs. Algorithmica 62(1-2): 361-381 (2012) - [j34]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Algorithms for the edge-width of an embedded graph. Comput. Geom. 45(5-6): 215-224 (2012) - [j33]Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura:
The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012) - [j32]Paul Bendich, Sergio Cabello, Herbert Edelsbrunner:
A point calculus for interlevel set homology. Pattern Recognit. Lett. 33(11): 1436-1444 (2012) - [c28]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. ESA 2012: 241-252 - [c27]Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang:
Annotating Simplices with a Homology Basis and Its Applications. SWAT 2012: 189-200 - [i10]Sergio Cabello, Erin W. Chambers, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. CoRR abs/1202.0314 (2012) - [i9]Sergio Cabello, Bojan Mohar:
Adding one edge to planar graphs makes crossing number and 1-planarity hard. CoRR abs/1203.5944 (2012) - [i8]Sergio Cabello:
Hardness of approximation for crossing number. CoRR abs/1204.0660 (2012) - [i7]Sergio Cabello:
Stackelberg Shortest Path Tree Game, Revisited. CoRR abs/1207.2317 (2012) - 2011
- [j31]Sergio Cabello, Bojan Mohar:
Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica 60(3): 484-504 (2011) - [j30]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci Dimension of a Graph. Electron. J. Comb. 18(1) (2011) - [j29]Sergio Cabello, Primoz Luksic:
The Complexity of Obtaining a Distance-Balanced Graph. Electron. J. Comb. 18(1) (2011) - [j28]Sergio Cabello, Marko Jakovac:
On the b-chromatic number of regular graphs. Discret. Appl. Math. 159(13): 1303-1310 (2011) - [j27]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. 15(1): 79-96 (2011) - [j26]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discret. Math. 25(4): 1600-1614 (2011) - [j25]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote:
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7(4): 43:1-43:27 (2011) - [i6]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum cell connection and separation in line segment arrangements. CoRR abs/1104.4618 (2011) - [i5]Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang:
Annotating Simplices with a Homology Basis and Its Applications. CoRR abs/1107.3793 (2011) - [i4]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. CoRR abs/1111.5986 (2011) - 2010
- [j24]Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann:
Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58(3): 543-565 (2010) - [j23]Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood:
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010) - [j22]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura:
Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Oper. Res. 202(1): 99-106 (2010) - [j21]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [j20]Sergio Cabello, Günter Rote:
Obnoxious Centers in Graphs. SIAM J. Discret. Math. 24(4): 1713-1730 (2010) - [j19]Sergio Cabello:
Finding shortest contractible and shortest separating cycles in embedded graphs. ACM Trans. Algorithms 6(2): 24:1-24:18 (2010) - [j18]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. ACM Trans. Algorithms 6(4): 61:1-61:13 (2010) - [c26]Sergio Cabello, Bojan Mohar:
Adding one edge to planar graphs makes crossing number hard. Symposium on Computational Geometry 2010: 68-76 - [c25]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Output-sensitive algorithm for the edge-width of an embedded graph. Symposium on Computational Geometry 2010: 147-155 - [c24]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. Symposium on Computational Geometry 2010: 156-165
2000 – 2009
- 2009
- [j17]Sergio Cabello, Christian Knauer:
Algorithms for graphs of bounded treewidth via orthogonal range searching. Comput. Geom. 42(9): 815-824 (2009) - [j16]Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. 19(6): 533-556 (2009) - [j15]Sergio Cabello, Marta Fort, Joan Antoni Sellarès:
Higher-order Voronoi diagrams on triangulated surfaces. Inf. Process. Lett. 109(9): 440-445 (2009) - [j14]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009) - [c23]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c22]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. Graph Drawing 2009: 183-194 - [c21]Sergio Cabello:
Finding shortest contractible and shortest separating cycles in embedded graphs. SODA 2009: 616-624 - [i3]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci dimension of a graph. CoRR abs/0903.2507 (2009) - 2008
- [j13]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. 39(2): 118-133 (2008) - [j12]Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3): 195-206 (2008) - [j11]Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. 105(2): 73-77 (2008) - [c20]Sergio Cabello, Bojan Mohar:
Crossing and Weighted Crossing Number of Near-Planar Graphs. Graph Drawing 2008: 38-49 - [c19]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. SODA 2008: 527-531 - [c18]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA 2008: 836-843 - 2007
- [j10]Sergio Cabello, Bojan Mohar:
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discret. Comput. Geom. 37(2): 213-235 (2007) - [j9]Sergio Cabello:
Approximation algorithms for spreading points. J. Algorithms 62(2): 49-73 (2007) - [j8]Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. 11(1): 259-276 (2007) - [c17]Sergio Cabello, Erin W. Chambers:
Multiple source shortest paths in a genus g graph. SODA 2007: 89-97 - [c16]Sergio Cabello, Günter Rote:
Obnoxious centers in graphs. SODA 2007: 98-107 - 2006
- [j7]Sergio Cabello, Matt DeVos, Bojan Mohar:
Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006) - [j6]Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006) - [j5]Sergio Cabello:
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Algorithms Appl. 10(2): 353-363 (2006) - [c15]Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann:
Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731 - [c14]Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir:
Computing a Center-Transversal Line. FSTTCS 2006: 93-104 - [c13]Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. IWPEC 2006: 175-183 - [c12]Sergio Cabello:
Many distances in planar graphs. SODA 2006: 1213-1220 - [c11]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68 - 2005
- [j4]Sergio Cabello, Mark de Berg, Marc J. van Kreveld:
Schematization of networks. Comput. Geom. 30(3): 223-228 (2005) - [c10]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura:
Reverse facility location problems. CCCG 2005: 68-71 - [c9]Sergio Cabello, Bojan Mohar:
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142 - [c8]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531 - [i2]Sergio Cabello, Bojan Mohar, Arjana Zitnik:
Homotopic spanners. EuroCG 2005: 25-28 - [i1]