Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sergio Cabello
@article{DBLP:journals/dcg/BonnetCM23,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Wolfgang Mulzer},
title = {Maximum Matchings in Geometric Intersection Graphs},
journal = {Discret. Comput. Geom.},
volume = {70},
number = {3},
pages = {550--579},
year = {2023},
url = {https://doi.org/10.1007/s00454-023-00564-3},
doi = {10.1007/S00454-023-00564-3},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BonnetCM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/Cabello23,
author = {Sergio Cabello},
title = {Faster distance-based representative skyline and k-center along pareto
front in the plane},
journal = {J. Glob. Optim.},
volume = {86},
number = {2},
pages = {441--466},
year = {2023},
url = {https://doi.org/10.1007/s10898-023-01280-1},
doi = {10.1007/S10898-023-01280-1},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/Cabello23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CabelloG23,
author = {Sergio Cabello and
Panos Giannopoulos},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {On k-Means for Segments and Polylines},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {28:1--28:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.28},
doi = {10.4230/LIPICS.ESA.2023.28},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/CabelloG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-10028,
author = {Sergio Cabello and
David Gajser},
title = {Connectivity with uncertainty regions given as line segments},
journal = {CoRR},
volume = {abs/2303.10028},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.10028},
doi = {10.48550/ARXIV.2303.10028},
eprinttype = {arXiv},
eprint = {2303.10028},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-10028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-10922,
author = {Sergio Cabello and
Panos Giannopoulos},
title = {On k-means for segments and polylines},
journal = {CoRR},
volume = {abs/2305.10922},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.10922},
doi = {10.48550/ARXIV.2305.10922},
eprinttype = {arXiv},
eprint = {2305.10922},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-10922.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-02637,
author = {Sergio Cabello and
Siu{-}Wing Cheng and
Otfried Cheong and
Christian Knauer},
title = {Geometric Assignment and Geometric Bottleneck},
journal = {CoRR},
volume = {abs/2310.02637},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.02637},
doi = {10.48550/ARXIV.2310.02637},
eprinttype = {arXiv},
eprint = {2310.02637},
timestamp = {Thu, 19 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-02637.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-01935,
author = {Sergio Cabello and
{\'{E}}va Czabarka and
Ruy Fabila Monroy and
Yuya Higashikawa and
Raimund Seidel and
L{\'{a}}szl{\'{o}} Sz{\'{e}}kely and
Josef Tkadlec and
Alexandra Wesolek},
title = {A Note on the 2-Colored Rectilinear Crossing Number of Random Point
Sets in the Unit Square},
journal = {CoRR},
volume = {abs/2312.01935},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.01935},
doi = {10.48550/ARXIV.2312.01935},
eprinttype = {arXiv},
eprint = {2312.01935},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-01935.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/CabelloC22,
author = {Sergio Cabello and
Timothy M. Chan},
title = {Computing Shapley Values in the Plane},
journal = {Discret. Comput. Geom.},
volume = {67},
number = {3},
pages = {843--881},
year = {2022},
url = {https://doi.org/10.1007/s00454-021-00368-3},
doi = {10.1007/S00454-021-00368-3},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/CabelloC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/CabelloC22a,
author = {Sergio Cabello and
Danny Z. Chen},
title = {Guest Editors' Foreword},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {4},
pages = {945--948},
year = {2022},
url = {https://doi.org/10.1007/s00454-022-00435-3},
doi = {10.1007/S00454-022-00435-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/CabelloC22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pmh/CabelloCD22,
author = {Sergio Cabello and
Otfried Cheong and
Michael Gene Dobbins},
title = {The inverse Kakeya problem},
journal = {Period. Math. Hung.},
volume = {84},
number = {1},
pages = {70--75},
year = {2022},
url = {https://doi.org/10.1007/s10998-021-00392-z},
doi = {10.1007/S10998-021-00392-Z},
timestamp = {Fri, 25 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pmh/CabelloCD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Cabello22,
author = {Sergio Cabello},
title = {Computing the Inverse Geodesic Length in Planar Graphs and Graphs
of Bounded Treewidth},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {2},
pages = {14:1--14:26},
year = {2022},
url = {https://doi.org/10.1145/3501303},
doi = {10.1145/3501303},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Cabello22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Cabello0KMT22,
author = {Sergio Cabello and
Michael Hoffmann and
Katharina Klost and
Wolfgang Mulzer and
Josef Tkadlec},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Long Plane Trees},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {23:1--23:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.23},
doi = {10.4230/LIPICS.SOCG.2022.23},
timestamp = {Wed, 01 Jun 2022 16:45:26 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Cabello0KMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetCMP21,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Bojan Mohar and
Hebert P{\'{e}}rez{-}Ros{\'{e}}s},
title = {The Inverse Voronoi Problem in Graphs {II:} Trees},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1165--1200},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00774-8},
doi = {10.1007/S00453-020-00774-8},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetCMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiniazCCCMMS21,
author = {Ahmad Biniaz and
Sergio Cabello and
Paz Carmi and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Saeed Mehrabi and
Michiel Smid},
title = {On the Minimum Consistent Subset Problem},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2273--2302},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00825-8},
doi = {10.1007/S00453-021-00825-8},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiniazCCCMMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChoiCA21,
author = {Jongmin Choi and
Sergio Cabello and
Hee{-}Kap Ahn},
title = {Maximizing Dominance in the Plane and its Applications},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3491--3513},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00863-2},
doi = {10.1007/S00453-021-00863-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChoiCA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BonnetC21,
author = {{\'{E}}douard Bonnet and
Sergio Cabello},
title = {The complexity of mixed-connectivity},
journal = {Ann. Oper. Res.},
volume = {307},
number = {1},
pages = {25--35},
year = {2021},
url = {https://doi.org/10.1007/s10479-021-04330-7},
doi = {10.1007/S10479-021-04330-7},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/BonnetC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloM21,
author = {Sergio Cabello and
Wolfgang Mulzer},
title = {Minimum cuts in geometric intersection graphs},
journal = {Comput. Geom.},
volume = {94},
pages = {101720},
year = {2021},
url = {https://doi.org/10.1016/j.comgeo.2020.101720},
doi = {10.1016/J.COMGEO.2020.101720},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CabelloDDM21,
author = {Sergio Cabello and
Arun Kumar Das and
Sandip Das and
Joydeep Mukherjee},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Finding a Largest-Area Triangle in a Terrain in Near-Linear Time},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {258--270},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_19},
doi = {10.1007/978-3-030-83508-8\_19},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/CabelloDDM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-00445,
author = {Sergio Cabello and
Michael Hoffmann and
Katharina Klost and
Wolfgang Mulzer and
Josef Tkadlec},
title = {Long plane trees},
journal = {CoRR},
volume = {abs/2101.00445},
year = {2021},
url = {https://arxiv.org/abs/2101.00445},
eprinttype = {arXiv},
eprint = {2101.00445},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-00445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11420,
author = {Sergio Cabello and
Arun Kumar Das and
Sandip Das and
Joydeep Mukherjee},
title = {Finding a Largest-Area Triangle in a Terrain in Near-Linear Time},
journal = {CoRR},
volume = {abs/2104.11420},
year = {2021},
url = {https://arxiv.org/abs/2104.11420},
eprinttype = {arXiv},
eprint = {2104.11420},
timestamp = {Tue, 13 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-11420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BonnetCMP20,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Bojan Mohar and
Hebert P{\'{e}}rez{-}Ros{\'{e}}s},
title = {The Inverse Voronoi Problem in Graphs {I:} Hardness},
journal = {Algorithmica},
volume = {82},
number = {10},
pages = {3018--3040},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00716-4},
doi = {10.1007/S00453-020-00716-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BonnetCMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CabelloJLM20,
author = {Sergio Cabello and
Kshitij Jain and
Anna Lubiw and
Debajyoti Mondal},
title = {Minimum shared-power edge cut},
journal = {Networks},
volume = {75},
number = {3},
pages = {321--333},
year = {2020},
url = {https://doi.org/10.1002/net.21928},
doi = {10.1002/NET.21928},
timestamp = {Thu, 15 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CabelloJLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CabelloV20,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Hardness of Minimum Barrier Shrinkage and Minimum Installation Path},
journal = {Theor. Comput. Sci.},
volume = {835},
pages = {120--133},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.06.016},
doi = {10.1016/J.TCS.2020.06.016},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CabelloV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Cabello20,
author = {Sergio Cabello},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Some Open Problems in Computational Geometry (Invited Talk)},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {2:1--2:6},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.2},
doi = {10.4230/LIPICS.MFCS.2020.2},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/Cabello20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BonnetCM20,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Wolfgang Mulzer},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Maximum Matchings in Geometric Intersection Graphs},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {31:1--31:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.31},
doi = {10.4230/LIPICS.STACS.2020.31},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BonnetCM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2020,
editor = {Sergio Cabello and
Danny Z. Chen},
title = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-143-6},
isbn = {978-3-95977-143-6},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-00858,
author = {Sergio Cabello and
Wolfgang Mulzer},
title = {Minimum Cuts in Geometric Intersection Graphs},
journal = {CoRR},
volume = {abs/2005.00858},
year = {2020},
url = {https://arxiv.org/abs/2005.00858},
eprinttype = {arXiv},
eprint = {2005.00858},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-00858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-04799,
author = {{\'{E}}douard Bonnet and
Sergio Cabello},
title = {The Complexity of Mixed-Connectivity},
journal = {CoRR},
volume = {abs/2010.04799},
year = {2020},
url = {https://arxiv.org/abs/2010.04799},
eprinttype = {arXiv},
eprint = {2010.04799},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-04799.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-15381,
author = {Sergio Cabello},
title = {Faster Distance-Based Representative Skyline and {\textdollar}k{\textdollar}-Center
Along Pareto Front in the Plane},
journal = {CoRR},
volume = {abs/2012.15381},
year = {2020},
url = {https://arxiv.org/abs/2012.15381},
eprinttype = {arXiv},
eprint = {2012.15381},
timestamp = {Fri, 08 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-15381.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BergCCEK19,
author = {Mark de Berg and
Sergio Cabello and
Otfried Cheong and
David Eppstein and
Christian Knauer},
title = {Covering many points with a small-area box},
journal = {J. Comput. Geom.},
volume = {10},
number = {1},
pages = {207--222},
year = {2019},
url = {https://doi.org/10.20382/jocg.v10i1a8},
doi = {10.20382/JOCG.V10I1A8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/BergCCEK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BurtonCKP19,
author = {Benjamin A. Burton and
Sergio Cabello and
Stefan Kratsch and
William Pettersson},
title = {The Parameterized Complexity of Finding a 2-Sphere in a Simplicial
Complex},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {4},
pages = {2092--2110},
year = {2019},
url = {https://doi.org/10.1137/18M1168704},
doi = {10.1137/18M1168704},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BurtonCKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Cabello19,
author = {Sergio Cabello},
title = {Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances
in Planar Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {21:1--21:38},
year = {2019},
url = {https://doi.org/10.1145/3218821},
doi = {10.1145/3218821},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Cabello19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloC19,
author = {Sergio Cabello and
Timothy M. Chan},
editor = {Gill Barequet and
Yusu Wang},
title = {Computing Shapley Values in the Plane},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {20:1--20:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.20},
doi = {10.4230/LIPICS.SOCG.2019.20},
timestamp = {Mon, 02 Jan 2023 09:02:13 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiniazCCCM0S19,
author = {Ahmad Biniaz and
Sergio Cabello and
Paz Carmi and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Saeed Mehrabi and
Michiel H. M. Smid},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {On the Minimum Consistent Subset Problem},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {155--167},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_12},
doi = {10.1007/978-3-030-24766-9\_12},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BiniazCCCM0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChoiCA19,
author = {Jong Min Choi and
Sergio Cabello and
Hee{-}Kap Ahn},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Maximizing Dominance in the Plane and Its Applications},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {325--338},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_24},
doi = {10.1007/978-3-030-24766-9\_24},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChoiCA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-02645,
author = {Sergio Cabello and
Jean Cardinal and
John Iacono and
Stefan Langerman and
Pat Morin and
Aur{\'{e}}lien Ooms},
title = {Encoding 3SUM},
journal = {CoRR},
volume = {abs/1903.02645},
year = {2019},
url = {http://arxiv.org/abs/1903.02645},
eprinttype = {arXiv},
eprint = {1903.02645},
timestamp = {Sun, 31 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-02645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-01317,
author = {Sergio Cabello},
title = {Computing the inverse geodesic length in planar graphs and graphs
of bounded treewidth},
journal = {CoRR},
volume = {abs/1908.01317},
year = {2019},
url = {http://arxiv.org/abs/1908.01317},
eprinttype = {arXiv},
eprint = {1908.01317},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-01317.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-02123,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Wolfgang Mulzer},
title = {Maximum Matchings in Geometric Intersection Graphs},
journal = {CoRR},
volume = {abs/1910.02123},
year = {2019},
url = {http://arxiv.org/abs/1910.02123},
eprinttype = {arXiv},
eprint = {1910.02123},
timestamp = {Wed, 09 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-02123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-04228,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Hardness of Minimum Barrier Shrinkage and Minimum Activation Path},
journal = {CoRR},
volume = {abs/1910.04228},
year = {2019},
url = {http://arxiv.org/abs/1910.04228},
eprinttype = {arXiv},
eprint = {1910.04228},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-04228.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloM18,
author = {Sergio Cabello and
Lazar Milinkovic},
title = {Two optimization problems for unit disks},
journal = {Comput. Geom.},
volume = {70-71},
pages = {1--12},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2017.12.001},
doi = {10.1016/J.COMGEO.2017.12.001},
timestamp = {Mon, 29 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BrodnikC18,
author = {Andrej Brodnik and
Sergio Cabello},
title = {Editorial: EuroCG2015},
journal = {Comput. Geom.},
volume = {73},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2018.06.010},
doi = {10.1016/J.COMGEO.2018.06.010},
timestamp = {Mon, 29 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BrodnikC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterCE18,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
title = {Parameterized Complexity of 1-Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {23--49},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00457},
doi = {10.7155/JGAA.00457},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterCE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BaeCCCSY18,
author = {Sang Won Bae and
Sergio Cabello and
Otfried Cheong and
Yoonsung Choi and
Fabian Stehn and
Sang Duk Yoon},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {The Reverse Kakeya Problem},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {6:1--6:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.6},
doi = {10.4230/LIPICS.SOCG.2018.6},
timestamp = {Wed, 16 Jun 2021 12:03:35 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BaeCCCSY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07175,
author = {Benjamin A. Burton and
Sergio Cabello and
Stefan Kratsch and
William Pettersson},
title = {The parameterized complexity of finding a 2-sphere in a simplicial
complex},
journal = {CoRR},
volume = {abs/1802.07175},
year = {2018},
url = {http://arxiv.org/abs/1802.07175},
eprinttype = {arXiv},
eprint = {1802.07175},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00849,
author = {Karl Bringmann and
Sergio Cabello and
Michael T. M. Emmerich},
title = {Maximum Volume Subset Selection for Anchored Boxes},
journal = {CoRR},
volume = {abs/1803.00849},
year = {2018},
url = {http://arxiv.org/abs/1803.00849},
eprinttype = {arXiv},
eprint = {1803.00849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03894,
author = {Sergio Cabello},
title = {Computing Shapley values in the plane},
journal = {CoRR},
volume = {abs/1804.03894},
year = {2018},
url = {http://arxiv.org/abs/1804.03894},
eprinttype = {arXiv},
eprint = {1804.03894},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03894.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04742,
author = {Sergio Cabello and
Kshitij Jain and
Anna Lubiw and
Debajyoti Mondal},
title = {Minimum Shared-Power Edge Cut},
journal = {CoRR},
volume = {abs/1806.04742},
year = {2018},
url = {http://arxiv.org/abs/1806.04742},
eprinttype = {arXiv},
eprint = {1806.04742},
timestamp = {Thu, 15 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04742.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-09232,
author = {Ahmad Biniaz and
Sergio Cabello and
Anil Maheshwari and
Paz Carmi and
Saeed Mehrabi and
Jean{-}Lou De Carufel and
Michiel H. M. Smid},
title = {On the Minimum Consistent Subset Problem},
journal = {CoRR},
volume = {abs/1810.09232},
year = {2018},
url = {http://arxiv.org/abs/1810.09232},
eprinttype = {arXiv},
eprint = {1810.09232},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-09232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12547,
author = {{\'{E}}douard Bonnet and
Sergio Cabello and
Bojan Mohar and
Hebert P{\'{e}}rez{-}Ros{\'{e}}s},
title = {The inverse Voronoi problem in graphs},
journal = {CoRR},
volume = {abs/1811.12547},
year = {2018},
url = {http://arxiv.org/abs/1811.12547},
eprinttype = {arXiv},
eprint = {1811.12547},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-12547.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CabelloJ17,
author = {Sergio Cabello and
Miha Jejcic},
title = {Refining the Hierarchies of Classes of Geometric Intersection Graphs},
journal = {Electron. J. Comb.},
volume = {24},
number = {1},
pages = {1},
year = {2017},
url = {https://doi.org/10.37236/6040},
doi = {10.37236/6040},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CabelloJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/AltCGK17,
author = {Helmut Alt and
Sergio Cabello and
Panos Giannopoulos and
Christian Knauer},
title = {Minimum Cell Connection in Line Segment Arrangements},
journal = {Int. J. Comput. Geom. Appl.},
volume = {27},
number = {3},
pages = {159--176},
year = {2017},
url = {https://doi.org/10.1142/S0218195917500017},
doi = {10.1142/S0218195917500017},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/AltCGK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloCKSV17,
author = {Sergio Cabello and
Josef Cibulka and
Jan Kyncl and
Maria Saumell and
Pavel Valtr},
title = {Peeling Potatoes Near-Optimally in Near-Linear Time},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {5},
pages = {1574--1602},
year = {2017},
url = {https://doi.org/10.1137/16M1079695},
doi = {10.1137/16M1079695},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CabelloCKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CabelloP17,
author = {Sergio Cabello and
Pablo P{\'{e}}rez{-}Lantero},
title = {Interval selection in the streaming model},
journal = {Theor. Comput. Sci.},
volume = {702},
pages = {77--96},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.08.015},
doi = {10.1016/J.TCS.2017.08.015},
timestamp = {Fri, 24 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CabelloP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannCE17,
author = {Karl Bringmann and
Sergio Cabello and
Michael T. M. Emmerich},
editor = {Boris Aronov and
Matthew J. Katz},
title = {Maximum Volume Subset Selection for Anchored Boxes},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.22},
doi = {10.4230/LIPICS.SOCG.2017.22},
timestamp = {Wed, 16 Jun 2021 12:03:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannCE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Cabello17,
author = {Sergio Cabello},
editor = {Philip N. Klein},
title = {Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances
in Planar Graphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2143--2152},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.139},
doi = {10.1137/1.9781611974782.139},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/Cabello17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BurtonCKP17,
author = {Benjamin A. Burton and
Sergio Cabello and
Stefan Kratsch and
William Pettersson},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {The Parameterized Complexity of Finding a 2-Sphere in a Simplicial
Complex},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.18},
doi = {10.4230/LIPICS.STACS.2017.18},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BurtonCKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloM17,
author = {Sergio Cabello and
Lazar Milinkovic},
title = {Two Optimization Problems for Unit Disks},
journal = {CoRR},
volume = {abs/1702.03266},
year = {2017},
url = {http://arxiv.org/abs/1702.03266},
eprinttype = {arXiv},
eprint = {1702.03266},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CabelloM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cabello17,
author = {Sergio Cabello},
title = {Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances
in Planar Graphs},
journal = {CoRR},
volume = {abs/1702.07815},
year = {2017},
url = {http://arxiv.org/abs/1702.07815},
eprinttype = {arXiv},
eprint = {1702.07815},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cabello17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CabelloG16,
author = {Sergio Cabello and
Panos Giannopoulos},
title = {The Complexity of Separating Points in the Plane},
journal = {Algorithmica},
volume = {74},
number = {2},
pages = {643--663},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9965-6},
doi = {10.1007/S00453-014-9965-6},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CabelloG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloCKS16,
author = {Sergio Cabello and
Otfried Cheong and
Christian Knauer and
Lena Schlipf},
title = {Finding largest rectangles in convex polygons},
journal = {Comput. Geom.},
volume = {51},
pages = {67--74},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2015.08.001},
doi = {10.1016/J.COMGEO.2015.08.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloCKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CabelloJ16,
author = {Sergio Cabello and
Miha Jejcic},
title = {Refining the Hierarchies of Classes of Geometric Intersection Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {54},
pages = {223--228},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.09.039},
doi = {10.1016/J.ENDM.2016.09.039},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CabelloJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/CabelloVL16,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Francis Lazarus},
title = {Finding shortest non-trivial cycles in directed graphs on surfaces},
journal = {J. Comput. Geom.},
volume = {7},
number = {1},
pages = {123--148},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i1a7},
doi = {10.20382/JOCG.V7I1A7},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/CabelloVL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BergCCEK16,
author = {Mark de Berg and
Sergio Cabello and
Otfried Cheong and
David Eppstein and
Christian Knauer},
title = {Covering many points with a small-area box},
journal = {CoRR},
volume = {abs/1612.02149},
year = {2016},
url = {http://arxiv.org/abs/1612.02149},
eprinttype = {arXiv},
eprint = {1612.02149},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BergCCEK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloJ15,
author = {Sergio Cabello and
Miha Jejcic},
title = {Shortest paths in intersection graphs of unit disks},
journal = {Comput. Geom.},
volume = {48},
number = {4},
pages = {360--367},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2014.12.003},
doi = {10.1016/J.COMGEO.2014.12.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CabelloG15,
author = {Sergio Cabello and
David Gajser},
title = {Simple PTAS's for families of graphs excluding a minor},
journal = {Discret. Appl. Math.},
volume = {189},
pages = {41--48},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.03.004},
doi = {10.1016/J.DAM.2015.03.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CabelloG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CabelloS15,
author = {Sergio Cabello and
Maria Saumell},
title = {A randomized algorithm for finding a maximum clique in the visibility
graph of a simple polygon},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {1},
pages = {1--12},
year = {2015},
url = {https://doi.org/10.46298/dmtcs.2126},
doi = {10.46298/DMTCS.2126},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CabelloS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CabelloMS15,
author = {Sergio Cabello and
Bojan Mohar and
Robert S{\'{a}}mal},
title = {Drawing a disconnected graph on the torus (Extended abstract)},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {779--786},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.105},
doi = {10.1016/J.ENDM.2015.06.105},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CabelloMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BokalCE15,
author = {Drago Bokal and
Sergio Cabello and
David Eppstein},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {Finding All Maximal Subsequences with Hereditary Properties},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {240--254},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.240},
doi = {10.4230/LIPICS.SOCG.2015.240},
timestamp = {Wed, 16 Jun 2021 12:03:14 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BokalCE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CabelloK15,
author = {Sergio Cabello and
Michael Kerber},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Semi-dynamic Connectivity in the Plane},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {115--126},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_10},
doi = {10.1007/978-3-319-21840-3\_10},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/CabelloK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CabelloP15,
author = {Sergio Cabello and
Pablo P{\'{e}}rez{-}Lantero},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Interval Selection in the Streaming Model},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {127--139},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_11},
doi = {10.1007/978-3-319-21840-3\_11},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/CabelloP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloP15,
author = {Sergio Cabello and
Pablo P{\'{e}}rez{-}Lantero},
title = {Interval Selection in the Streaming Model},
journal = {CoRR},
volume = {abs/1501.02285},
year = {2015},
url = {http://arxiv.org/abs/1501.02285},
eprinttype = {arXiv},
eprint = {1501.02285},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CabelloP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloK15,
author = {Sergio Cabello and
Michael Kerber},
title = {Semi-dynamic connectivity in the plane},
journal = {CoRR},
volume = {abs/1502.03690},
year = {2015},
url = {http://arxiv.org/abs/1502.03690},
eprinttype = {arXiv},
eprint = {1502.03690},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CabelloK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CabelloCH14,
author = {Sergio Cabello and
Markus Chimani and
Petr Hlinen{\'{y}}},
title = {Computing the Stretch of an Embedded Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {3},
pages = {1391--1401},
year = {2014},
url = {https://doi.org/10.1137/130945636},
doi = {10.1137/130945636},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CabelloCH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloCKSV14,
author = {Sergio Cabello and
Josef Cibulka and
Jan Kyncl and
Maria Saumell and
Pavel Valtr},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {Peeling Potatoes Near-Optimally in Near-Linear Time},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {224},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582159},
doi = {10.1145/2582112.2582159},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloCKSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloJ14,
author = {Sergio Cabello and
Miha Jejcic},
title = {Shortest Paths in Intersection Graphs of Unit Disks},
journal = {CoRR},
volume = {abs/1402.4855},
year = {2014},
url = {http://arxiv.org/abs/1402.4855},
eprinttype = {arXiv},
eprint = {1402.4855},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CabelloJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloCS14,
author = {Sergio Cabello and
Otfried Cheong and
Lena Schlipf},
title = {Finding Largest Rectangles in Convex Polygons},
journal = {CoRR},
volume = {abs/1405.1223},
year = {2014},
url = {http://arxiv.org/abs/1405.1223},
eprinttype = {arXiv},
eprint = {1405.1223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CabelloCS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloCKSV14,
author = {Sergio Cabello and
Josef Cibulka and
Jan Kyncl and
Maria Saumell and
Pavel Valtr},
title = {Peeling potatoes near-optimally in near-linear time},
journal = {CoRR},
volume = {abs/1406.1368},
year = {2014},
url = {http://arxiv.org/abs/1406.1368},
eprinttype = {arXiv},
eprint = {1406.1368},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/CabelloCKSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CabelloG14,
author = {Sergio Cabello and
David Gajser},
title = {Simple PTAS's for families of graphs excluding a minor},
journal = {CoRR},
volume = {abs/1410.5778},
year = {2014},
url = {http://arxiv.org/abs/1410.5778},
eprinttype = {arXiv},
eprint = {1410.5778},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CabelloG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloDP13,
author = {Sergio Cabello and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Pablo P{\'{e}}rez{-}Lantero},
title = {Covering a bichromatic point set with two disjoint monochromatic disks},
journal = {Comput. Geom.},
volume = {46},
number = {3},
pages = {203--212},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2012.06.002},
doi = {10.1016/J.COMGEO.2012.06.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloDP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Cabello13,
author = {Sergio Cabello},
title = {Hardness of Approximation for Crossing Number},
journal = {Discret. Comput. Geom.},
volume = {49},
number = {2},
pages = {348--358},
year = {2013},
url = {https://doi.org/10.1007/s00454-012-9440-6},
doi = {10.1007/S00454-012-9440-6},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Cabello13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/CabelloCL13,
author = {Sergio Cabello and
Jean Cardinal and
Stefan Langerman},
title = {The Clique Problem in Ray Intersection Graphs},
journal = {Discret. Comput. Geom.},
volume = {50},
number = {3},
pages = {771--783},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9538-5},
doi = {10.1007/S00454-013-9538-5},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/CabelloCL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloCE13,
author = {Sergio Cabello and
Erin W. Chambers and
Jeff Erickson},
title = {Multiple-Source Shortest Paths in Embedded Graphs},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1542--1571},
year = {2013},
url = {https://doi.org/10.1137/120864271},
doi = {10.1137/120864271},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CabelloCE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloM13,
author = {Sergio Cabello and
Bojan Mohar},
title = {Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity
Hard},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {5},
pages = {1803--1829},
year = {2013},
url = {https://doi.org/10.1137/120872310},
doi = {10.1137/120872310},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CabelloM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloG13,
author = {Sergio Cabello and
Panos Giannopoulos},
editor = {Guilherme Dias da Fonseca and
Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and
Timothy M. Chan and
Rolf Klein},
title = {The complexity of separating points in the plane},
booktitle = {Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
Brazil, June 17-20, 2013},
pages = {379--386},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2462356.2462383},
doi = {10.1145/2462356.2462383},
timestamp = {Mon, 14 Jun 2021 16:24:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BannisterCE13,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parameterized Complexity of 1-Planarity},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {97--108},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_9},
doi = {10.1007/978-3-642-40104-6\_9},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BannisterCE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5591,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
title = {Parameterized Complexity of 1-Planarity},
journal = {CoRR},
volume = {abs/1304.5591},
year = {2013},
url = {http://arxiv.org/abs/1304.5591},
eprinttype = {arXiv},
eprint = {1304.5591},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5591.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Cabello12,
author = {Sergio Cabello},
title = {Many Distances in Planar Graphs},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {361--381},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9459-0},
doi = {10.1007/S00453-010-9459-0},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Cabello12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloVL12,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Francis Lazarus},
title = {Algorithms for the edge-width of an embedded graph},
journal = {Comput. Geom.},
volume = {45},
number = {5-6},
pages = {215--224},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2011.12.002},
doi = {10.1016/J.COMGEO.2011.12.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloVL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BeregCDPSV12,
author = {Sergey Bereg and
Sergio Cabello and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Pablo P{\'{e}}rez{-}Lantero and
Carlos Seara and
Inmaculada Ventura},
title = {The class cover problem with boxes},
journal = {Comput. Geom.},
volume = {45},
number = {7},
pages = {294--304},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2012.01.014},
doi = {10.1016/J.COMGEO.2012.01.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BeregCDPSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/BendichCE12,
author = {Paul Bendich and
Sergio Cabello and
Herbert Edelsbrunner},
title = {A point calculus for interlevel set homology},
journal = {Pattern Recognit. Lett.},
volume = {33},
number = {11},
pages = {1436--1444},
year = {2012},
url = {https://doi.org/10.1016/j.patrec.2011.10.007},
doi = {10.1016/J.PATREC.2011.10.007},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/BendichCE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CabelloCL12,
author = {Sergio Cabello and
Jean Cardinal and
Stefan Langerman},
editor = {Leah Epstein and
Paolo Ferragina},
title = {The Clique Problem in Ray Intersection Graphs},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {241--252},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_22},
doi = {10.1007/978-3-642-33090-2\_22},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/CabelloCL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BusaryevCCDW12,
author = {Oleksiy Busaryev and
Sergio Cabello and
Chao Chen and
Tamal K. Dey and
Yusu Wang},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Annotating Simplices with a Homology Basis and Its Applications},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {189--200},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_17},
doi = {10.1007/978-3-642-31155-0\_17},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BusaryevCCDW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-0314,
author = {Sergio Cabello and
Erin W. Chambers and
Jeff Erickson},
title = {Multiple-Source Shortest Paths in Embedded Graphs},
journal = {CoRR},
volume = {abs/1202.0314},
year = {2012},
url = {http://arxiv.org/abs/1202.0314},
eprinttype = {arXiv},
eprint = {1202.0314},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-0314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-5944,
author = {Sergio Cabello and
Bojan Mohar},
title = {Adding one edge to planar graphs makes crossing number and 1-planarity
hard},
journal = {CoRR},
volume = {abs/1203.5944},
year = {2012},
url = {http://arxiv.org/abs/1203.5944},
eprinttype = {arXiv},
eprint = {1203.5944},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-5944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0660,
author = {Sergio Cabello},
title = {Hardness of approximation for crossing number},
journal = {CoRR},
volume = {abs/1204.0660},
year = {2012},
url = {http://arxiv.org/abs/1204.0660},
eprinttype = {arXiv},
eprint = {1204.0660},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-2317,
author = {Sergio Cabello},
title = {Stackelberg Shortest Path Tree Game, Revisited},
journal = {CoRR},
volume = {abs/1207.2317},
year = {2012},
url = {http://arxiv.org/abs/1207.2317},
eprinttype = {arXiv},
eprint = {1207.2317},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-2317.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CabelloM11,
author = {Sergio Cabello and
Bojan Mohar},
title = {Crossing Number and Weighted Crossing Number of Near-Planar Graphs},
journal = {Algorithmica},
volume = {60},
number = {3},
pages = {484--504},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9357-5},
doi = {10.1007/S00453-009-9357-5},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CabelloM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CabelloEK11,
author = {Sergio Cabello and
David Eppstein and
Sandi Klavzar},
title = {The Fibonacci Dimension of a Graph},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/542},
doi = {10.37236/542},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CabelloEK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CabelloL11,
author = {Sergio Cabello and
Primoz Luksic},
title = {The Complexity of Obtaining a Distance-Balanced Graph},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/536},
doi = {10.37236/536},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CabelloL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CabelloJ11,
author = {Sergio Cabello and
Marko Jakovac},
title = {On the b-chromatic number of regular graphs},
journal = {Discret. Appl. Math.},
volume = {159},
number = {13},
pages = {1303--1310},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.04.028},
doi = {10.1016/J.DAM.2011.04.028},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CabelloJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CabelloKLMSV11,
author = {Sergio Cabello and
Marc J. van Kreveld and
Giuseppe Liotta and
Henk Meijer and
Bettina Speckmann and
Kevin Verbeek},
title = {Geometric Simultaneous Embeddings of a Graph and a Matching},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {79--96},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00218},
doi = {10.7155/JGAA.00218},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CabelloKLMSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CabelloVL11,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Francis Lazarus},
title = {Finding Cycles with Topological Properties in Embedded Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {4},
pages = {1600--1614},
year = {2011},
url = {https://doi.org/10.1137/100810794},
doi = {10.1137/100810794},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CabelloVL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CabelloGKMR11,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
D{\'{a}}niel Marx and
G{\"{u}}nter Rote},
title = {Geometric clustering: Fixed-parameter tractability and lower bounds
with respect to the dimension},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {43:1--43:27},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000811},
doi = {10.1145/2000807.2000811},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CabelloGKMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4618,
author = {Helmut Alt and
Sergio Cabello and
Panos Giannopoulos and
Christian Knauer},
title = {Minimum cell connection and separation in line segment arrangements},
journal = {CoRR},
volume = {abs/1104.4618},
year = {2011},
url = {http://arxiv.org/abs/1104.4618},
eprinttype = {arXiv},
eprint = {1104.4618},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4618.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3793,
author = {Oleksiy Busaryev and
Sergio Cabello and
Chao Chen and
Tamal K. Dey and
Yusu Wang},
title = {Annotating Simplices with a Homology Basis and Its Applications},
journal = {CoRR},
volume = {abs/1107.3793},
year = {2011},
url = {http://arxiv.org/abs/1107.3793},
eprinttype = {arXiv},
eprint = {1107.3793},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-5986,
author = {Sergio Cabello and
Jean Cardinal and
Stefan Langerman},
title = {The Clique Problem in Ray Intersection Graphs},
journal = {CoRR},
volume = {abs/1111.5986},
year = {2011},
url = {http://arxiv.org/abs/1111.5986},
eprinttype = {arXiv},
eprint = {1111.5986},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-5986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CabelloHKS10,
author = {Sergio Cabello and
Herman J. Haverkort and
Marc J. van Kreveld and
Bettina Speckmann},
title = {Algorithmic Aspects of Proportional Symbol Maps},
journal = {Algorithmica},
volume = {58},
number = {3},
pages = {543--565},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9281-8},
doi = {10.1007/S00453-009-9281-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CabelloHKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/AichholzerCMFHHHW10,
author = {Oswin Aichholzer and
Sergio Cabello and
Ruy Fabila Monroy and
David Flores{-}Pe{\~{n}}aloza and
Thomas Hackl and
Clemens Huemer and
Ferran Hurtado and
David R. Wood},
title = {Edge-Removal and Non-Crossing Configurations in Geometric Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {12},
number = {1},
pages = {75--86},
year = {2010},
url = {https://doi.org/10.46298/dmtcs.525},
doi = {10.46298/DMTCS.525},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/AichholzerCMFHHHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CabelloDLSV10,
author = {Sergio Cabello and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Stefan Langerman and
Carlos Seara and
Inmaculada Ventura},
title = {Facility location problems in the plane based on reverse nearest neighbor
queries},
journal = {Eur. J. Oper. Res.},
volume = {202},
number = {1},
pages = {99--106},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2009.04.021},
doi = {10.1016/J.EJOR.2009.04.021},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CabelloDLSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BuchinCGLLRSSW10,
author = {Kevin Buchin and
Sergio Cabello and
Joachim Gudmundsson and
Maarten L{\"{o}}ffler and
Jun Luo and
G{\"{u}}nter Rote and
Rodrigo I. Silveira and
Bettina Speckmann and
Thomas Wolle},
title = {Finding the Most Relevant Fragments in Networks},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {307--336},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00209},
doi = {10.7155/JGAA.00209},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BuchinCGLLRSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CabelloR10,
author = {Sergio Cabello and
G{\"{u}}nter Rote},
title = {Obnoxious Centers in Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1713--1730},
year = {2010},
url = {https://doi.org/10.1137/09077638X},
doi = {10.1137/09077638X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CabelloR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Cabello10,
author = {Sergio Cabello},
title = {Finding shortest contractible and shortest separating cycles in embedded
graphs},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {2},
pages = {24:1--24:18},
year = {2010},
url = {https://doi.org/10.1145/1721837.1721840},
doi = {10.1145/1721837.1721840},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Cabello10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CabelloDEM10,
author = {Sergio Cabello and
Matt DeVos and
Jeff Erickson and
Bojan Mohar},
title = {Finding one tight cycle},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {4},
pages = {61:1--61:13},
year = {2010},
url = {https://doi.org/10.1145/1824777.1824781},
doi = {10.1145/1824777.1824781},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CabelloDEM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloM10,
author = {Sergio Cabello and
Bojan Mohar},
editor = {David G. Kirkpatrick and
Joseph S. B. Mitchell},
title = {Adding one edge to planar graphs makes crossing number hard},
booktitle = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
Snowbird, Utah, USA, June 13-16, 2010},
pages = {68--76},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810959.1810972},
doi = {10.1145/1810959.1810972},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloVL10,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Francis Lazarus},
editor = {David G. Kirkpatrick and
Joseph S. B. Mitchell},
title = {Output-sensitive algorithm for the edge-width of an embedded graph},
booktitle = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
Snowbird, Utah, USA, June 13-16, 2010},
pages = {147--155},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810959.1810987},
doi = {10.1145/1810959.1810987},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloVL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloVL10a,
author = {Sergio Cabello and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Francis Lazarus},
editor = {David G. Kirkpatrick and
Joseph S. B. Mitchell},
title = {Finding shortest non-trivial cycles in directed graphs on surfaces},
booktitle = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
Snowbird, Utah, USA, June 13-16, 2010},
pages = {156--165},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810959.1810988},
doi = {10.1145/1810959.1810988},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloVL10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloK09,
author = {Sergio Cabello and
Christian Knauer},
title = {Algorithms for graphs of bounded treewidth via orthogonal range searching},
journal = {Comput. Geom.},
volume = {42},
number = {9},
pages = {815--824},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2009.02.001},
doi = {10.1016/J.COMGEO.2009.02.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/CabelloBGKOV09,
author = {Sergio Cabello and
Mark de Berg and
Panos Giannopoulos and
Christian Knauer and
Ren{\'{e}} van Oostrum and
Remco C. Veltkamp},
title = {Maximizing the Area of Overlap of Two Unions of Disks under Rigid
Motion},
journal = {Int. J. Comput. Geom. Appl.},
volume = {19},
number = {6},
pages = {533--556},
year = {2009},
url = {https://doi.org/10.1142/S0218195909003118},
doi = {10.1142/S0218195909003118},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/CabelloBGKOV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CabelloFS09,
author = {Sergio Cabello and
Marta Fort and
Joan Antoni Sellar{\`{e}}s},
title = {Higher-order Voronoi diagrams on triangulated surfaces},
journal = {Inf. Process. Lett.},
volume = {109},
number = {9},
pages = {440--445},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.01.001},
doi = {10.1016/J.IPL.2009.01.001},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CabelloFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BergCH09,
author = {Mark de Berg and
Sergio Cabello and
Sariel Har{-}Peled},
title = {Covering Many or Few Points with Unit Disks},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {446--469},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9135-9},
doi = {10.1007/S00224-008-9135-9},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BergCH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/agile/BuchinCGLLRSSW09,
author = {Kevin Buchin and
Sergio Cabello and
Joachim Gudmundsson and
Maarten L{\"{o}}ffler and
Jun Luo and
G{\"{u}}nter Rote and
Rodrigo I. Silveira and
Bettina Speckmann and
Thomas Wolle},
editor = {Monika Sester and
Lars Bernard and
Volker Paelke},
title = {Detecting Hotspots in Geographic Networks},
booktitle = {Advances in GIScience, Proceedings of the 12th {AGILE} Conference,
Hannover, Germany, 2-5 June 2009},
series = {Lecture Notes in Geoinformation and Cartography},
pages = {217--231},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00318-9\_11},
doi = {10.1007/978-3-642-00318-9\_11},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/agile/BuchinCGLLRSSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CabelloKLMSV09,
author = {Sergio Cabello and
Marc J. van Kreveld and
Giuseppe Liotta and
Henk Meijer and
Bettina Speckmann and
Kevin Verbeek},
editor = {David Eppstein and
Emden R. Gansner},
title = {Geometric Simultaneous Embeddings of a Graph and a Matching},
booktitle = {Graph Drawing, 17th International Symposium, {GD} 2009, Chicago, IL,
USA, September 22-25, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5849},
pages = {183--194},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11805-0\_18},
doi = {10.1007/978-3-642-11805-0\_18},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/CabelloKLMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Cabello09,
author = {Sergio Cabello},
editor = {Claire Mathieu},
title = {Finding shortest contractible and shortest separating cycles in embedded
graphs},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {616--624},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.68},
doi = {10.1137/1.9781611973068.68},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Cabello09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-2507,
author = {Sergio Cabello and
David Eppstein and
Sandi Klavzar},
title = {The Fibonacci dimension of a graph},
journal = {CoRR},
volume = {abs/0903.2507},
year = {2009},
url = {http://arxiv.org/abs/0903.2507},
eprinttype = {arXiv},
eprint = {0903.2507},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-2507.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloGKR08,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
title = {Matching point sets with respect to the Earth Mover's Distance},
journal = {Comput. Geom.},
volume = {39},
number = {2},
pages = {118--133},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2006.10.001},
doi = {10.1016/J.COMGEO.2006.10.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloGKR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloDSSUV08,
author = {Sergio Cabello and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Carlos Seara and
Joan Antoni Sellar{\`{e}}s and
Jorge Urrutia and
Inmaculada Ventura},
title = {Covering point sets with two disjoint disks or squares},
journal = {Comput. Geom.},
volume = {40},
number = {3},
pages = {195--206},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2007.10.001},
doi = {10.1016/J.COMGEO.2007.10.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloDSSUV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CabelloGK08,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer},
title = {On the parameterized complexity of d-dimensional point set pattern
matching},
journal = {Inf. Process. Lett.},
volume = {105},
number = {2},
pages = {73--77},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2007.08.003},
doi = {10.1016/J.IPL.2007.08.003},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CabelloGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CabelloM08,
author = {Sergio Cabello and
Bojan Mohar},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Crossing and Weighted Crossing Number of Near-Planar Graphs},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {38--49},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_5},
doi = {10.1007/978-3-642-00219-9\_5},
timestamp = {Sun, 13 Nov 2022 09:57:30 +0100},
biburl = {https://dblp.org/rec/conf/gd/CabelloM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CabelloDEM08,
author = {Sergio Cabello and
Matt DeVos and
Jeff Erickson and
Bojan Mohar},
editor = {Shang{-}Hua Teng},
title = {Finding one tight cycle},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {527--531},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347140},
timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CabelloDEM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CabelloGKR08,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Shang{-}Hua Teng},
title = {Geometric clustering: fixed-parameter tractability and lower bounds
with respect to the dimension},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {836--843},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347174},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CabelloGKR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/CabelloM07,
author = {Sergio Cabello and
Bojan Mohar},
title = {Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically
Embedded Graphs},
journal = {Discret. Comput. Geom.},
volume = {37},
number = {2},
pages = {213--235},
year = {2007},
url = {https://doi.org/10.1007/s00454-006-1292-5},
doi = {10.1007/S00454-006-1292-5},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/CabelloM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Cabello07,
author = {Sergio Cabello},
title = {Approximation algorithms for spreading points},
journal = {J. Algorithms},
volume = {62},
number = {2},
pages = {49--73},
year = {2007},
url = {https://doi.org/10.1016/j.jalgor.2004.06.009},
doi = {10.1016/J.JALGOR.2004.06.009},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Cabello07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CabelloDR07,
author = {Sergio Cabello and
Erik D. Demaine and
G{\"{u}}nter Rote},
title = {Planar Embeddings of Graphs with Specified Edge Lengths},
journal = {J. Graph Algorithms Appl.},
volume = {11},
number = {1},
pages = {259--276},
year = {2007},
url = {https://doi.org/10.7155/jgaa.00145},
doi = {10.7155/JGAA.00145},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CabelloDR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CabelloC07,
author = {Sergio Cabello and
Erin W. Chambers},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Multiple source shortest paths in a genus g graph},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {89--97},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283394},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/CabelloC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CabelloR07,
author = {Sergio Cabello and
G{\"{u}}nter Rote},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Obnoxious centers in graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {98--107},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283395},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CabelloR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informaticaSI/CabelloDM06,
author = {Sergio Cabello and
Matt DeVos and
Bojan Mohar},
title = {Expected Case for Projecting Points},
journal = {Informatica (Slovenia)},
volume = {30},
number = {3},
pages = {289--293},
year = {2006},
url = {http://www.informatica.si/index.php/informatica/article/view/95},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informaticaSI/CabelloDM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseCCGKS06,
author = {Prosenjit Bose and
Sergio Cabello and
Otfried Cheong and
Joachim Gudmundsson and
Marc J. van Kreveld and
Bettina Speckmann},
title = {Area-preserving approximations of polygonal paths},
journal = {J. Discrete Algorithms},
volume = {4},
number = {4},
pages = {554--566},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.06.008},
doi = {10.1016/J.JDA.2005.06.008},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BoseCCGKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Cabello06,
author = {Sergio Cabello},
title = {Planar embeddability of the vertices of a graph using a fixed point
set is NP-hard},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {353--363},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00132},
doi = {10.7155/JGAA.00132},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Cabello06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CabelloHKS06,
author = {Sergio Cabello and
Herman J. Haverkort and
Marc J. van Kreveld and
Bettina Speckmann},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Algorithmic Aspects of Proportional Symbol Maps},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {720--731},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_64},
doi = {10.1007/11841036\_64},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/CabelloHKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgarwalCSS06,
author = {Pankaj K. Agarwal and
Sergio Cabello and
Joan Antoni Sellar{\`{e}}s and
Micha Sharir},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {Computing a Center-Transversal Line},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {93--104},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_11},
doi = {10.1007/11944836\_11},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AgarwalCSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CabelloGK06,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {On the Parameterized Complexity of \emph{d}-Dimensional Point Set
Pattern Matching},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {175--183},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_16},
doi = {10.1007/11847250\_16},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/CabelloGK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Cabello06,
author = {Sergio Cabello},
title = {Many distances in planar graphs},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {1213--1220},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109691},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Cabello06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BergCH06,
author = {Mark de Berg and
Sergio Cabello and
Sariel Har{-}Peled},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {Covering Many or Few Points with Unit Disks},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {55--68},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_5},
doi = {10.1007/11970125\_5},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BergCH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CabelloBK05,
author = {Sergio Cabello and
Mark de Berg and
Marc J. van Kreveld},
title = {Schematization of networks},
journal = {Comput. Geom.},
volume = {30},
number = {3},
pages = {223--228},
year = {2005},
url = {https://doi.org/10.1016/j.comgeo.2004.11.002},
doi = {10.1016/J.COMGEO.2004.11.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CabelloBK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/CabelloDLSV05,
author = {Sergio Cabello and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Stefan Langerman and
Carlos Seara and
Inmaculada Ventura},
title = {Reverse facility location problems},
booktitle = {Proceedings of the 17th Canadian Conference on Computational Geometry,
CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005},
pages = {68--71},
year = {2005},
url = {http://www.cccg.ca/proceedings/2005/24.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/CabelloDLSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CabelloM05,
author = {Sergio Cabello and
Bojan Mohar},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Finding Shortest Non-separating and Non-contractible Cycles for Topologically
Embedded Graphs},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {131--142},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_14},
doi = {10.1007/11561071\_14},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/CabelloM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CabelloGKR05,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Matching Point Sets with Respect to the Earth Mover's Distance},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {520--531},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_47},
doi = {10.1007/11561071\_47},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CabelloGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/CabelloMZ05,
author = {Sergio Cabello and
Bojan Mohar and
Arjana Zitnik},
title = {Homotopic spanners},
booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
pages = {25--28},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/7.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/CabelloMZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/CabelloGKR05,
author = {Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
G{\"{u}}nter Rote},
title = {Matching point sets with respect to the Earth mover's distance},
booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
pages = {57--60},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/15.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/CabelloGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/CabelloLMS04,
author = {Sergio Cabello and
Yuanxin Liu and
Andrea Mantler and
Jack Snoeyink},
title = {Testing Homotopy for Paths in the Plane},
journal = {Discret. Comput. Geom.},
volume = {31},
number = {1},
pages = {61--81},
year = {2004},
url = {https://doi.org/10.1007/s00454-003-2949-y},
doi = {10.1007/S00454-003-2949-Y},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/CabelloLMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergCGKOV04,
author = {Mark de Berg and
Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
Ren{\'{e}} van Oostrum and
Remco C. Veltkamp},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Maximizing the Area of Overlap of Two Unions of Disks Under Rigid
Motion},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {138--149},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_13},
doi = {10.1007/978-3-540-27810-8\_13},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergCGKOV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Cabello04,
author = {Sergio Cabello},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Approximation Algorithms for Spreading Points},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {83--96},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_9},
doi = {10.1007/978-3-540-31833-0\_9},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Cabello04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CabelloK03,
author = {Sergio Cabello and
Marc J. van Kreveld},
title = {Approximation Algorithms for Aligning Points},
journal = {Algorithmica},
volume = {37},
number = {3},
pages = {211--232},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1033-6},
doi = {10.1007/S00453-003-1033-6},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CabelloK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloK03,
author = {Sergio Cabello and
Marc J. van Kreveld},
editor = {Steven Fortune},
title = {Approximation algorithms for aligning points},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {20--28},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777796},
doi = {10.1145/777792.777796},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/CabelloDR03,
author = {Sergio Cabello and
Erik D. Demaine and
G{\"{u}}nter Rote},
editor = {Giuseppe Liotta},
title = {Planar Embeddings of Graphs with Specified Edge Lengths},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {283--294},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_26},
doi = {10.1007/978-3-540-24595-7\_26},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/CabelloDR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/CabelloPS02,
author = {Sergio Cabello and
Carles Padr{\'{o}} and
Germ{\'{a}}n S{\'{a}}ez},
title = {Secret Sharing Schemes with Detection of Cheaters for a General Access
Structure},
journal = {Des. Codes Cryptogr.},
volume = {25},
number = {2},
pages = {175--188},
year = {2002},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcc/CabelloPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloLMS02,
author = {Sergio Cabello and
Yuanxin Liu and
Andrea Mantler and
Jack Snoeyink},
editor = {Ferran Hurtado and
Vera Sacrist{\'{a}}n and
Chandrajit Bajaj and
Subhash Suri},
title = {Testing Homotopy for paths in the plane},
booktitle = {Proceedings of the 18th Annual Symposium on Computational Geometry,
Barcelona, Spain, June 5-7, 2002},
pages = {160--169},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/513400.513421},
doi = {10.1145/513400.513421},
timestamp = {Mon, 14 Jun 2021 16:25:21 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloLMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CabelloBDKS01,
author = {Sergio Cabello and
Mark de Berg and
Steven van Dijk and
Marc J. van Kreveld and
Tycho Strijk},
editor = {Diane L. Souvaine},
title = {Schematization of road networks},
booktitle = {Proceedings of the Seventeenth Annual Symposium on Computational Geometry,
Medford, MA, USA, June 3-5, 2001},
pages = {33--39},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/378583.378609},
doi = {10.1145/378583.378609},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CabelloBDKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/CabelloPS99,
author = {Sergio Cabello and
Carles Padr{\'{o}} and
Germ{\'{a}}n S{\'{a}}ez},
editor = {Gabriel Ciobanu and
Gheorghe Paun},
title = {Secret Sharing Schemes with Detection of Cheaters for a General Access
Structure},
booktitle = {Fundamentals of Computation Theory, 12th International Symposium,
{FCT} '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1684},
pages = {185--194},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48321-7\_14},
doi = {10.1007/3-540-48321-7\_14},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/CabelloPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-01-03 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
