Jurij Mihelic

Orcid: 0000-0002-7662-4827

Affiliations:
  • University of Ljubljana, Slovenia


According to our database1, Jurij Mihelic authored at least 16 papers between 2002 and 2025.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Towards a Formal Verification of the Bao Hypervisor.
Proceedings of the Foundations and Practice of Security - 18th International Symposium, 2025

2021
An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms.
Open Comput. Sci., 2021

Graph automorphisms for compression.
Open Comput. Sci., 2021

2019
A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms.
Symmetry, 2019

2017
Chapter Three - Adaptation and Evaluation of the Simplex Algorithm for a Data-Flow Architecture.
Adv. Comput., 2017

Symmetry-Compressible Graphs.
Proceedings of the 2017 Data Compression Conference, 2017

2015
Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem.
Int. J. Pattern Recognit. Artif. Intell., 2015

SicSim: A simulator of the educational SIC/XE computer for a system-software course.
Comput. Appl. Eng. Educ., 2015

Evaluating the effect of the automatic assessment introduction in the ADS1 course practical work.
Proceedings of the 38th International Convention on Information and Communication Technology, 2015

Maximum exploratory equivalence in trees.
Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

2014
Search Strategies for Subgraph Isomorphism Algorithms.
Proceedings of the Applied Algorithms - First International Conference, 2014

Exploratory Equivalence in Graphs: Definition and Algorithms.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2010
Two-stage flexible-choice problems under uncertainty.
Eur. J. Oper. Res., 2010

Flexible-attribute problems.
Comput. Optim. Appl., 2010

2005
Solving the k-center Problem Efficiently with a Dominating Set Algorithm.
J. Comput. Inf. Technol., 2005

2002
Approximation Algorithms for the k-center Problem: An Experimental Evaluation.
Proceedings of the Operations Research Proceedings 2002, 2002


  Loading...