Matjaz Krnc

According to our database, Matjaz Krnc authored at least 31 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

Growing Trees and Amoebas' Replications.

Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi

CoRR, 2024

2023

Fair allocation algorithms for indivisible items under structured conflict constraints.

Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer

Comput. Appl. Math., October, 2023

Fair Allocation of Indivisible Items with Conflict Graphs.

Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer

Algorithmica, May, 2023

Multiset-Trie Data Structure.

Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski

Algorithms, March, 2023

Toward characterizing locally common graphs.

Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec

Random Struct. Algorithms, 2023

2022

Shifting paths to avoidable ones.

Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi

J. Graph Theory, 2022

Evaluating group degree centrality and centralization in networks.

Mario Karlovcec, Matjaz Krnc, Riste Skrekovski

Informatica (Slovenia), 2022

Avoidability beyond paths.

Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi

CoRR, 2022

Sprague-Grundy values and complexity for LCTR.

Eric Gottlieb, Matjaz Krnc, Peter Mursic

CoRR, 2022

2021

The Recognition Problem of Graph Search Trees.

Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler

SIAM J. Discret. Math., 2021

Graphs where Search Methods are Indistinguishable.

Matjaz Krnc, Nevena Pivac

CoRR, 2021

Graphs with at most two moplexes.

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic

CoRR, 2021

Graphs with Two Moplexes.

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Distinguishing Graphs via Cycles.

Nina Klobas, Matjaz Krnc

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Eccentricity of networks with structural constraints.

Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma

Discuss. Math. Graph Theory, 2020

Recognizing generalized Petersen graphs in linear time.

Matjaz Krnc, Robin J. Wilson

Discret. Appl. Math., 2020

Fast recognition of some parametric graph families.

Nina Klobas, Matjaz Krnc

CoRR, 2020

Edge Elimination and Weighted Graph Classes.

Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Positive Aging Admits Fast Asynchronous Plurality Consensus.

Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Fair Packing of Independent Sets.

Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Recognizing Graph Search Trees.

Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Generalized Petersen graphs and Kronecker covers.

Matjaz Krnc, Tomaz Pisanski

Discret. Math. Theor. Comput. Sci., 2019

On the End-Vertex Problem of Graph Searches.

Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler

Discret. Math. Theor. Comput. Sci., 2019

2018

Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies.

Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc

CoRR, 2018

2016

Closeness centralization measure for two-mode data of prescribed sizes.

Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma

Netw. Sci., 2016

2015

Centralization of transmission in networks.

Matjaz Krnc, Riste Skrekovski

Discret. Math., 2015

Group centralization of network indices.

Matjaz Krnc, Riste Skrekovski

Discret. Appl. Math., 2015

2012

Extending Fractional Precolorings.

Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec

SIAM J. Discret. Math., 2012

Cyclic colorings of plane graphs with independent faces.

Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho

Eur. J. Comb., 2012

2010

Improved induced matchings in sparse graphs.

Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen

Discret. Appl. Math., 2010