Nikola Milosavljević

Author

Stanford University ORCID

Also Known As

Milosavljevic, N., N. Milosavljevic, Nikola Milosavljevic, Nikola Milosavljević

Publications

555

Citations

H-Index

Concepts

All Affiliations

Stanford University Stony Brook University

About

Nikola Milosavljević is an author at Stanford University specializing in computer science, engineering, and network science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	9	9	541
2	Computer Science	9	9	541
3	Computer Engineering	3	3	137
4	Natural Sciences	2	2	58
5	Education	1	1	20

Nikola Milosavljević

Publications

541

Citations

H-Index

Page 1

	Year	Citations
Fast exact and heuristic methods for role minimization problems Alina Ene, William Horne, Nikola Milosavljević, Mathematical ProgrammingHeuristic SearchEngineeringRole MinimizationLogical Access Control	2008	218
Predictive QoS routing to mobile sinks in wireless sensor networks Branislav Kusý, HyungJune Lee, Martin Wicke, Information Processing in Sensor Networks EngineeringWireless RoutingMobile SinksNetwork RoutingNetwork Analysis	2009	69
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks An Nguyen, Nikola Milosavljević, Qing Fang, Greedy RoutingLandmark Selection SchemeNetwork ScienceEngineeringNetwork Routing Algorithm	2007	61
Composable Information Gradients in Wireless Sensor Networks Huijia Lin, Nikola Milosavljević, Jie Gao, Mathematical ProgrammingEngineeringNetwork AnalysisSensor ConnectivityDynamic Network	2008	57
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II" Stefan Funke, Nikola Milosavljević Symposium on Discrete Algorithms Communication GraphEngineeringGeometryNetwork SketchesNetwork Analysis	2007	48
Distributed resource management and matching in sensor networks Jie Gao, Leonidas Guibas, Nikola Milosavljević, Information Processing in Sensor Networks Cluster ComputingEngineeringDistributed AlgorithmsResource ManagementNetwork Analysis	2009	35
Sparse Data Aggregation in Sensor Networks Jie Gao, Leonidas Guibas, Nikola Milosavljević, Sparse SetCluster ComputingNetwork ScienceEngineeringData Science	2007	23
On optimal preprocessing for contraction hierarchies Nikola Milosavljević Mathematical ProgrammingDirected GraphEngineeringNetwork AnalysisEducation	2012	20
How much geometry it takes to reconstruct a 2-manifold in R <sup>3</sup> Daniel Dumitriu, Stefan Funke, Martin Kütz, ACM Journal of Experimental Algorithmics Geometry CompressionEngineeringGeometryManifold ModelingRange Searching	2009	10

Page 1