Dvir Shabtay

Ben-Gurion University of the Negev
Country flagIsrael

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Articles (19)

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

In this paper we consider the fundamental scheduling problem of minimizing the weighted number of tardy jobs on a single machine. We present a simple pseudo polynomial-time algorithm for this problem that improves upon the classical Lawler and Moore algorithm from the late 60’s under certain scenarios and parameter settings. Our algorithm uses (max,+)-convolutions as its main tool, exploiting recent improved algorithms for computing such convolutions, and obtains several different running times depending on the specific improvement used. We also provide a related lower bound for the problem under a variant of the well-known Strong Exponential Time Hypothesis (SETH). History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms – Discrete. Funding: This work was supported by the Israel Science Foundation [Grant 1070/20].

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Collaborators (4)

Baruch Mor

Ariel University

ISRAEL
View details

Jean-Charles Billaut

Université de Tours

FRANCE
View details

Alessandro Agnetis

Professor

University of Siena

ITALY
View details

Gur Mosheiov

Hebrew University of Jerusalem

ISRAEL
View details