Martin Milanič is Professor at the University of Primorska’s Faculty of Mathematics, Natural Sciences and Information Technologies. His research focuses on structural and algorithmic graph theory, including treewidth, domination, and clique studies. He chairs the WG 2024 conference and leads projects on graph modification and induced minors. Recent work establishes NP-completeness of treewidth on cubic graphs and characterizes minimally tough graphs. He supervises doctoral students in graph decomposition and independence problems.
Sergio Cabello is a full professor at the Faculty of Mathematics and Physics of the University of Ljubljana, Slovenia, and a researcher at the Institute of Mathematics, Physics and Mechanics. His research focuses on discrete algorithms and computational geometry, with contributions to graph theory, geometric optimization, and algorithm design. He has held editorial roles in journals such as the Journal of Combinatorial Mathematics and Combinatorial Computing, and has participated in numerous conferences as a PC member or invited speaker. His work spans topics like shortest paths in geometric graphs, convex hulls, and algorithmic complexity. Notable recent activities include organizing the Indo-Spanish School of Algorithms and Combinatorics (2025) and serving on the editorial boards of Discrete Mathematics & Theoretical Computer Science and the Journal of Computational Geometry. He has also received best paper awards at SODA 2017 and AGILE 2009 for his contributions to theoretical computer science. Editorial Roles: Journal of Combinatorial Mathematics, Discrete Mathematics & Theoretical Computer Science, Indian Journal of Discrete Mathematics Professional Activities: PC member for EuroCG 2025, WADS steering committee member, invited speaker at GROW 2022 and Discrete Mathematics Days 2024 His research interests include geometric algorithms, graph connectivity, and combinatorial optimization, with a focus on theoretical foundations and algorithmic applications in discrete structures.
Jurij Mihelič is an Associate Professor at the Faculty of Computer and Information Science, University of Ljubljana, and a member of the Laboratory for Algorithms and Data Structures where he conducts research in theoretical and applied computer science. His research interests include: Algorithms and discrete mathematics Combinatorial optimization Computational complexity Operating systems and system software Virtual machines and execution environments Algorithm engineering and experimental algorithmics Graph theory and network analysis Facility location and pattern matching Mihelič teaches courses in Operating Systems and Algorithms and Data Structures I. His research bridges theoretical computer science with practical applications, with a particular focus on developing efficient algorithms and system software solutions. His work spans both theoretical foundations and practical implementations, demonstrating a strong commitment to connecting academic research with real-world problems. His publications demonstrate consistent contributions to algorithm design, graph theory, and combinatorial optimization, showing a progression from purely theoretical work toward more applied research in recent years. Key themes include facility location problems, subgraph isomorphism algorithms, and educational tools for system software concepts. Mihelič has been actively involved in the academic community, serving on organizing committees for significant conferences including EuroCG 2015, LADS3 2014, and ALGO 2012. He is currently involved in multiple research projects, most notably the ARRS research program 'Parallel and distributed systems' (2020-2026), along with several other projects focused on graph optimization, big data, and system software development.
Ademir Hujdurović is a Full Professor and Dean of the Faculty of Mathematics, Natural Sciences and Information Technologies at the University of Primorska in Slovenia. His academic career spans over a decade at the university, progressing from PhD student to his current leadership position. He maintains strong affiliations with the international mathematics community through editorial work and conference organization. Dr. Hujdurović earned his PhD in mathematics in 2013 at the University of Primorska under Professors Dragan Marušič and Klavdija Kutnar. His academic journey began with exceptional performance at the University of Tuzla, where he received the Gold Plaque for Best Student of the Generation with a perfect 10.00 average in 2009. His research focuses on graph theory, particularly the properties and characterization of symmetric graphs. His extensive publication record demonstrates deep expertise in algebraic graph theory, with emphasis on vertex-transitive graphs, circulant graphs, and the relationship between graph theory and group theory. His work bridges pure mathematics with applications in computational biology, particularly in phylogenetics and cancer genomics. The publication trends show consistent output in top combinatorics journals with increasing international collaboration. Dr. Hujdurović has received significant recognition for his contributions: Kalman Visiting Fellowship, University of Auckland, New Zealand (2024) Scientific Excellence Award (Best Researcher of the Year), University of Primorska (2019) Gold Plaque for Best Student of the Generation, University of Tuzla (2009) As an academic leader, he serves as Managing Editor of Ars Mathematica Contemporanea and Editorial Board Member of The Art of Discrete and Applied Mathematics. He actively mentors students, currently advertising a PhD position in algebraic graph theory for October 2025. His teaching portfolio includes advanced courses in Algebra, Abstract Algebra, and Algebraic Theory of Graphs. He has been instrumental in organizing the annual PhD Summer School in Discrete Mathematics since 2013 and major events like the 8th European Congress of Mathematics (2021). Dr. Hujdurović leads a vibrant research group focused on algebraic graph theory and regularly collaborates with international researchers. His leadership in organizing the "Groups, Graphs, and Everything in Between" conference dedicated to Dragan Marušič's 70th birthday (2023) highlights his standing in the international graph theory community.
Gašper Fijavž is a Full Professor at the Faculty of Computer and Information Science, University of Ljubljana. He serves as the Vice Dean for Education and teaches courses such as Discrete Structures , Discrete Mathematics , and Mathematics 2 . He is a member of the Laboratory for Mathematical Methods in Computer and Information Science .
Assistant Professor at the University of Ljubljana's Faculty of Computer and Information Science (FRI) specializing in theoretical computer science and discrete mathematics. His research bridges cryptography, graph theory, and metric geometry with practical applications in algorithm design and security protocols. Research Focus: Primary interests include cryptography (hash function analysis), graph theory (combinatorial structures, graph databases), and discrete geometry (metric cones, polyhedral combinatorics). His work demonstrates strong interdisciplinary connections between theoretical mathematics and computational problem-solving. Publication Trends: Recent publications reveal a consistent focus on combinatorial structures with applications in both cryptography and geometry. His research combines rigorous mathematical proofs with computational implementations, particularly evident in metric space analysis and graph-theoretical frameworks. Projects: Leads significant open-source initiatives including gap-graphs (computational graph theory) and GraphZOO (graph database), alongside the Kriptogram crypto portal for cryptographic education in Slovene. Teaching: Maintains office hours by appointment with focus on advanced mathematical and cryptographic concepts. Integrates research directly into teaching through computational projects and open-source tools development.
Aleksandar Jurišić is a Full Professor at the Faculty of Computer and Information Science, University of Ljubljana, where he serves as Head of the Laboratory for Cryptography and Computer Security. He also maintains an affiliation with the Institute of Mathematics, Physics and Mechanics (IMFM) in Ljubljana and occasionally teaches at the Faculty of Mathematics. His educational background includes: B.A. from University of Ljubljana (1987), working under Joze Vrabec on topology applications in combinatorics M.Sc. (1990) and Ph.D. (1995) from University of Waterloo, working under Chris Godsil in algebraic combinatorics Jurišić's research interests focus on Algebraic Combinatorics, Cryptography, and Algorithmic Number Theory . His work bridges theoretical mathematics with practical security applications, particularly in elliptic curve cryptography and finite field implementations. He has made notable contributions to understanding mathematical phenomena like the Mercedes knot problem, which connects everyday observations with advanced mathematical concepts. His publications demonstrate a consistent focus on cryptographic implementations, particularly for resource-constrained environments like smart cards. His research spans theoretical mathematics (knot theory, combinatorics) to applied cryptography, showing how abstract mathematical concepts can solve practical security problems. Among his scientific recognitions , he received the Hasse Prize for his paper 'The Mercedes knot problem' published in American Mathematical Monthly. In 2005, he co-founded the Slovenian Society of Cryptology, demonstrating leadership in establishing cryptography as a field in Slovenia. As an educator and mentor , Jurišić has supervised over 25 diploma theses, 4 master's theses, and 1 PhD dissertation. His courses include Probability and Statistics, Cryptography and Computer Security, and Introduction to Probability and Statistics. He has led numerous educational projects focused on e-content development for mathematics and cryptography education. He leads the Laboratory for Cryptography and Computer Security , which has been involved in multiple Structural Funds projects including PKP series (e-content in education), NA-MA POTI (mathematical literacy), and ŠIPK 1 (Cryptogram - a portal for cryptography and computer security).
Dr. Tomaž Pisanski serves as Full Professor and Department Chair of the Department of Information Sciences and Technologies at the University of Primorska in Koper, Slovenia. His academic leadership spans theoretical and applied research across multiple mathematical disciplines. His primary research domains include: Graph Theory and Combinatorics Discrete and Computational Mathematics Chemical Graph Theory applications Computational Genealogy and Heraldry Operations Research and Optimization Theoretical Computer Science foundations Professor Pisanski maintains active teaching responsibilities while directing departmental operations from his office at Kettejeva 1, Cabinet I/01. His contact email tomaz.pisanski@upr.si serves as the primary channel for academic inquiries and collaboration opportunities.
