default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJurij Mihelic
Person information
- affiliation: University of Ljubljana, Slovenia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j9]Jurij Mihelic
, Uros Cibej:
An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms. Open Comput. Sci. 11(1): 33-42 (2021)- [j8]Uros Cibej, Jurij Mihelic:
Graph automorphisms for compression. Open Comput. Sci. 11(1): 51-59 (2021) - 2019
- [j7]Uros Cibej, Luka Fürst, Jurij Mihelic:
A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms. Symmetry 11(10): 1300 (2019) - 2017
- [j6]Uros Cibej, Jurij Mihelic:
Chapter Three - Adaptation and Evaluation of the Simplex Algorithm for a Data-Flow Architecture. Adv. Comput. 106: 63-105 (2017) - 2015
- [j5]Jurij Mihelic, Tomaz Dobravec:
SicSim: A simulator of the educational SIC/XE computer for a system-software course. Comput. Appl. Eng. Educ. 23(1): 137-146 (2015) - [j4]Uros Cibej, Jurij Mihelic:
Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem. Int. J. Pattern Recognit. Artif. Intell. 29(7): 1550025:1-1550025:26 (2015) - 2010
- [j3]Jurij Mihelic, Borut Robic:
Flexible-attribute problems. Comput. Optim. Appl. 47(3): 553-566 (2010) - [j2]Jurij Mihelic, Amine Mahjoub, Christophe Rapine, Borut Robic:
Two-stage flexible-choice problems under uncertainty. Eur. J. Oper. Res. 201(2): 399-403 (2010) - 2005
- [j1]Jurij Mihelic, Borut Robic:
Solving the k-center Problem Efficiently with a Dominating Set Algorithm. J. Comput. Inf. Technol. 13(3): 225-234 (2005)
Conference and Workshop Papers
- 2017
- [c6]Uros Cibej, Jurij Mihelic:
Symmetry-Compressible Graphs. DCC 2017: 435 - 2015
- [c5]Luka Fürst, Uros Cibej, Jurij Mihelic:
Maximum exploratory equivalence in trees. FedCSIS 2015: 507-518 - [c4]Igor Rozanc, Jurij Mihelic:
Evaluating the effect of the automatic assessment introduction in the ADS1 course practical work. MIPRO 2015: 778-783 - 2014
- [c3]Jurij Mihelic, Luka Fürst, Uros Cibej:
Exploratory Equivalence in Graphs: Definition and Algorithms. FedCSIS 2014: 447-456 - [c2]Uros Cibej, Jurij Mihelic:
Search Strategies for Subgraph Isomorphism Algorithms. ICAA 2014: 77-88 - 2002
- [c1]Jurij Mihelic, Borut Robic:
Approximation Algorithms for the k-center Problem: An Experimental Evaluation. OR 2002: 371-376
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
