جست‌وجوی استاد و پژوهشگر

• Condensed Matter Physics
• Quantum Transport
• Nanotechnology
• +۲ مورد دیگر

Viktor Cerovski serves as an Expert Advisor at the Department of Plant, Soil and Nano Systems within the University of Belgrade's Institute for Multidisciplinary Research. His career spans international institutions including Chemnitz University of Technology (Germany), Virginia Commonwealth University, and Michigan State University (USA), where he earned his PhD and served as Teaching Assistant in Physics. His educational background includes: Doctor of Physics, Michigan State University Graduate in Physics, University of Belgrade Faculty of Physics Programmer certification, Mathematical Gymnasium Belgrade Cerovski's research centers on quantum disordered systems and nanoscale phenomena, with expertise in computational modeling of electronic transport, atomic clusters, and biomolecular structures. His work bridges theoretical condensed matter physics and biophysics, utilizing advanced DFT and HPC methodologies to investigate chaotic systems, quasicrystals, and molecular-scale transport mechanisms. Analysis of his 2000-2017 publications reveals a progression from fundamental studies of Anderson localization and quasicrystals toward applied research in molecular electronics and biomolecular photodissociation. Key journals include Physical Review B, Europhysics Letters, and high-impact chemistry journals, reflecting interdisciplinary collaboration with European synchrotron facilities. No scientific awards were documented in available sources. He mentors doctoral students and reviews master's theses at the University of Belgrade's Faculty of Physics while leading current Ministry of Education Project No. 171033. Past funding includes EU FP7 initiatives, SOLEIL synchrotron projects (France), and Swiss SCOPES grants, supporting international collaborations in nanoscale bio-non-bio interaction research. Though no dedicated laboratory is specified, his computational work within the Department of Plant, Soil and Nano Systems emphasizes cluster-based modeling of quantum systems, with infrastructure likely supported through Serbia's national research network and international partnerships.

Mladen Nikolićمشاهده پروفایل

دانشیار

• Machine Learning
• Automated Reasoning
• Earthquake Damage Assessment
• +۲ مورد دیگر

Mladen Nikolić is an Associate Professor at the Faculty of Mathematics, University of Belgrade, specializing in machine learning and automated reasoning. He actively contributes to the Machine Learning and Applications Group (MLA@MATF) and the Automated Reasoning GrOup (ARGO) . His research spans earthquake damage assessment , deep learning object tracking , LLM integration with tabular data , and astronomical data analysis . Recent work focuses on the RELAR Project for rapid earthquake loss assessment, CNN architectures for structural damage classification, and novel approaches to incorporating large language model priors into machine learning systems. His publications demonstrate strong interdisciplinary applications connecting computer science with seismology, transportation engineering, and astrophysics. Developed frameworks for earthquake loss assessment and recovery Advanced deep learning filters for non-linear motion tracking Integrated LLMs with tabular data processing systems Contributed to LSST astronomical data challenges Nikolić maintains active research collaborations through MLA@MATF and ARGO groups, with publications spanning machine learning theory, automated reasoning systems, and practical applications across multiple scientific domains. His work shows increasing focus on real-world deployment of AI systems for disaster response and scientific data analysis.

Olga Bodroža-Pantićمشاهده پروفایل

استاد

• Graph Theory
• Combinatorics
• Theoretical Computer Science
• +۳ مورد دیگر

Olga Bodroža-Pantić is a Professor at the Department of Mathematics and Informatics , Faculty of Sciences , University of Novi Sad . Her research spans Graph Theory , Combinatorics , and Discrete Mathematics , with significant contributions to the study of Hamiltonian cycles , 2-factors , and Kekule structures in grid graphs and topological surfaces like torus and Klein bottle. Email: bodroza@dmi.uns.ac.rs Recent publications focus on graph enumeration and structural analysis in grid graphs, alongside interdisciplinary applications in mathematical biology and food production processes . Her work on the MTE-model highlights interests in mathematics education.

• Combinatorics
• Probabilistic Methods
• Random Graphs
• +۴ مورد دیگر

Rajko Nenadov is a Lecturer in Theoretical Computer Science at the University of Auckland, New Zealand. Previously, he earned his PhD from ETH Zurich in 2016 under Angelika Steger. He held postdoctoral positions at Monash University (Australia) and ETH Zurich, focusing on combinatorics and graph theory. Between 2018–2022, he worked as a software engineer at Google Zurich, contributing to search ranking algorithms. Returning to academia in 2023, his research emphasizes probabilistic methods, random structures, and applications in theoretical computer science. His education includes a PhD in Computer Science from ETH Zurich (2016). Notable career milestones include postdoctoral research on expanders, pseudorandomness, and Ramsey theory, followed by industry experience in algorithmic development. Rajko’s research interests revolve around combinatorics, with a focus on probabilistic methods, random graphs, extremal graph theory, and Ramsey theory. His work bridges foundational combinatorics with practical applications in computer science, particularly in algorithm design and computational complexity. His recent publications explore topics like hypergraph universality, container theorems, and extremal subgraph counting. These contributions highlight advancements in probabilistic combinatorics and structural graph theory. No scientific awards or grants are explicitly listed in the provided information. His career transition from academia to industry and back underscores his interdisciplinary expertise in theory and applied computing.

Xavier Goaocمشاهده پروفایل

استاد

• Computational Geometry
• Discrete Mathematics
• Combinatorial Convexity
• +۵ مورد دیگر

Xavier Goaoc is a Professor of Computer Science at Université de Lorraine, affiliated with the Department of Computer Science & Engineering at École des Mines de Nancy and the Gamble research team (joint between LORIA and INRIA). His research focuses on algorithms and discrete mathematics, particularly discrete and computational geometry, including convex hulls, intersection patterns, topological generalizations, and geometric transversal theory. University: Université de Lorraine School: School of Engineering Department: Department of Computer Science & Engineering Research Team: Gamble (LORIA/INRIA) Emails: xavier.goaoc@loria.fr , xavier.goaoc@univ-lorraine.fr His research spans computational geometry, combinatorial convexity, geometric transversal theory, and random geometric structures. Key topics include homological minors, order types of point sets, and geometric optimization. His 15 most recent publications highlight advancements in computational geometry algorithms, structural complexity, and topological constraints. Notably, his work has received Best Paper Awards at SoCG 2020, 2018, 2016, and 2012. Administrative roles include heading the computer science & engineering department at Mines Nancy and co-chairing the computer science department of the IAEM doctoral school. He is also a member of the Université de Lorraine's ‘pôle AM2I’ council. Teaching activities encompass courses in algorithms, computer architecture, blockchains, and geometric models for vision, with publications and grants reflecting his interdisciplinary impact in computer science and mathematics.

François Pirotمشاهده پروفایل

دانشیار

• Graph Theory
• Combinatorics
• Probabilistic Method
• +۴ مورد دیگر

François Pirot is an Associate Professor (Maître de Conférences) at Université Paris-Saclay since September 1, 2021. He conducts research at the LISN laboratory within the GALaC team and teaches at the Faculty of Science of Orsay. PhD in Mathematics (Radboud University) and Computer Sciences (Université de Lorraine), 2019 Postdoctoral experience: ULB (2019), G-SCOP (2019-2020), Inria Sophia Antipolis (2020-2021) His research focuses on graph coloring problems in diverse contexts such as graph powers, locally sparse graphs, and distributed algorithms, utilizing probabilistic methods and connections to bio-informatics through circular codes. He has advanced bounds for h -conflict-free coloring, acyclic coloring, and dichromatic numbers in oriented graphs, with applications to minor-closed families and geometric group theory. Scientific contributions include: Asymptotically tight bounds for chromatic numbers in sparse graphs Efficient fractional coloring algorithms for K_t-minor-free graphs Structural analysis of comma-free and mixed circular codes in genetic alphabets Charles Delorme Prize for outstanding thesis in Graph Theory (2019) Collaborations span institutions like ULB, G-SCOP, Inria, and cross-disciplinary fields from computer science to mathematical biology.