Snježana Majstorović    Google Scholar Profil

1. R. Scitovski, K. Sabo, P. Nikić, S. Majstorović, A new efficient method for solving the multiple ellipse detection problem, Expert systems with applications (2023), prihvaćen za objavljivanje
   Abstract

   In this paper, we consider the multiple ellipse detection problem based on data points coming from a number of ellipses in the plane not known in advance. In so doing, data points are usually contaminated with some noisy errors. In this paper, the multiple ellipse detection problem is solved as a center-based problem from cluster analysis. Therefore, an ellipse is considered a Mahalanobis circle. In this way, we easily determine a distance from a point to the ellipse and also an ellipse as the cluster center. In the case when the number of ellipses is known in advance, an optimal partition is searched for on the basis of the k-means algorithm that is modified for this case. Hence, a good initial approximation for M-circle-centers is searched for as unit circles with the application of a few iterations of the well-known DIRECT algorithm for global optimization. In the case when the number of ellipses is not known in advance, optimal partitions with 1, 2, … clusters for the case when cluster-centers are ellipses are determined by using an incremental algorithm. Among them, the partition with the most appropriate number of clusters is selected. For that purpose, a new Geometrical Objects-index (GO-index) is defined. Numerous test-examples point to high efficiency of the proposed method. Many algorithms can be found in the literature that recognize ellipses with clear edges well, but that do not recognize ellipses with unclear or noisy edges. On the other hand, our algorithm is specifically used for recognition of ellipses with unclear or noisy edges.
2. S. Majstorović, Maximizing Graovac-Ghorbani Index of Trees with Fixed Maximum Degree, MATCH Communications in Mathematical and in Computer Chemistry 90/3 (2023), 673-684
3. R. Scitovski, S. Majstorović, K. Sabo, A combination of RANSAC and DBSCAN methods for solving the multiple geometrical object detection problem, Journal of Global Optimization 79/3 (2021), 669-686
   Abstract

   In this paper we consider the multiple geometrical object detection problem. On the basis of the set $A$ of data points coming from and scattered among a number of geometrical objects not known in advance, we should reconstruct or detect thosegeometrical objects. A new very efficient method for solving this problem based on avery popular RANSAC method using parameters from DBSCAN method is proposed.Thereby, instead of using classical indexes for recognizing the most appropriatepartition, we use parameters from DBSCAN method which define the necessaryconditions proven to be far more efficient.Especially, the method is applied to solving multiple circle detection problem. In this case, we give both the conditions for the existence of the best circle as arepresentative of the data set and the explicit formulas for the parameters of the bestcircle. In the illustrative example we consider the multiple circle detection problem for the datapoint set $A$ coming from $5$ intersected circles not known in advance. Using Wolfram Mathematica, the proposed method needed between 0.5 - 1 sec to solve this problem.
4. M. Knor, S. Majstorović, A. Teo Masha Toshi, R. Škrekovski, I. Yero, Graphs with the edge metric dimension smaller than the metric dimension, Applied mathematics and computation 401 (2021)
5. M. Knor, S. Majstorović, R. Škrekovski, Graphs preserving total distance upon vertex removal, Electronic Notes in Discrete Mathematics 68 (2018), 107-112
6. M. Knor, S. Majstorović, R. Škrekovski, Graphs preserving Wiener index upon vertex removal, Applied mathematics and computation 338 (2018), 25-32
7. M. Knor, S. Majstorović, R. Škrekovski, Graphs whose Wiener index does not change when a specific vertex is removed, Discrete Applied Mathematics 238 (2018), 126-132
8. S. Majstorović, K. Sabo, J. Jung, M. Klarić, Spectral methods for growth curve clustering, Central European Journal of Operations Research 26/3 (2018), 715-737
   Abstract

   The growth curve clustering problem is analyzed and its connec- tion with the spectral relaxation method is described. For a given set of growth curves and similarity function, a similarity matrix is defined, from which the corresponding similarity graph is constructed. It is shown that a nearly op- timal growth curve partition can be obtained from the eigendecomposition of a specific matrix associated with a similarity graph. The results are illus- trated and analyzed on the set of synthetically generated growth curves. One real-world problem is also given.
9. S. Majstorović, A. Klobučar, T. Došlić, Domination Numbers of m-cactus chains, Ars Combinatoria 125 (2016), 11-22
10. S. Majstorović, G. Caporossi, Bounds and relations involving the adjusted centrality of a tree, Graphs and Combinatorics 31/6 (2015), 2319-2334
11. S. Majstorović, D. Stevanović, A note on graphs with the largest eigenvalue of modularity matrix equal to zero, Electronic Journal of Linear Algebra 27 (2014), 611-618
12. S. Majstorović, T. Došlić, A. Klobučar, K-domination on hexagonal cactus chains, Kragujevac Journal of Mathematics 36/2 (2012), 335-347
13. S. Majstorović, K-domination sets on double linear hexaghonal chains, Aplimat - Journal of applied mathematics 3/3 (2010), 77-86
14. S. Majstorović, A. Klobučar, I. Gutman, Tricyclic Biregular Graphs Whose Energy Exceeds the Number of Vertices, Mathematical Communications 15/1 (2010), 213-222
15. I. Gutman, A. Klobučar, S. Majstorović, C. Adiga, Biregular Graphs Whose Energy Exceeds the Number of Vertices, MATCH Communications in Mathematical and in Computer Chemistry 62/3 (2009), 499-508
16. S. Majstorović, A. Klobučar, I. Gutman, Triregular Graphs Whose Energy Exceeds the Number of Vertices, MATCH Communications in Mathematical and in Computer Chemistry 62/3 (2009), 509-524

1. S. Majstorović, A. Kolos Csaba, A. Vaskovi, Spectral Clustering of Survival Curves, International Symposium of Operational Research SOR'19, Bled, Slovenia, 2019, 81-87

1. S. Majstorović, Turanov teorem, Math.e : hrvatski matematički elektronski časopis (2023), prihvaćen za objavljivanje
2. S. Majstorović, D. Begović, Niz stupnjeva grafa, Osječki matematički list 20/1 (2020), 39-52
3. S. Majstorović, K. Vincetić, Totalna zbrka, Osječki matematički list 17/2 (2017), 109-123
4. K. Vincetić, S. Majstorović, Zanimljivi zadatci s brojem 2017, Poučak 72/18 (2017), 6-23
5. S. Majstorović, L. Boras, Petersenov graf, Math.e : hrvatski matematički elektronski časopis 27 (2015)
6. S. Majstorović, Dirichletov princip, Osječki matematički list 6 (2006), 99-105

1. S. Majstorović, A. Klobučar, I. Gutman, Selected topics from the theory of graph energy: hypoenergetic graphs, Applications of graph spectra / Cvetković, Dragoš; Gutman, Ivan , Matematički institut SANU, Beograd, 2009.

Projects

• Regionalni znanstveni centar Panonske Hrvatske, stručni projekt, nositelj Osječko-baranjska županija (2022.-2024.)

• Modeliranje adsorpcije na nanostrukturama: Graf-teoretički pristup 
  (Modeling adsorption on nanostructures: A graph-theoretical approach), bilateralni hrvatsko-slovenski   projekt pod vodstvom prof.dr.sc. T. Došlić (HR) i izv.prof.dr.sc. R. Škrekovski (SLO), 2016.-2017.  
  

• "Neke primjene geometrijskih reprezentacija u grafovima“ u sklopu kolaborativnog projekta „Geometrijske reprezentacije i simetrije grafova i druge diskretne strukture i primjene u znanosti pod vodstvom prof.dr.sc.A.Klobučar,  2011-2014.
  
• "Pasivna kontrola mehaničkih modela“ pod vodstvom prof.dr.sc.N.Truhara, 2009.-2014.
  
   

Professional Activities

• "Types of domination on m-ary chain cacti", GERAD-Group for Research in Decision Analysis, Montreal, Canada, October 2011
• "Indivisible graphs", Technische universitat, Graz, Austria, January 2015
• "Spectral methods for growth curve clustering", Corvinus University, Budapest, Hungary, April 2018

Study Visits Abroad and Professional Improvements

• DAAD- Biomedical Image Analysis and Bioinformatics - Intensive course, Vrnjačka Banja, Serbia, September 2010
• GERAD-Group for Research in Decision Analysis, Montreal, Canada, October 2011
• Summer School of the Marie Curie ITN 'Environmental ChemoInformatics', Verona, Italy, June 2012
• DAAD- Graph Spectra and Applications- Intensive course, Vrnjačka Banja, Serbia, September 2012
• DAAD- Linear Optimal Control of Dynamic Systems, Osijek, Croatia, September 2013
• Summer School in Discrete Mathematics, Rogla, Slovenia, June 2015
• Montanuniversitat Loeben, Loeben, Austria, September 2015  (ERASMUS+ 2014/2015)
• Montanuniversitat Loeben, Loeben, Austria, September 2015  (ERASMUS+ 2015/2016)
• DAAD - Approximation theory and Applications, Sozopol, Bulgaria, June 2016
• DAAD - Krylov Subspaces and Applications, Golem, Kavaja, Albania, September 2016
• Fakulteta za matematiko in fiziko, Universa v Ljubljani, Ljubljana, Slovenija, 1.03.-5.03. 2017
• Fakulteta za matematiko in fiziko, Universa v Ljubljani, Ljubljana, Slovenija, 16.12.-21.12. 2017
• Fakulteta za matematiko in fiziko, Universa v Ljubljani, Ljubljana, Slovenija, August 2018 (ERASMUS+ 2017/2018)
• Fakulteta za matematiko in fiziko, Universa v Ljubljani, Ljubljana, Slovenija, June 2021 (ERASMUS+ 2021/2022)
• Fakulteta za matematiko in fiziko, Universa v Ljubljani, Ljubljana, Slovenija, October 2022 (ERASMUS+ 2022/2023)

Service Activities

Pripreme za natjecanje IMC  2015

Koordinatorica priprema za međunarodna studentska natjecanja iz matematike: Vojtech 2016, IMC 2017, IMC 2018

Član organizacijskog odbora međunarodne konferencije CroCoDays 2016 , CroCoDays 2018, CroCoDays 2020

IAESTE - mentor   od ak.god. 2016/2017 - ....

Koordinatorica za Festival znanosti od 2018. -...

Festival znanosti 2018: Fourierova otkrića

Festival znanosti 2019: Neriješeni problem bojenja ravnine

Festival znanosti 2022: Eulerova otkrića

Član organizacijskog odbora međunarodne studentske konferencije GREEN 2018

Član organizacijskog odbora međunarodne studentske konferencije GREEN 2022

Član organizacijskog odbora međunarodne konferencije VODA ZA SVE 2019

Večer matematike 2018: Modeliranje pomoću grafova

Član organizacijskog odbora STEM games 2021

Teaching

POPIS TEMA ZAVRŠNIH I DIPLOMSKIH RADOVA (vidljiv samo registriranim korisnicima)

Zadnja promjena: 28.02.2022.

Konzultacije (Office Hours):  Konzultacije su moguće po dogovoru.

Nastavne aktivnosti u ljetnom semestru akademske 2017./2018.

• Primjene diferencijalnog i integralnog računa II
• Kombinatorna i diskretna matematika
• Grupiranje podataka: pristupi, metode i primjene
• Prehrambeno-tehnološki fakultet: Matematika II

Nastavne aktivnosti u zimskom semestru akademske 2017./2018.

• Grafovi
• Građevinski fakultet: Matematika III

Nastavne aktivnosti u ljetnom semestru akademske 2016./2017.

• Primjene diferencijalnog i integralnog računa II
• Prehrambeno-tehnološki fakultet: Matematika II

Nastavne aktivnosti u zimskom semestru akademske 2016./2017.

• Kombinatorna i diskretna matematika
• Grafovi
• Prehrambeno-tehnološki fakultet: Matematika I
• Građevinski fakultet: Matematika III

Nastavne aktivnosti u ljetnom semestru akademske 2015./2016.

• Primjene diferencijalnog i integralnog računa II
• Prehrambeno-tehnološki fakultet: Matematika II
• Građevinski fakultet: Matematika II

Nastavne aktivnosti u zimskom semestru akademske 2015./2016.

• Kombinatorna i diskretna matematika
• Grafovi
• Prehrambeno-tehnološki fakultet: Matematika I
• Građevinski fakultet: Matematika III

Personal

• Birthdate: April 13
• Birthplace: Osijek, Croatia
• Citizenship: Croatian
• Family: /