activity
20112026
most citedMany, many more intrinsically knotted graphs

24 citations · 24 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DS2026

Robust Permutation Flowshops Under Budgeted Uncertainty

Noam Goldberg, Danny Hermelin, Dvir Shabtay

We consider the robust permutation flowshop problem under the budgeted uncertainty model, where at most a given number of job processing times may deviate on each machine. We show…

cs.DM2026

A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty

Noam Goldberg, Dvir Shabtay

In this study, we investigate a robust single-machine scheduling problem under processing time uncertainty. The uncertainty is modeled using the budgeted approach, where each job h…

cs.DM2025

Robust Extensible Bin Packing and Revisiting a Convex Knapsack Problem

Noam Goldberg, Michael Poss, Yariv Marmor

We study a robust extensible bin packing problem, under a budget uncertainty model where item sizes lie in the intersection of a box with a one-norm ball. We design an algorithm ba…

math.OC2025

Smooth Uncertainty Sets: Dependence of Uncertain Parameters via a Simple Polyhedral Set

Noam Goldberg, Michael Poss, Shimrit Shtern

We propose a novel polyhedral uncertainty set for robust optimization, termed the smooth uncertainty set, which captures dependencies of uncertain parameters by constraining their…

math.OC2024

Robust Radiotherapy Planning with Spatially Based Uncertainty Sets

Noam Goldberg, Mark P. Langer, Shimrit Shtern

Radiotherapy treatment planning is a challenging large-scale optimization problem plagued by uncertainty. Following the robust optimization methodology, we propose a novel, spatial…

math.OC2023

Projecting onto a Capped Rotated Second-Order Cone

Noam Goldberg, Ishy Zagdoun

We derive a closed-form expression for the projection onto a capped rotated second-order cone, a convex set that arises in perspective relaxations of nonlinear programs with binary…

cs.CC2017

On the Complexity and Approximation of the Maximum Expected Value All-or-Nothing Subset

Noam Goldberg, Gabor Rudolf

An unconstrained nonlinear binary optimization problem of selecting a maximum expected value subset of items is considered. Each item is associated with a profit and probability. E…

math.GT2011★ 24 cited

Many, many more intrinsically knotted graphs

Noam Goldberg, Thomas W. Mattman, Ramin Naimi

We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.