| Cyclic 7-edge-cuts in fullerene graphs F Kardoš, M Krnc, B Lužar, R Škrekovski Journal of mathematical chemistry 47 (2), 771-789, 2010 | 52 | 2010 |
| On the diameter and some related invariants of fullerene graphs V Andova, T Došlić, M Krnc, B Lužar, R Škrekovski Match-Communications In Mathematical And In Computer Chemistry 68 (1), 109-130, 2012 | 32 | 2012 |
| Improved induced matchings in sparse graphs R Erman, Ł Kowalik, M Krnc, T Waleń Parameterized and Exact Computation, 134-148, 2009 | 15* | 2009 |
| Centralization of transmission in networks M Krnc, R Škrekovski Discrete Mathematics 338 (12), 2412-2420, 2015 | 12 | 2015 |
| On Wiener Inverse Interval Problem M Krnc, R Škrekovski MATCH Communications in Mathematical and in Computer Chemistry 75 (1), 71--80, 2015 | 12 | 2015 |
| Cyclic colorings of plane graphs with independent faces J Azarija, R Erman, D Král, M Krnc, L Stacho European Journal of Combinatorics, 2011 | 10 | 2011 |
| Eccentricity of networks with structural constraints M Krnc, JS Sereni, R Škrekovski, ZB Yilma Discussiones Mathematicae Graph Theory 40 (4), 1141-1162, 2020 | 6 | 2020 |
| Group centralization of network indices M Krnc, R Škrekovski Discrete Applied Mathematics 186, 147-157, 2015 | 6 | 2015 |
| Characterization of generalized Petersen graphs that are Kronecker covers M Krnc, T Pisanski arXiv preprint arXiv:1802.07134, 2018 | 5 | 2018 |
| On the end-vertex problem of graph searches J Beisegel, C Denkert, E Köhler, M Krnc, N Pivač, R Scheffler, M Strehler Discrete Mathematics & Theoretical Computer Science, 2019, 2018 | 4* | 2018 |
| Extending Fractional Precolorings D Král', M Krnc, M Kupec, B Lužar, J Volec SIAM Journal on Discrete Mathematics 26, 647, 2012 | 4 | 2012 |
| Generalized Petersen graphs and Kronecker covers M Krnc, T Pisanski Discrete Mathematics and Theoretical Computer Science 21, 2019 | 3 | 2019 |
| Recognizing graph search trees J Beisegel, C Denkert, E Köhler, M Krnc, N Pivač, R Scheffler, M Strehler Electronic notes in theoretical computer science 346, 99-110, 2019 | 2 | 2019 |
| Generalized Petersen graphs are recognizable in linear time M Krnc, RJ Wilson Discrete Applied Mathematics, 2017 | 2* | 2017 |
| Closeness centralization measure for two-mode data of prescribed sizes M Krnc, JS Sereni, R Škrekovski, ZB Yilma arXiv preprint arXiv:1608.04093, 2016 | 2 | 2016 |
| Positive Aging Admits Fast Asynchronous Plurality Consensus G Bankhamer, R Elsässer, D Kaaser, M Krnc Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 1 | 2020 |
| Generalized Petersen graphs and Kronecker covers T Pisanski, M Krnc Discrete Mathematics & Theoretical Computer Science 21, 2019 | 1 | 2019 |
| Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies G Bankhamer, R Elsässer, D Kaaser, M Krnc arXiv preprint arXiv:1806.02596, 2018 | 1 | 2018 |
| Data structure set-trie for storing and querying sets: Theoretical and empirical analysis I Savnik, M Akulich, M Krnc, R Škrekovski Plos one 16 (2), e0245122, 2021 | | 2021 |
| Towards characterizing locally common graphs R Hancock, D Kral, M Krnc, J Volec arXiv preprint arXiv:2011.02562, 2020 | | 2020 |
Borut LužarFaculty of Information Studies, Novo mesto, SloveniaPreverjeni e-poštni naslov na fis.unm.si
