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

Brad Foxمشاهده پروفایل

استاد

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

Brad Fox is a Professor of Mathematics at the Department of Mathematics and Statistics, Austin Peay State University. He specializes in Discrete Mathematics and Combinatorics with a focus on graph labelings, posets, and permutations. Dr. Fox holds a Ph.D. in Mathematics from the University of Kentucky (2015), a Graduate Certificate in College Teaching and Learning (2015), an M.A. in Mathematics (2014), and a B.A. in Mathematics from Transylvania University (2009). His research explores graph theory, combinatorial structures, and permutation analysis. Recent publications (2024-2014) investigate topics like ranked choice voting systems, graph labeling algorithms, permutation cycle enumeration, and combinatorial identities. His work bridges theoretical advancements with practical applications in discrete structures. No scientific awards are listed. Advising and grant details are not provided in available texts. His research lab focuses on graph theory innovations, though specific team names are unspecified.

Michael Coonsمشاهده پروفایل

دانشیار

• Number Theory
• Aperiodic Order
• Automata Theory
• +۵ مورد دیگر

Michael Coons is an Associate Professor in the Department of Mathematics and Statistics at California State University, Chico. His research bridges number theory, automata theory, and aperiodic order, focusing on the interplay between regular sequences, Mahler functions, and fractal structures. Education: Ph.D. in Mathematics from Simon Fraser University. Coons' work explores the spectral properties of regular sequences, correlations in automatic sequences like the Thue-Morse sequence, and the fractal nature of ghost distributions. His recent publications investigate asymptotics of partition functions, algebraic independence of Mahler functions, and connections to dynamical systems. His research trends highlight a focus on number-theoretic functions, Diophantine approximation, and applications of automata theory to mathematical structures. Coons has also contributed to the legacy of Kurt Mahler through expository and analytical works. No scientific awards or honors were explicitly mentioned in the provided texts.

• Operations Research
• Combinatorial Optimization
• Algorithmic Graph Theory
• +۳ مورد دیگر

Prof. Dr. Marzena Fügenschuh is a Professor at the Berlin School of Economics and Law (BHT Berlin), affiliated with the Department of Mathematics - Physics - Chemistry. She has been actively involved in teaching since the summer semester of 2009, offering courses in applied mathematics, computer science, and media informatics. Her research focuses on operations research, combinatorial optimization, algorithmic graph theory, and network theory, particularly analyzing multiplex networks and their layered structures. Her work emphasizes synthetic model development for complex networks, including air transportation systems and layered network topologies. She has presented her research at major conferences such as Complex Networks and the European Conference on Operational Research. Supervising theses, she guides students in topics like multiplex network generation and optimization algorithms. Prof. Fügenschuh’s contributions span theoretical advancements in graph bisection and practical applications in magnetic measuring systems and industrial design. Her interdisciplinary approach bridges algorithmic theory with real-world engineering challenges.

Brant Jonesمشاهده پروفایل

استاد

• Combinatorics
• Algorithms
• Game Theory
• +۳ مورد دیگر

Brant Jones is a Professor of Pure Mathematics at James Madison University (JMU), where he has been since 2010. He earned his PhD in Mathematics from the University of Washington in 2007 and held a VIGRE Fellowship at the University of California, Davis. His research focuses on combinatorics, particularly games, algorithms, algebraic structures, and enumerative combinatorics, often involving computational tools. He has mentored 28 undergraduate students in research projects and contributed to software libraries like liberiksson for Coxeter group computations. Jones has been awarded NSF grants for JMU's Research Experiences for Undergraduates (REU) program and led workshops at ICERM and AIM. His work has been cited by Don Knuth in The Art of Computer Programming . Education: PhD in Mathematics, University of Washington (2007); Postdoctoral Fellowship at UC Davis (2007–2010). Research Interests: Combinatorial game theory, algebraic structures, enumerative combinatorics, and reflection group representation theory. He frequently uses programming to aid his research and has experience in software engineering. Publications: Over 20 peer-reviewed articles, including works on games of best choice, Kazhdan-Lusztig polynomials, and combinatorial enumeration. Recent work includes collaborations on core partitions and affine permutation patterns. Awards/Grants: NSF REU funding (2017–2023), REUF workshop leadership (2019), citations in The Art of Computer Programming (2021). Teaching: Courses in discrete mathematics, abstract algebra, calculus, and combinatorics. Coordinates JMU's Putnam Competition team. Software Contributions: Developed liberiksson for Coxeter group calculations and contributed to Sage's combinatorics modules.

Joshua Bowmanمشاهده پروفایل

دانشیار

• Dynamical Systems
• Geometric Topology
• Teichmüller Theory
• +۳ مورد دیگر

Joshua Bowman is an Associate Professor of Mathematics at Pepperdine University, affiliated with the Natural Science Division within Seaver College. His research focuses on Dynamical Systems and Geometric Topology, with a particular emphasis on Teichmüller theory and translation surfaces. Bowman holds a PhD from Cornell University (2009), an MS from Cornell (2006), and a BA from St. Olaf College (1999). His work explores topics such as billiard dynamics, flat structures, and geometric properties of surfaces. Notable publications include studies on Arnoux-Yoccoz surfaces, monodromy groups, and historical analyses of Poincaré's contributions. Bowman teaches courses like Calculus 1 and 3, emphasizing both theoretical rigor and applied mathematical reasoning. Publications span journals like Israel Journal of Mathematics, Math Horizons, and Contemporary Mathematics. His research highlights the interplay between algebraic, geometric, and topological structures in dynamical systems. Bowman actively contributes to academic discourse through peer-reviewed articles and educational initiatives in mathematics.

• Operations Research
• Optimization
• Mathematical Programming
• +۵ مورد دیگر

Marianna De Santis is an Associate Professor in the Department of Information Engineering (Dipartimento di Ingegneria dell’Informazione) at the University of Florence, Italy. She previously held positions at Sapienza University of Rome and other institutions. Her research focuses on optimization, particularly in multiobjective programming, mixed-integer programming, and algorithm design. She has authored numerous articles in top journals and developed software tools like BBMOQIP and MOMIX for solving complex optimization problems. Education : PhD in Operations Research, Sapienza University of Rome (2012) MSc in Applied Mathematics (2007), BSc in Mathematics (2005) Research Interests : Dr. De Santis specializes in optimization theory and applications, including multiobjective optimization, integer programming, and algorithm design. Her work bridges theoretical advancements with practical implementations, addressing challenges in machine learning, bioinformatics, and operations research. Key areas include semidefinite programming, robust optimization, and exact methods for complex combinatorial problems. Articles Trends : Her recent work emphasizes multiobjective optimization, with contributions to hyperparameter optimization, robust combinatorial methods, and sustainable modeling. Publications span journals like Journal of Global Optimization and Mathematical Programming , reflecting her expertise in algorithmic innovation and mathematical rigor. Grants & Teaching : She leads projects on augmented Lagrangian methods and multiobjective integer optimization. Teaching includes courses on operations research, optimization, and data science at the undergraduate and graduate levels. She has also organized international workshops and served on conference committees. Labs/Teams : Her research group develops optimization software (e.g., BBMOQIP) and collaborates internationally on projects involving algorithm design and real-world applications.

Christoph Koutschanمشاهده پروفایل

استاد پژوهشی

• Computer Algebra
• Algorithmic Combinatorics
• Symbolic Summation
• +۳ مورد دیگر

Christoph Koutschan is a Senior Fellow in the Symbolic Computation group at the Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences. He holds a PhD in Mathematics from JKU Linz (2009) and a Habilitation in Mathematics (2017). His research focuses on computer algebra, algorithmic combinatorics, and symbolic summation/integration of holonomic functions. Koutschan has held positions at Tulane University (2009–2010), Tulane University (2009–2010), and INRIA (2011–2012) before joining RICAM in 2012. Education: PhD in Mathematics (2009), Research Institute for Symbolic Computation (RISC), JKU Linz Habilitation in Mathematics (2017), JKU Linz M.Sc. in Computer Science (2005), FAU Erlangen-Nürnberg Studies in Computer Science (1999–2005), FAU Erlangen-Nürnberg Research Interests: Koutschan's work revolves around symbolic computation with a focus on holonomic functions, combinatorial identities, and applications in mathematical physics. His tools include algorithmic methods for summation/integration, differential equations, and computational algebra. Publications & Awards: Over 40 journal articles, including work on determinant evaluations, Feynman amplitudes, and combinatorial enumeration. Notable awards include the David P. Robbins Prize (2016), ISSAC's Distinguished Software Presentation Award (2016), and the ACA Early Researcher Award (2021). Grants & Collaborations: Lead or co-PI in projects like 'Certificate-free Summation and Integration' (SFB F50, 2017–2021) and 'Security and Safety for Shared AI' (FFG COMET-K2, 2020–2023). Active in editorial roles at Journal of Symbolic Computation and Annals of Combinatorics . Labs/Teams: Core member of RICAM's Symbolic Computation group, collaborating internationally with institutions like INRIA, Tulane University, and TU Wien.

• Applied Mathematics
• Graph Theory
• Combinatorics
• +۳ مورد دیگر

Prof. Angelika Wiegele is a full Professor at the Department of Mathematics at Alpen-Adria-Universität Klagenfurt. She serves as a member of the university senate and head of the Institut für Mathematik. Her research focuses on semidefinite optimization, combinatorial optimization, and their applications in graph theory and operations research. She holds a Dipl.-Ing. (2001) and Dr. techn. (2006) from Alpen-Adria-Universität Klagenfurt, with thesis supervision by Franz Rendl. Her academic career includes positions at TU Graz, IASI-CNR Rome, and Universität zu Köln, as well as a visiting professorship at Università di Roma Tor Vergata. Her educational background includes studies at City University London (Erasmus) and TU Eindhoven (Leonardo project). Recent work emphasizes SDP-based methods for graph partitioning, edge expansion, and combinatorial problems, with a focus on high-performance computing solutions. Her research bridges theoretical optimization with practical applications in network design and algorithmic development. Publications from 2021–2024 highlight advancements in semidefinite programming for graph partitioning, SDP-based bounds for cutwidth, and exact solvers for clustering problems. She contributed to the BiqBin and SOS-SDP solvers for quadratic optimization and co-edited special journal issues on mixed-integer nonlinear optimization. Her work often appears in top operations research journals and conference proceedings. Prof. Wiegele has held global faculty positions at the University of Cologne (2022–2024) and is active in international research collaborations through PRACE high-performance computing initiatives. She maintains an ORCID profile and a university webpage with teaching and research materials.

Dieter Fellnerمشاهده پروفایل

استاد

• Computer Graphics
• Digital Libraries
• Computational Geometry
• +۱۰ مورد دیگر

Dieter Fellner is a Professor of Computer Science at Technical University of Darmstadt, Germany , and Director of the Fraunhofer Institute of Computer Graphics (IGD) . He also serves as Founding Director of the Institute of Computer Graphics and Knowledge Visualization at Graz University of Technology, Austria. His career spans multiple prestigious institutions including University of Bonn, Memorial University of Newfoundland, and University of Technology Braunschweig. Dr. Fellner's research focuses on algorithms integrating modeling and rendering , digital libraries , virtual/augmented reality , collision detection , and radio wave propagation simulation . His work in digital libraries led to a DFG-funded strategic initiative (1997-2005) involving 50 researchers annually across 21 groups. The 15 most recent articles highlight his expertise in 3D document modeling , stereoscopic projection , subdivision surfaces , and color quantization . His publications include influential textbooks like the German standard on computer graphics (1988) and Digitale Bibliotheken (2000). 2000 Fellow of the Eurographics Association Best Technical Paper Award (Günther Enderle Award) at Eurographics’98 2007 IST Advisory Group (ISTAG) Member for the European Commission 2019 Honorary Doctorate from University of Rostock Dr. Fellner actively participates in editorial boards of journals like Computer Graphics Forum , IEEE CG&A , and JOCCH , and serves on program committees for conferences such as Eurographics, VSMM, and ACM Web3D. His leadership roles include Chairmanship of the Eurographics Association (1999-2000) and Directorship of Fraunhofer IGD (since 2006).

• Logistics and Supply Chain Management
• Artificial Intelligence
• Machine Learning
• +۶ مورد دیگر

Haibo Wang is a Killam Distinguished Professor at Texas A&M International University, specializing in logistics, artificial intelligence, and quantum computing. With a Ph.D. from the University of Mississippi (2004), he brings over a decade of IT consulting experience to academia, focusing on bridging employer needs and student skills through data analytics education. He teaches in the MBA in Management program, emphasizing analytical skills, research proficiency, and business problem-solving using Excel, R, and Python. His research interests span decision support systems, supply chain resilience, and optimization algorithms. Key contributions include work on quantum-inspired optimization, econophysics frameworks for financial networks, and machine learning applications in supply chain security. He has secured grants related to infrastructure and border security as a principal investigator and expert consultant. Professor Wang has received prestigious awards including the International Faculty of the Year and University Scholar of the Year. His work integrates computational experiments with real-world challenges, such as predicting distressed firms in China and analyzing cross-border transportation data. He mentors students in NSF LSAMP grant programs and advocates for structured learning approaches to master business analytics tools. His academic output includes over 50 refereed journal papers across disciplines like operations research, financial engineering, and AI. Recent research highlights dynamic market relationships (e.g., BRICS stock markets and cryptocurrency), quantum machine learning algorithms, and network resilience in financial systems.

Dorin Andricaمشاهده پروفایل

استاد

• Critical Point Theory
• Nonlinear Analysis
• Approximation Theory
• +۳ مورد دیگر

Dorin Andrica is a Professor at the Faculty of Mathematics and Computer Science at Babeș-Bolyai University in Cluj-Napoca, Romania. With a career spanning over three decades at the same institution, his work bridges multiple disciplines including Critical Point Theory , Nonlinear Analysis , Approximation Theory , and Number Theory , particularly focusing on Elementary Mathematics and Olympiad/Contest problems . PhD in Mathematics (Babeș-Bolyai University, 1992) Two decades of research grants, including the European Network 'Geometric Analysis' (2001–2004) and DAAD Fellowship (1993). His publications often explore Diophantine equations , prime gaps , and geometric inequalities , with notable contributions like Andrica's Conjecture — a famous unsolved problem in number theory. Recent works highlight dynamic geometry, cyclotomic polynomials, and advanced combinatorial identities, reflecting his interdisciplinary approach. Andrica has co-organized the European Summer School 'Spaces with singularities and monopols' (Cluj-Napoca, 1999) and serves on editorial boards of multiple journals, including Studia Univ. 'Babeș-Bolyai'-Mathematica and Gazeta Matematica . His Erdős number is 2.

Hamza Yesilyurtمشاهده پروفایل

دانشیار

• q-Series
• Partition Theory
• Theta Functions
• +۳ مورد دیگر

Hamza Yeşilyurt is Associate Professor of Mathematics at Bilkent University specializing in q-series and modular forms. Research bridges partition theory, theta functions, and Ramanujan's identities. Develops combinatorial proofs for Rogers-Ramanujan function identities and investigates connections between quadratic forms and eta-quotients. Manages the Mathematics department's mandatory internship program for undergraduates. Teaches mathematics courses while exploring representations of integers by binary/quaternary forms derived from Ramanujan's work. Office hours available by appointment.

Edward Lamمشاهده پروفایل

پژوهشگر ارشد

• Combinatorial Optimization
• Neuro-Symbolic AI
• Operations Research
• +۳ مورد دیگر

Edward Lam is a Research Fellow in the Department of Data Science and Artificial Intelligence at Monash University. His research focuses on the intersection of combinatorial optimization and neuro-symbolic AI, developing algorithms for routing, scheduling, control, and analytics, primarily applied to automated decision-making in transportation and logistics. He holds a PhD in Computer Science (2019) and a BSc(Hons) in Mathematics and Statistics (2010), both from the University of Melbourne. Lam is affiliated with CSIRO Data61 and actively supervises PhD students in optimization and machine learning. **Education**: PhD in Computer Science, University of Melbourne (2019) BSc(Hons) in Mathematics and Statistics, University of Melbourne (2010) **Research Interests**: Combinatorial optimization, neuro-symbolic AI, multi-agent systems, and applications in autonomous logistics. His work addresses challenges in routing, scheduling, and decision-making under constraints. **Article Trends**: Recent publications emphasize branch-and-cut-and-price algorithms for multi-agent pathfinding, electric vehicle routing, and hybrid optimization methods. His work bridges theoretical algorithm design with real-world applications in transportation and warehousing. **Awards**: Received the Doctoral Research Award (2019) for outstanding contributions to optimization algorithms. **Advising & Grants**: Currently accepting PhD students focused on combinatorial optimization and machine learning, with available scholarships. Collaborates on projects funded by industry and governmental entities like CSIRO. **Affiliations**: Maintains an external position at CSIRO Data61 and has contributed to patents in optimization algorithms (2018).

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

استاد

• Algebraic groups
• Invariant theory
• Commutative algebra
• +۴ مورد دیگر

David Wehlau is a Professor of Mathematics at the Royal Military College of Canada (RMC), with a joint affiliation at Queen's University. He holds a Ph.D. (Brandeis, 1989) and Master’s (Brandeis, 1984) in Mathematics, and an Honors BSc in Mathematics and Computer Science from Western University. His research focuses on algebraic groups, invariant theory, commutative algebra, and discrete mathematics, with notable contributions to modular invariant theory and cryptographic applications. He has advised numerous graduate students, including Asia Matthews (PhD 2015), Yinglin Wu (PhD 2009), and Emilie Dufresne (PhD 2008). His awards include the Cowan Prize (2012) for research and the RMC Teaching Excellence Award (2002). He has organized major conferences like the 2016 Algebraic Combinatorics and Group Actions conference and co-authored influential books such as Modular Invariant Theory . Wehlau collaborates extensively with researchers at Queen's University, including Eddy Campbell and Ivan Dimitrov, on algebraic geometry and representation theory. His work also bridges cryptography and finite geometry, with applications in error-correcting codes and secure communication systems.

Enrique Trevinoمشاهده پروفایل

استاد

• Analytic Number Theory
• Computational Number Theory
• Combinatorics
• +۳ مورد دیگر

Enrique Trevino is a Professor of Mathematics and Chair of the Mathematics and Computer Science Department at Lake Forest College . His research focuses on Analytic Number Theory and Computational Number Theory , with a strong emphasis on explicit estimates and algorithmic approaches to classical number theory problems. PhD in Mathematics from Dartmouth College (2011) Advisor: Carl Pomerance His work spans topics such as quadratic non-residues, parking functions, Egyptian fractions, and probabilistic methods in number theory. He has published extensively in journals like the American Mathematical Monthly , College Mathematics Journal , and Integers , often collaborating with students on research projects. Travel Grant from American Mathematical Society (2013) Swarthmore College Research Award (2011-2013) GAANN Fellowship (2006-2007) Top 200 in the 66th Putnam Exam (2005) Professor Trevino has supervised undergraduate theses on topics ranging from the probabilistic method to transcendental numbers and directed numerous Richter projects , including studies on Tupper’s Self-Referential Formula and perfect polynomials modulo 2. He also serves as a key organizer for mathematical competitions, leading Mexican teams at international Olympiads since 2017 and co-editing the United States Mathematical Olympiad.