Academic Info

I am a fifth year Ph.D. student in the Computer Science Department of Stanford University. I am a member of the Computational Geometry Group. My advisor is professor Leo Guibas.

Publications

D. Dumitriu, S. Funke, M. Kutz, N. Milosavljevic. On the Locality of Extracting a 2-Manifold in R^3. Accepted at the 11th Scandinavian Workshop on Algorithm Theory (SWAT) 2008, preliminary version at the 24th European Workshop on Computational Geometry (EWCG) 2008. (PDF)

A. Ene, W. Horne, N. Milosavljevic, P. Rao, R. Schreiber, R. E. Tarjan. Fast Exact and Heuristic Methods for Role Minimization Problems. Accepted at the 13th ACM Symposium on Access Control Models and Technologies (SACMAT), 2008. (PDF)

H. Lin, M. Lu, N. Milosavljevic, J. Gao, L. J. Guibas. Composable Information Gradients in Wireless Sensor Networks. Proceedings of the 7th Inernational Conference on Information Processing in Sensor Networks (IPSN), 2008. (PDF)

D. Dumitriu, S. Funke, M. Kutz, N. Milosavljevic. How Much Geometry It Takes to Reconstruct a 2-Manifold in R^3. Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 2008. (PDF)

J. Gao, L. J. Guibas, J. Hershberger, N. Milosavljevic. Sparse Data Aggregation in Sensor Networks. The 6th Inernational Conference on Information Processing in Sensor Networks (IPSN), 2007. (PDF)

A. Nguyen, N. Milosavljevic, Q. Fang, J. Gao, L. J. Guibas. Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks. IEEE INFOCOM 2007, to appear. (PDF)

S. Funke, N. Milosavljevic. Guaranteed-delivery Geographic Routing Under Uncertain Node Locations. IEEE INFOCOM 2007. (PDF)

S. Funke, N. Milosavljevic. Network Sketching or: "How Much Geometry Hides in Connectivity? -- Part II". Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2007. (PDF)

S. Funke, N. Milosavljevic. Infrastructure-Establishment from Scratch in Wireless Sensor Networks. Proceedings of the 1st IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS), 2005. (PDF)

Teaching

Spring 2006/2007
CS154 Introduction to Automata and Complexity Theory (Motwani), teaching assistant

Spring 2005/2006
CS368 Geometric Algorithms (Guibas), teaching assistant

Winter 2004/2005
CS348A Computer Graphics: Geometric Modeling (Guibas), teaching assistant

Stanford Coursework

Spring 2007/2008
CS 499 Advanced Reading and Research (Guibas)

Winter 2007/2008
CS 369B Advanced Graph Algorithms (Roughgarden)
CS 499 Advanced Reading and Research (Guibas)

Autumn 2007/2008
CS 499 Advanced Reading and Research (Guibas)

Spring 2006/2007
CS 499 Advanced Reading and Research (Guibas)

Winter 2006/2007
CS 359D Hardness of Approximation (Roughgarden)
CS 468 Geometric Algorithms Seminar (Guibas)
CS 499 Advanced Reading and Research (Guibas)

Autumn 2006/2007
CS 468 Geometric Algorithms Seminar (Koltun)
CS 499 Advanced Reading and Research (Guibas)

Spring 2005/2006
CS 369A Advanced Geometric Algorithms (Koltun)
CS 499 Advanced Reading and Research (Guibas)

Winter 2005/2006
CS 369X Network Algorithms (Goel)
CS 369C Metric Embeddings and Algorithmic Applications (Roughgarden)
CS 468 Geometric Algorithms Seminar (Koltun, Oudot, Guibas)
CS 499 Advanced Reading and Research (Guibas)

Autumn 2005/2006
STAT 318 Modern Markov Chains (Diaconis), audit
CS 365 Advanced Algorithms and Data Structures (Motwani)
CS 354B Topics in Algorithmic Game Theory (Roughgarden), audit
CS 499 Advanced Reading and Research (Guibas)

Spring 2004/2005
CS 428 Information Processing for Sensor Networks (Guibas)
EE 364 Convex Optimization with Engineering Applications (Boyd), audit
MATH 283 Topics in Algebraic and Geometric Topology (Carlsson), audit
CS 499 Advanced Reading and Research (Guibas)

Winter 2004/2005
MSE 319 Approximation Algorithms for Optimization Problems (Goel)
CS 499 Advanced Reading and Research (Guibas)

Autumn 2004/2005
CS 365 Randomized Algorithms (Motwani)
CS 364A Algorithmic Game Theory (Roughgarden)
MATH 108 Introduction to Combinatorics and Its Applications (Thiem)
EE 384M Network Algorithms (Prabhakar), audit
CS 499 Advanced Reading and Research (Guibas)

Summer 2003/2004
CS 499 Advanced Reading and Research (Guibas)

Spring 2003/2004
CS 273 Algorithms for Structure and Motion in Biology (Batzoglou, Guibas, Latombe)
CS 361B Advanced Algorithms (Plotkin)
CS 368 Geometric Algorithms (Guibas)
CS 468 Topics in Geometric Algorithms (Guibas)
CS 499 Advanced Reading and Research (Guibas)

Winter 2003/2004
CS 261 Optimization and Algorithmic Paradigms (Plotkin)
CS 348A Computer Graphics: Geometric Modeling (Guibas)
CS 468 Topics in Geometric Algorithms (Guibas) - Introduction to Computational Topology (Zomorodian)
CS 499 Advanced Reading and Research (Guibas)
ATHLETIC 142 Tennis: Low Intermediate

Autumn 2003/2004
CS 161 Design and Analysis of Algorithms (Plotkin)
CS 154 Introduction to Automata and Complexity Theory (Yannakakis)

Smoothing of Protein Folding Motion

This is a short animation that I made by taking a sequence of conformations from molecular dynamics simulation, and interpolating between them in conformation space, parametrized by bond lenghts and bond angles. The movie shows the folding of villin.

The original MD sequence, the molecule jumps around a lot
Interpolated verison, looks much smoother

Last update: April 25, 2008