default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBelén Palop
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Hugo A. Akitaya
, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83(5): 1316-1351 (2021)
2010 – 2019
- 2019
- [c12]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 2019: 3:1-3:14 - [i5]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR abs/1908.07880 (2019) - 2015
- [j9]Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira:
Bichromatic 2-center of pairs of points. Comput. Geom. 48(2): 94-107 (2015) - [c11]Alvaro Estebanez, Diego R. Llanos, David Orden, Belén Palop:
Moody Scheduling for Speculative Parallelization. Euro-Par 2015: 135-146 - 2012
- [c10]Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira:
Bichromatic 2-Center of Pairs of Points. LATIN 2012: 25-36 - 2010
- [j8]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway hull revisited. Comput. Geom. 43(2): 115-130 (2010)
2000 – 2009
- 2009
- [j7]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing Geometric Transportation Networks. Int. J. Comput. Geom. Appl. 19(6): 507-520 (2009) - [c9]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh:
Relaxed Gabriel Graphs. CCCG 2009: 169-172 - 2008
- [j6]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop:
Optimal location of transportation devices. Comput. Geom. 41(3): 219-229 (2008) - [j5]Manuel Abellanas, Ferran Hurtado, Belén Palop:
The Heavy Luggage Metric. Int. J. Comput. Geom. Appl. 18(4): 295-306 (2008) - [c8]Manuel Abellanas, Belén Palop:
Urban Data Visualization with Voronoi Diagrams. ICCSA (1) 2008: 126-136 - [c7]Diego R. Llanos Ferraris, David Orden, Belén Palop:
Just-In-Time Scheduling for Loop-based Speculative Parallelization. PDP 2008: 334-342 - [i4]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway Hull Revisited. CoRR abs/0806.1416 (2008) - 2007
- [j4]Diego R. Llanos Ferraris, David Orden, Belén Palop:
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization. IEEE Trans. Computers 56(6): 839-852 (2007) - [i3]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop:
Moving Walkways, Escalators, and Elevators. CoRR abs/0705.0635 (2007) - 2006
- [c6]Diego R. Llanos Ferraris, Belén Palop:
TPCC-UVa: an open-source TPC-C implementation for parallel and distributed systems. IPDPS 2006 - [i2]Manuel Abellanas, António Leslie Bajuelos, Gregorio Hernández-Peñalver, Ferran Hurtado, Inês Matos, Belén Palop:
Good Illumination of Minimum Range. CoRR abs/cs/0606013 (2006) - 2005
- [c5]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing of Geometric Transportation Networks. CCCG 2005: 92-96 - [c4]Diego R. Llanos Ferraris, David Orden, Belén Palop:
MESETA: A New Scheduling Strategy for Speculative Parallelization of Randomized Incremental Algorithms. ICPP Workshops 2005: 121-128 - 2004
- [j3]Oswin Aichholzer, Franz Aurenhammer, Belén Palop:
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. Discret. Comput. Geom. 31(1): 17-35 (2004) - [c3]Marcelo H. Cintra, Diego R. Llanos Ferraris, Belén Palop:
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm. ICCSA (3) 2004: 188-197 - 2003
- [j2]Manuel Abellanas, Ferran Hurtado, Vera Sacristán, Christian Icking, Lihong Ma, Rolf Klein, Elmar Langetepe, Belén Palop:
Voronoi Diagram for services neighboring a highway. Inf. Process. Lett. 86(5): 283-288 (2003) - 2002
- [j1]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning Polygons. Discret. Comput. Geom. 28(2): 231-253 (2002) - [c2]Oswin Aichholzer, Franz Aurenhammer, Belén Palop:
Quickest paths, straight skeletons, and the city Voronoi diagram. SCG 2002: 151-159 - 2001
- [c1]Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán:
Smallest Color-Spanning Objects. ESA 2001: 278-289 - 2000
- [i1]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning polygons. CoRR cs.CG/0008010 (2000)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST 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:
