ד"ר נילי בק

Dr. Nili Beck

מוסד עיקרי

המכללה האקדמית ת"א יפו

The Academic College of Tel Aviv Yaffo

דוא״ל

becknili at mta.ac.il

דיסציפלינות ראשיותMain Disciplines

Computer Sciences

תחומי מחקר / מילות מפתחKeywords

Combinatorial Optimization

פרסומים ויצירות עיקריים / עדכנייםMain / Recent Publications

Nili Guttmann-Beck, Refael Hassin, Michal Stern, On partitioning minimum spanning trees, Discrete Applied Mathematics, Volume 359, 2024, Pages 45-54
Nili Guttmann-Beck, Michal Stern, Decomposing the feasibility of Clustered Spanning Tree by Paths, Discrete Applied Mathematics, Volume 354, 2024, Pages 160-180
S. Levy, Y. Stukalin, and N. Guttmann-Beck, Using practical programming tasks to enhance combinatorial understanding, Teach. Stat. 46 (2024), 113–120
N. Guttmann-Beck, H. Meshita-Sayag, M. Stern, Achieving feasibility for clustered traveling salesman problems using PQ-trees, Networks. (2023), 82 (2023), 153–166.
Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern, Two dimensional maximum weight matching using Manhattan topology, Operations Research Letters, Volume 50, Issue 3, 2022, Pages 281-286
Levy, Sigal, Guttmann-Beck, Nili, and Shweiki, Dorit. ‘Clustering Alzheimer’s Disease Gene Expression Dataset Reveals Underlying Sexually Dimorphic and Disease Status Profiles’. 1 Jan. 2021 : 541 – 547.
Nili Guttmann-Beck, Roni Rozen, Michal Stern, Vertices removal for feasibility of clustered spanning trees, Discrete Applied Mathematics, Volume 296, 2021, Pages 68-84
Amir Beck and Nili Guttmann-Beck. FOM—a MATLAB toolbox of first-order methods for solving convex optimization problems, Optim. Methods Softw., volume 34, number 1, pages 172–193, 2019.
Nili Guttmann-Beck, Zeev Sorek and Michal Stern. Clustered spanning tree—conditions for feasibility, Discrete Math. Theor. Comput. Sci., volume 21, number 1, pages Paper No. 15, 15, 2019.
Nili Guttmann-Beck, Eyal Knaan and Michal Stern. Approximation algorithms for not necessarily disjoint clustered TSP, J. Graph Algorithms Appl., volume 22, number 4, pages 555–575, 2018.