Approximation Algorithms for the k-center Problem: An Experimental Evaluation. - Jurij Mihelic; Borut Robic (OR, 2002)

Solving the k-center Problem Efficiently with a Dominating Set Algorithm. - Jurij Mihelic; Borut Robic (J. Comput. Inf. Technol., 2005)

Flexible-attribute problems. - Jurij Mihelic; Borut Robic (Comput. Optim. Appl., 2010)

Two-stage flexible-choice problems under uncertainty. - Jurij Mihelic; Amine Mahjoub; Christophe Rapine; Borut Robic (Eur. J. Oper. Res., 2010)

Exploratory Equivalence in Graphs: Definition and Algorithms. - Jurij Mihelic; Luka Fürst; Uros Cibej (FedCSIS, 2014)

Search Strategies for Subgraph Isomorphism Algorithms. - Uros Cibej; Jurij Mihelic (ICAA, 2014)

Maximum exploratory equivalence in trees. - Luka Fürst; Uros Cibej; Jurij Mihelic (FedCSIS, 2015)

Evaluating the effect of the automatic assessment introduction in the ADS1 course practical work. - Igor Rozanc; Jurij Mihelic (MIPRO, 2015)

SicSim: A simulator of the educational SIC/XE computer for a system-software course. - Jurij Mihelic; Tomaz Dobravec (Comput. Appl. Eng. Educ., 2015)

Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem. - Uros Cibej; Jurij Mihelic (Int. J. Pattern Recognit. Artif. Intell., 2015)

Symmetry-Compressible Graphs. - Uros Cibej; Jurij Mihelic (DCC, 2017)

Chapter Three - Adaptation and Evaluation of the Simplex Algorithm for a Data-Flow Architecture. - Uros Cibej; Jurij Mihelic (Adv. Comput., 2017)

A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms. - Uros Cibej; Luka Fürst; Jurij Mihelic (Symmetry, 2019)

Graph automorphisms for compression. - Uros Cibej; Jurij Mihelic (Open Comput. Sci., 2021)

An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms. - Jurij Mihelic; Uros Cibej (Open Comput. Sci., 2021)