Luka Fürst

Adv. Comput., 2020

2019

A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms.

[BibT_eX]

[DOI]

Uros Cibej

Jurij Mihelic

Symmetry, 2019

2015

Converting metamodels to graph grammars: doing without advanced graph grammar features.

[BibT_eX]

[DOI]

Softw. Syst. Model., 2015

Introduction of the automated assessment of homework assignments in a university-level programming course.

[BibT_eX]

[DOI]

Marko Pozenel

Proceedings of the 38th International Convention on Information and Communication Technology, 2015

Maximum exploratory equivalence in trees.

[BibT_eX]

[DOI]

Uros Cibej

Jurij Mihelic

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

2014

Feature selection for object detection: The best group vs. the group of best.

[BibT_eX]

[DOI]

Ales Leonardis

Proceedings of the 37th International Convention on Information and Communication Technology, 2014

Exploratory Equivalence in Graphs: Definition and Algorithms.

[BibT_eX]

[DOI]

Jurij Mihelic

Uros Cibej

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2011

Improving the graph grammar parser of Rekers and Schürr.

[BibT_eX]

[DOI]

IET Softw., 2011

Graph Grammar Induction as a Parser-Controlled Heuristic Search Process.

[BibT_eX]

[DOI]

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2011

2008

Selecting features for object detection using an AdaBoost-compatible evaluation function.

[BibT_eX]

[DOI]