Jurij Mihelic

15 papers B 1C 2Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2021 J jnl
An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms.
Open Comput. Sci.
Jurij Mihelic, Uros Cibej
2021 J jnl
Graph automorphisms for compression.
Open Comput. Sci.
Uros Cibej, Jurij Mihelic
2019 J jnl
A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms.
Symmetry
Uros Cibej, Luka Fürst, Jurij Mihelic
2017 J jnl
Chapter Three - Adaptation and Evaluation of the Simplex Algorithm for a Data-Flow Architecture.
Adv. Comput.
Uros Cibej, Jurij Mihelic
2017 B conf
Symmetry-Compressible Graphs.
DCC
Uros Cibej, Jurij Mihelic
2015 — conf
Evaluating the effect of the automatic assessment introduction in the ADS1 course practical work.
MIPRO
Igor Rozanc, Jurij Mihelic
2015 J jnl
Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem.
Int. J. Pattern Recognit. Artif. Intell.
Uros Cibej, Jurij Mihelic
2015 C conf
Maximum exploratory equivalence in trees.
FedCSIS
Luka Fürst, Uros Cibej, Jurij Mihelic
2015 J jnl
SicSim: A simulator of the educational SIC/XE computer for a system-software course.
Comput. Appl. Eng. Educ.
Jurij Mihelic, Tomaz Dobravec
2014 C conf
Exploratory Equivalence in Graphs: Definition and Algorithms.
FedCSIS
Jurij Mihelic, Luka Fürst, Uros Cibej
2014 — conf
Search Strategies for Subgraph Isomorphism Algorithms.
ICAA
Uros Cibej, Jurij Mihelic
2010 J jnl
Flexible-attribute problems.
Comput. Optim. Appl.
Jurij Mihelic, Borut Robic
2010 J jnl
Two-stage flexible-choice problems under uncertainty.
Eur. J. Oper. Res.
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, Borut Robic
2005 J jnl
Solving the k-center Problem Efficiently with a Dominating Set Algorithm.
J. Comput. Inf. Technol.
Jurij Mihelic, Borut Robic
2002 — conf
Approximation Algorithms for the k-center Problem: An Experimental Evaluation.
OR
Jurij Mihelic, Borut Robic