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

Rolf Fagerbergمشاهده پروفایل

استاد

• Algorithms
• Data Structures
• Computational Biology
• +۷ مورد دیگر

Rolf Fagerberg is a Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark (SDU). His research centers on algorithms, data structures, and their applications in computational biology and cheminformatics. His research interests include: Algorithms and data structures, particularly dynamic and geometric data structures Graph theory with emphasis on subgraphs, Yao graphs, and hypergraphs Algorithmic cheminformatics and modeling of chemical reaction networks Computational biology, including metabolic pathway analysis Theoretical computer science and discrete mathematics Recent publications highlight a strong trend toward interdisciplinary research combining computer science with chemistry and biology, particularly in modeling chemical reaction networks using hypergraphs and mixed-integer linear programming. His work also includes algorithmic solutions for palindromic subsequence problems and efficient extraction of reaction rules from large databases, reflecting a blend of theoretical and applied algorithm design. Rolf Fagerberg has served as senior coordinator on multiple research projects, including 'Algorithmic Cheminformatics' and 'Fundamental Data Structures', funded by the Danish Ministry of Higher Education and Research. He has also contributed to peer review and editorial work for major conferences such as the ACM Symposium on Parallelism in Algorithms and Architectures and the International Symposium on Experimental Algorithms. He has supervised PhD students and is actively involved in academic service, including membership in assessment committees at Aarhus University and IT University of Copenhagen. His research has received media attention, including coverage of a 'mathematical breakthrough' and applications in understanding intestinal systems in obesity.

• Algorithms
• Network Applications
• Parallel Algorithms
• +۸ مورد دیگر

Tom Leighton is a Professor at the Massachusetts Institute of Technology (MIT), affiliated with the Department of Mathematics and the Computer Science and Artificial Intelligence Laboratory (CSAIL). He co-founded Akamai Technologies and currently serves as its CEO while on leave from MIT. His research spans algorithm design, network applications, parallel computing, distributed systems, communication protocols, combinatorial optimization, probabilistic methods, VLSI computation, graph theory, and content delivery networks. Publication Trends : His work focuses on network algorithms, graph theory, and distributed systems, with recent papers addressing oblivious routing, universal TSP bounds, multicommodity flow analysis, load balancing, and content delivery challenges. Awards : Marconi Prize (2018) ACM Fellow (2018) National Inventors Hall of Fame (2017) American Mathematical Society Fellow (2012) U.S. National Academy of Sciences (2008) ACM-SIGACT Distinguished Service Prize (2006) National Academy of Engineering (2004) American Academy of Arts and Sciences Fellow (2003) Princeton University Gordon Wu Distinguished Lecturer (2002) MIT Entrepreneurship Award (2002) He has served on numerous editorial boards, including Journal of the ACM , SIAM Journal on Computing , and Algorithmica , and has contributed to STEM education initiatives through the Akamai Foundation and related programs.

• Computer Science
• Algorithms
• Computational Geometry
• +۴ مورد دیگر

Sujoy Bhore is affiliated with the Indian Institute of Technology Bombay (Department of Computer Science & Engineering), Université libre de Bruxelles, and Technische Universität Wien. His research focuses on algorithms , computational geometry , and graph theory , with a strong emphasis on geometric optimization , dynamic data structures , and parameterized algorithms . Recent publications highlight advancements in Euclidean spanners for sparse network design online algorithms for dynamic geometric problems Steiner trees and tree covers in planar domains k-median/means approximation using coresets His collaborative work spans institutions, with frequent joint research on geometric intersection graphs , map labeling , and planar graph embeddings . Co-authors include prominent researchers like Csaba D. Tóth, Martin Nöllenburg, and Timothy M. Chan. While no formal awards are documented here, his contributions to algorithmic complexity and geometric networks remain significant.

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.

Giordano Da Lozzoمشاهده پروفایل

دانشیار

• Algorithm Design
• Graph Drawing
• Computational Geometry
• +۵ مورد دیگر

Giordano Da Lozzo is an Associate Professor at Roma Tre University in Rome, Italy, where he is part of the Graph Algorithms and Network Visualization research group. His academic career spans theoretical computer science with a focus on practical applications in graph theory and network analysis. His educational background includes: Associate Professor Habilitation (09/H1 - Information Processing Systems), from 2022 to 2031, awarded by the Italian Ministry of Education, Universities and Research (MIUR) PhD in Computer Science and Automation Engineering, 2015, from Roma Tre University MEng in Computer Science (110/110 cum laude), 2010, from Roma Tre University Da Lozzo's research lies at the intersection of algorithm engineering and computational complexity, with particular focus on graph and network analysis and visualization. His work spans several interconnected fields including graph drawing, computational geometry, topology, combinatorics, parameterized complexity, and more recently quantum computing applications to graph problems. His research combines theoretical rigor with practical implementation considerations, aiming to develop efficient algorithms for real-world network analysis challenges. His publication record shows a consistent focus on graph drawing problems, with recent work expanding into quantum approaches to graph visualization. His research demonstrates progression from foundational graph theory problems toward more complex constrained visualization scenarios, often addressing NP-hard problems with novel algorithmic approaches. His scientific achievements have been recognized with several prestigious awards: Best Student Paper Award at the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024) Best Paper Award at the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) Best Paper Award at the 42nd International Conference on Current Trends in Theory and Practice of Computer (SOFSEM 2016) Best Poster Award at the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015) Best MCS Thesis Award by Confindustria Servizi Innovativi e Tecnologici–AICA (CSIT 2011) Da Lozzo actively mentors PhD students including Giordano Andreola (working on constrained graph embeddings, expected 2025) and Susanna Caroppo (working on quantum graph drawing, 2023). His research is supported by multiple grants including AHeAD (funded by the Italian Ministry of University and Scientific Research), CONNECT (funded by EU Horizon 2020 Programme), MODE, STACS (funded by the U.S. Defense Advanced Research Projects Agency), AMANDA, NextGRAAL, GraDR, and AlgoDEEP. He is a key member of the Graph Algorithms and Network Visualization research group at Roma Tre University, which focuses on developing efficient algorithms for networked data analysis and visualization. The group collaborates internationally on projects addressing both theoretical and practical challenges in graph representation.

Walter Didimoمشاهده پروفایل

استاد

• Graph Drawing
• Network Visualization
• Information Visualization
• +۷ مورد دیگر

Walter Didimo is a Full Professor of Computer Engineering at the University of Perugia, with a career spanning over two decades. His expertise lies in Graph Drawing, Network Visualization, and Algorithm Engineering, contributing to advancements in Computational Geometry and Big Data. Researcher in Graph Algorithms (1996-2000) Assistant Professor (2001-2004), Associate Professor (2005-2024), Full Professor (2024-) Director of Research Unit CINI (2019-2022) His research focuses on hybrid graph visualization models (e.g., ChordLink), distributed graph processing (e.g., GiViP), and practical applications in cultural heritage (e.g., CHIP) and web analytics (e.g., COWA). Recent work includes scalable algorithms for heterogeneous networked data and visual analytics for genomics (GGB Consortium). Scientific Awards: Best Paper Award - Track 2, Graph Drawing 2021 He has been instrumental in technology transfer, co-founding Vis4 Srl (2009) and contributing to the GGB Consortium. His editorial roles include Associate Editor of IEEE Access and guest editorships for CGTA and JGAA.

• Theoretical Computer Science
• Algorithms
• Computational Complexity
• +۴ مورد دیگر

Nutan Limaye is a Professor at the Department of Theoretical Computer Science , IT University of Copenhagen , specializing in Algorithms , Computational Complexity , and Algebraic Circuits . She actively contributes to research on polynomial complexity, quantum computation, and lower bound techniques. Key Research Areas : Algebraic Circuit Complexity, Polynomial Computation, Graph Isomorphism, Boolean Satisfiability Current Projects : FLows : Formula complexity and lower bounds (2024-2026) DIREC: OnlineAlgo : Digital research initiatives (2022-2025) BARC2 : Basic Algorithms Research Copenhagen (2024-2029) Scientific Recognition includes the FOCS Best Paper Award (2022) . Her work frequently appears in top conferences like CCC , FSTTCS , and SIGACT News , with recent collaborations in Denmark and international institutions. She contributes to public understanding through media appearances on topics like basic computer science research and BARC's initiatives .

Sally Cockburnمشاهده پروفایل

استاد

• Set Theory
• Philosophy of Mathematics
• Combinatorial Optimization
• +۴ مورد دیگر

Sally Cockburn is a Professor in the Mathematics and Statistics Department at Hamilton College, where she has been part of the faculty since 1991. Her research spans combinatorial optimization, geometric graph theory, and the philosophical foundations of mathematics. Education: Ph.D. from Yale University, M.Sc. from Queen’s University, M.Sc. from University of Ottawa, B.Sc. (Honors) from Queen’s University Her research focuses on geometric graph homomorphisms and poset structures, with applications in combinatorial optimization and computational complexity. She has explored philosophical questions in mathematics education and developed pedagogical materials for undergraduate courses. Recent publications analyze geometric graph properties (like K2,n and K3,3), NP-hardness, and set theory. These works situate her at the intersection of discrete mathematics and educational innovation. Scientific Awards: Mathematical Association of America Carl B. Allendoerfer Award (2014) Class of 1963 Faculty Fellowship (2005, 1996) Cockburn mentors students through collaborative research, notably guiding Yonghyun Song and Joshua Lesperance. She actively participates in college governance as a faculty secretary and on academic policy committees. As Mellon curricular leader for quantitative reasoning and squash team coach, she integrates academic and athletic leadership.

Kurusch Ebrahimi-Fardمشاهده پروفایل

استاد

• Numerical integration methods
• Nonlinear control theory
• Stochastic calculus
• +۱۲ مورد دیگر

Kurusch Ebrahimi-Fard is a Professor in the Department of Mathematical Sciences at the Norwegian University of Science and Technology (NTNU) in Trondheim, Norway. He is an active member of the Differential Equations and Numerical Analysis (DNA) group at IMF-NTNU, with extensive international collaborations across Europe and North America. His research spans a remarkable breadth of mathematical disciplines, focusing on the surprising convergence of algebraic and combinatorial structures across seemingly disparate fields. His work bridges geometric integration methods, nonlinear control theory, rough paths theory, free probability theory, and perturbative quantum field theory. The common thread throughout his research is the central role of algebraic and combinatorial structures on graphs, partitions, and other combinatorial objects. Dr. Ebrahimi-Fard's recent publications reveal strong trends in the application of Hopf algebraic structures to probability theory and stochastic analysis, with significant contributions to understanding signatures in rough path theory and their applications to image analysis. His work consistently demonstrates how abstract algebraic structures can provide powerful tools for concrete problems in numerical analysis and mathematical physics. Juan de la Cierva fellowship Ramón y Cajal fellowship Fellow of the Studienstiftung des Deutschen Volkes Fellow of the Evangelisches Studienwerk e.V. Fellow of the German Academic Exchange Service (DAAD) Fellow of the European Post-Doctoral Institute (EPDI) Throughout his career, Dr. Ebrahimi-Fard has organized numerous international conferences and workshops, including the 18th Santaló Summer School on Algebraic and Combinatorial Methods in Stochastic Calculus. His editorial work includes special issues on theoretical and computational aspects of dynamical systems, non-commutative algebra, and algebraic structures in perturbative quantum field theory. He has also secured research funding through various grants including the BBVA Foundation Research Grants. Dr. Ebrahimi-Fard maintains active collaborations with researchers worldwide and participates in several research networks focused on the intersection of algebra, combinatorics, and mathematical physics. His work with the DNA group at NTNU continues to explore fundamental mathematical structures with applications across scientific disciplines.

• Algebraic Geometry
• Combinatorics
• Cluster Algebras
• +۷ مورد دیگر

David Speyer is a Professor in the Department of Mathematics at the University of Michigan. He serves as Associate Chair for Education-Logistics and has been a key figure in curriculum development, particularly for Math 632 , Math 593 , and Math 665 . His research bridges algebraic geometry with combinatorial mathematics, focusing on areas such as cluster algebras , tropical geometry , and flag varieties . Education : Ph.D. in Mathematics from the University of California, Berkeley (2005); B.A. from Harvard University. Previous Positions : Clay Research Fellow (2005-2010), with appointments at the University of Michigan and MIT. Research Interests Speyer's work explores the intersection of algebraic geometry and combinatorics. His key contributions include studies on total positivity , shard theory in Coxeter groups , and combinatorial structures in algebraic varieties . Current projects involve cluster deep loci and 3D plabic graphs , connecting mirror symmetry to discrete mathematics. Scientific Contributions Awards : Clay Research Fellow (2005-2007). Publications : 15+ papers on algebraic geometry, combinatorial structures, and total positivity. Advising and Teaching Speyer has advised 9 graduate students and supervised 8 undergraduate research projects . He is involved in high school outreach through programs like PROMYS and Math Corps . He plans to take 2-4 new graduate students in the coming years.

• programming and building microprocessor devices
• application programming (Delphi, C++)
• Web programming (.NET, C#, MVC, AJAX)
• +۲ مورد دیگر

Sergey Oleksandrovych Sgadov is a Senior Lecturer in the Department of Computer Systems and Networks at Zaporizhzhia Polytechnic National University. With academic activity at the university since 1998, he has established himself as a dedicated educator and researcher in computer science and microprocessor technologies. His institutional affiliation places him within the Faculty of Computer Sciences and Technologies, where he contributes to both teaching and research initiatives. Education: Graduated from Zaporizhia National University in 1993 with honors, specializing in "Solid-state electronics and microelectronics" and receiving the qualification of "specialist". Dr. Sgadov's research spans multiple domains of computer science and engineering. His primary interests include microprocessor programming, application development using Delphi and C++, web programming with .NET technologies, and computer modeling of physical processes. He has made significant contributions to graph theory, particularly in topological graph drawing algorithms and their applications in printed circuit board design. His work bridges theoretical computer science with practical engineering applications, focusing on creating efficient algorithms for complex computational problems. Analysis of his publication record reveals a strong focus on graph theory applications in electronic design automation, microprocessor systems development, and educational tools for computer engineering. His research has evolved from fundamental theoretical work on graph algorithms to practical implementations in microcontroller programming and educational technology. The consistent thread throughout his work is the application of computational methods to solve complex engineering problems, particularly in circuit design and microprocessor systems. Dr. Sgadov teaches courses in microcontroller programming and programming of microcontroller systems, bringing his research expertise directly into the classroom. His teaching methodology likely incorporates practical, hands-on experience with modern microprocessor technologies, reflecting his research interests in ARM Cortex processors and microcontroller applications.

András Frankمشاهده پروفایل

استاد

• Combinatorial Optimization
• Matroid Theory
• Submodular Functions
• +۳ مورد دیگر

András Frank is a Professor at the Department of Operations Research, Eötvös Loránd University, Budapest. As founder and leader of the MTA-ELTE Egerváry Research Group on Combinatorial Optimization (EGRES), he focuses on combinatorial optimization, matroid theory, submodular functions, matchings, graph theory, and polynomial-time algorithms. University: Eötvös Loránd University Department: Operations Research Research Group: EGRES (MTA-ELTE Egerváry Research Group on Combinatorial Optimization) His research addresses both theoretical and applied aspects of combinatorial optimization, including network flows, graph connectivity, and algorithmic applications. He authored the book Connections in Combinatorial Optimization (Oxford University Press, 2011), which explores polynomial-time algorithms and their role in graph theory and matroid theory. Key trends in his recent work include fair integral flows, discrete convex optimization, and algorithmic approaches to supermodular functions. While no specific scientific awards are listed in the provided texts, his contributions have been recognized through publications in top-tier venues and leadership in the EGRES group.

Yusuke Kobayashiمشاهده پروفایل

دانشیار

• Graph Algorithms
• Discrete Structures
• Combinatorial Optimization
• +۴ مورد دیگر

Yusuke Kobayashi is an Associate Professor at the Research Institute for Mathematical Sciences (RIMS), Kyoto University. His research focuses on graph algorithms, combinatorial optimization, and discrete structures such as matroids, jump systems, and discrete convex functions. He has contributed to problems involving network design, disjoint paths, and fair allocation of indivisible goods. Education : Bachelor, Master, and Ph.D. in Information Science and Technology from the University of Tokyo (2005, 2007, 2010). Research Interests : Graph Algorithms: Network design, disjoint paths, and reconfiguration problems. Discrete Structures: Matroid theory, jump systems, and discrete convexity. Combinatorial Optimization: Applications to fair division, social welfare, and graph connectivity. Article Trends : Kobayashi’s recent work spans reconfiguration problems (e.g., colorings, matchings), fair allocation (EFX criteria), and quantum routing. His research often bridges graph theory with algorithmic applications, emphasizing structural properties like planarity and 4-edge-connectedness. Scientific Awards : Japan Operations Research Society Student Paper Award (2005). University of Tokyo Dean’s Award (2010). STOC Best Paper Award (2017). MEXT Young Scientists' Award (2020). Operations Research Society of Japan Research Award (2023). Grants and Collaborations : His work has been supported by the Japan Society for the Promotion of Science (JSPS) and involves collaborations with researchers in Japan and Hungary (e.g., Kristóf Bérczi, Naonori Kakimura).

• Computational Complexity Theory
• Graph Theory
• Theoretical Computer Science

Raghunath Tewari is an Associate Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Kanpur. His academic journey includes a PhD from the University of Nebraska-Lincoln (2011), an MS from the same institution (2007), and a B.Sc. from Chennai Mathematical Institute (2005). Dr. Tewari's research focuses on Computational Complexity Theory and Graph Theory , with particular expertise in space complexity, unambiguous computations, and planar graph algorithms. His work bridges theoretical computer science with practical applications in graph algorithms and computational models. His recent publications (2009-2012) demonstrate a consistent research trajectory in computational complexity, particularly examining space-bounded computations and graph-theoretic problems. His work frequently appears in high-impact theoretical computer science venues including ACM Transactions on Computation Theory and Journal of Computer and System Sciences. Outstanding Ph.D. Student Award Outstanding Masters Student Award Dr. Tewari teaches courses in Theoretical Computer Science and Introduction to Programming, contributing to both foundational and advanced computer science education at IIT Kanpur. His office is located in Room 514 of the Computer Science and Engineering Department building at IIT Kanpur.

Alicia Cantón Pireمشاهده پروفایل

استاد

• Mathematics
• Applied Mathematics
• Geometry
• +۵ مورد دیگر

Alicia Cantón Pire is a Professor at the Department of Mathematics and Computer Science Applied to Civil and Naval Engineering , affiliated with the Higher Technical School of Naval Engineers (ETSIN) at the Polytechnic University of Madrid (UPM) . Her research spans multiple domains within Mathematics, Applied Mathematics, and Computer Science, focusing on geometric modeling, complex analysis, and graph theory. Research Interests : Asymptotic values of meromorphic functions, Gromov hyperbolicity in planar graphs, geometric characteristics of Bézier surfaces, and isoperimetric inequalities. Teaching : Engaged in academic instruction, with access to the Moodle platform for current courses. Professional Affiliations : Member of mathematical societies including the Royal Spanish Mathematical Society (RSME) , Spanish Society of Applied Mathematics (SeMA) , and the American Mathematical Society (AMS) . Her work integrates theoretical mathematics with practical applications in engineering and computer science, reflecting in her collaborative publications and extensive contributions to geometric and analytic problems. Email : alicia.canton@upm.es