Luka Fürst

13 papers C 2Journal 8Unranked 3
YearRankTypeTitle / Venue / Authors
2024 J jnl
Agile Effort Estimation: Comparing the Accuracy and Efficiency of Planning Poker, Bucket System, and Affinity Estimation methods.
CoRR
Marko Pozenel, Luka Fürst, Damjan Vavpotic, Tomaz Hovelja
2024 J jnl
Impact of competence on agile effort estimation in academic setting.
Softw. Pract. Exp.
Luka Fürst, Tomaz Hovelja, Marko Pozenel, Damjan Vavpotic
2023 J jnl
Agile Effort Estimation: Comparing the Accuracy and Efficiency of Planning Poker, Bucket System, and Affinity Estimation Methods.
Int. J. Softw. Eng. Knowl. Eng.
Marko Pozenel, Luka Fürst, Damjan Vavpotic, Tomaz Hovelja
2020 J jnl
Chapter Three - Graph grammar induction.
Adv. Comput.
Luka Fürst, Marjan Mernik, Viljan Mahnic
2019 J jnl
A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms.
Symmetry
Uros Cibej, Luka Fürst, Jurij Mihelic
2015 J jnl
Converting metamodels to graph grammars: doing without advanced graph grammar features.
Softw. Syst. Model.
Luka Fürst, Marjan Mernik, Viljan Mahnic
2015 — conf
Introduction of the automated assessment of homework assignments in a university-level programming course.
MIPRO
Marko Pozenel, Luka Fürst, Viljan Mahnic
2015 C conf
Maximum exploratory equivalence in trees.
FedCSIS
Luka Fürst, Uros Cibej, Jurij Mihelic
2014 C conf
Exploratory Equivalence in Graphs: Definition and Algorithms.
FedCSIS
Jurij Mihelic, Luka Fürst, Uros Cibej
2014 — conf
Feature selection for object detection: The best group vs. the group of best.
MIPRO
Luka Fürst, Ales Leonardis
2011 — conf
Graph Grammar Induction as a Parser-Controlled Heuristic Search Process.
AGTIVE
Luka Fürst, Marjan Mernik, Viljan Mahnic
2011 J jnl
Improving the graph grammar parser of Rekers and Schürr.
IET Softw.
Luka Fürst, Marjan Mernik, Viljan Mahnic
2008 J jnl
Selecting features for object detection using an AdaBoost-compatible evaluation function.
Pattern Recognit. Lett.
Luka Fürst, Sanja Fidler, Ales Leonardis