Nili Guttmann-Beck

According to our database, Nili Guttmann-Beck authored at least 22 papers between 1997 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Insertion and removal lists gaining clustered subtrees.

Nili Guttmann-Beck

Theor. Comput. Sci., 2026

2024

Decomposing the feasibility of Clustered Spanning Tree by Paths.

Nili Guttmann-Beck, Michal Stern

Discret. Appl. Math., 2024

On partitioning minimum spanning trees.

Nili Guttmann-Beck, Refael Hassin, Michal Stern

Discret. Appl. Math., 2024

2023

Achieving feasibility for clustered traveling salesman problems using PQ-trees.

Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern

Networks, September, 2023

2022

Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286].

Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern

Oper. Res. Lett., 2022

Two dimensional maximum weight matching using Manhattan topology.

Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern

Oper. Res. Lett., 2022

2021

Vertices removal for feasibility of clustered spanning trees.

Nili Guttmann-Beck, Roni Rozen, Michal Stern

Discret. Appl. Math., 2021

2019

FOM - a MATLAB toolbox of first-order methods for solving convex optimization problems.

Amir Beck, Nili Guttmann-Beck

Optim. Methods Softw., 2019

Clustered Spanning Tree - Conditions for Feasibility.

Nili Guttmann-Beck, Zeev Sorek, Michal Stern

Discret. Math. Theor. Comput. Sci., 2019

2018

Approximation Algorithms for Not Necessarily Disjoint Clustered TSP.

Nili Guttmann-Beck, Eyal Knaan, Michal Stern

J. Graph Algorithms Appl., 2018

2012

Series-parallel orientations preserving the cycle-radius.

Nili Guttmann-Beck, Refael Hassin

Inf. Process. Lett., 2012

The (K, k)-capacitated spanning tree problem.

Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

Discret. Optim., 2012

2011

On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.

Nili Guttmann-Beck, Refael Hassin

Discret. Optim., 2011

Minimum diameter and cycle-diameter orientations on planar graphs

Nili Guttmann-Beck, Refael Hassin

CoRR, 2011

2010

The CoMirror algorithm for solving nonsmooth constrained convex problems.

Amir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili

Oper. Res. Lett., 2010

On two restricted ancestors tree problems.

Nili Guttmann-Beck, Refael Hassin

Inf. Process. Lett., 2010

The (<i>K</i>, <i>k</i>)-Capacitated Spanning Tree Problem.

Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2000

Approximation Algorithms for Minimum <i>K</i>-Cut.

Nili Guttmann-Beck, Refael Hassin

Algorithmica, 2000

1998

Approximation Algorithms for Min-sum p-clustering.

Nili Guttmann-Beck, Refael Hassin

Discret. Appl. Math., 1998

Approximation Algorithms for Minimum Tree Partition.

Nili Guttmann-Beck, Refael Hassin

Discret. Appl. Math., 1998

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.

Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Approximation Algorithms for Min-Max Tree Partition.

Nili Guttmann-Beck, Refael Hassin

J. Algorithms, 1997