Enric Rodríguez Carbonell is a faculty member at the Department of Computer Sciences within the Faculty of Computer Science at Universitat Politècnica de Catalunya (UPC). He is a key member of the LOGPROG - Lògica i Programació research group, focusing on formal methods, automated reasoning, and combinatorial optimization. Research Interests: His work centers on satisfiability (SAT), satisfiability modulo theories (SMT), and their applications in program verification, constraint solving, and optimization. He investigates techniques such as conflict-driven learning, invariant generation, and Max-SMT for proving termination and safety. His research bridges theoretical foundations with practical applications in software analysis and industrial problem-solving. Publication Trends: His recent publications (2020–2024) show a sustained focus on enhancing SAT and SMT solvers, particularly in pseudo-Boolean reasoning, integer linear programming, and multi-conflict analysis. Earlier works established contributions in non-linear arithmetic, termination proofs, and efficient encodings for cardinality constraints, reflecting a long-term commitment to foundational and applied aspects of automated reasoning. Scientific Awards: Best student paper award at SAT 2024 Advising and Grants: Rodríguez Carbonell has contributed to multiple competitive R+D+i projects under Spain’s State Research Plans, indicating active grant involvement. He has co-authored doctoral theses and educational initiatives like Jutge.org, demonstrating engagement in academic supervision and pedagogical innovation. Labs and Teams: He is a core researcher in the LOGPROG group at UPC, which specializes in logic and programming, with strong collaborations across formal methods, verification, and constraint technologies.
Prof. Jacek Jachymski is a research and teaching professor at the Department of Applied Contemporary Mathematical Analysis, Lodz University of Technology. His work spans fixed point theory, metric spaces, and nonlinear analysis, with significant contributions to metrization theorems and topological properties of semimetric spaces. Focus on metric fixed point theory , including Banach contraction principle extensions and Cantor intersection theorems. Pioneering research in quasimetric and semimetric spaces, with applications to optimization and function theory. Collaborations with mathematicians like Filip Turoboś and Katarzyna Chrząszcz on Lipschitzian mappings and metric preservation. Recent publications (2024–2018) emphasize metric compactness , remetrization techniques, and fixed point stability. His work bridges abstract mathematics with practical applications in differential equations and iterative function systems. PhD students include Filip Turoboś, Katarzyna Chrząszcz, Jakub Klima, Filip Strobin, Gertruda Gwóźdź-Łukawska, and Izabela Jóźwik, all advancing fixed point theory in generalized metric structures.
Prof. dr. Jeroen de Mast is a faculty member at the University of Amsterdam (UvA) , affiliated with the Faculty of Economics and Business and the Section Business Analytics . His research focuses on Lean Six Sigma , statistical engineering , and diagnostic problem solving , with applications in healthcare operations and industrial processes. He has authored numerous publications on topics such as variation reduction, measurement systems, and quality improvement frameworks. Academic Rank: Professor Contact: j.demast@uva.nl Research Trends (2019–2025): His work spans operational excellence , appointment scheduling optimization , and statistical validation , emphasizing interdisciplinary collaboration between statistics, healthcare, and business analytics. Key methodologies include DMAIC , DAPS diagrams , and adaptive polynomials .
Aïssa Guesmia is a Maître de conférence (Associate Professor) at Université de Lorraine in Metz, France, where he has been working since 2001. He is affiliated with the Faculty of Mathematics, Computer Science and Mechanics (UFR MIM) and is a member of the Partial Differential Equations research team at IECL (Institut Élie Cartan de Lorraine). He also holds an Adjunct Professor position at King Fahd University of Petroleum and Minerals (KFUPM) in Saudi Arabia since 2019, following a two-year detachment as Associate Professor there from 2012-2014. Dr. Guesmia received his Baccalauréat in Mathematics from Technicome de M'sila, Algeria in 1991. He earned his Maitrise (equivalent to Master's) in Functional Analysis from Ferhat Abbas University in Sétif, Algeria in 1995. He then pursued his DEA (Diplôme d'Études Approfondies) and PhD in Mathematics at Louis Pasteur University in Strasbourg, France, completing his PhD titled "Contributions to exact controllability and stabilization of evolution systems" in 2000 under the supervision of Professor Vilmos Komornik. He obtained his HDR (Habilitation à Diriger des Recherches) in 2006 with the thesis "Integral inequalities and applications to the stabilization of non-dissipative distributed systems." Dr. Guesmia's research focuses on partial differential equations and control theory, particularly in the areas of existence, uniqueness and regularity of PDE solutions, observability and exact controllability, asymptotic behavior, integral inequalities, and numerical analysis. His work has significant applications in structural mechanics, including Timoshenko systems, wave equations, plate theory, and elasticity. He has developed innovative approaches for stabilizing non-dissipative distributed systems through the introduction of new integral inequalities and has made substantial contributions to understanding the stability of systems with memory effects and delays. His research bridges theoretical mathematics with practical engineering applications. Analysis of Dr. Guesmia's recent publications (2017-2020) reveals a continued focus on stability analysis of various structural systems, particularly Timoshenko beams, Bresse systems, and plate equations. His work frequently examines the effects of viscoelasticity, thermal conduction, and memory effects on system stability. A notable trend is his investigation of logarithmic nonlinearities in viscoelastic systems and the comparison of different types of heat conduction (types I and III) in thermoelastic structures. His research demonstrates both theoretical depth and practical relevance to engineering applications, with over 63 publications and extensive international collaborations. Dr. Guesmia has served as an Associate Editor for the journals Nonautonomous Dynamical Systems (since 2013) and International Journal of Mathematical Physics (since 2018). He has been a regular reviewer for Mathematical Reviews, American Mathematical Society since 2001. His professional qualifications include three successful qualifications for Professor positions (2007, 2012, and 2017) in section CNU 26. Dr. Guesmia has supervised six doctoral theses, two magister theses, and several Master's theses across multiple countries including France, Algeria, and Lebanon. He has secured eleven research projects primarily funded by institutions in Saudi Arabia and Oman. His international collaborations are extensive, with regular teaching activities in Algeria through the Algerian-French doctoral school established in 2005, where he has conducted eight intensive M2 courses. Dr. Guesmia is an active member of the Partial Differential Equations, Analysis and Applications research group at IECL. His international network includes ongoing work with King Fahd University of Petroleum and Minerals in Saudi Arabia, University of Maringà in Brazil, Lebanese University in Beirut, and multiple Algerian universities. He has participated in over 50 conferences worldwide and maintains a robust research program with continuous publications since 1997.
Dr. Orhan Kaplan serves as a Lecturer at Gaziantep University's Nizip Vocational School in the Marketing and Advertising Department since 2019, with prior appointment in the Mathematics Education Department at Nizip Faculty of Education (2021). Holding a doctorate in Curriculum and Instruction (Mathematics Education) from the University of Florida, he maintains active research in mathematics education with particular focus on algebra pedagogy, STEAM integration, and educational technology. His research interests encompass Mathematics Education , Algebra Teaching Methodologies , STEAM Curriculum Development , Educational Technology Integration , and Critical Thinking Development . Current projects include TÜBİTAK-funded research on 'Artificial Intelligence Applications in Mathematics Education' and comparative analyses of mathematics curricula across Türkiye and the United States. Recent publications reveal a strong emphasis on digital technology's impact on creative thinking (2025), ChatGPT integration in teacher education (2024), and critical analysis of algebra curricula (2025). His scholarly work spans quantitative studies using PISA data, qualitative analyses of teacher reflections, and historical examinations of NCTM's evolution regarding equity and assessment. Certificate of Appreciation for Master's Education (Turkish Consulate General, New York) Certificate of Appreciation for Upward Bound Program Services (University of Florida) Measurement and Evaluation Certificate (Gaziantep) As an educator, Kaplan teaches courses including Primary School Mathematics Teaching, Problem Solving in Mathematics, and Communication in Mathematics Classrooms. He has served on organizing committees for international symposia including BİLTEK-IV (2021) and NCTM Annual Meeting Exposition (2018), demonstrating active engagement in global mathematics education communities through his National Council of Teachers of Mathematics membership since 2012.
Ophelia Adams is a Visiting Assistant Professor at the University of Rochester, specializing in number theory and arithmetic dynamics. She earned her Ph.D. at Brown University in Spring 2023 under Joe Silverman, focusing on dynamical Galois representations and anabelian geometry over local fields. Her research explores connections between: Higher ramification in dynamical extensions Structure of iterated monodromy groups Rigidity of dynamical representations Interactions with chemical reaction networks Étale fundamental group applications Recent publications examine profinite iterated monodromy groups, dynamical analogues of classical criteria, and solvability conditions in reaction networks. Her work reveals deep parallels between arithmetic dynamics and chemical systems. Scientific awards include: Teaching Center's College Course Development Fellowship (Summer '24) Transparent Assignment Design Fellowship (Spring '24) At Rochester, she redesigned MATH 280 to emphasize project-based learning and teaches across calculus and number theory curricula. She also pursues part-time studies in literary translation at the University of Rochester, focusing on the poetry of 朱淑真 (Zhū Shúzhēn).
Mine Menekse Yilmaz is an Associate Professor at Gaziantep University , Faculty of Arts and Sciences , Department of Mathematics , with a career spanning over two decades. She holds a PhD in Mathematics from Ankara University (2011) and has been actively researching approximation theory, singular integral operators, and functional analysis.
Jerzy Mycka is an Associate Professor at the Faculty of Mathematics, Physics and Computer Science of Maria Curie-Skłodowska University (UMCS) in Lublin, Poland. He is affiliated with the Department of Teaching Mathematics and Computer Science and serves as the Faculty Coordinator for the Erasmus+ Programme . His research spans the theory of computability , mathematical logic , philosophy of mathematics , and the history of mathematics . He also explores the social and cultural role of mathematics , bridging technical rigor with philosophical inquiry. His publications reflect a deep engagement with foundational questions in computation, including Church's thesis , real recursive functions , and analog computation . His work often intersects with philosophical implications of computational limits and the nature of mathematical knowledge. He is actively involved in academic service, offering regular student consultations and coordinating international academic exchange through Erasmus+. His teaching and mentoring are integral to the university’s academic community.
Nicola Galesi serves as an Associate Professor in the Department of Computer, Control and Management Engineering (DIAG) at Sapienza University of Rome since 2022, following 17 years in Sapienza's Department of Computer Science (2005-2022). His academic journey began with an Associate Professorship at Universitat Politecnica de Catalunya (2001-2005) after postdoctoral positions at the Institute for Advanced Studies in Princeton (2000-2001) and University of Toronto (2002-2003) under Stephen Cook and Toni Pitassi. His educational background features a PhD from Universitat Politecnica de Catalunya supervised by Maria Luisa Bonet, complemented by dual Italian habilitations as full professor in Mathematical Logic (2012) and Computer Science. These qualifications underpin his rigorous theoretical approach across research domains. Galesi's research program centers on Computational Complexity and Logic in Computer Science , with specialized expertise in Proof Complexity (investigating resolution refinements and algebraic proof systems), SAT-Solving , Optimization , and applied domains like Group Testing and Network Tomography . His seminal work on space complexity in algebraic proof systems (JACM 2015) established foundational frameworks, while recent network tomography research develops mathematical models for node failure identification in communication networks using Boolean algebra and graph connectivity principles. Analysis of his 15 most recent publications (2022-2025) reveals a cohesive research trajectory bridging theoretical proof complexity and practical network analysis. Key trends include depth lower bounds in stabbing planes for combinatorial principles, vertex-connectivity metrics for failure localization, and algebraic investigations of vanishing sums in polynomial calculus. His work consistently applies combinatorial principles to derive tight bounds across graph structures while advancing the theoretical understanding of proof systems through tensor isomorphism and roots of unity analyses. His scientific recognition includes: ACM Computing Review Most Notable paper in Theory of Computing for 2012 Galesi mentors the next generation through PhD supervision of Massimo Lauria (2009), Ilario Bonacina (2015), and Fariba Ranjbar (2021), while hosting postdocs including Alan Skelley, Olaf Beyersdorff, and Massimo Lauria. His research is amplified through prestigious visiting positions at the Simons Institute for Theory of Computing (2015, 2021) and Tokyo Institute for Technology (2015), building on his foundational work at IAS Princeton and Toronto. He actively shapes the theoretical CS landscape as organizer of the Sapienza LOC3 (Logic, Complexity, Combinatorics, Computability) seminar series and founder of the RaTLoCC workshops (Ramsey Theory in Logic, Complexity and Combinatorics). His editorial role for Logical Methods in Computer Science (LMCS) and program committee service for CIAC, IJCAI, and FSTTCS conferences demonstrate sustained community leadership beyond his core research and teaching responsibilities in Calculus, Mathematical Logic, and Computational Complexity.
T M Indra Mahlia , a Distinguished Professor at the School of Civil and Environmental Engineering , University of Technology Sydney (UTS), leads cutting-edge research in sustainable energy systems and environmental engineering. As a core member of the Centre for Technology in Water and Wastewater and the Centre for Advanced Modelling and Geospatial Information Systems , he bridges engineering innovation with practical climate solutions. PhD from University of Malaya (Kuala Lumpur, Malaysia) Fluency in English, Indonesian, Malay, and Achinese for peer review His research spans Techno-Economic Analysis , Circular Economy , and Water-Energy Nexus challenges, supported by over $5 million in grants. His work focuses on: Hydrogen energy systems optimization Advanced materials for energy storage Low-cost water purification technologies Sustainable biodiesel production Thermal management innovations As a Highly Cited Researcher (Clarivate Analytics, 2017-2022) and The Australian 's 2019/2025 Sustainable Energy Leader , he mentors future researchers - notably guiding two Highly Cited PhD students ( H.C. Ong and A.S. Silitonga ). His publications across 2024-2026 demonstrate technical advancements in: Hydrogen carrier systems Microalgae-derived lubricants High-entropy alloy corrosion resistance Artificial neural network optimization Phase change material thermal sinks Biohydrogen production pathways
Alp Bassa is a Professor in the Department of Mathematics at Boğaziçi University, Faculty of Arts and Sciences. He holds a Ph.D. in Mathematics from Universität Duisburg-Essen, Germany (2007), and dual Bachelor of Science degrees in Computer Engineering and Mathematics from Middle East Technical University, Ankara (2004). His academic work is centered on pure and applied number theory with connections to algebraic geometry. His educational background includes: Ph.D. in Mathematics, Universität Duisburg-Essen, Germany, 2007 B.S. in Computer Engineering, Middle East Technical University, Ankara, 2004 B.S. in Mathematics, Middle East Technical University, Ankara, 2004 Alp Bassa's research lies primarily in Number Theory and Arithmetic Geometry , with a focus on curves defined over finite fields , irreducible polynomials , and their applications to Jacobian and abelian varieties . His work has strong implications in theoretical mathematics and cryptography. He has led research projects funded by TÜBİTAK and Boğaziçi University's BAP program, indicating sustained research activity and institutional support. Although no publications are listed in the provided text, his project titles and research areas suggest a thematic focus on algebraic curves, zeta functions, and function field arithmetic, likely contributing to the broader fields of algebraic geometry and computational number theory. There are no scientific awards explicitly mentioned in the provided information. Alp Bassa has been actively involved in academic advising and teaching at both undergraduate and graduate levels, offering courses such as Math 101, Math 102, Math 344, Math 345, Math 483, Math 525, and Math 48A. While specific student names are not listed, his role as a professor and project leader implies mentorship of graduate students. He has secured competitive research funding, including: TÜBİTAK 2509 - France PIA Bosphorus: Curves Defined on Finite Fields, Jacobian Varieties and Abelian Varieties (2018–2020) BAP-10540: Curves over Finite Fields and Irreducible Polynomials (2015–2017) These grants reflect his leadership in specialized areas of mathematical research. There is no explicit mention of a research lab or formal team in the provided text. However, his funded projects suggest collaboration with researchers in Turkey and France, particularly under the TÜBİTAK-France PIA Bosphorus program, indicating international research engagement.
Yulia Alexandr is a Hedrick Assistant Adjunct Professor (Adjunct Assistant Professor) in the Department of Mathematics at the University of California, Los Angeles (UCLA) and a Postdoctoral Fellow in Applied Mathematics at Harvard University. Her research centers on algebraic statistics, applied algebraic geometry, and mathematical machine learning, with current focus on geometric structures in statistical models and neural networks. She is actively on the academic job market for the 2025-26 cycle. Education: Ph.D. in Mathematics, University of California, Berkeley (2023). Advisors: Bernd Sturmfels and Serkan Hoşten. Thesis: From Voronoi Cells to Algebraic Statistics . B.A. in Mathematics (high honors), Wesleyan University (2019). Advisor: Karen Collins. Thesis: Combinatorial Nullstellensatz: Various Proofs, Extensions and Applications . Dr. Alexandr's research develops algebraic and geometric frameworks for statistical modeling and machine learning. She pioneers methods for analyzing logarithmic Voronoi cells in Gaussian and discrete models, investigates structural properties of graphical models and mixture distributions, and establishes algebraic constraints in neural network architectures. Her work bridges abstract algebra with practical machine learning applications, particularly in understanding geometric constraints of ReLU networks and information divergence in statistical models. Analysis of her 15 most recent publications (2018-2025) reveals three dominant research thrusts: (1) geometric foundations of statistical models through Voronoi structures and moment varieties, (2) algebraic analysis of graphical models including decomposable and context-specific variants, and (3) mathematical theory of neural networks with emphasis on ReLU constraints. Her publications demonstrate consistent progression from combinatorial foundations to advanced applications in machine learning, with increasing focus on computational implementations using tools like HomotopyContinuation.jl. Scientific Awards: No scientific awards were documented in the provided materials. Dr. Alexandr has mentored undergraduate researchers through Berkeley's Directed Reading Program (Spring 2020), focusing on algebraic combinatorics and graph theory. Her teaching portfolio includes instructing programming courses (PIC 10A/B, PIC 16A) at UCLA and serving as Graduate Student Instructor for mathematics courses at UC Berkeley. While no specific grants are listed, her participation in workshops at IMSI, AIM, and MPI MIS indicates collaborative research funding support. She co-organizes the Berkeley Nonlinear Algebra Seminar and maintains active research collaborations with Guido Montúfar (UCLA), Anna Seigal (Harvard), and her doctoral advisors. Her work is regularly presented at premier venues including SIAM AG, ISSAC, and JMM. Additionally, Dr. Alexandr is a published Russian-language poet with a 2017 collection Лирическое Наступление and contributions to The Birch journal, reflecting her interdisciplinary engagement beyond mathematics.
Dr. Marcel Celaya serves as a Lecturer in Operational Research at Cardiff University's School of Mathematics. His academic position places him within one of the UK's leading mathematics departments, contributing to both teaching and research in theoretical optimization. Dr. Celaya's research program centers on the theoretical foundations of integer programming and combinatorial optimization: Proximity and sparsity properties in integer optimization Structural analysis of mathematical programming problems Connections between optimization and algebraic structures Computational geometry aspects of discrete optimization Matroid theory applications in optimization His publication record reveals a strong focus on theoretical aspects of integer programming, with particular attention to proximity bounds and sparsity properties. The research often involves international collaborations with optimization experts across European institutions, as evidenced by co-authorships with researchers from various universities. Dr. Celaya regularly contributes to the International Conference on Integer Programming and Combinatorial Optimization (IPCO), a premier venue in the field. While specific teaching responsibilities aren't detailed in the available information, his position as Lecturer suggests active involvement in undergraduate and potentially graduate instruction within the mathematics curriculum at Cardiff University. His specialization in Operational Research indicates contributions to programs requiring advanced optimization methods and mathematical modeling.
Eva Rotenberg is an Associate Professor in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark (DTU), affiliated with the Algorithms, Logic and Graphs section. Her research is centered on theoretical computer science, particularly algorithms, data structures, and graph theory. Research Interests: Her work focuses on graph algorithms , especially in planar and dynamic graphs, data structures for efficient computation, and combinatorial optimization . Key topics include approximation algorithms , worst-case analysis , edge connectivity , and local density estimation in distributed settings. She investigates algorithmic solutions with strong theoretical guarantees. The recent publications (2024–2025) reveal a consistent focus on graph-theoretic problems in discrete algorithms, with applications in dynamic and distributed systems. Trends include adaptive data structures, sorting via partial orders, and connectivity augmentation in geometric graphs. Scientific Awards: No specific awards listed in the provided text. Advising and Grants: She is the main supervisor for multiple active PhD projects at DTU, including Dynamic Graph Algorithms , Combinatorial Algorithms on Graphs and Geometry , and Hierarchical Compression of Highly-Repetitive Data . These projects indicate successful grant acquisition and leadership of a vibrant research group. Her supervision spans theoretical algorithms and their applications in data compression and network analysis. Labs and Teams: She is a core member of the Algorithms, Logic and Graphs group at DTU, which conducts fundamental research in discrete mathematics and theoretical computer science. This team actively publishes in top venues and collaborates on national and international projects.
James R. Lee is a Professor in the Department of Computer Science at the University of Washington, with a focus on algorithms, complexity, and the theory of computation. He is affiliated with the UW Theory Group and currently on leave at Microsoft Research, which may delay responses to UW emails. Research Interests: Algorithms, complexity, geometry/discrete-continuous interfaces, probability, stochastic processes, metric embeddings, spectral graph theory, convex optimization. Recent Work Trends: Sparsification of generalized linear models and norms, spectral hypergraph methods, entropic regularization for metrical task systems, and analysis of scaling exponents in random graphs. His papers address sparsifier existence, lower bounds for SDP/LP relaxations, and geometric random walk properties. Scientific Awards: Best Paper Award at STOC 2015. Students: Farzam Ebrahimnejad, Ewin Tang, Yichuan Deng (co-advised with Shayan Oveis-Gharan, Shirshendu Ganguly, and others). Email: jrl@cs.washington.edu
