default search action
Nikola Milosavljevic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c16]Erroll Wood, Tadas Baltrusaitis, Charlie Hewitt, Matthew Johnson, Jingjing Shen, Nikola Milosavljevic, Daniel Wilde, Stephan J. Garbin, Toby Sharp, Ivan Stojiljkovic, Tom Cashman, Julien P. C. Valentin:
3D Face Reconstruction with Dense Landmarks. ECCV (13) 2022: 160-177 - [i1]Erroll Wood, Tadas Baltrusaitis, Charlie Hewitt, Matthew Johnson, Jingjing Shen, Nikola Milosavljevic, Daniel Wilde, Stephan J. Garbin, Toby Sharp, Ivan Stojiljkovic, Tom Cashman, Julien Valentin:
3D face reconstruction with dense landmarks. CoRR abs/2204.02776 (2022)
2010 – 2019
- 2013
- [j3]Leonidas J. Guibas, Nikola Milosavljevic, Arik Motskin:
Connected dominating sets on dynamic geometric graphs. Comput. Geom. 46(2): 160-172 (2013) - [j2]Aleksandar Ilic, Nikola Milosavljevic
:
The weighted vertex PI index. Math. Comput. Model. 57(3-4): 623-631 (2013) - 2012
- [c15]Nikola Milosavljevic:
On optimal preprocessing for contraction hierarchies. CTS@SIGSPATIAL 2012: 33-38 - 2011
- [c14]Nikola Milosavljevic:
On Complexity of Wireless Gathering Problems on Unit-Disk Graphs. ADHOC-NOW 2011: 308-321 - [c13]Nikola Milosavljevic, Dmitriy Morozov, Primoz Skraba:
Zigzag persistent homology in matrix multiplication time. SCG 2011: 216-225 - 2010
- [c12]Leonidas J. Guibas, Nikola Milosavljevic, Arik Motskin:
Connected dominating sets on dynamic geometric graphs. CCCG 2010: 27-30
2000 – 2009
- 2009
- [b1]Nikola Milosavljevic:
Robust algorithms for infrastructure establishment in wireless sensor networks. Stanford University, USA, 2009 - [j1]Daniel Dumitriu
How much geometry it takes to reconstruct a 2-manifold in R3. ACM J. Exp. Algorithmics 14 (2009) - [c11]Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, Dengpan Zhou:
Distributed resource management and matching in sensor networks. IPSN 2009: 97-108 - [c10]Branislav Kusy, HyungJune Lee, Martin Wicke, Nikola Milosavljevic, Leonidas J. Guibas:
Predictive QoS routing to mobile sinks in wireless sensor networks. IPSN 2009: 109-120 - 2008
- [c9]Daniel Dumitriu
How much Geometry it takes to Reconstruct a 2-Manifold in R3. ALENEX 2008: 65-74 - [c8]Huijia Lin, Maohua Lu, Nikola Milosavljevic, Jie Gao, Leonidas J. Guibas:
Composable Information Gradients in Wireless Sensor Networks. IPSN 2008: 121-132 - [c7]Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan:
Fast exact and heuristic methods for role minimization problems. SACMAT 2008: 1-10 - [c6]Daniel Dumitriu
On the Locality of Extracting a 2-Manifold in . SWAT 2008: 270-281 - 2007
- [c5]An Thanh Nguyen, Nikola Milosavljevic, Qing Fang, Jie Gao, Leonidas J. Guibas:
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks. INFOCOM 2007: 661-669 - [c4]Stefan Funke, Nikola Milosavljevic:
Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations. INFOCOM 2007: 1244-1252 - [c3]Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger:
Sparse data aggregation in sensor networks. IPSN 2007: 430-439 - [c2]Stefan Funke, Nikola Milosavljevic:
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II". SODA 2007: 958-967 - 2005
- [c1]Stefan Funke, Nikola Milosavljevic:
Infrastructure-Establishment from Scratch in Wireless Sensor Networks. DCOSS 2005: 354-367
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:52 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: