جستجوی استاد راهنمای دانشگاهی

• Network Optimization
• Graph Theory
• Stable Matchings
• +۵ مورد دیگر

Marcin Anholcer is a Professor at the Department of Operations Research and Mathematical Economics, Institute of Informatics and Quantitative Economics, University of Economics in Poznan. His research spans both theoretical and applied domains, focusing on network optimization, graph theory, stable matchings, and fair division. He integrates mathematical methods into economic and financial contexts, contributing to combinatorial optimization and operations research. Education: Doctorate in 2006 and 2011 (specific institutions not detailed). His work addresses problems in graph labeling, distance magic labelings, and stochastic transportation models. He has also contributed to empirical studies on exclusionary constraints in logistics and supply chains. His research bridges pure mathematics and economic applications, with a strong emphasis on algorithmic solutions and computational models. His publications demonstrate trends in combinatorial optimization, hypergraph algorithms, and the application of mathematical models to financial forecasting. He has extensively explored group irregularity strength and chromatic numbers in graphs, alongside practical transportation and supply chain optimization. He has supervised 4 promoted theses and participated in 3 research projects. His methodological contributions include heuristic algorithms for complex optimization problems and comparative analyses of nonlinear allocation techniques.

Joanna Cymanمشاهده پروفایل

استادیار

• Graph Theory
• Algorithmic Graph Theory
• Discrete Algorithms

Dr. Joanna Cyman is an Assistant Professor at the Institute of Applied Mathematics, Gdańsk University of Technology. Her academic work centers on graph theory and its algorithmic applications, with a focus on domination parameters and network optimization. PhD in Mathematics, University of Gdańsk (2007) Her research explores fundamental graph-theoretic concepts such as total domination , paired domination , and Roman domination , applying these to practical problems in smart grid security, communication networks, and computational complexity. Publications from 2015–2022 demonstrate expertise in analyzing graph structures for efficiency and fault tolerance, particularly in cubic and regular graphs. Dr. Cyman frequently collaborates with researchers like Joanna Raczek, Michael Henning, and Magdalena Dettlaff. Her work intersects graph theory , algorithm design , and real-world network applications , though no specific grants or lab affiliations are detailed in the provided texts.

• Matroids
• Combinatorial algebraic geometry
• Commutative algebra
• +۲ مورد دیگر

Michał Lasoń is a researcher in combinatorics and discrete mathematics affiliated with the Faculty of Mathematics and Computer Science at Jagiellonian University. His academic work focuses on matroid theory, combinatorial algebraic geometry, and discrete geometry, with significant contributions to coloring problems and algebraic combinatorics. His research interests include Matroids, Combinatorial algebraic geometry and commutative algebra, Extreme combinatorics, and Discrete geometry. Dr. Lasoń's work often bridges combinatorial structures with algebraic methods, particularly in the study of matroids and their applications to geometric problems. Dr. Lasoń's publication record shows a strong focus on matroid coloring problems, geometric combinatorics, and algebraic approaches to discrete structures. His work spans theoretical foundations to specific combinatorial problems, with publications in top journals including Advances in Mathematics, Proceedings of the American Mathematical Society, and European Journal of Combinatorics. His educational background includes dual PhDs - in Mathematics from the Institute of Mathematics of the Polish Academy of Sciences (2013) and in Computer Science from Jagiellonian University (2014), following an MSc in mathematics from Jagiellonian University in 2008. Dr. Lasoń held postdoctoral positions at Ecole Polytechnique Federale de Lausanne (2013-2014), Free University of Berlin (2014-2016), and University of Bern (2016-2017), establishing an international research profile in combinatorial mathematics.

• Optimization
• Metaheuristic Methods
• Constrained Optimization
• +۳ مورد دیگر

Wojciech Rafajłowicz is a Professor in the Department of Control Systems and Mechatronics at Wrocław University of Science and Technology's Faculty of Information and Communication Technology. His research focuses on optimization techniques, optimal control, image processing, and embedded systems development. Academic Rank: Professor University: Wrocław University of Science and Technology His recent publications demonstrate a strong focus on developing advanced mathematical and machine learning techniques for signal classification, medical image analysis, and industrial process optimization. Key trends include the application of Bezier-Durrmeyer descriptors for curve classification, shape-preserving autoencoders for data reconstruction, and multi-objective optimization approaches in pandemic mitigation. Notable research contributions include: Medical imaging analysis methods for bleeding detection Adaptive thresholding techniques in industrial control systems Functional data representation using Bernstein polynomials Vibration analysis for structural health monitoring Current work emphasizes the intersection of control theory, machine learning, and practical applications in mechatronics and industrial safety.

David Ramseyمشاهده پروفایل

استاد

• Decision Theory
• Game Theory
• Stochastic Optimization
• +۷ مورد دیگر

Dr. David Ramsey is a professor at the Faculty of Information and Communication Technology, Wrocław University of Science and Technology, specializing in decision theory, game theory, and stochastic optimization. His work bridges mathematics, computer science, and behavioral economics. University: Wrocław University of Science and Technology School: Faculty of Information and Communication Technology Department: Department of Computer Science and Systems Engineering Email: david.ramsey@pwr.edu.pl Research Interests: Ramsey’s research integrates decision theory and game theory with stochastic optimization to model complex systems in behavioural economics and biological systems . Recent work explores multi-criteria decision making and urban sustainability . Publication Trends: His 2024–2020 articles span game theory applications in partnership formation, urban development analysis, and computational decision support tools. Collaborative works include interdisciplinary studies on genetic epidemiology and moral cognition in schizophrenia. Teaching & Contact: He holds regular office hours on Tuesdays and Thursdays. No scientific awards are listed in the provided data.

• Discrete Mathematics
• Graph Theory
• Combinatorics
• +۱ مورد دیگر

Lech Adamus is an Assistant Professor at the Department of Discrete Mathematics, Faculty of Applied Mathematics, AGH University of Science and Technology in Kraków, Poland. His contact details include phone number +48 12 617 46 19 and email adamus@agh.edu.pl . His research interests are rooted in Discrete Mathematics, with a focus on Graph Theory, Combinatorics, and Theoretical Computer Science. These fields align with the department’s emphasis on foundational mathematical structures and algorithmic problem-solving. Roles and Affiliation: Assistant Professor, AGH University of Science and Technology Faculty of Applied Mathematics Department of Discrete Mathematics

Przemysław Gordinowiczمشاهده پروفایل

استادیار

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +۲ مورد دیگر

Dr. Przemysław Gordinowicz serves as an Assistant Professor at Lodz University of Technology within the Department of Applications of Contemporary Mathematical Analysis. Based in room 161 with contact details (+48) 42 631-36-33 and pgordin@p.lodz.pl, he maintains an active research profile in discrete mathematics. His research centers on Graph Theory and Combinatorics, specializing in graph coloring extendability problems for planar and outerplanar graphs, pursuit-evasion games (cops and robbers, localization games), and polynomial method applications. He also investigates random graph models, discrete Laplacian problems, and extremal graph theory, employing combinatorial and algebraic techniques to solve complex structural problems. Analysis of his 15 most recent publications (2015-2025) reveals consistent focus on three interconnected themes: (1) polynomial method applications to list coloring extendability, (2) theoretical advances in pursuit-evasion games across diverse graph classes, and (3) firefighter problem variants including surviving rate calculations. His work bridges theoretical combinatorics with algorithmic applications, frequently appearing in top-tier journals like Journal of Graph Theory and Electronic Journal of Combinatorics. He has supervised PhD student Paweł Twardowski, whose 2023 dissertation addressed graph polynomial applications to list coloring extendability in planar graphs. No information about research grants or collaborative teams is available in the provided materials.

• Formal Methods
• Concurrent Systems
• Real-Time Systems
• +۷ مورد دیگر

Professor Marcin Szpyrka is a faculty member at AGH University of Science and Technology in Kraków, Poland, where he works in the Department of Applied Informatics within the Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering. He holds the position of Professor and maintains an office in building C-2, room 321. His academic work spans formal methods, concurrent systems modeling, and data mining applications. Professor Szpyrka's primary research interests focus on formal methods including the Alvis modeling language, Petri nets, and process algebras. He specializes in the modeling and verification of concurrent and real-time systems , with applications spanning industrial processes, automotive diagnostics, and cybersecurity. His work bridges theoretical computer science with practical engineering applications, particularly in embedded systems and data analysis. Analysis of Professor Szpyrka's recent publications reveals a clear research trajectory focusing on formal verification techniques applied to increasingly complex systems. His work has evolved from foundational research on the Alvis language to practical applications in automotive systems, industrial processes, and cybersecurity. The publications demonstrate consistent expertise in modeling concurrent systems while expanding into data mining and machine learning applications for anomaly detection and system diagnostics. Rector's Finance Committee Disciplinary Council for Technical Information Technology and Telecommunications Disciplinary Appeals Committee for Doctoral Students Supervised 9 PhD dissertations between 2009-2024 Developed academic resources including the aghdpl LaTeX class for thesis preparation Mentored students working on formal methods, concurrent systems, and data mining applications Professor Szpyrka leads the Formal Methods research group with projects hosted at fm.kis.agh.edu.pl, focusing on the development and application of the Alvis modeling language for system verification.

Robert Janczewskiمشاهده پروفایل

دانشیار

• Graph Theory
• Algorithmic Graph Theory
• Chromatic Graph Theory
• +۶ مورد دیگر

Dr hab. inż. Robert Janczewski serves as an Associate Professor at the Department of Algorithms and Systems Modelling within the Faculty of Electronics Telecommunications and Informatics at Gdańsk University of Technology. He simultaneously holds the position of Senior Specialist – Design Programmer at the Team for Development and Maintenance of Data Warehouses CUI, both positions located in Building A of the Faculty of Electronics, room EA 224. His academic journey includes obtaining a "dr inż." degree in 2001 and a higher doctoral degree "dr hab. inż." in Information Science (Technology) in 2015, both from the same faculty. His research focuses on the theoretical foundations of graph theory, with particular emphasis on various coloring problems including edge coloring, incidence coloring, and contrast coloring of graphs. His work spans both classical and signed graph theory, exploring chromatic indices, backbone coloring, and frequency allocation problems. Janczewski's research has significant applications in algorithm design, network optimization, and theoretical computer science, with many of his contributions addressing NP-hard problems and developing polynomial-time solutions for specific graph classes. Analysis of his recent publications (2022-2025) reveals a concentrated research trajectory on signed graph coloring problems, where he has made substantial contributions to understanding edge coloring of signed graphs and their products. His work demonstrates a progression from foundational coloring problems toward more complex signed graph structures, establishing classification systems for signed graphs based on their chromatic properties. The interdisciplinary nature of his research bridges pure mathematics with practical computational applications. Janczewski has maintained a consistent publication record in prestigious journals including Discrete Applied Mathematics, Theoretical Computer Science, and Discussiones Mathematicae Graph Theory. His collaborative work with researchers like Turowski, Wróblewski, and Obszarski indicates strong research partnerships within the graph theory community. His methodology combines theoretical proofs with algorithmic approaches, often providing both complexity analyses and practical solution strategies for graph coloring problems.

Magdalena Ruckaمشاهده پروفایل

استاد

• Structural Health Monitoring
• Non-Destructive Testing
• Concrete Fracture Mechanics
• +۳ مورد دیگر

Magdalena Rucka serves as Professor and Head of the Department of Mechanics of Materials and Structures at Gdańsk University of Technology's Faculty of Civil and Environmental Engineering. Her research focuses on advanced non-destructive testing methodologies for civil infrastructure, specializing in ultrasonic techniques for concrete fracture analysis and structural health monitoring. Her primary research domains include acoustic emission monitoring, discrete element modeling of microcrack propagation, and sustainable construction solutions using recycled materials. Current investigations center on real-time crack localization in concrete structures, wave attenuation characterization in heterogeneous materials, and repurposing decommissioned wind turbine blades for pedestrian infrastructure. She integrates experimental methods with numerical simulations to develop innovative damage detection frameworks. Recent publications (2025) demonstrate consistent focus on ultrasonic wave applications in structural diagnostics, with recurring themes in fracture process characterization, real-time monitoring algorithms, and sustainable material reuse. Her work bridges experimental validation with computational modeling across high-impact journals in civil engineering and ultrasonics. Professor Rucka leads multiple National Science Centre-funded projects including OPUS grants for SMART-S2H3D (multifunctional 3D-printed composites with self-healing capabilities) and micro-macro crack analysis in concrete structures. These projects address critical challenges in structural integrity assessment and sustainable material innovation. As department head, she oversees research in structural mechanics and non-destructive testing, fostering collaborations on wind turbine blade repurposing and cervical spine failure modeling. Her team develops methodologies for real-time fracture imaging and ultrasonic tomography applicable to concrete and masonry preservation.

• Liquid Crystal Physics
• Statistical Mechanics
• Monte Carlo Simulations
• +۳ مورد دیگر

Dr. Andrzej Kapanowski is an Assistant Professor at Jagiellonian University's Faculty of Physics, Astronomy and Applied Computer Science. His research focuses on liquid crystal physics, statistical mechanics, and computational methods. He obtained his habilitation in physics (2012) and PhD (1997) from the same institution. He supervises doctoral and master's theses, with recent work exploring Python optimization and computational tools. Education: PhD in Physics, 1997 Habilitation, 2012 (Dissertation: "Statistical Theory of Elastic Constants of Biaxial Nematic Liquid Crystals") MSc in Physics, 1992 Research Interests: Liquid crystal phase behavior and modeling Monte Carlo simulations for complex systems Computational graph theory and Python libraries Software Contributions: Graph theory packages (GitHub: graphs-dict ) Planegeometry and permutation group libraries

• combinatorial games
• online algorithms
• graph theory
• +۳ مورد دیگر

Bartłomiej Bosek is a Professor at Jagiellonian University's Faculty of Mathematics and Computer Science, Department of Algorithmics. He holds a habilitation in exact sciences (computer science) and has held academic roles since 2004. His research focuses on combinatorial games, online algorithms, graph theory, and poset theory. He actively participates in international conferences and has led multiple grants, including managing the 2020-2025 'Algorithmic Nullstellensatz' project. Notable collaborations include work with Jarosław Grytczuk, Grzegorz Gutowski, and Anna Zych-Pawlewicz. Education: Master's in Computer Science (Jagiellonian University, 2004) PhD in Mathematics (Computer Science, Jagiellonian University, 2008) Habilitation in Exact Sciences (Computer Science, Jagiellonian University, 2019) Research Interests: Combinatorial games and their algorithmic applications Online algorithms for graph coloring and poset structures Graph theory with a focus on coloring and dynamic algorithms Poset theory and dimension analysis Grants: Algorithmic Nullstellensatz (2020–2025, Principal Investigator) New Techniques for Matching Algorithms (2014–2018, Principal Investigator) Tracking Moving People in Monitored Zones (2012–2015, Researcher) Key Contributions: Recent publications emphasize graph coloring algorithms, online chain partitioning, and combinatorial game theory. His work on dynamic graph coloring and poset dimension analysis has been published in top-tier venues like Discrete Mathematics and SIAM Journal on Discrete Mathematics . Labs/Teams: Lead researcher in algorithmic and combinatorial studies at the Department of Algorithmics, collaborating with a network of international researchers including those at Georgia Tech and UPC Barcelona.

• Theoretical Computer Science
• Lambda Calculus
• Combinatorial Logic
• +۳ مورد دیگر

Katarzyna Grygiel is a researcher in theoretical computer science at the Faculty of Mathematics and Computer Science, Jagiellonian University. Her primary affiliation is with the Department of Foundations of Informatics, where she focuses on lambda calculus, combinatorial logic, and asymptotic properties of formal systems. She earned her MSc in Mathematics (2007) and PhD in Computer Science (2013) from Jagiellonian University. Her research interests span lambda calculus, combinatorial analysis of formal systems, and the application of probabilistic methods to logic. She has contributed to understanding normalization properties in combinatory logic and developed algorithms for generating lambda terms using Boltzmann samplers. Her work bridges theoretical computer science with foundational mathematical logic. Key grants include leadership roles in projects like 'Asymptotic methods in lambda calculus and combinatorial logic' (2014–2017) and 'Quantitative Research in Logics and Computational Theory' (2009–2012). She co-organized major conferences, including the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2016). Her publications emphasize combinatorial studies of lambda terms, foundational logic, and algorithmic methods. Collaborations include researchers at École Polytechnique and University of Paris, reflecting her international scholarly network.

• Algebra
• Computational Complexity
• Theoretical Computer Science
• +۳ مورد دیگر

Prof. Pawel M. Idziak is a distinguished academic at the Faculty of Mathematics and Computer Science, Jagiellonian University, where he holds a Professorship in the Department of Algorithmics. His primary research focuses on algebra, computational complexity, and theoretical computer science, with notable contributions to the study of algebraic structures, satisfiability problems, and modular circuits. Idziak has led and contributed to numerous grants, including managing the 'Numerical and Structural Invariants in Algebra, Logic and Constraint Satisfaction Problems' (2015–2022) and co-ordinating initiatives like 'Programmers of the Future 4.0'. His work bridges abstract algebra with computational challenges, addressing topics such as group theory, circuit satisfiability, and algorithmic complexity. His research interests span a broad spectrum of theoretical computer science and algebra, including the interplay between algebraic structures and computational problems. Idziak has advised over 20 PhD students, mentoring them in areas such as algorithm design, logic in computer science, and discrete mathematics. He has also contributed to foundational works like Generative Complexity in Algebra (2005) and co-authored influential papers in journals like SIAM Journal on Computing and Transactions of the American Mathematical Society . Idziak’s academic leadership is evident through his roles in institutional committees and his active participation in international conferences. His recent work (2024) on equation satisfiability in solvable groups highlights his ongoing contributions to advancing computational algebra and complexity theory.

• Probabilistic Method
• Graph Coloring
• Analytical Combinatorics

Jakub Kozik is a Professor in the Department of Algorithmics at the Faculty of Mathematics and Computer Science, Jagiellonian University. His research focuses on probabilistic methods, graph coloring, and analytical combinatorics, with notable contributions to hypergraph coloring algorithms and combinatorial optimization. He has authored over 30 peer-reviewed articles and led multiple research grants, including the National Science Centre-funded projects on hypergraph coloring and online graph coloring algorithms. Position: Professor, Department of Algorithmics University: Jagiellonian University (Kraków, Poland) Key Research Areas: Graph Theory, Combinatorics, Probabilistic Methods His work bridges combinatorial mathematics and theoretical computer science, addressing problems in algorithm design, randomized algorithms, and structural graph theory. Recent research explores the Alon-Tarsi method, entropy compression techniques, and applications of probabilistic methods to hypergraphs. Grants include leadership roles in projects like 'Random Greedy Hypergraph Coloring Algorithms' (2024–2027) and 'Online Coloring from Lists' (2017–2021). These projects address fundamental challenges in combinatorial optimization and algorithmic efficiency. He collaborates with institutions globally and is part of the Algorithmics Research Group, contributing to the Foundations of Computer Science at his faculty.