Jurij Mihelic

According to our database, Jurij Mihelic authored at least 15 papers between 2002 and 2021.

Collaborative distances:

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

2021

An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms.

Jurij Mihelic, Uros Cibej

Open Comput. Sci., 2021

Graph automorphisms for compression.

Uros Cibej, Jurij Mihelic

Open Comput. Sci., 2021

2019

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

Uros Cibej, Luka Fürst, Jurij Mihelic

Symmetry, 2019

2017

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

Uros Cibej, Jurij Mihelic

Adv. Comput., 2017

Symmetry-Compressible Graphs.

Uros Cibej, Jurij Mihelic

Proceedings of the 2017 Data Compression Conference, 2017

2015

Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem.

Uros Cibej, Jurij Mihelic

Int. J. Pattern Recognit. Artif. Intell., 2015

SicSim: A simulator of the educational SIC/XE computer for a system-software course.

Jurij Mihelic, Tomaz Dobravec

Comput. Appl. Eng. Educ., 2015

Evaluating the effect of the automatic assessment introduction in the ADS1 course practical work.

Igor Rozanc, Jurij Mihelic

Proceedings of the 38th International Convention on Information and Communication Technology, 2015

Maximum exploratory equivalence in trees.

Luka Fürst, Uros Cibej, Jurij Mihelic

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

2014

Search Strategies for Subgraph Isomorphism Algorithms.

Uros Cibej, Jurij Mihelic

Proceedings of the Applied Algorithms - First International Conference, 2014

Exploratory Equivalence in Graphs: Definition and Algorithms.

Jurij Mihelic, Luka Fürst, Uros Cibej

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2010

Two-stage flexible-choice problems under uncertainty.

Jurij Mihelic, Amine Mahjoub, Christophe Rapine, Borut Robic

Eur. J. Oper. Res., 2010

Flexible-attribute problems.

Jurij Mihelic, Borut Robic

Comput. Optim. Appl., 2010

2005

Solving the k-center Problem Efficiently with a Dominating Set Algorithm.

Jurij Mihelic, Borut Robic

J. Comput. Inf. Technol., 2005

2002

Approximation Algorithms for the k-center Problem: An Experimental Evaluation.

Jurij Mihelic, Borut Robic

Proceedings of the Operations Research Proceedings 2002, 2002