Hadas Shachnai

Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv, 1998, Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247).

Scheduling memory accesses through a shared bus

Hadas Shachnai, Eli Almog, 2001, Perform. Evaluation.

Multi-coloring Trees

Guy Kortsarz, Hadas Shachnai, Jan Arne Telle, 1999, COCOON.

On the Optimality of the Counter Scheme for Dynamic Linear Lists

Micha Hofri, Hadas Shachnai, 1991, Inf. Process. Lett..

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Leah Epstein, Hadas Shachnai, Asaf Levin, 2006, Algorithmica.

Partial information spreading with application to distributed maximum coverage

Hadas Shachnai, Keren Censor-Hillel, K. Censor-Hillel, 2010, PODC.

Finding Large Independent Sets in Graphs and Hypergraphs

Aravind Srinivasan, Hadas Shachnai, A. Srinivasan, 2005, SIAM J. Discret. Math..

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

Roy Schwartz, Baruch Schieber, Hadas Shachnai, 2013, IPCO.

Approximation Schemes for Packing with Item Fragmentation

Hadas Shachnai, Tami Tamir, Omer Yehezkely, 2007, Theory of Computing Systems.

Adaptive source routing in high-speed networks

Alon Itai, Hadas Shachnai, A. Itai, 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Hadas Shachnai, Tami Tamir, Gal Tamir, 2009, WAOA.

IDABased Protocols for Reliable Multicast

Hagit Attiya, Hadas Shachnai, 1997, OPODIS.

Scheduling jobs with dwindling resource requirements in clouds

Hadas Shachnai, Tami Tamir, Sivan Albagli-Kim, 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

Parameterized Algorithms for Graph Partitioning Problems

Hadas Shachnai, Meirav Zehavi, 2016, Theory of Computing Systems.

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Gerhard J. Woeginger, Hadas Shachnai, Tami Tamir, 2002, ESA.

Real-time scheduling to minimize machine busy times

Baruch Schieber, Hadas Shachnai, Tami Tamir, 2015, J. Sched..

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)

Klaus Jansen, Claire Mathieu, Hadas Shachnai, 2011, Dagstuhl Reports.

Representative Families: A Unified Tradeoff-Based Approach

Hadas Shachnai, Meirav Zehavi, 2014, ESA.

Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling

Shmuel Zaks, Hadas Shachnai, Ariella Voloshin, 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

Fairness-Free Periodic Scheduling with Vacations

Jirí Sgall, Hadas Shachnai, Tami Tamir, 2005, ESA.

Corrigendum: Improved results for data migration and open shop scheduling

Rajiv Gandhi, Guy Kortsarz, Hadas Shachnai, 2013, TALG.

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem

Hagit Attiya, Leah Epstein, Hadas Shachnai, 2010, Algorithmica.

Scheduling Issues in Video-on-Demand Systems

Philip S. Yu, Hadas Shachnai, Joel L. Wolf, 1996 .

A Theory and Algorithms for Combinatorial Reoptimization

Baruch Schieber, Hadas Shachnai, Tami Tamir, 2012, Algorithmica.

Constrained Submodular Maximization via Greedy Local Search

Baruch Schieber, Hadas Shachnai, Kanthi K. Sarpatwar, 2017, Oper. Res. Lett..

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Leah Epstein, Hadas Shachnai, Asaf Levin, 2006, APPROX-RANDOM.

Improved Parameterized Algorithms for Network Query Problems

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi, 2018, Algorithmica.

On Chromatic Sums and Distributed Resource Allocation

Mihir Bellare, Amotz Bar-Noy, Hadas Shachnai, 1998, Inf. Comput..

On Two Class-Constrained Versions of the Multiple Knapsack Problem

Hadas Shachnai, Tami Tamir, Tami Tamir, 2001, Algorithmica.

Tight Bounds for Online Class-Constrained Packing

Hadas Shachnai, Tami Tamir, 2002, LATIN.

Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints

Hadas Shachnai, Tami Tamir, Tami Tamir, 2002, Algorithmica.

Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs

Guy Kortsarz, Hadas Shachnai, Magnús M. Halldórsson, 2003, Algorithmica.

Tractable Parameterizations for the Minimum Linear Arrangement Problem

Michael R. Fellows, Hadas Shachnai, Frances A. Rosamond, 2016, TOCT.

Minimizing total busy time in parallel scheduling with application to optical networks

Gianpiero Monaco, Shmuel Zaks, Michele Flammini, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

On Lagrangian Relaxation and Subset Selection Problems

Hadas Shachnai, Ariel Kulik, 2008, WAOA.

Minimizing Busy Time in Multiple Machine Real-time Scheduling

Baruch Schieber, Hadas Shachnai, Tami Tamir, 2010, FSTTCS.

The Application of Restricted Counter Schemes to Three Models of Linear Search

Micha Hofri, Hadas Shachnai, 1992 .

Parameterized Approximation via Fidelity Preserving Transformations

Michael R. Fellows, Hadas Shachnai, Frances A. Rosamond, 2012, ICALP.

Tight bounds for online class-constrained packing

Hadas Shachnai, Tami Tamir, Tami Tamir, 2002, Theor. Comput. Sci..

Local Labeling and Resource Allocation Using Preprocessing

Hagit Attiya, Hadas Shachnai, Tami Tamir, 1999, SIAM J. Comput..

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations

Hadas Shachnai, Ariel Kulik, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

Roy Schwartz, Baruch Schieber, Hadas Shachnai, 2013, IPCO.

Improved bounds for scheduling conflicting jobs with minsum criteria

Rajiv Gandhi, Guy Kortsarz, Hadas Shachnai, 2008, TALG.

Exact algorithms for the master ring problem

Lisa Zhang, Tomomi Matsui, Hadas Shachnai, 2008, Networks.

Multiresource Malleable Task Scheduling to Minimize Response Time

Hadas Shachnai, John Turek, John Turek, 1999, Inf. Process. Lett..

Local Labeling and Resource Allocation Using Preprocessing

Hagit Attiya, Hadas Shachnai, Tami Tamir, 1994, WDAG.

Complexity and inapproximability results for the Power Edge Set problem

Baruch Schieber, Pierre-Louis Poirion, Leo Liberti, 2018, J. Comb. Optim..

Return of the Boss Problem: Competing Online against a Non-adaptive Adversary

Hadas Shachnai, Magnús M. Halldórsson, M. Halldórsson, 2010, FUN.

Design and analysis of a look-ahead scheduling scheme to support pause-resume for video-on-demand applications

Philip S. Yu, Hadas Shachnai, Joel L. Wolf, 2005, Multimedia Systems.

Deterministic Parameterized Algorithms for the Graph Motif Problem

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi, 2014, MFCS.

Disk load balancing for video-on-demand systems

Philip S. Yu, Hadas Shachnai, Joel L. Wolf, 1997, Multimedia Systems.

Approximation Schemes for Packing with Item Fragmentation

Hadas Shachnai, Tami Tamir, Omer Yehezkely, 2005, Theory of Computing Systems.

Maximizing Throughput in Flow Shop Real-Time Scheduling

Baruch Schieber, Hadas Shachnai, Kanthi K. Sarpatwar, 2020, APPROX/RANDOM.

Packing Resizable Items with Application to Video Delivery over Wireless Networks

Leah Epstein, Hadas Shachnai, Tami Tamir, 2012, ALGOSENSORS.

Exploring wait tolerance in effective batching for video-on-demand scheduling

Philip S. Yu, Hadas Shachnai, 1998, Multimedia Systems.

Representative families: A unified tradeoff-based approach

Hadas Shachnai, Meirav Zehavi, H. Shachnai, 2014, J. Comput. Syst. Sci..

Packing resizable items with application to video delivery over wireless networks

Leah Epstein, Hadas Shachnai, Tami Tamir, 2014, Theor. Comput. Sci..

Polynomial-Time Approximation Schemes

Hadas Shachnai, Tami Tamir, Tami Tamir, 2007, Handbook of Approximation Algorithms and Metaheuristics.

Real-Time Scheduling with a Budget

Joseph Naor, Hadas Shachnai, Tami Tamir, 2003, ICALP.

The preemptive resource allocation problem

Baruch Schieber, Hadas Shachnai, Kanthi K. Sarpatwar, 2018, FSTTCS.

The Euclidean k-Supplier Problem

Baruch Schieber, Hadas Shachnai, Viswanath Nagarajan, 2013, IPCO.

A Theory and Algorithms for Combinatorial Reoptimization

Hadas Shachnai, Tami Tamir, Gal Tamir, 2012, LATIN.

Real-Time k-bounded Preemptive Scheduling

Baruch Schieber, Hadas Shachnai, Tami Tamir, 2016, ALENEX.

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria

Rajiv Gandhi, Guy Kortsarz, Hadas Shachnai, 2004, WAOA.

The Euclidean k-Supplier Problem

Baruch Schieber, Hadas Shachnai, Viswanath Nagarajan, 2020, Math. Oper. Res..

Methode d'optimisation utilisant le relayage pour equilibrer la charge et planifier la configuration dans un systeme informatique de consultation video

Hadas Shachnai, Joel L. Wolf, Philip S. Yu, 1995 .

Adaptive Source Routing in High-Speed Networks

Alon Itai, Hadas Shachnai, 1996, J. Algorithms.

Polynominal time approximation schemes for class-constrained packing problem

Hadas Shachnai, Tami Tamir, Tami Tamir, 2000, APPROX.

Look-ahead scheduling to support pause-resume for video-on-demand applications

Philip S. Yu, Hadas Shachnai, Joel L. Wolf, 1995, Electronic Imaging.

On Lagrangian Relaxation and Reoptimization Problems pdf

Hadas Shachnai, Ariel Kulik, Gal Tamir, 2015, ArXiv.

A Multivariate Approach for Weighted FPT Algorithms

Hadas Shachnai, Meirav Zehavi, 2015, ESA.

FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted

Hadas Shachnai, Meirav Zehavi, H. Shachnai, 2014, ArXiv.

Polynomial Time Approximation Schemes

Hadas Shachnai, Tami Tamir, Tami Tamir, 2018, Handbook of Approximation Algorithms and Metaheuristics.

Tighter Bounds for Makespan Minimization on Unrelated Machines pdf

Hadas Shachnai, Yael Mordechai, Dor Arad, 2014, ArXiv.

Dynamic schemes for speculative execution of code

Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv, 2003, Perform. Evaluation.

Flexible Resource Allocation for Clouds and All-Optical Networks pdf

Baruch Schieber, Dmitriy Katz, Hadas Shachnai, 2016, ArXiv.

On Analytic Modeling of Multimedia Batching Schemes

Philip S. Yu, Hadas Shachnai, H. Shachnai, 1998, Perform. Evaluation.

Improved results for data migration and open shop scheduling

Rajiv Gandhi, Guy Kortsarz, Hadas Shachnai, 2004, TALG.

Online selection of intervals and t-intervals

Hadas Shachnai, Magnús M. Halldórsson, Unnar Th. Bachmann, 2013, Inf. Comput..

Optimizing bandwidth allocation in elastic optical networks with application to scheduling

Shmuel Zaks, Hadas Shachnai, Ariella Voloshin, 2017, J. Discrete Algorithms.

Improved Results for Data Migration and Open Shop Scheduling

Rajiv Gandhi, Guy Kortsarz, Hadas Shachnai, 2004, ICALP.

Generalized Assignment via Submodular Optimization with Reserved Capacity

Baruch Schieber, Hadas Shachnai, Kanthi Sarpatwar, 2019, ESA.

Sum Multicoloring of Graphs

Guy Kortsarz, Amotz Bar-Noy, Hadas Shachnai, 2000, J. Algorithms.

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Gerhard J. Woeginger, Hadas Shachnai, Tami Tamir, 2005, Algorithmica.

Batch Coloring Flat Graphs and Thin

Hadas Shachnai, Magnús M. Halldórsson, M. Halldórsson, 2008, SWAT.

Tight bounds for FEC-based reliable multicast

Hagit Attiya, Hadas Shachnai, 2004, Inf. Comput..

Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation

Baruch Schieber, Hadas Shachnai, Kanthi K. Sarpatwar, 2018, SPAA.

Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints

Hadas Shachnai, Oded Shmueli, Robert Sayegh, 2004, WAOA.

Parameterized approximation via fidelity preserving transformations

Michael R. Fellows, Hadas Shachnai, Frances A. Rosamond, 2012, J. Comput. Syst. Sci..

Approximation schemes for generalized two-dimensional vector packing with application to data placement

Hadas Shachnai, Tami Tamir, Tami Tamir, 2012, J. Discrete Algorithms.

Throughput maximization of real-time scheduling with batching

Sudipto Guha, Joseph Naor, Baruch Schieber, 2002, SODA '02.

Sum Multi-coloring of Graphs

Guy Kortsarz, Amotz Bar-Noy, Hadas Shachnai, 1999, ESA.

Self-Organizing Lists and Independent References: A Statistical Synergy

Micha Hofri, Hadas Shachnai, M. Hofri, 1991, J. Algorithms.

The List Update Problem: Improved Bounds for the Counter Scheme

Micha Hofri, Hadas Shachnai, M. Hofri, 1998, Algorithmica.

Faster Computation of Representative Families for Uniform Matroids with Applications pdf

Hadas Shachnai, Meirav Zehavi, 2014, ArXiv.

Generalized Assignment of Time-Sensitive Item Groups

Baruch Schieber, Hadas Shachnai, Kanthi K. Sarpatwar, 2018, APPROX-RANDOM.

Partial Information Network Queries

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi, 2015, J. Discrete Algorithms.

Periodic scheduling with obligatory vacations

Jirí Sgall, Hadas Shachnai, Tami Tamir, 2009, Theor. Comput. Sci..

On G-networks and resource allocation in multimedia systems

Erol Gelenbe, Hadas Shachnai, E. Gelenbe, 1998, Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications.

Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract)

Shmuel Zaks, Hadas Shachnai, Ariella Voloshin, 2014, MFCS.

Scheduling split intervals

Reuven Bar-Yehuda, Joseph Naor, Hadas Shachnai, 2002, SODA '02.

An APTAS for Bin Packing with Clique-graph Conflicts pdf

Hadas Shachnai, Ilan Doron Arad, 2020, ArXiv.

Efficient Reorganization of Binary Search Trees

Micha Hofri, Hadas Shachnai, 2001, Algorithmica.

The passport control problem or how to keep a dynamic service system load balanced?

Alon Itai, Michael Rodeh, Hadas Shachnai, 2002, Theor. Comput. Sci..

Flexible bandwidth assignment with application to optical networks

Shmuel Zaks, Hadas Shachnai, Ariella Voloshin, 2018, J. Sched..