default search action
Nili Guttmann-Beck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Nili Guttmann-Beck, Michal Stern
:
Decomposing the feasibility of Clustered Spanning Tree by Paths. Discret. Appl. Math. 354: 160-180 (2024) - [j18]Nili Guttmann-Beck, Refael Hassin, Michal Stern:
On partitioning minimum spanning trees. Discret. Appl. Math. 359: 45-54 (2024) - 2023
- [j17]Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern:
Achieving feasibility for clustered traveling salesman problems using PQ-trees. Networks 82(2): 153-166 (2023) - 2022
- [j16]Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern:
Two dimensional maximum weight matching using Manhattan topology. Oper. Res. Lett. 50(3): 281-286 (2022) - [j15]Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern:
Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286]. Oper. Res. Lett. 50(5): 475 (2022) - 2021
- [j14]Nili Guttmann-Beck, Roni Rozen, Michal Stern:
Vertices removal for feasibility of clustered spanning trees. Discret. Appl. Math. 296: 68-84 (2021)
2010 – 2019
- 2019
- [j13]Nili Guttmann-Beck, Zeev Sorek, Michal Stern:
Clustered Spanning Tree - Conditions for Feasibility. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j12]Amir Beck, Nili Guttmann-Beck:
FOM - a MATLAB toolbox of first-order methods for solving convex optimization problems. Optim. Methods Softw. 34(1): 172-193 (2019) - 2018
- [j11]Nili Guttmann-Beck, Eyal Knaan, Michal Stern:
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP. J. Graph Algorithms Appl. 22(4): 555-575 (2018) - 2012
- [j10]Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-capacitated spanning tree problem. Discret. Optim. 9(4): 258-266 (2012) - [j9]Nili Guttmann-Beck, Refael Hassin:
Series-parallel orientations preserving the cycle-radius. Inf. Process. Lett. 112(4): 153-160 (2012) - 2011
- [j8]Nili Guttmann-Beck, Refael Hassin:
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph. Discret. Optim. 8(2): 302-314 (2011) - [i1]Nili Guttmann-Beck, Refael Hassin:
Minimum diameter and cycle-diameter orientations on planar graphs. CoRR abs/1105.4770 (2011) - 2010
- [j7]Nili Guttmann-Beck, Refael Hassin:
On two restricted ancestors tree problems. Inf. Process. Lett. 110(14-15): 570-575 (2010) - [j6]Amir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili:
The CoMirror algorithm for solving nonsmooth constrained convex problems. Oper. Res. Lett. 38(6): 493-498 (2010) - [c2]Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
The (K, k)-Capacitated Spanning Tree Problem. AAIM 2010: 25-34
2000 – 2009
- 2000
- [j5]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Minimum K-Cut. Algorithmica 27(2): 198-207 (2000) - [j4]Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica 28(4): 422-437 (2000)
1990 – 1999
- 1998
- [j3]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Minimum Tree Partition. Discret. Appl. Math. 87(1-3): 117-137 (1998) - [j2]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Min-sum p-clustering. Discret. Appl. Math. 89(1-3): 125-142 (1998) - [c1]Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. FSTTCS 1998: 6-17 - 1997
- [j1]Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Min-Max Tree Partition. J. Algorithms 24(2): 266-286 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: