Curriculum Vitae
Research Interests
- Structural and algorithmic graph theory
- Extremal graph theory, combinatorial limits
- Combinatorial game theory
- Population protocols, distributed consensus
Academic Positions
| Period | Position | Institution |
|---|---|---|
| 2022–Present | Associate Professor | Faculty of Mathematics, Natural Sciences and Information Technologies (University of Primorska) |
| 2016–2021 | Docent (Assistant Professor) | Faculty of Mathematics, Natural Sciences and Information Technologies (University of Primorska) |
| 2016–2018 | Postdoc (with Prof. R. Elsaesser) | Efficient Algorithms Group (Salzburg University) |
| 2015–2016 | Teaching Assistant | Faculty of Mathematics, Natural Sciences and Information Technologies (University of Primorska) |
| 2013 (Autumn) | Student Internship (with Prof. D. Kral) | Centre for Discrete Mathematics and its Applications (University of Warwick) |
| 2011–2015 | Teaching Assistant & PhD Student | Faculty of Mathematics and Physics (University of Ljubljana) |
| 2011–2015 | Young Researcher | Institute of Mathematics, Physics and Mechanics (Ljubljana) |
Publications
Authors
Title
Avoidability Beyond Paths
Avoidability Beyond Paths
Year: 2025 |
Journal: Electron. J. Comb.
Full Authors: Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Full Authors: Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
[DOI / DBLP]
[arXiv]
Distinguishing graphs via cycles
Distinguishing graphs via cycles
Year: 2025 |
Journal: Discret. Appl. Math.
Full Authors: Nina Klobas, Matjaz Krnc
Full Authors: Nina Klobas, Matjaz Krnc
Young domination on Hamming rectangles
Young domination on Hamming rectangles
Year: 2025 |
Journal: CoRR
Full Authors: Janko Gravner, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
Full Authors: Janko Gravner, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
[DOI / DBLP]
[arXiv]
Linear colorings of graphs
Linear colorings of graphs
Year: 2025 |
Journal: CoRR
Full Authors: Claire Hilaire, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
Full Authors: Claire Hilaire, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
[DOI / DBLP]
[arXiv]
Sandwich Monotonicity and the Recognition of Weighted Graph Classes
Sandwich Monotonicity and the Recognition of Weighted Graph Classes
Year: 2025 |
Journal: CoRR
Full Authors: Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
Full Authors: Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
[DOI / DBLP]
[arXiv]
Row Impartial Terminus
Row Impartial Terminus
Year: 2025 |
Journal: CoRR
Full Authors: Eric Gottlieb, Dawood Khatana, Matjaz Krnc, Peter Mursic, Ismael Qureshi
Full Authors: Eric Gottlieb, Dawood Khatana, Matjaz Krnc, Peter Mursic, Ismael Qureshi
[DOI / DBLP]
[arXiv]
Dominated balanced separators in wheel-induced-minor-free graphs
Dominated balanced separators in wheel-induced-minor-free graphs
Year: 2025 |
Journal: CoRR
Full Authors: Maria Chudnovsky, Jochen Pascal Gollin, Matjaz Krnc, Martin Milanic
Full Authors: Maria Chudnovsky, Jochen Pascal Gollin, Matjaz Krnc, Martin Milanic
[DOI / DBLP]
[arXiv]
Sprague-Grundy values and complexity for LCTR
Sprague-Grundy values and complexity for LCTR
Year: 2024 |
Journal: Discret. Appl. Math.
Full Authors: Eric Gottlieb, Matjaz Krnc, Peter Mursic
Full Authors: Eric Gottlieb, Matjaz Krnc, Peter Mursic
[DOI / DBLP]
[arXiv]
Graphs with at most two moplexes
Graphs with at most two moplexes
Year: 2024 |
Journal: J. Graph Theory
Full Authors: Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Full Authors: Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
[DOI / DBLP]
[arXiv]
Growing Trees and Amoebas' Replications
Growing Trees and Amoebas' Replications
Year: 2024 |
Journal: CoRR
Full Authors: Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi
Full Authors: Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi
[DOI / DBLP]
[arXiv]
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
Year: 2024 |
Journal: CoRR
Full Authors: Clément Dallard, Matjaz Krnc, O-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
Full Authors: Clément Dallard, Matjaz Krnc, O-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
[DOI / DBLP]
[arXiv]
Fair Allocation of Indivisible Items with Conflict Graphs
Fair Allocation of Indivisible Items with Conflict Graphs
Year: 2023 |
Journal: Algorithmica
Full Authors: Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Full Authors: Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Multiset-Trie Data Structure
Multiset-Trie Data Structure
Year: 2023 |
Journal: Algorithms
Full Authors: Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski
Full Authors: Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski
Fair allocation algorithms for indivisible items under structured conflict constraints
Fair allocation algorithms for indivisible items under structured conflict constraints
Year: 2023 |
Journal: Comput. Appl. Math.
Full Authors: Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
Full Authors: Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
[DOI / DBLP]
[arXiv]
Toward characterizing locally common graphs
Toward characterizing locally common graphs
Year: 2023 |
Journal: Random Struct. Algorithms
Full Authors: Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec
Full Authors: Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec
Evaluating group degree centrality and centralization in networks
Evaluating group degree centrality and centralization in networks
Year: 2022 |
Journal: Informatica (Slovenia)
Full Authors: Mario Karlovcec, Matjaz Krnc, Riste Skrekovski
Full Authors: Mario Karlovcec, Matjaz Krnc, Riste Skrekovski
Shifting paths to avoidable ones
Shifting paths to avoidable ones
Year: 2022 |
Journal: J. Graph Theory
Full Authors: Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Full Authors: Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
[DOI / DBLP]
[arXiv]
Multiset-trie data structure - datasets (Version 1.0)
Multiset-trie data structure - datasets (Version 1.0)
Year: 2022 |
Full Authors: Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski
Full Authors: Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski
Computer-assisted verification of confining two-rooted graphs with certain cages (Version 1.0)
Computer-assisted verification of confining two-rooted graphs with certain cages (Version 1.0)
Year: 2022 |
Full Authors: Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Full Authors: Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
The Recognition Problem of Graph Search Trees
The Recognition Problem of Graph Search Trees
Year: 2021 |
Journal: SIAM J. Discret. Math.
Full Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
Full Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
Graphs with Two Moplexes
Graphs with Two Moplexes
Year: 2021 |
Venue: Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / S\~ao Paulo, Brazil, May 2021
Full Authors: Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Full Authors: Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Graphs where Search Methods are Indistinguishable
Graphs where Search Methods are Indistinguishable
Year: 2021 |
Journal: CoRR
Full Authors: Matjaz Krnc, Nevena Pivac
Full Authors: Matjaz Krnc, Nevena Pivac
[DOI / DBLP]
[arXiv]
Recognizing generalized Petersen graphs in linear time
Recognizing generalized Petersen graphs in linear time
Year: 2020 |
Journal: Discret. Appl. Math.
Full Authors: Matjaz Krnc, Robin J. Wilson
Full Authors: Matjaz Krnc, Robin J. Wilson
Eccentricity of networks with structural constraints
Eccentricity of networks with structural constraints
Year: 2020 |
Journal: Discuss. Math. Graph Theory
Full Authors: Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
Full Authors: Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
Fair Packing of Independent Sets
Fair Packing of Independent Sets
Year: 2020 |
Venue: Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings
Full Authors: Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Full Authors: Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
[DOI / DBLP]
[arXiv]
Positive Aging Admits Fast Asynchronous Plurality Consensus
Positive Aging Admits Fast Asynchronous Plurality Consensus
Year: 2020 |
Venue: PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020
Full Authors: Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc
Full Authors: Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc
Edge Elimination and Weighted Graph Classes
Edge Elimination and Weighted Graph Classes
Year: 2020 |
Venue: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers
Full Authors: Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
Full Authors: Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
Fast recognition of some parametric graph families
Fast recognition of some parametric graph families
Year: 2020 |
Journal: CoRR
Full Authors: Nina Klobas, Matjaz Krnc
Full Authors: Nina Klobas, Matjaz Krnc
[DOI / DBLP]
[arXiv]
On the End-Vertex Problem of Graph Searches
On the End-Vertex Problem of Graph Searches
Year: 2019 |
Journal: Discret. Math. Theor. Comput. Sci.
Full Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
Full Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
[DOI / DBLP]
[arXiv]
Generalized Petersen graphs and Kronecker covers
Generalized Petersen graphs and Kronecker covers
Year: 2019 |
Journal: Discret. Math. Theor. Comput. Sci.
Full Authors: Matjaz Krnc, Tomaz Pisanski
Full Authors: Matjaz Krnc, Tomaz Pisanski
Recognizing Graph Search Trees
Recognizing Graph Search Trees
Year: 2019 |
Venue: Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019
Full Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
Full Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
[DOI / DBLP]
[arXiv]
Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies
Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies
Year: 2018 |
Journal: CoRR
Full Authors: Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc
Full Authors: Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc
[DOI / DBLP]
[arXiv]
Closeness centralization measure for two-mode data of prescribed sizes
Closeness centralization measure for two-mode data of prescribed sizes
Year: 2016 |
Journal: Netw. Sci.
Full Authors: Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
Full Authors: Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
Group centralization of network indices
Group centralization of network indices
Year: 2015 |
Journal: Discret. Appl. Math.
Full Authors: Matjaz Krnc, Riste Skrekovski
Full Authors: Matjaz Krnc, Riste Skrekovski
Centralization of transmission in networks
Centralization of transmission in networks
Year: 2015 |
Journal: Discret. Math.
Full Authors: Matjaz Krnc, Riste Skrekovski
Full Authors: Matjaz Krnc, Riste Skrekovski
Cyclic colorings of plane graphs with independent faces
Cyclic colorings of plane graphs with independent faces
Year: 2012 |
Journal: Eur. J. Comb.
Full Authors: Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho
Full Authors: Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho
Extending Fractional Precolorings
Extending Fractional Precolorings
Year: 2012 |
Journal: SIAM J. Discret. Math.
Full Authors: Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec
Full Authors: Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec
Improved induced matchings in sparse graphs
Improved induced matchings in sparse graphs
Year: 2010 |
Journal: Discret. Appl. Math.
Full Authors: Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
Full Authors: Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
Full lists available on DBLP or Google Scholar.
Grants & Awards
| Year | Details |
|---|---|
| 2022–2024 | ARRS bilateral research project (BI-US/22-24-093), with Rutgers University (USA) |
| 2019–2021 | ARRS bilateral research project (BI-US/19-21-018), with Rutgers University (USA) |
| 2019 | Erasmus+ mobility project with Brandenburg University of Technology Cottbus–Senftenberg |
| 2016 | Funds for attending São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization |
| 2015 | Award for early PhD defense |
| 2013 | Ad-futura mobility grant for PhD students (Research visit to Warwick University) |
Talks & Visits
Seminar Talks & Public Lectures
| Date | Institution |
|---|---|
| 2025 Apr. | FAMNIT math seminar |
| 2024 May | Fachgebiet Diskrete Mathematik und Grundlagen der Informatik (B-TU Cottbus) |
| 2024 Feb. | Rhodes College, Tennessee, USA |
| 2024 Feb. | Institute of Combinatorics, University of Memphis, USA |
| 2023 Mar. | Masaryk University, Brno, Czech Republic |
| 2023 Mar. | Fachgebiet Diskrete Mathematik und Grundlagen der Informatik (B-TU Cottbus) |
| 2022 Aug. | ORADA (Computer Science Summer School at UP FAMNIT) |
| 2020 Mar. | Masaryk University, Brno, Czech Republic |
| 2020 Feb. | Fachgebiet Diskrete Mathematik und Grundlagen der Informatik (B-TU Cottbus) |
| 2019 Nov. | Open University, Milton Keynes, UK |
| 2019 Aug. | HSE, Faculty of Computer Science, Moscow |
| 2019 May | FIN-TECH Risk management workshop on Blockchains (Joseph Stefan Institute) |
| 2019 Jan. | Matematični dan (Public Lecture, UP FAMNIT) |
| 2018 Dec. | Department of Mathematics, FAMNIT (UP) |
| 2018 Aug. | Matematika je kul (Summer school for mathematics, UP FAMNIT) |
| 2018 Feb. | Software Tools for Mathematics, SageDays’97 workshop (UP FAMNIT) |
| 2018 Feb. | Fachgebiet Diskrete Mathematik und Grundlagen der Informatik (B-TU Cottbus) |
| 2017 Nov. | Computer Laboratory (University of Cambridge) |
| 2017 Oct. | Oberseminar Arbeitsbereich ART, Fachbereich Informatik (Universität Hamburg) |
| 2016 Jun. | Efficient Algorithms Group (Salzburg University) |
| 2016 Apr. | Department of Information Science and Technologies, FAMNIT (UP) |
Research Visits
- Europe: INRIA (France), University of West Bohemia (Czech), Charles University (Czech), Pavol Jozef Šafárik University (Slovakia), Warsaw University (Poland), University of Zagreb (Croatia), LIAFA (France), Universität Hamburg (Germany), Cambridge (UK), Brandenburgische Technische Universität (Germany), Karl-Franzens-Universität Graz (Austria), Masaryk University (Czech).
- USA: Rhodes College (TN), University of Memphis (TN), Rutgers University (NJ).
- Other: HSE (Moscow), National Institute of Informatics (Tokyo).
Organised Events
| Date | Event | Webpage |
|---|---|---|
| 2023 Oct. | SCORES 2023 - 9th Student Computing Research Symposium | www.scores.si |
| 2022 Oct. | MATCOS 2022 : Middle-European Conference on Applied Theoretical Computer Science | matcos.iam.upr.si |
| 2021 Sep. | GROW 2022 : The Workshop on Graph Classes, Optimization and Width Parameters | grow.famnit.upr.si |
| 2019 Oct. | MATCOS 2019 : Middle-European Conference on Applied Theoretical Computer Science | matcos.iam.upr.si |
| 2019 Oct. | StuCoSReC 2019 - The 6th Student Computer Science Research Conference | stucosrec.feri.um.si/2019 |
| 2018 Feb. | Software Tools for Mathematics, SageDays’97 workshop | stm.famnit.upr.si |
Research Collaborations & Students
MSc Students: Mikita Akulich, Nina Klobas, Nevena Pivač, Ina Bašić.
BSc Students: Mikita Akulich, Jelena Ilić, Đorđe Klisura, Ina Bašić, Hannah Meit.
Research Collaborators: I have had the pleasure of doing research (one week or more) with: Jernej Azarija, Vesna Andova, Nino Bašič, Gregor Bankhamer, Jesse Beisegel, Petra Berenbrink, Marthe Bonamy, Nina Chiarelli, Maria Chudnovsky, Clément Dallard, Andreas Darmann, Carolin Denkert, Zdenek Dvorak, Robert Elsaesser, Rok Erman, Robert Ganian, Frederik Garbe, Pascal Gollin, Eric Gottlieb, Janko Gravner, Vladimir Gurvich, Robert Hancock, Meike Hatzel, Frederic Havet, Claire Hilaire, Tomas Kaiser, Dominik Kaaser, Frantisek Kardos, Lukasz Kowalik, Peter Kling, Ekkehard Köhler, Daniel Kráľ, Martin Kupec, Ander Lamaison, Anita Liebenau, Borut Lužar, Aljoscha Mayer, Martin Milanič, Martina Mockovciakova, Samuel Mohr, Peter Muršič, Vít Musil, Sarka Petrickova, Ulrik Pferschy, Michał Pilipczuk, Tomaž Pisanski, Jean-Florent Raymond, Nicolás Rivera, Ondrej Rucky, Thomas Sauerwald, Joachim Schauer, Robert Scheffler, Jean-Sebastien Sereni, Ladislav Stacho, Martin Strehler, John Sylvester, Riste Škrekovski, Jan Volec, Misha Vyalyi, Tomasz Walen, Robin J Wilson, Zelealem Yilma.
Thesis Supervision
Are you considering writing a thesis under my supervision? Please identify an area of math/CS you are passionate about, then email me to arrange a meeting.
Useful Resources
From Fan Chung’s webpage.
- Tips for Graduate Students - For those wishing to explore the world of mathematics.
- The Hardy-Littlewood Collaboration Rule - An overview of the collaboration ethos I support.