Nikola Milosavljević

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Efficient computation of trees with minimal atom-bond connectivity index revisited	2021-10-15	Paper
A few examples and counterexamples in spectral graph theory Discussiones Mathematicae Graph Theory	2020-02-17	Paper
How much geometry it takes to reconstruct a 2-manifold in \(\mathbb{R}^3\) 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-11	Paper
Detour index of hexagonal chains	2017-04-11	Paper
The weighted vertex PI index Mathematical and Computer Modelling	2015-02-19	Paper
Network sketching or: ``How much geometry hides in connectivity? II	2014-12-18	Paper
How much geometry it takes to reconstruct a 2-manifold in \(\mathbb{R}^{3}\) ACM Journal of Experimental Algorithmics	2014-04-01	Paper
Zigzag persistent homology in matrix multiplication time Proceedings of the twenty-seventh annual symposium on Computational geometry	2014-03-24	Paper
Connected dominating sets on dynamic geometric graphs Computational Geometry	2012-12-04	Paper
On the Locality of Extracting a 2-Manifold in Algorithm Theory – SWAT 2008	2008-07-15	Paper

Research outcomes over time

This page was built for person: Nikola Milosavljević