Find Academic Supervisors

Florian GalliotView profile

Associate Professor

• Positional Games
• Structural Graph Theory
• Combinatorial Games
• +5 more

Florian Galliot is an Associate Professor in Mathematics at Aix-Marseille University, conducting research with the GDAC team at the Institut de Mathématiques de Marseille (I2M) and teaching in the Computer Science department of IUT d'Aix-Marseille. Previously, he was a temporary teaching and research assistant at Université de Bordeaux and completed his PhD in discrete mathematics at Institut Fourier under Sylvain Gravier and Isabelle Sivignon, defended on July 3, 2023. His primary research interests include: Positional Games and Combinatorial Games Structural Graph Theory Hypergraphs and their properties Reconstruction and Reconfiguration Problems in graphs Galliot's research focuses on positional games, a family of combinatorial games played on hypergraphs (including games like tic-tac-toe, Hex, and Sim). His work bridges theoretical mathematics with practical applications, examining computational complexity, game strategies, and structural properties of graphs and hypergraphs. He has made significant contributions to understanding the Maker-Breaker game, Avoider-Enforcer games, and poset positional games, with several publications in top journals and conferences. His recent publications (2023-2025) demonstrate a consistent research trajectory in positional games on hypergraphs, with a particular focus on computational complexity and structural properties. His work shows increasing sophistication in analyzing games on hypergraphs of various ranks, with several results establishing polynomial-time solutions or complexity classifications. Galliot is actively involved in mathematics popularization: Member of 'Maths à Modeler' federative structure Participant in Science Festival, Culture and Mathematical Games Fair, Remue-Méninges Festival Previously supervised the mathematics club 'Les maths autrement' in Grenoble (2019-2022) His teaching portfolio spans fundamental mathematical tools, graph theory, cryptography, automata and languages, and algorithm implementation across multiple institutions including Aix-Marseille University, Université de Bordeaux, and Grenoble Alpes University.

Igor Z. MilovanovicView profile

Professor

• Applied Mathematics
• Parallel Computing
• Algorithm Design
• +2 more

Igor Z. Milovanovic serves as a Full Professor in the Department of Mathematics at the Faculty of Electronic Engineering, University of Nis, Serbia, a position he has held since his appointment in 1991. His academic career is deeply rooted in the institution where he completed all his formal education, establishing him as a cornerstone of the mathematics and computing disciplines within this engineering faculty. His educational background reflects a lifelong commitment to applied mathematical sciences at the University of Nis: PhD in Applied Mathematics (1980), Faculty of Electronic Engineering MSc in Applied Mathematics (1978), Faculty of Electronic Engineering BSc in Mathematics (1975), Faculty of Electronic Engineering Professor Milovanovic's research program bridges theoretical mathematics and practical computational engineering, with primary expertise in parallel computing architectures and algorithm optimization. His work focuses on systolic array implementations for matrix operations, graph algorithms, and linear algebra problems, consistently targeting hardware-efficient solutions for high-performance computing challenges. This interdisciplinary approach integrates mathematical rigor with computer architecture considerations to solve complex computational problems. Analysis of his publication trajectory reveals a sustained concentration on systolic array methodologies across three decades, evolving from foundational matrix algorithms in the 1990s toward FPGA-based hardware implementations and fault-tolerant systems in the 2000s. With 50 total publications including 32 in impact-factor journals, his contributions demonstrate significant impact in parallel processing and reconfigurable computing domains, particularly in optimizing classical algorithms for specialized hardware architectures. No scientific awards or major honors are documented in the available records. He currently participates in one national research project, though international collaborations appear absent from his active portfolio. His advisory activities are not explicitly detailed, but his extensive publication history suggests substantial mentorship of graduate researchers. The professor operates within the Department of Mathematics framework at the Faculty of Electronic Engineering, with no indication of dedicated laboratory facilities or named research teams in the provided documentation. His work remains closely integrated with the department's computational mathematics focus while maintaining strong connections to computer engineering applications.

Mirjana MikalackiView profile

Professor

• Positional games on graphs
• Discrete random structures
• Algorithms on graphs
• +1 more

Mirjana Mikalacki is a Full Professor in the Department of Mathematics and Informatics at the Faculty of Sciences, University of Novi Sad. She has held academic positions since 2009, advancing from Teaching Assistant to her current rank. Her research focuses on positional games on graphs, discrete random structures, graph algorithms, and combinatorial optimization. She has organized multiple workshops, including the Novi Sad Workshop on Foundations of Computer Science (NSFOCS) series. Education: Ph.D. (2014) and B.Sc. (2007) in Computer Science from the University of Novi Sad. She has also attained advanced English language certifications (CPE, CAE, FCE) and holds proficiency in German and other Slavic languages. Her publications (15+ articles) span journals like Discrete Mathematics and Electronic Journal of Combinatorics , focusing on positional game strategies, graph algorithms, and combinatorial optimization. Recent work includes analysis of optimal paths in graphs and game dynamics in multi-stage and Walker-Breaker scenarios. No scientific awards explicitly mentioned. Her teaching includes courses in programming and informatics. She advises no listed students but collaborates on research projects involving graph theory and algorithmic game theory.

Alexey PokrovskiyView profile

Lecturer

• Discrete Mathematics
• Combinatorics
• Graph Theory
• +10 more

Alexey Pokrovskiy is a Lecturer in the Department of Mathematics at University College London (UCL), part of the Faculty of Mathematical and Physical Sciences. His research focuses on Discrete Mathematics and Combinatorics, with particular emphasis on graph theory, Ramsey theory, and positional games. He holds a PhD from the London School of Economics (LSE), supervised by Professors Jan van den Heuvel and Jozef Skokan. Prior to UCL, he held postdoctoral positions at Freie Universität Berlin (with Prof. Tibor Szabó) and ETH Zurich (with Prof. Benny Sudakov), and was a lecturer at Birkbeck, University of London. His research interests include Latin squares, Ramsey theory, probability, graph partitioning, Hamiltonian cycles, graph limits, directed graphs, regularity lemmas, hypergraph matchings, algorithms, and positional games. He has contributed to numerous conferences and published extensively on topics such as monochromatic cycle partitioning, rainbow trees, Rota's basis conjecture, and extremal graph theory. Key achievements include resolving Ringel's conjecture, counterexamples to Stein's equi-n-square conjecture, and advancements in understanding Ramsey numbers and graph decomposition. His work often bridges combinatorial theory and algorithmic applications, with a focus on structural graph properties and extremal problems.

• Operations Research
• Optimization
• Electric Vehicle Scheduling
• +3 more

Raka Jovanović is a Researcher at Singidunum University , affiliated with the Faculty of Informatics and Computing . His work bridges theoretical algorithm design with practical applications in transportation, energy systems, and optimization. Bachelor's, Matematički fakultet - Beograd (2002) Postgraduate, Matematički fakultet - Beograd (2007) Doctorate, Matematički fakultet - Beograd (2016) His research focuses on metaheuristics and matheuristics for complex optimization problems, including: Knapsack problems with penalty constraints Electric vehicle charging infrastructure planning Graph-based combinatorial optimization Energy management in extreme climates Integration of machine learning with traditional algorithms Recent publications demonstrate a strong emphasis on Fixed Set Search as a unifying methodology across diverse domains. Journal articles in 2024-2025 explore its application to: Maximum Diversity Problem Multidimensional knapsack Charging station placement Multi-objective optimization Conference papers from 2023-2024 highlight collaboration with international teams on: EV fleet scheduling Desert climate agricultural energy systems Max-Cut and disjoint dominating sets problems Waterway transport prediction models

• Object-Oriented Programming
• Algorithms
• Computer Science
• +3 more

Александар Купусинац is a Full Professor at the Department of Applied Computing Sciences within the Faculty of Technical Sciences, University of Novi Sad. He holds roles including Deputy Dean for Teaching since 2020. His expertise spans Object-Oriented Programming (C++, Java, C#), Algorithm Theory, and Software Engineering. Education: Completed Bachelor's in Electrical Engineering and Computing (2005, GPA 9.71), Master's in Applied Mathematics (2008), and PhD in Dynamical Postulates Analysis (2010). Awards include the prestigious Milena Maric-Ainstein Award and a Norwegian Government Scholarship. Teaching: Leads courses on Object-Oriented Programming and Advanced Software Design. Research focuses on algorithm optimization, programming paradigms, and mathematical foundations of computing. Key Achievements: 15+ years of academic service, 50+ teaching hours annually Labs/Teams: Member of Programming Languages Research Group

Prosenjit K. BoseView profile

Professor

• Computational Geometry
• Graph Algorithms
• Geometric Spanners
• +4 more

Prosenjit K. Bose is a Full Professor in the School of Computer Science at Carleton University and serves as Associate Dean of Research and Graduate Studies for the Faculty of Science. His research focuses on computational geometry, graph algorithms, and geometric spanners with applications in robotics, manufacturing, and geographic information systems. He leads the CGLab research group and organizes weekly research seminars. Key areas of interest include geometric pathfinding, proximity graphs, and algorithmic optimization. Recent work emphasizes shortest path algorithms in weighted grids, geometric spanner properties, and applications in manufacturing and robotics. His contributions span over 150 peer-reviewed publications, with recent advancements in approximation algorithms and geometric problem-solving. Awards and honors are not explicitly listed in the provided materials.

Miroslava Mihajlov CarevicView profile

Assistant Professor

• Mathematics
• Computer Science
• Applied Mathematics
• +5 more

Miroslava Mihajlov Carević is an Assistant Professor at the Faculty of Mathematics and Computer Sciences at Alfa BK University in Belgrade. She holds a doctoral degree in Mathematics and Computer Science, with a thesis on figurate numbers as mathematical models. Her academic journey includes specialist, master's, and doctoral studies at the Faculty of Mathematics in Belgrade and Alfa BK University. Education : Specialist degree in Mathematics Teaching (2001) Master's in Mathematics Teaching (2007) Doctoral degree in Mathematics and Computer Science (2020) Her research focuses on figurative numbers , constructive thinking , and the integration of modern teaching technologies in mathematics education. She has published extensively in international and national journals, as well as conferences, on topics like dominating sets in networks , generating functions , and visual-logical approaches to mathematical problems. Recent publications highlight her work in applied mathematics , statistical evaluation of teaching , and geometric modeling . She has collaborated on studies involving GeoGebra software for educational purposes and network analysis of cactus chains. Despite no explicitly listed awards, her research output and teaching innovations are notable.

Miroslav B. MilovanovicView profile

Associate Professor

• Automation Engineering
• Control Systems
• Neural Networks
• +3 more

Miroslav B. Milovanović is an Associate Professor at the Faculty of Electronics of the University of Niš , within the Department of Automation . He holds a PhD in Automation from the same faculty (2018) and has been a faculty member since 2014, advancing to Assistant Professor in 2018 and Associate Professor in 2025. His research focuses on neural networks, control systems, and automation applications in areas like motor control, magnetic levitation, and industrial processes. He has authored over 8 journal articles with impact factors and participates in 4 international projects. Education: PhD in Automation (2018), Faculty of Electronics, University of Niš Bachelor’s degree in Automation (2011), Faculty of Electronics, University of Niš Research interests emphasize adaptive control systems using neural networks and neuro-fuzzy methods, with applications in dynamical systems, resource management, and automotive safety (e.g., anti-lock braking systems). His work often integrates orthogonal polynomial-based architectures to enhance neural network performance and robustness. His publications highlight contributions to PID control optimization, data denoising techniques for neural networks, and hybrid modeling approaches combining bond graphs with fuzzy logic. Despite no listed awards, his active participation in international projects underscores ongoing research engagement. He advises no explicitly listed students but collaborates extensively with colleagues on multi-author studies. His professional address is Aleksandra Medvedeva 4, 18104 Niš, Serbia, with institutional contacts at elfak.ni.ac.rs.

Marjan M. MatejicView profile

Associate Professor

• Graph Theory
• Mathematical Analysis
• Topological Indices
• +3 more

Marjan M. Matejic is an Associate Professor at the Faculty of Electronics, Department of Mathematics, University of Niš since 2022. He holds a PhD in Mathematics from the Faculty of Natural Sciences and Mathematics in Niš (2016), preceded by a Master's (2005) and Bachelor's degree (2001) in the same field. His research focuses on graph theory with emphasis on topological indices, spectral graph theory, and combinatorial analysis. He has published over 20 articles in peer-reviewed journals, including FILOMAT , MATCH Communications in Mathematical and in Computer Chemistry , and Discrete Applied Mathematics . His work explores properties of graph invariants like inverse degree indices, Kirchhoff index, and Laplacian matrices, contributing to theoretical frameworks for network analysis and chemical graph theory. Collaborations with researchers like Emina Milovanović and Igor Milovanović highlight his active role in interdisciplinary mathematical research. Key research areas include deriving bounds for topological indices, analyzing spectral properties of graphs, and applying algebraic methods to network metrics. His recent studies address inequalities for forgotten topological indices and symmetric division deg indices, advancing computational approaches in discrete mathematics. Professional activities include participation in national and international scientific projects.

Man-Kwun ChiuView profile

Assistant Professor

• Algorithms
• Graph Theory
• Computational Geometry
• +3 more

Man-Kwun Chiu is an Assistant Professor at Wenzhou-Kean University. He holds a Ph.D. in Computer Science from the Hong Kong University of Science and Technology. His research focuses on algorithms, graph theory, and computational geometry, with contributions to topics like graph coloring, geometric algorithms, and self-improving algorithms. Prior to his current position, he was a researcher at Freie Universität Berlin and the National Institute of Informatics in Japan. His work spans theoretical computer science, including geometric routing, polygon partitioning, and manifold reconstruction. Key publications address planar graph coloring, digital geometry, and algorithmic efficiency. Chiu's research often bridges discrete mathematics and computational geometry, with applications in optimization and algorithm design. Publications highlight contributions to geometric algorithms (e.g., Snipperclips, rectilinear link distances) and combinatorial problems (e.g., k-level complexity). His work emphasizes foundational theory with practical algorithmic implications.

• Evolutionary Graph Theory
• Random Processes on Graphs
• Theoretical Computer Science
• +3 more

Josef Tkadlec is an Assistant Professor at the Computer Science Institute of Charles University in Prague. He holds a PhD from IST Austria (supervised by Krish Chatterjee) and an undergraduate degree from Charles University. Previously, he was a postdoctoral fellow at Harvard University's Mathematics Department under Martin A. Nowak. Affiliations: Charles University (current), Harvard University (postdoc), IST Austria (PhD) His research focuses on evolutionary graph theory, random processes on graphs, and geometric/game-theoretical aspects of theoretical computer science. He leads the PRIMUS grant project Evolutionary graph theory: Beyond fixation probability and has contributed to studies on amplifiers of natural selection and network dynamics. Tkadlec is also actively involved in mathematics competitions, proposing problems for international events like the IMO and organizing resources for Czech high-school students. His work bridges evolutionary biology and computer science, addressing questions like fixation probabilities in population structures and coexistence dynamics. Tkadlec's recent publications explore topics such as quasigeodesics in geometric structures, fixation times on directed graphs, and algorithmic approaches to geometric problems. Scientific Awards: Best Paper Award at WALCOM 2021 for research on IMO problem applications. He advises student projects and maintains active collaborations in evolutionary dynamics and discrete mathematics. Tkadlec also contributes to math outreach through competitions, puzzle creation, and educational resources.

Kolja KnauerView profile

Professor

• Combinatorics
• Graph Theory
• Discrete Geometry
• +3 more

Kolja Knauer is a Professor at the Universitat de Barcelona, holding a dual role as Professor Agregat and Maître de conférences (on leave). He is affiliated with the Department of Mathematics and Computer Science, specializing in Combinatorics. His research focuses on structural combinatorics, matroid theory, graph theory, and discrete geometry, with notable contributions to oriented matroids, lattice path matroids, and geometric graphs. He leads the MICINN project ACoGe (PID2022-137283NB-C22) on algebraic combinatorics and geometry, and participates in the ANR project DAGDigDec (ANR-21-CE48-0012) on digraph decompositions. Knauer is the Editor-in-chief of Annals of Combinatorics and a Section editor of Discrete Mathematics & Theoretical Computer Science . His research interests span Cayley graphs, graph colorings, convex geometries, and computational geometry. Recent work includes studies on matroid polytopes, oriented matroid complexes, and combinatorial algorithms. He actively organizes events like the Combinatorial Geometries & Geometric Combinatorics program at CRM (2025) and the recurring Three Talks in Combinatorics seminar at UB. Knauer advises PhD students including Gil Puig i Surroca and Manon Philibert. His work often intersects algebraic structures, geometric configurations, and combinatorial optimization. He collaborates internationally, with affiliations to the Institute of Mathematics of the University of Barcelona (IMUB) and the Catalan Institution for Research and Advanced Studies (CRM).

• Computational Geometry
• Combinatorial Geometry
• Geometric Optimization
• +3 more

Micha Sharir holds the Alicia and Isaias Nizri Chair in Computational Geometry and Robotics at the School of Computer Science, Tel Aviv University, Israel. His research focuses on computational geometry, combinatorial geometry, and geometric optimization, with applications in robotics and motion planning. He has contributed extensively to geometric algorithms, arrangement structures, and algorithmic foundations. Current interests include advancing algebraic techniques in combinatorial geometry, studying geometric optimization problems, and exploring motion planning in complex environments. He teaches courses such as Computational Geometry, Advanced Topics in Computational Geometry, and Algorithms. His work bridges theoretical computer science and applied mathematics, addressing challenges in geometric data structures and their real-world applications. Notable contributions include foundational research on arrangements, Voronoi diagrams, and geometric algorithms for robotics.

Ivica BošnjakView profile

Professor

• Algebra
• Graph Theory
• Fuzzy Sets
• +5 more

Ivica Bošnjak is a full professor at the Department of Algebra and Theoretical Computer Science within the Faculty of Sciences at the University of Novi Sad. His research focuses on algebraic structures, graph theory, fuzzy systems, and combinatorial optimization. He has contributed significantly to the study of power graphs, enhanced power graphs of finite groups, and fuzzy algebraic relations. His work integrates abstract algebra with computational methods, addressing problems in group theory, graph classification, and algorithm design. Recent articles highlight advancements in analyzing abelian groups, fuzzy power relations, and optimization techniques for collateral value distribution. While no scientific awards are explicitly mentioned, his extensive publication record (spanning 1992–2024) demonstrates sustained academic engagement. His research trends emphasize interdisciplinary approaches, merging algebraic theory with practical applications in discrete mathematics and algorithmic solutions. No advising or grant details are provided in the available texts. His affiliation with the Faculty of Sciences underscores a commitment to foundational mathematical research without noted lab or team collaborations.