ד"ר שקד ממנה
Dr. Shaked is a faculty member in the Department of Computer Science at Sami Shamoon College of Engineering. He holds a B.Sc., M.Sc., and Ph.D. in Mathematics from Ben-Gurion University. His research focuses on probabilistic methods for solving combinatorial optimization problems. During his doctoral studies, he specialized in graph optimization problems, particularly the Minimum Vertex Cover Problem, Black-and-White Coloring Problem, and Optimal Linear Arrangement Problem
קורות חיים
השכלה
2019-2024 Ph.D. in mathematics at Ben-Gurion University of the Negev, Israel. Thesis topic: On Some Optimization Problems on Graphs Supervisor: Professor Daniel Berend.
2015-2018 M.Sc. in mathematics at Ben-Gurion University of the Negev, Israel. Dissertation title: On Random Permutations of Finite Groups. Supervisor: Professor Daniel Berend.
2010-2014 B.Sc. in mathematics at Ben-Gurion University of the Negev, Israel.
תחומי מחקר
Applied Probability
Combinatorial Optimization
קורסים
Linear Algebra 1
Linear Algebra 2
Calculus 1
Calculus 2
Logic and group theory
Discrete mathematics
Differential Equations
פרסומים
D. Berend and S. Mamana. On Random Permutations of Finite Groups. Journal of Algebraic Combinatorics, 54, 515-528, 2021.
D. Berend and S. Mamana. A probabilistic algorithm for vertex cover. Theoretical Computer Science, 983, 114306, 2024
D. Berend and S. Mamana. A greedy probabilistic heuristic for Graph black-and-white anticoloring. J. Graph Algorithms and Applications, 28(1), 365-383, 2024.
D. Berend and S. Mamana. A probabilistic algorithm for optimal linear arrangements. Computational Optimization and Applications, submitted.
