Homepage

Nikola Milosavljevic

Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 329
66123 Saarbrücken
Germany

Email: Get my email address via email
Phone: +49 681 9325 129
Fax: +49 681 9325 199

Research Interests

Geometric and topological algorithms for wireless sensor networks

Curriculum Vitae (PDF)

Education

September 2003 - September 2009:
M. Sc. and Ph. D. in Computer Science, Stanford University, CA, U.S.A.
Ph. D. Thesis: Robust Algorithms for Infrastructure Establishment in Wireless Sensor Networks (supervisor: Prof. Leonidas Guibas)
October 1997 - May 2002:
B. Sc. in Electrical Engineering, University of Belgrade, Serbia
B. Sc. Thesis: Adaptive Space-Time Block Codes (supervisor: Prof. Dusan Drajic), in Serbian

Publications

In the MPII database

On Complexity of Wireless Gathering Problems on Unit-Disk Graphs.
ADHOC-NOW 2011 (updated version; the one in the proceedings has a small bug and a few typos).
Zigzag Persistent Homology in Matrix Multiplication Time.
with D. Morozov and P. Skraba.
SoCG 2011.
Connected Dominating Sets on Dynamic Geometric Graphs.
with L. Guibas and A. Motskin.
Accepted to Computational Geometry: Theory and Applications, 2011 (preliminary version at CCCG 2010).
How Much Geometry It Takes to Reconstruct a 2-Manifold in R^3.
with D. Dumitriu and S. Funke.
Journal of Experimental Algorithms, vol. 13, 2009.
Distributed Resource Management and Matching in Sensor Networks.
with J. Gao, L. Guibas and D. Zhou.
IPSN 2009.
Predictive QoS Routing to Mobile Sinks in Wireless Sensor Networks.
with B. Kusy, HJ. Lee, M. Wicke and L. Guibas.
IPSN 2009.
On the Locality of Extracting a 2-Manifold in R^3.
with D. Dumitriu, S. Funke and M. Kutz.
SWAT 2008 (preliminary version at EWCG 2008).
Fast Exact and Heuristic Methods for Role Minimization Problems.
with A. Ene, W. Horne, P. Rao, R. Schreiber and R. E. Tarjan.
SACMAT 2008.
Composable Information Gradients in Wireless Sensor Networks.
with H. Lin, M. Lu, J. Gao and L. J. Guibas.
IPSN 2008.
How Much Geometry It Takes to Reconstruct a 2-Manifold in R^3.
with D. Dumitriu, S. Funke and M. Kutz.
ALENEX 2008.
Sparse Data Aggregation in Sensor Networks.
with J. Gao, L. J. Guibas and J. Hershberger.
IPSN 2007.
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks.
with A. Nguyen, Q. Fang, J. Gao and L. J. Guibas.
INFOCOM 2007.
Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations.
with S. Funke.
INFOCOM 2007.
Network Sketching or: "How Much Geometry Hides in Connectivity? -- Part II".
with S. Funke.
SODA 2007.
Infrastructure-Establishment from Scratch in Wireless Sensor Networks.
with S. Funke.
DCOSS 2005.