Aleksandra Stojanova

Aleksandra Stojanova

Auto-generated profile, based on publicly available information

Aleksandra Stojanova

Goce Delčev University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2022 in Soil Dynamics and Earthquake Engineering
Verified
Journal Article
Closed access
VKV. Kokalanov
V. Kokalanov
MTMihailo D. Trifunac
Mihailo D. Trifunac
VGV. Gičev
V. Gičev
MVMirjana Kocaleva Vitanova
Mirjana Kocaleva Vitanova
AIAleksandra Stojanova Ilievska
Aleksandra Stojanova Ilievska

28 March 2022
Verified
Conference Paper
Closed access
LLLimonka Koceva Lazarova
Limonka Koceva Lazarova
NSNatasha Stojkovikj
Natasha Stojkovikj
AIAleksandra Stojanova Ilievska
Aleksandra Stojanova Ilievska
MMMarija Miteva
Marija Miteva
The basic aim of mathematics education was described as “to bring mathematical knowledge and skills that are required by daily life to the individual, to teach students problem solving and to bring them a way of thinking that handles incidents including a problem-solving approach”. For this reason, problem-solving skills take an important place among mathematical skills. Mathematics (NCTM) standards also indicate that problem-solving skills have higher priority in teaching mathematics. One of the mathematical disciplines which has great application for solving of the real problems is the graph theory. Graph theory as a part of mathematics has the potential to become a popular tool for teaching and learning mathematics in elementary and secondary school for solving and understanding of many logical puzzles. This kind of puzzles are very complicated and present complex problems for understanding by the students at elementary and secondary level. But, by using the basic concept of graph theory the students can easily make visualization of such kind of problems and can easily prepare for different kind of mathematical competitions. The graph theory can facilitate the learning process, because it provides good illustrations by which the applications of the ideas can be shown and presented to the children. In this paper we are considering a methodology that improve the students’ ability for logical thinking. For that purpose, we will consider some kind of logical mathematical problems which are usually given at the mathematical classes but especially for gifted and talented students.

5 June 2026 in Balkan Journal of Applied Mathematics and Informatics
Verified
Journal Article
Open access
PDF file
NSNatasha Stojkovikj
Natasha Stojkovikj
SFStefanija Fileva
Stefanija Fileva
AIAleksandra Stojanova Ilievska
Aleksandra Stojanova Ilievska
LLLimonka Koceva Lazarova
Limonka Koceva Lazarova
CBCveta Martinovska Bande
Cveta Martinovska Bande
VKVasko Kokalanov
Vasko Kokalanov
Efficient route determination in transportation networks represents an important challenge in modern navigation systems, logistics planning, and traffic management. Models based on graph theory provide an appropriate mathematical framework for representing road infrastructure and analyzing optimal paths between different locations. This paper examines the application of Dijkstra’s algorithm for solving the shortest-path problem in transportation networks modeled as weighted graphs. In the proposed model, cities in the Republic of North Macedonia are represented as vertices, while road connections between them are modeled as edges whose weights correspond to real geographical distances expressed in kilometers. To demonstrate the practical applicability of the proposed approach, a software application implemented in the Java programming language was developed. The system enables users to select a starting and a destination location, after which the algorithm automatically computes the shortest route within the modeled transportation network. The developed model illustrates how graph algorithms can be applied in the analysis and optimization of real transportation systems. The results obtained from the analysis of the modeled road network indicate that the algorithm efficiently identifies optimal routes and supports decision-making in route planning. The study confirms that Dijkstra’s algorithm represents a reliable and computationally efficient method for solving shortest-path problems in road networks. The proposed approach has potential applications in navigation systems, transportation planning, and logistics optimization, highlighting the practical significance of graph algorithms in modern transportation infrastructures.

19 November 2026 in Diagnostics
Verified
Journal Article
Open access
PDF file
MPMaja Kukusheva Paneva
Maja Kukusheva Paneva
Saso KoceskiSaso Koceski
Saso Koceski
AIAleksandra Stojanova Ilievska
Aleksandra Stojanova Ilievska
NSNatasha Stojkovikj
Natasha Stojkovikj
Background/Objectives: This retrospective methodological case study evaluated outcome classification in the first 501 laboratory-confirmed COVID-19 cases in North Macedonia (37 deaths; 7.39%). Methods: Six machine learning classifiers were compared with ZeroR and ridge logistic regression using stratified 10-fold cross-validation, supplemented by five repetitions. The primary analysis used 19 demographic, symptom and comorbidity predictors without hospitalization status. Symptom timestamps were unavailable, so performance at initial assessment could not be established. Results: J48 matched the majority-class accuracy of 92.6%; no classifier exceeded it. Naïve Bayes achieved the highest AUROC (0.863), MCC (0.369) and Death-class sensitivity (0.486). Logistic regression achieved AUROC 0.800 (95% CI 0.709–0.891), numerically exceeding five of the six machine learning classifiers; the conventional benchmark was competitive. Its repeated cross-validation AUROC was 0.801 ± 0.003. Bagging had the lowest Brier score (0.058), whereas Naïve Bayes and Random Tree had negative scaled Brier scores despite their discrimination above chance. Including hospitalization increased the Naïve Bayes AUROC to 0.893 and sensitivity to 0.649. Decision curves suggested net benefit at selected thresholds, but uncertainty and miscalibration limit interpretation. Separate exploratory permutation and SHAP analyses of a scikit-learn Random Forest reconstruction identified difficulty breathing, age and cardiovascular disease as prominent contributors; these explanations cannot be attributed directly to the evaluated WEKA ensemble. Conclusions: The contribution is a cohort-specific demonstration of how accuracy, discrimination, calibration and net benefit can support different conclusions, rather than a new algorithm or deployable mortality model. The small event count, uncertain predictor timing and absence of external validation preclude clinical implementation.