◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Shabtay

21 papers hereh-index 302.9k citations121 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3
  • last author18

Across the 21 of 21 papers where every author was matched, so the position is known.

fields
  • cs.DS18
  • cs.DM2
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedMinimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard

2 citations · 5 across the 18 of their papers we have counts for

collaborators
Showing 2020Show all

3 papers · 1 filter

cs.DM2020

Equitable Scheduling on a Single Machine

Klaus Heeger, Danny Hermelin, George B. Mertzios +3

We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalizati…

cs.DS2020

Scheduling Lower Bounds via AND Subset Sum

Amir Abboud, Karl Bringmann, Danny Hermelin +1

Given N instances (X1​,t1​),…,(XN​,tN​) of Subset Sum, the AND Subset Sum problem asks to determine whether all of these instances are yes-instances; that is, whether each…

cs.DS2020

Faster Minimization of Tardy Processing Time on a Single Machine

Karl Bringmann, Nick Fischer, Danny Hermelin +2

This paper is concerned with the 1∣∣∑pj​Uj​ problem, the problem of minimizing the total processing time of tardy jobs on a single machine. This is not only a fundamental sch…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.