default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniela Maftuleac
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j4]Anna Lubiw, Daniela Maftuleac, Megan Owen:
Shortest paths and convex hulls in 2D complexes with non-positive curvature. Comput. Geom. 89: 101626 (2020)
2010 – 2019
- 2017
- [j3]Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. J. Graph Algorithms Appl. 21(3): 371-387 (2017) - 2016
- [c5]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CCCG 2016: 57-62 - [c4]Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. WALCOM 2016: 55-67 - [c3]Alejandro López-Ortiz, Daniela Maftuleac:
Optimal Distributed Searching in the Plane with and Without Uncertainty. WALCOM 2016: 68-79 - [i8]Anna Lubiw, Daniela Maftuleac, Megan Owen:
Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature. CoRR abs/1603.00847 (2016) - [i7]Aditya Kumar Akash, Sándor P. Fekete, SeoungKyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. CoRR abs/1603.05944 (2016) - [i6]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CoRR abs/1607.05739 (2016) - 2015
- [c2]Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin:
Local policies for efficiently patrolling a triangulated region by a robot swarm. ICRA 2015: 1809-1815 - [c1]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring and Partial List Colouring of Graphs On-line. IWOCA 2015: 124-135 - [i5]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring Big Graphs On-Line. CoRR abs/1502.02557 (2015) - 2014
- [j2]Daniela Maftuleac:
Algorithms for Distance Problems in Planar complexes of Global nonpositive Curvature. Int. J. Comput. Geom. Appl. 24(1): 1-38 (2014) - [i4]Alejandro López-Ortiz, Daniela Maftuleac:
Optimal Strategies for Search and Rescue Operations with Robot Swarms. CoRR abs/1410.1077 (2014) - [i3]Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin:
Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm. CoRR abs/1410.2295 (2014) - 2013
- [j1]Victor Chepoi, Daniela Maftuleac:
Shortest path problem in rectangular complexes of global nonpositive curvature. Comput. Geom. 46(1): 51-64 (2013) - [i2]Daniela Maftuleac:
Algorithms for distance problems in planar complexes of global nonpositive curvature. CoRR abs/1306.5796 (2013) - 2010
- [i1]Victor Chepoi, Daniela Maftuleac:
Shortest path problem in rectangular complexes of global nonpositive curvature. CoRR abs/1010.0852 (2010)
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-25 05:53 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:
