default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuka Fürst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Luka Fürst
, Tomaz Hovelja, Marko Pozenel, Damjan Vavpotic:
Impact of competence on agile effort estimation in academic setting. Softw. Pract. Exp. 54(11): 2144-2159 (2024)- [i1]Marko Pozenel, Luka Fürst, Damjan Vavpotic, Tomaz Hovelja:
Agile Effort Estimation: Comparing the Accuracy and Efficiency of Planning Poker, Bucket System, and Affinity Estimation methods. CoRR abs/2401.16152 (2024) - 2023
- [j6]Marko Pozenel, Luka Fürst, Damjan Vavpotic, Tomaz Hovelja:
Agile Effort Estimation: Comparing the Accuracy and Efficiency of Planning Poker, Bucket System, and Affinity Estimation Methods. Int. J. Softw. Eng. Knowl. Eng. 33(11&12): 1923-1950 (2023) - 2020
- [j5]Luka Fürst, Marjan Mernik, Viljan Mahnic:
Chapter Three - Graph grammar induction. Adv. Comput. 116: 133-181 (2020)
2010 – 2019
- 2019
- [j4]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) - 2015
- [j3]Luka Fürst, Marjan Mernik, Viljan Mahnic:
Converting metamodels to graph grammars: doing without advanced graph grammar features. Softw. Syst. Model. 14(3): 1297-1317 (2015) - [c5]Luka Fürst, Uros Cibej, Jurij Mihelic:
Maximum exploratory equivalence in trees. FedCSIS 2015: 507-518 - [c4]Marko Pozenel, Luka Fürst, Viljan Mahnic:
Introduction of the automated assessment of homework assignments in a university-level programming course. MIPRO 2015: 761-766 - 2014
- [c3]Jurij Mihelic, Luka Fürst, Uros Cibej:
Exploratory Equivalence in Graphs: Definition and Algorithms. FedCSIS 2014: 447-456 - [c2]Luka Fürst, Ales Leonardis:
Feature selection for object detection: The best group vs. the group of best. MIPRO 2014: 1192-1197 - 2011
- [j2]Luka Fürst, Marjan Mernik, Viljan Mahnic:
Improving the graph grammar parser of Rekers and Schürr. IET Softw. 5(2): 246-261 (2011) - [c1]Luka Fürst, Marjan Mernik, Viljan Mahnic:
Graph Grammar Induction as a Parser-Controlled Heuristic Search Process. AGTIVE 2011: 121-136
2000 – 2009
- 2008
- [j1]Luka Fürst, Sanja Fidler, Ales Leonardis:
Selecting features for object detection using an AdaBoost-compatible evaluation function. Pattern Recognit. Lett. 29(11): 1603-1612 (2008)
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-11-07 21:34 CET 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:
