default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarta Fort
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j20]Narcís Coll
, Marta Fort, Moisès Saus:
Coverage area maximization with parallel simulated annealing. Expert Syst. Appl. 202: 117185 (2022)- 2021
- [j19]José Díaz, Marta Fort, Pere-Pau Vázquez:
TourVis: Narrative Visualization of Multi-Stage Bicycle Races. Comput. Graph. Forum 40(3): 531-542 (2021) - [j18]Yuejun Guo, Anton Bardera, Marta Fort, Rodrigo I. Silveira:
A scalable method to construct compact road networks from GPS trajectories. Int. J. Geogr. Inf. Sci. 35(7): 1309-1345 (2021) - 2020
- [j17]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances. Knowl. Based Syst. 192: 105299 (2020)
2010 – 2019
- 2019
- [j16]Narcís Coll, Marta Fort, Joan Antoni Sellarès:
On the overlap area of a disk and a piecewise circular domain. Comput. Oper. Res. 104: 59-73 (2019) - [j15]Yago Diez, Marta Fort, Matias Korman, Joan Antoni Sellarès:
Group evolution patterns in running races. Inf. Sci. 479: 20-39 (2019) - 2018
- [i2]Yago Diez, Marta Fort, Matias Korman, Joan Antoni Sellarès:
Group evolution patterns in running races. CoRR abs/1812.10530 (2018) - 2017
- [j14]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
Intersecting two families of sets on the GPU. J. Parallel Distributed Comput. 104: 167-178 (2017) - 2016
- [j13]Marta Fort, Joan Antoni Sellarès:
Efficient multiple bichromatic mutual nearest neighbor query processing. Inf. Syst. 62: 136-154 (2016) - [j12]Marta Fort, Joan Antoni Sellarès:
Solving multiple kth smallest dissimilarity queries for non-metric dissimilarities with the GPU. Inf. Sci. 361-362: 66-83 (2016) - 2015
- [j11]Marta Fort, Joan Antoni Sellarès:
Common influence region problems. Inf. Sci. 321: 116-135 (2015) - 2014
- [j10]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
A parallel GPU-based approach for reporting flock patterns. Int. J. Geogr. Inf. Sci. 28(9): 1877-1903 (2014) - [j9]Sergey Bereg, José Miguel Díaz-Báñez, Marta Fort, Mario Alberto López, Pablo Pérez-Lantero, Jorge Urrutia:
Continuous Surveillance of Points by rotating Floodlights. Int. J. Comput. Geom. Appl. 24(3): 183-196 (2014) - [j8]Marta Fort, Joan Antoni Sellarès:
Solving the k-influence region problem with the GPU. Inf. Sci. 269: 255-269 (2014) - [j7]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
Finding extremal sets on the GPU. J. Parallel Distributed Comput. 74(1): 1891-1899 (2014) - [j6]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
Computing and visualizing popular places. Knowl. Inf. Syst. 40(2): 411-437 (2014) - [c8]Marta Fort, Joan Antoni Sellarès:
Solving Multiple Bichromatic Mutual Nearest Neighbor Queries with the GPU. DASFAA Workshops 2014: 308-316 - 2013
- [j5]Marta Fort, Joan Antoni Sellarès:
Finding influential location regions based on reverse k-neighbor queries. Knowl. Based Syst. 47: 35-52 (2013) - [c7]Marta Fort, Joan Antoni Sellarès:
Common Influence Region Queries. ISVD 2013: 53-62 - 2012
- [j4]Marta Fort, Joan Antoni Sellarès:
Approximating generalized distance functions on weighted triangulated surfaces with applications. J. Comput. Appl. Math. 236(14): 3461-3477 (2012) - [c6]Marta Fort, Joan Antoni Sellarès:
GPU-Based Influence Regions Optimization. ICCSA (1) 2012: 253-266 - 2010
- [c5]Marta Fort, Joan Antoni Sellarès, Nacho Valladares:
Computing Popular Places Using Graphics Processors. ICDM Workshops 2010: 233-240
2000 – 2009
- 2009
- [j3]Marta Fort, Joan Antoni Sellarès:
Computing generalized higher-order Voronoi diagrams on triangulated surfaces. Appl. Math. Comput. 215(1): 235-250 (2009) - [j2]Sergio Cabello, Marta Fort, Joan Antoni Sellarès:
Higher-order Voronoi diagrams on triangulated surfaces. Inf. Process. Lett. 109(9): 440-445 (2009) - [c4]Marta Fort, Joan Antoni Sellarès:
GPU-based computation of distance functions on road networks with applications. SAC 2009: 1320-1324 - 2008
- [b1]Marta Fort:
Visibility and proximity on triangulated surfaces. University of Girona, Spain, 2008 - [c3]Marta Fort, Joan Antoni Sellarès:
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces. ICCSA Workshops 2008: 394-404 - 2007
- [j1]Narcís Coll, Marta Fort, Narcis Madern, Joan Antoni Sellarès:
Multi-visibility maps of triangulated terrains. Int. J. Geogr. Inf. Sci. 21(10): 1115-1134 (2007) - [c2]Marta Fort, Joan Antoni Sellarès:
Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces. ISVD 2007: 74-83 - 2006
- [c1]Narcís Coll, Marta Fort, Narcis Madern, Joan Antoni Sellarès:
Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware. ICCSA (1) 2006: 81-90 - 2005
- [i1]Narcís Coll, Marta Fort, Joan Antoni Sellarès:
Approximate multi-visibility map computation. EuroCG 2005: 97-100
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-05-08 20:55 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:
