Hadas Shachnai | Academic Influence

Hadas Shachnai's AcademicInfluence.com Rankings

Hadas Shachnai

Computer Science

#5143

World Rank

#5434

Historical Rank

Database

#9132

World Rank

#9603

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Hadas Shachnai Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Hadas Shachnai is an Israeli computer scientist specializing in combinatorial optimization, including knapsack problems, interval scheduling, and the optimization of submodular set functions. She is a professor of computer science at the Technion – Israel Institute of Technology, and co-editor-in-chief of Discrete Mathematics & Theoretical Computer Science.

(See a Problem?)

Hadas Shachnai's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Maximizing submodular set functions subject to multiple linear constraints (2009) (184)
Scheduling split intervals (2002) (176)
On Chromatic Sums and Distributed Resource Allocation (1998) (167)
Disk load balancing for video-on-demand systems (1997) (107)
On Two Class-Constrained Versions of the Multiple Knapsack Problem (2001) (93)
Polynomial time approximation schemes for class‐constrained packing problems (2001) (85)
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (2011) (82)
Minimizing total busy time in parallel scheduling with application to optical networks (2009) (69)
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem (2010) (67)
There is no EPTAS for two-dimensional knapsack (2010) (65)
Sum Multicoloring of Graphs (2000) (64)
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs (2003) (58)
Parameterized approximation via fidelity preserving transformations (2012) (57)
Exploring wait tolerance in effective batching for video-on-demand scheduling (1997) (54)
A Theory and Algorithms for Combinatorial Reoptimization (2012) (48)
Fast information spreading in graphs with large weak conductance (2011) (48)
Representative families: A unified tradeoff-based approach (2014) (43)
Tractable Parameterizations for the Minimum Linear Arrangement Problem (2013) (41)
Approximation Schemes for Packing with Item Fragmentation (2005) (40)
Tight bounds for online class-constrained packing (2002) (39)
Throughput maximization of real-time scheduling with batching (2002) (36)
Partial information spreading with application to distributed maximum coverage (2010) (35)
On G-networks and resource allocation in multimedia systems (1998) (35)
Minimizing Makespan and Preemption Costs on a System of Uniform Machines (2005) (35)
Minimizing Busy Time in Multiple Machine Real-time Scheduling (2010) (34)
Multicoloring trees (2003) (31)
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement (2003) (29)
Improved results for data migration and open shop scheduling (2004) (28)
Minimizing Average Completion of Dedicated Tasks and Interval Graphs (2001) (27)
Transactional contention management as a non-clairvoyant scheduling problem (2006) (24)
Improved bounds for scheduling conflicting jobs with minsum criteria (2008) (23)
Polynominal time approximation schemes for class-constrained packing problem (2000) (23)
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints (2002) (22)
Sum Multi-coloring of Graphs (1999) (22)
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria (2004) (21)
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs (2006) (20)
Finding Large Independent Sets in Graphs and Hypergraphs (2005) (20)
Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) (20)
Real-time scheduling to minimize machine busy times (2015) (20)
The Euclidean k-Supplier Problem (2013) (18)
Self-Organizing Lists and Independent References: A Statistical Synergy (1991) (17)
Constrained Submodular Maximization via Greedy Local Search (2017) (17)
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs (2007) (17)
Real-Time Scheduling with a Budget (2003) (16)
Approximation schemes for generalized two-dimensional vector packing with application to data placement (2012) (16)
Scheduling jobs with dwindling resource requirements in clouds (2014) (16)
Minimal Cost Reconfiguration of Data Placement in Storage Area Network (2009) (15)
Batch Coloring Flat Graphs and Thin (2008) (15)
Polynomial-Time Approximation Schemes (2007) (14)
Multi-coloring Trees (1999) (14)
Multiresource Malleable Task Scheduling to Minimize Response Time (1999) (14)
Design and analysis of a look-ahead scheduling scheme to support pause-resume for video-on-demand applications (1995) (14)
Parameterized Algorithms for Graph Partitioning Problems (2014) (14)
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns (2013) (14)
Scheduling Split Intervals Reuven Bar-Yehuda yz Magn us M. Halld orsson x Joseph (Se) Naor y (2005) (13)
Constructing minimum changeover cost arborescenses in bounded treewidth graphs (2016) (12)
On Analytic Modeling of Multimedia Batching Schemes (1998) (12)
Faster Computation of Representative Families for Uniform Matroids with Applications (2014) (12)
Look-ahead scheduling to support pause-resume for video-on-demand applications (1995) (12)
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) (2011) (11)
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling (2014) (11)
On the Optimality of the Counter Scheme for Dynamic Linear Lists (1991) (11)
Optimal Bounds on Tail Probabilities: A Study of an Approach (1999) (10)
Local Labeling and Resource Allocation Using Preprocessing (1994) (10)
Minimal cost reconfiguration of data placement in a storage area network (2012) (10)
On Lagrangian Relaxation and Subset Selection Problems (2009) (9)
Online selection of intervals and t-intervals (2010) (8)
A multivariate framework for weighted FPT algorithms (2014) (8)
Flexible bandwidth assignment with application to optical networks (2018) (8)
Dynamic schemes for speculative execution of code (1998) (8)
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (2004) (8)
Fast Distributed Approximation for Max-Cut (2017) (8)
Strongly competitive algorithms for caching with pipelined prefetching (2001) (8)
Periodic scheduling with obligatory vacations (2009) (8)
Adaptive source routing in high-speed networks (1993) (7)
Scheduling Issues in Video-on-Demand Systems (1996) (6)
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (2020) (6)
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks (2016) (6)
Finding large independent sets of hypergraphs in parallel (2001) (5)
DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer (1995) (5)
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping (2020) (4)
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary (2010) (4)
Minimizing the Flow Time for Parallelizable Task Systems (preliminary Version) (1993) (3)
The passport control problem or how to keep a dynamic service system load balanced? (2002) (3)
Polynomial Time Approximation Schemes (2018) (3)
Minimizing Makespan and Preemption Costs on a System of Uniform Machines (2002) (3)
Online Scheduling Intervals and t-Intervals (2010) (3)
Complexity and inapproximability results for the Power Edge Set problem (2018) (3)
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations (2019) (3)
A Multivariate Approach for Weighted FPT Algorithms (2015) (3)
Corrigendum: Improved results for data migration and open shop scheduling (2004) (3)
Tight Approximations for Modular and Submodular Optimization with D-resource Multiple Knapsack Constraints (2020) (2)
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint (2021) (2)
Minimizing Average Completion of Dedicated Tasks and Partially Ordered Sets (2001) (2)
An EPTAS for Budgeted Matroid Independent Set (2022) (2)
Improved Parameterized Algorithms for Network Query Problems (2014) (2)
Improved Approximations for Non-monotone Submodular Maximization with Knapsack Constraints (2010) (2)
The Master Ring Problem (2005) (2)
Flexible Resource Allocation to Interval Jobs (2019) (2)
The Application of Restricted Counter Schemes to Three Models of Linear Search (1992) (2)
Interleaved Algorithms for Constrained Submodular Function Maximization (2017) (2)
Scheduling memory accesses through a shared bus (2001) (2)
Generalized Assignment of Time-Sensitive Item Groups (2018) (2)
Flexible bandwidth assignment with application to optical networks (2014) (2)
Real-Time k-bounded Preemptive Scheduling (2016) (2)
Efficient Reorganization of Binary Search Trees (1994) (2)
Tight bounds for FEC-based reliable multicast (2004) (2)
Fairness-Free Periodic Scheduling with Vacations (2005) (2)
On Lagrangian Relaxation and Reoptimization Problems (2015) (1)
Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins (2022) (1)
Packing resizable items with application to video delivery over wireless networks (2012) (1)
Generalized Assignment via Submodular Optimization with Reserved Capacity (2019) (1)
A $(1-e^{-1}-\varepsilon)$-Approximation for the Monotone Submodular Multiple Knapsack Problem (2020) (1)
Flexible Resource Allocation for Clouds and All-Optical Networks (2016) (1)
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection (2023) (1)
Batch Coloring Tree-like Graphs (2007) (1)
A Theory and Algorithms for Combinatorial Reoptimization (2017) (1)
Prototype-Based Approximate Nearest Neighbor Search (2007) (1)
Exact algorithms for the master ring problem (2008) (1)
Channel based scheduling of parallelizable tasks (1997) (1)
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation (2018) (1)
Optimal Bounds on Tail Probabilities - A Simplified Approach (1998) (1)
Optimizing bandwidth allocation in elastic optical networks with application to scheduling (2017) (1)
An almost optimal approximation algorithm for monotone submodular multiple knapsack (2021) (1)
On Rank Aggregation of Multiple Orderings in Network Design (1)
Tighter Bounds for Makespan Minimization on Unrelated Machines (2014) (1)
An APTAS for Bin Packing with Clique-graph Conflicts (2020) (1)
A note on generalized rank aggregation (2009) (1)
ON THE LIMITED UTILITY OF AUXILIARY INFORMATION IN THE LISTUPDATE (2013) (0)
The List Update Problem: Improved Bounds for the Counter Scheme (1998) (0)
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem (2022) (0)
Multicoloring trees q Magn us (2003) (0)
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding (2022) (0)
An Asymptotic -Approximation for the 2-Dimensional Vector Bin Packing Problem (2022) (0)
Bell Labs Algorithms Pow Wow (2004) (0)
Theorem 5. (a Stopping Point for the Cs) for a List of N Items with The (0)
An FPTAS for Budgeted Laminar Matroid Independent Set (2023) (0)
Finding Possible and Necessary Winners in Spatial Voting with Partial Information (2023) (0)
Fairness-Free Periodic Scheduling (2005) (0)
XX : 2 Generalized Assignment via Submodular Optimization bins (2019) (0)
Online Class-constrained Packing (2007) (0)
Real-time scheduling to minimize machine busy times (2014) (0)
OPTIMAL STRATEGIES FOR SOURCE (1991) (0)
Maximizing Throughput in Flow Shop Real-Time Scheduling (2020) (0)
The Preemptive Resource Allocation Problem (2018) (0)
A refined analysis of submodular Greedy (2021) (0)
Flexible Resource Allocation for Optical Networks (2014) (0)
Approximating Bin Packing with Conflict Graphs via Maximization Techniques (2023) (0)
Parameterized Algorithms for Graph Partitioning Problems (2016) (0)
Flexible Resource Allocation to Interval Jobs (2019) (0)
The Container Selection Problem (2015) (0)
Complexity and inapproximability results for the Power Edge Set problem (2017) (0)
On Lagrangian relaxation for constrained maximization and reoptimization problems (2020) (0)
Self-tuning synchronization mechanisms in network operating systems (1999) (0)
Resource Allocation in Multimedia Systems (2018) (0)
THREE MODELS OF LINEAR SEARCH (2000) (0)
FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted (2014) (0)
IDABased Protocols for Reliable Multicast (1997) (0)
Design and analysis of a lookahead scheduling pause-resume for video-on-demand applications (0)
Improved Parameterized Algorithms for Network Query Problems (2018) (0)
Theoretical Computer Science (2012) (0)

This paper list is powered by the following services:

Other Resources About Hadas Shachnai

en.wikipedia.org

What Schools Are Affiliated With Hadas Shachnai?

Hadas Shachnai is affiliated with the following schools:

Technion – Israel Institute of Technology

Image Attributions

Image Source for Hadas Shachnai