Improved induced matchings in sparse graphs. - Rok Erman; Lukasz Kowalik; Matjaz Krnc; Tomasz Walen (Discret. Appl. Math., 2010)

Cyclic colorings of plane graphs with independent faces. - Jernej Azarija; Rok Erman; Daniel Král'; Matjaz Krnc; Ladislav Stacho (Eur. J. Comb., 2012)

Extending Fractional Precolorings. - Daniel Král'; Matjaz Krnc; Martin Kupec; Borut Luzar; Jan Volec (SIAM J. Discret. Math., 2012)

Group centralization of network indices. - Matjaz Krnc; Riste Skrekovski (Discret. Appl. Math., 2015)

Centralization of transmission in networks. - Matjaz Krnc; Riste Skrekovski (Discret. Math., 2015)

Closeness centralization measure for two-mode data of prescribed sizes. - Matjaz Krnc; Jean-Sébastien Sereni; Riste Skrekovski; Zelealem B. Yilma (Netw. Sci., 2016)

Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies. - Gregor Bankhamer; Robert Elsässer; Dominik Kaaser; Matjaz Krnc (CoRR, 2018)

On the End-Vertex Problem of Graph Searches. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (Discret. Math. Theor. Comput. Sci., 2019)

Generalized Petersen graphs and Kronecker covers. - Matjaz Krnc; Tomaz Pisanski (Discret. Math. Theor. Comput. Sci., 2019)

Recognizing Graph Search Trees. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (LAGOS, 2019)

Fair Packing of Independent Sets. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (IWOCA, 2020)

Positive Aging Admits Fast Asynchronous Plurality Consensus. - Gregor Bankhamer; Robert Elsässer; Dominik Kaaser; Matjaz Krnc (PODC, 2020)

Edge Elimination and Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (WG, 2020)

Fast recognition of some parametric graph families. - Nina Klobas; Matjaz Krnc (CoRR, 2020)

Recognizing generalized Petersen graphs in linear time. - Matjaz Krnc; Robin J. Wilson (Discret. Appl. Math., 2020)

Eccentricity of networks with structural constraints. - Matjaz Krnc; Jean-Sébastien Sereni; Riste Skrekovski; Zelealem B. Yilma (Discuss. Math. Graph Theory, 2020)

Graphs with Two Moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (LAGOS, 2021)

Graphs where Search Methods are Indistinguishable. - Matjaz Krnc; Nevena Pivac (CoRR, 2021)

The Recognition Problem of Graph Search Trees. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (SIAM J. Discret. Math., 2021)

Evaluating group degree centrality and centralization in networks. - Mario Karlovcec; Matjaz Krnc; Riste Skrekovski (Informatica (Slovenia), 2022)

Shifting paths to avoidable ones. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (J. Graph Theory, 2022)

Multiset-trie data structure - datasets. - Mikita Akulich; Iztok Savnik; Matjaz Krnc; Riste Skrekovski (Zenodo, 2022)

Computer-assisted verification of confining two-rooted graphs with certain cages. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (Zenodo, 2022)

Toward characterizing locally common graphs. - Robert Hancock 002; Daniel Král'; Matjaz Krnc; Jan Volec (Random Struct. Algorithms, 2023)

Multiset-Trie Data Structure. - Mikita Akulich; Iztok Savnik; Matjaz Krnc; Riste Skrekovski (Algorithms, 2023)

Fair Allocation of Indivisible Items with Conflict Graphs. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (Algorithmica, 2023)

Fair allocation algorithms for indivisible items under structured conflict constraints. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Joachim Schauer (Comput. Appl. Math., 2023)

Growing Trees and Amoebas' Replications. - Vladimir Gurvich; Matjaz Krnc; Mikhail N. Vyalyi (CoRR, 2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. - Clément Dallard; Matjaz Krnc; O-joung Kwon; Martin Milanic; Andrea Munaro; Kenny Storgel; Sebastian Wiederrecht (CoRR, 2024)

Sprague-Grundy values and complexity for LCTR. - Eric Gottlieb; Matjaz Krnc; Peter Mursic (Discret. Appl. Math., 2024)

Graphs with at most two moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (J. Graph Theory, 2024)

Avoidability Beyond Paths. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (Electron. J. Comb., 2025)

Distinguishing graphs via cycles. - Nina Klobas; Matjaz Krnc (Discret. Appl. Math., 2025)

Young domination on Hamming rectangles. - Janko Gravner; Matjaz Krnc; Martin Milanic; Jean-Florent Raymond (CoRR, 2025)

Linear colorings of graphs. - Claire Hilaire; Matjaz Krnc; Martin Milanic; Jean-Florent Raymond (CoRR, 2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (CoRR, 2025)