Matjaz Krnc

Orcid: 0000-0002-4960-8901

According to our database1, Matjaz Krnc authored at least 33 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sprague-Grundy values and complexity for LCTR.
Discret. Appl. Math., 2024

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.
CoRR, 2024

Growing Trees and Amoebas' Replications.
CoRR, 2024

2023
Fair allocation algorithms for indivisible items under structured conflict constraints.
Comput. Appl. Math., October, 2023

Fair Allocation of Indivisible Items with Conflict Graphs.
Algorithmica, May, 2023

Multiset-Trie Data Structure.
Algorithms, March, 2023

Toward characterizing locally common graphs.
Random Struct. Algorithms, 2023

2022
Computer-assisted verification of confining two-rooted graphs with certain cages.
Dataset, August, 2022

Multiset-trie data structure - datasets.
Dataset, August, 2022

Shifting paths to avoidable ones.
J. Graph Theory, 2022

Evaluating group degree centrality and centralization in networks.
Informatica (Slovenia), 2022

Avoidability beyond paths.
CoRR, 2022

2021
The Recognition Problem of Graph Search Trees.
SIAM J. Discret. Math., 2021

Graphs where Search Methods are Indistinguishable.
CoRR, 2021

Graphs with at most two moplexes.
CoRR, 2021

Graphs with Two Moplexes.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Distinguishing Graphs via Cycles.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Eccentricity of networks with structural constraints.
Discuss. Math. Graph Theory, 2020

Recognizing generalized Petersen graphs in linear time.
Discret. Appl. Math., 2020

Fast recognition of some parametric graph families.
CoRR, 2020

Edge Elimination and Weighted Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Positive Aging Admits Fast Asynchronous Plurality Consensus.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Fair Packing of Independent Sets.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Recognizing Graph Search Trees.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Generalized Petersen graphs and Kronecker covers.
Discret. Math. Theor. Comput. Sci., 2019

On the End-Vertex Problem of Graph Searches.
Discret. Math. Theor. Comput. Sci., 2019

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

2016
Closeness centralization measure for two-mode data of prescribed sizes.
Netw. Sci., 2016

2015
Centralization of transmission in networks.
Discret. Math., 2015

Group centralization of network indices.
Discret. Appl. Math., 2015

2012
Extending Fractional Precolorings.
SIAM J. Discret. Math., 2012

Cyclic colorings of plane graphs with independent faces.
Eur. J. Comb., 2012

2010
Improved induced matchings in sparse graphs.
Discret. Appl. Math., 2010


  Loading...