פרופ' מיכל שטרן

Guttmann-Beck, N., Meshita-Sayag, H., Stern, M., 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

Nili Guttmann-Beck, Roni Rozen, Michal Stern, Vertices removal for feasibility of clustered spanning trees, Discrete Applied Mathematics, Volume 296, 2021, Pages 68-84

Guttmann-Beck, N., Knaan, E., & Stern, M. (2018). Approximation Algorithms for Not Necessarily Disjoint Clustered TSP. J. Graph Algorithms Appl., 22, 555-575.

Nili Guttmann-Beck, Zeev Sorek, Michal Stern. Clustered Spanning Tree - Conditions for Feasibility. Discrete Mathematics and Theoretical Computer Science, DMTCS, In press, vol. 21 no. 1, ICGT 2018.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern, Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2, Discrete Mathematics, Volume 340, Issue 2, 2017