Nili Guttmann-Beck

23 papers C 1Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Insertion and removal lists gaining clustered subtrees.
Theor. Comput. Sci.
Nili Guttmann-Beck
2024 J jnl
Decomposing the feasibility of Clustered Spanning Tree by Paths.
Discret. Appl. Math.
Nili Guttmann-Beck, Michal Stern
2024 J jnl
On partitioning minimum spanning trees.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin, Michal Stern
2023 J jnl
Achieving feasibility for clustered traveling salesman problems using PQ-trees.
Networks
Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern
2022 J jnl
Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286].
Oper. Res. Lett.
Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern
2022 J jnl
Two dimensional maximum weight matching using Manhattan topology.
Oper. Res. Lett.
Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern
2021 J jnl
Vertices removal for feasibility of clustered spanning trees.
Discret. Appl. Math.
Nili Guttmann-Beck, Roni Rozen, Michal Stern
2019 J jnl
Clustered Spanning Tree - Conditions for Feasibility.
Discret. Math. Theor. Comput. Sci.
Nili Guttmann-Beck, Zeev Sorek, Michal Stern
2019 J jnl
FOM - a MATLAB toolbox of first-order methods for solving convex optimization problems.
Optim. Methods Softw.
Amir Beck, Nili Guttmann-Beck
2018 J jnl
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP.
J. Graph Algorithms Appl.
Nili Guttmann-Beck, Eyal Knaan, Michal Stern
2012 J jnl
Series-parallel orientations preserving the cycle-radius.
Inf. Process. Lett.
Nili Guttmann-Beck, Refael Hassin
2012 J jnl
The (K, k)-capacitated spanning tree problem.
Discret. Optim.
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
2011 J jnl
Minimum diameter and cycle-diameter orientations on planar graphs
CoRR
Nili Guttmann-Beck, Refael Hassin
2011 J jnl
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph.
Discret. Optim.
Nili Guttmann-Beck, Refael Hassin
2010 J jnl
On two restricted ancestors tree problems.
Inf. Process. Lett.
Nili Guttmann-Beck, Refael Hassin
2010 C conf
The (
AAIM
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
2010 J jnl
The CoMirror algorithm for solving nonsmooth constrained convex problems.
Oper. Res. Lett.
Amir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili
2000 J jnl
Approximation Algorithms for Minimum
Algorithmica
Nili Guttmann-Beck, Refael Hassin
2000 J jnl
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Algorithmica
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
1998 J jnl
Approximation Algorithms for Min-sum p-clustering.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin
1998 J jnl
Approximation Algorithms for Minimum Tree Partition.
Discret. Appl. Math.
Nili Guttmann-Beck, Refael Hassin
1998 — conf
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
FSTTCS
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
1997 J jnl
Approximation Algorithms for Min-Max Tree Partition.
J. Algorithms
Nili Guttmann-Beck, Refael Hassin