Nili Guttmann-Beck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nili Guttmann-Beck has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Michal Stern
Acad Coll Tel Aviv Yaffo, Yaffo, Israel
2 shared publications- Refael Hassin
Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel
2 shared publications - Aharon Ben-Tal
Faculty of Industrial Engineering and Management Technion Technion city 32000 Haifa Israel
1 shared publication - Amir Beck
Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel
1 shared publication Eitan Shvartz
Academic College of Tel-Aviv Yaffo, Yaffo, Israel
1 shared publicationHadas Meshita‐Sayag
School of Computer Science Academic College of Tel‐Aviv Yaffo Tel Aviv‐Yaffo Israel
1 shared publication
Latest Publications
- 14 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Insertion and removal lists gaining clustered subtrees
- 14 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Insertion and removal lists gaining clustered subtrees
- 9 August 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 45-54
On partitioning minimum spanning trees
- 9 August 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 45-54
On partitioning minimum spanning trees
- 12 April 2024
- Published by Wiley in Teaching Statistics
- Vol. 46 (2) , 113-120
Using practical programming tasks to enhance combinatorial understanding
Probability theory has extensive applications across various domains, such as statistics, computer science, and finance. In probability education, students are introduced to fundamental principles which may include mathematical topics such as combinatorics and symmetric sample spaces. Students pursuing degrees in computer science possess a robust foundation in programming, software engineering, and algorithmic thinking. Despite entering probability courses with a unique perspective and learning potential, these students encounter challenges in grasping combinatorial concepts. In this experiment, we challenged first‐year postsecondary computer science students to program a simulation of a practical combinatorics problem. Students commented on whether and how this task helped them internalize the basic concepts of combinatorics. We aim to show how utilizing programming tasks may empower students with a deeper grasp of combinatorics.
- 12 April 2024
- Published by Wiley in Teaching Statistics
- Vol. 46 (2) , 113-120
Using practical programming tasks to enhance combinatorial understanding
Probability theory has extensive applications across various domains, such as statistics, computer science, and finance. In probability education, students are introduced to fundamental principles which may include mathematical topics such as combinatorics and symmetric sample spaces. Students pursuing degrees in computer science possess a robust foundation in programming, software engineering, and algorithmic thinking. Despite entering probability courses with a unique perspective and learning potential, these students encounter challenges in grasping combinatorial concepts. In this experiment, we challenged first‐year postsecondary computer science students to program a simulation of a practical combinatorics problem. Students commented on whether and how this task helped them internalize the basic concepts of combinatorics. We aim to show how utilizing programming tasks may empower students with a deeper grasp of combinatorics.
- 3 March 2022
- Published by Elsevier in Operations Research Letters
- Vol. 50 (3) , 281-286
Two dimensional maximum weight matching using Manhattan topology
- 3 March 2022
- Published by Elsevier in Operations Research Letters
- Vol. 50 (3) , 281-286
Two dimensional maximum weight matching using Manhattan topology
- Open Access
Minimum diameter and cycle-diameter orientations on planar graphs
Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle diameter of H is similarly defined except for that cycles are replaced by directed closed walks. Is there always an orientation H of G whose cycle diameter is bounded by a constant times the cycle diameter of G? We prove this property for planar graphs. These results have implications on the problem of approximating an orientation with minimum diameter
Open AccessMinimum diameter and cycle-diameter orientations on planar graphs
Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle diameter of H is similarly defined except for that cycles are replaced by directed closed walks. Is there always an orientation H of G whose cycle diameter is bounded by a constant times the cycle diameter of G? We prove this property for planar graphs. These results have implications on the problem of approximating an orientation with minimum diameter
- 1 May 2011
- Published by Elsevier in Discrete Optimization
- Vol. 8 (2) , 302-314
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- 1 May 2011
- Published by Elsevier in Discrete Optimization
- Vol. 8 (2) , 302-314
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- 30 November 2010
- Published by Elsevier in Operations Research Letters
- Vol. 38 (6) , 493-498
The CoMirror algorithm for solving nonsmooth constrained convex problems
- 30 November 2010
- Published by Elsevier in Operations Research Letters
- Vol. 38 (6) , 493-498
The CoMirror algorithm for solving nonsmooth constrained convex problems
- 7 May 2010
- Published by Elsevier in Information Processing Letters
- Vol. 110 (14-15) , 570-575
On two restricted ancestors tree problems
- 7 May 2010
- Published by Elsevier in Information Processing Letters
- Vol. 110 (14-15) , 570-575
On two restricted ancestors tree problems