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

Alexander Wolffمشاهده پروفایل

استاد

• Graph Drawing
• Computational Geometry
• Algorithms
• +۳ مورد دیگر

Alexander Wolff is a Professor at the Chair of Algorithms and Complexity within the Institute of Computer Science at the University of Würzburg. His work focuses on graph drawing, computational geometry, and algorithmic complexity, with applications in geographic information systems and network visualization. Chair of Algorithms and Complexity, Institute of Computer Science, University of Würzburg (since 2009) Managing Director, Institute of Computer Science (2011–2013, 2015–2017) Editorial roles in journals like JoCG and JGAA Conference leadership in Graph Drawing (GD) and SOFSEM His research explores geometric graph representations, obstacle numbers, and parameterized complexity. Recent publications address level planarity, polyhedral surface adjacency, and metro map visualization. Collaborative projects include algorithmic quality assurance and interactive industrial network visualization. Wolff’s work bridges theoretical graph algorithms with practical applications, such as optimizing public transport schematics and enhancing data accessibility. He has supervised numerous PhD students and co-authored over 100 publications, with editorial and organizational roles in major computational geometry and graph drawing conferences.

Salar Y Alsardaryمشاهده پروفایل

استاد

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

Salar Y. Alsardary is a Professor in the Department of Mathematics and Department of Languages and Linguistics at Saint Joseph's University in Philadelphia, where he has been a faculty member since 1996. He teaches courses ranging from college algebra to advanced topics like graph theory and differential equations. PhD, West Virginia University MA, Mathematics, West Virginia University MS, Mathematics, Mosul University BS, Sulaimania University His research focuses on Graph Theory and Combinatorics, particularly analyzing properties of power graphs, basis numbers, vertex covering, and induced path numbers. He also contributes to Mathematics Education, exploring interactive and learning-centered pedagogical methods. Alsardary's publications span 1997–2009, emphasizing graph-theoretical invariants and educational innovations. His work on power graphs and hypercubes reveals structural properties, while later studies address pedagogical strategies in upper-level mathematics courses.

• Combinatorial Optimization
• Polynomially Solvable Special Cases
• Assignment Problems
• +۶ مورد دیگر

Eranda Dragoti-Cela is an Associate Professor at the Department of Optimization and Discrete Mathematics, Graz University of Technology. She specializes in combinatorial optimization, focusing on polynomially solvable special cases of NP-hard problems like the Quadratic Assignment Problem (QAP), portfolio optimization, and algorithmic graph theory. Education: M.Sc. in Applied Mathematics, University of Tirana (1992) Ph.D. in Technical Sciences, Graz University of Technology (1995) Habilitation in Applied Mathematics (2001) Her research spans combinatorial optimization (QAP, assignment problems, location problems), portfolio optimization (risk-return models, ordinal information integration), and graph theory (edge intersection graphs, network flows). Recent work includes linearization of quadratic shortest path problems and data arrangement on trees. She supervises bachelor's and master's theses in discrete mathematics and teaches courses like Combinatorial Optimization 1 and Risk Theory and Management , emphasizing algorithmic rigor and practical applications in finance and engineering.

Kamlesh Mathurمشاهده پروفایل

استاد

• Supply Chain Management
• Operations Research
• Vehicle Routing
• +۴ مورد دیگر

Kamlesh Mathur is a Professor and Chair of the Operations Department at the Weatherhead School of Management, Case Western Reserve University. He has been affiliated with the institution since his initial appointment in 1980 and contributes to supply chain logistics, vehicle routing, and service center location optimization. Education: PhD (Case Western Reserve University, 1980), MS (Wayne State University, 1976), MTech (IIT Kanpur, 1975), BE (Engineering College Jodhpur, 1972) His research focuses on supply chain distribution, emphasizing vehicle routing efficiency and service center location strategies . Recent publications highlight stochastic optimization, multi-echelon logistics, and reverse supply chain design, with applications in manufacturing and telecommunications. Key trends in his work include location-allocation modeling , heuristic algorithm development , and interactive software systems for operations research problems, reflecting interdisciplinary applications from biomedical engineering to radio frequency management. Dr. Mathur teaches courses in business statistics, predictive modeling, and global supply chain logistics. He serves on the editorial review board of the Journal of Business Logistics and is a long-standing member of INFORMS.

Daniel Kráľمشاهده پروفایل

استاد

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

Daniel Kráľ is an Alexander von Humboldt Professor for Discrete Mathematics at Leipzig University and an affiliated member of the Max Planck Institute for Mathematics in the Sciences (MPI MiS). Previously, he held the Donald Ervin Knuth Professorship at Masaryk University in Brno and is also an honorary professor at the University of Warwick, where he was a professor of mathematics and computer science and a member of the Centre for Discrete Mathematics and its Applications (DIMAP). His research addresses various topics at the interface of mathematics and computer science, with primary focus on structural and extremal graph theory, discrete algorithms, and combinatorial limits. The theory of combinatorial limits is an emerging area that provides analytic methods to study large graphs such as social networks, establishing new links between analysis, combinatorics, ergodic theory, group theory and probability theory. His work has been supported by prestigious ERC grants including the CCOSA Starting grant and LADIST Consolidator grant. Dr. Kráľ's scholarly output includes over 150 journal research papers and numerous conference contributions. His recent publications demonstrate continued leadership in extremal combinatorics, graph limits, and structural graph theory, with significant contributions to understanding quasirandomness, Turán densities, and the coloring of complex graph structures. Scientific Recognition: SIAM Fellow (2024) Fellow of the American Mathematical Society (2020) Philip Leverhulme Prize in Mathematics and Statistics (2014) European Prize in Combinatorics (2011) ERC Consolidator grant LADIST (2015-21) ERC Starting grant CCOSA (2010-15) Professor Kráľ has supervised numerous PhD students and postdoctoral fellows throughout his career. His editorial service includes Editor-in-Chief of SIAM Journal on Discrete Mathematics (2017-2022), Co-Editor-in-Chief of Journal of Combinatorial Theory (since 2025), and Managing editor of Advances in Combinatorics (since 2018). He has organized multiple international workshops and conferences including Oberwolfach workshops on Graph Theory and the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23).

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

Daphne Der-Fen Liu is Professor and Chair of the Department of Mathematics at California State University, Los Angeles (College of Natural & Social Sciences), where she has served since 1991. Her affiliations include prior work as a Research Assistant at Academia Sinica in Taiwan. She holds a Ph.D. from the University of South Carolina and a B.S. from National Central University. Research Interests: Liu specializes in graph theory and combinatorics, with emphasis on: Graph coloring parameters (circular, fractional, list-coloring) Distance graphs and connections to number theory Radio/antimagic labeling for optimization Topological methods in graph problems Her work is funded by NSF and NASA grants. Teaching: She developed a graph theory course, employs flipped classroom strategies, and co-leads a U.S. Department of Education grant for pedagogical innovation. Awards include: 2015 MAA Distinguished Teaching Award 2018 President’s Distinguished Professor Award 2003 Outstanding Professor Award 2016 Distinguished Women Award Publications focus on graph labeling/coloring, with recent trends in antimagic labeling for tree-like structures and radio-k-labeling optimizations. She mentors student research but directs no formal lab.

Dan McQuillanمشاهده پروفایل

استاد

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

Dan McQuillan serves as Chair of the Department of Mathematics and holds the Charles A. Dana Professorship at Norwich University's College of Arts & Sciences. With over twenty peer-reviewed publications across multiple mathematical disciplines, he teaches eighteen courses including Discrete Mathematics and Calculus, emphasizing deep conceptual understanding to simplify complex problems. He earned his Ph.D. and M.Sc. in Mathematics from Western University and B.A. in Mathematics from Carleton University, Canada. McQuillan's research centers on Combinatorics and Topological Graph Theory, with landmark contributions to magic labelings of graphs and crossing numbers of complete graphs. His work bridges abstract algebra, geometric topology, and pedagogical innovation, frequently collaborating with cross-departmental faculty on calculus teaching methodologies and involving undergraduates in tractable yet profound mathematical research. Recent publications demonstrate sustained focus on graph labelings and topological embeddings, revealing patterns where combinatorial structures yield elegant geometric solutions. This trajectory highlights his philosophy of deriving surprising simplicity from apparent complexity, with problems intentionally designed for undergraduate accessibility. As an academic mentor, he initiated Norwich's participation in the William Lowell Putnam Mathematical Competition in 2002 and continues coaching the team. His undergraduate research mentorship has produced four peer-reviewed publications in discrete mathematics, primarily through summer projects on magic graph labelings. He leads the Putnam Competition team and directs student summer research initiatives, fostering collaborative environments where undergraduates contribute directly to publishable mathematical discoveries in discrete structures.

• Data Visualization
• Augmented Reality
• Interactive Display Systems
• +۵ مورد دیگر

Raimund Dachselt is a Professor at the Institute of Software and Multimedia Technology within the Faculty of Computer Science at Dresden University of Technology. His research focuses on advanced visualization techniques and human-computer interaction systems. His primary research interests include: Data visualization for non-planar displays Augmented reality with photorealistic lighting Collaborative work with interactive display walls Analysis of multivariate graphs in multi-display environments Understandable software systems for cyber-physical worlds Professor Dachselt leads multiple significant research initiatives funded by the German Research Foundation (DFG), with particular emphasis on immersive analysis of cyber-physical systems and interactive exploration of visual models. His work bridges theoretical computer science with practical applications in collaborative environments. His scientific contributions span across several major research centers including: TRR 248: Fundamentals of Understandable Software Systems EXC 2050: Center for Tactile Internet with Human-in-the-Loop (CeTI) EXC 2068: Physics of Life - The Dynamic Organization of Living Matter

• Computer Networks
• Graph Drawing
• Information Visualization
• +۸ مورد دیگر

Maurizio Patrignani is a Full Professor of Computer Science at the Department of Civil, Computer and Aeronautical Engineering at Roma Tre University, where he has served since May 2017. Since November 2022, he has also held the position of Chair of the Computer Science and Engineering Faculty Board. His academic journey began with a "Laurea" degree in Electronic Engineering from the University of Rome "La Sapienza" in 1996, followed by a Ph.D. in Computer Science from the same institution in 2001. Patrignani's research spans multiple areas within computer science, with a strong focus on graph-related disciplines. His primary research interests include Computer Networks, Graph Drawing, Information Visualization, and Computational Geometry. He has developed expertise in Dynamic Graph Drawing, Orthogonal Drawings, Planarity and Planar Graphs, Upward Planarity, and Data Center Networking. His work often bridges theoretical computer science with practical applications, particularly in network visualization and analysis. The analysis of Patrignani's recent publications reveals a consistent focus on graph theory and its applications. His work demonstrates expertise in planar graph embeddings, orthogonal drawings, and upward planarity. Recent publications show increasing attention to practical applications of graph theory in network visualization, data center networking, and route planning. His research combines theoretical algorithm design with experimental validation and user studies, reflecting a comprehensive approach to solving complex problems in graph drawing and network analysis. Patrignani has been actively involved in numerous research projects throughout his career, including EU-funded initiatives like DELIS (Dynamically Evolving, Large Scale Information Systems) and GraDR (Graph Drawings and Representations), as well as national projects funded by MIUR. His collaborative work spans multiple institutions and researchers across Europe and beyond, demonstrating his significant role in the international computer science community. He has served on numerous program committees for major conferences in graph drawing and visualization, including the International Symposium on Graph Drawing (GD) where he was co-chair for GD 2008 and GD 2012. His organizational contributions extend to the Summer Workshop on Graph Drawing (SWGD) where he has been a member of the organizing committee since 2021. Patrignani's teaching portfolio at Roma Tre University includes courses on Algorithms and Data Structures, Computer Networks, Information Visualization, and Big Data Algorithms.