Hadas Shachnai

Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir: All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24

Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai: The Euclidean k-Supplier Problem. IPCO 2013: 290-301

Hadas Shachnai, Tami Tamir: Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms 10: 35-48 (2012)

Keren Censor-Hillel, Hadas Shachnai: Fast Information Spreading in Graphs with Large Weak Conductance. SIAM J. Comput. 41(6): 1451-1465 (2012)

Hadas Shachnai, Gal Tamir, Tami Tamir: Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. 460: 42-53 (2012)

Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir: Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS 2012: 6-17

Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai: Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012: 351-362

Hadas Shachnai, Gal Tamir, Tami Tamir: A Theory and Algorithms for Combinatorial Reoptimization. LATIN 2012: 618-630

Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh: Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. 412(52): 7087-7098 (2011)

Keren Censor-Hillel, Hadas Shachnai: Fast Information Spreading in Graphs with Large Weak Conductance. SODA 2011: 440-448

Ariel Kulik, Hadas Shachnai, Tami Tamir: Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. CoRR abs/1101.2940 (2011)

Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young: Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports 1(2): 67-93 (2011)

Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010)

Ariel Kulik, Hadas Shachnai: There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 110(16): 707-710 (2010)

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010)

Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir: Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180

Magnús M. Halldórsson, Hadas Shachnai: Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN 2010: 237-248

Keren Censor-Hillel, Hadas Shachnai: Partial information spreading with application to distributed maximum coverage. PODC 2010: 161-170

Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai: Online Selection of Intervals and t-Intervals. SWAT 2010: 383-394

Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai: Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica 55(4): 643-665 (2009)

Hadas Shachnai, Lisa Zhang, Tomomi Matsui: A note on generalized rank aggregation. Inf. Process. Lett. 109(13): 647-651 (2009)

Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai: Throughput maximization of real-time scheduling with batching. ACM Transactions on Algorithms 5(2) (2009)

Jiri Sgall, Hadas Shachnai, Tami Tamir: Periodic scheduling with obligatory vacations. Theor. Comput. Sci. 410(47-49): 5112-5121 (2009)

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks: Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12

Ariel Kulik, Hadas Shachnai, Tami Tamir: Maximizing submodular set functions subject to multiple linear constraints. SODA 2009: 545-554

Hadas Shachnai, Gal Tamir, Tami Tamir: Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA 2009: 229-241

Hadas Shachnai, Tami Tamir, Omer Yehezkely: Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. 43(1): 81-98 (2008)

Hadas Shachnai, Lisa Zhang, Tomomi Matsui: Exact algorithms for the master ring problem. Networks 52(2): 98-107 (2008)

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Transactions on Algorithms 4(1) (2008)

Magnús M. Halldórsson, Hadas Shachnai: Batch Coloring Flat Graphs and Thin. SWAT 2008: 198-209

Ariel Kulik, Hadas Shachnai: On Lagrangian Relaxation and Subset Selection Problems. WAOA 2008: 160-173

Joseph Naor, Hadas Shachnai, Tami Tamir: Real-Time Scheduling with a Budget. Algorithmica 47(3): 343-364 (2007)

Hadas Shachnai, Omer Yehezkely: Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. FCT 2007: 482-493

Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira: Scheduling Split Intervals. SIAM J. Comput. 36(1): 1-15 (2006)

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved results for data migration and open shop scheduling. ACM Transactions on Algorithms 2(1): 116-129 (2006)

Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai: Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM 2006: 116-127

Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315

Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42(3-4): 309-334 (2005)

Jiri Sgall, Hadas Shachnai, Tami Tamir: Fairness-Free Periodic Scheduling with Vacations. ESA 2005: 592-603

Hadas Shachnai, Tami Tamir, Omer Yehezkely: Approximation Schemes for Packing with Item Fragmentation. WAOA 2005: 334-347

Hagit Attiya, Hadas Shachnai: Tight bounds for FEC-based reliable multicast. Inf. Comput. 190(2): 117-135 (2004)

Alexander Gaysinsky, Alon Itai, Hadas Shachnai: Strongly competitive algorithms for caching with pipelined prefetching. Inf. Process. Lett. 91(1): 19-27 (2004)

Hadas Shachnai, Aravind Srinivasan: Finding Large Independent Sets in Graphs and Hypergraphs. SIAM J. Discrete Math. 18(3): 488-500 (2004)

Hadas Shachnai, Tami Tamir: Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321(1): 103-123 (2004)

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved Results for Data Migration and Open Shop Scheduling. ICALP 2004: 658-669

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA 2004: 68-82

Hadas Shachnai, Oded Shmueli, Robert Sayegh: Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. WAOA 2004: 111-125

Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Algorithmica 37(3): 187-209 (2003)

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003)

Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv: Dynamic schemes for speculative execution of code. Perform. Eval. 53(2): 125-142 (2003)

Joseph Naor, Hadas Shachnai, Tami Tamir: Real-Time Scheduling with a Budget. ICALP 2003: 1123-1137

Hadas Shachnai, Tami Tamir: Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. RANDOM-APPROX 2003: 165-177

Hadas Shachnai, Tami Tamir: Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica 32(4): 651-678 (2002)

Alon Itai, Michael Rodeh, Hadas Shachnai: The passport control problem or how to keep a dynamic service system load balanced? Theor. Comput. Sci. 282(2): 303-318 (2002)

Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA 2002: 859-871

Hadas Shachnai, Tami Tamir: Tight Bounds for Online Class-Constrained Packing. LATIN 2002: 569-583

Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira: Scheduling split intervals. SODA 2002: 732-741

Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai: Throughput maximization of real-time scheduling with batching. SODA 2002: 742-751

Hadas Shachnai, Tami Tamir: On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica 29(3): 442-467 (2001)

Micha Hofri, Hadas Shachnai: Efficient Reorganization of Binary Search Trees. Algorithmica 31(3): 378-402 (2001)

Eli Almog, Hadas Shachnai: Scheduling memory accesses through a shared bus. Perform. Eval. 46(2-3): 193-218 (2001)

Alexander Gaysinsky, Alon Itai, Hadas Shachnai: Strongly Competitive Algorithms for Caching with Pipelined Prefetching. ESA 2001: 49-61

Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai: Minimizing Average Completion of Dedicated Tasks and Interval Graphs. RANDOM-APPROX 2001: 114-126

Hadas Shachnai, Aravind Srinivasan: Finding large independent sets of hypergraphs in parallel. SPAA 2001: 163-168

Erol Gelenbe, Hadas Shachnai: On G-networks and resource allocation in multimedia systems. European Journal of Operational Research 126(2): 308-318 (2000)

Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai: Sum Multicoloring of Graphs. J. Algorithms 37(2): 422-450 (2000)

Hadas Shachnai, Tami Tamir: Polynominal time approximation schemes for class-constrained packing problem. APPROX 2000: 238-249

Hadas Shachnai, John Turek: Multiresource Malleable Task Scheduling to Minimize Response Time. Inf. Process. Lett. 70(1): 47 (1999)

Hagit Attiya, Hadas Shachnai, Tami Tamir: Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. 28(4): 1397-1414 (1999)

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle: Multi-coloring Trees. COCOON 1999: 271-280

Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai: Sum Multi-coloring of Graphs. ESA 1999: 390-401

Yuval Hershko, Daniel Segal, Hadas Shachnai: Self-Tuning Synchronization Mechanisms in Network Operating Systems. SIGMETRICS 1999: 224-225

Hadas Shachnai, Micha Hofri: The List Update Problem: Improved Bounds for the Counter Scheme. Algorithmica 22(4): 650-659 (1998)

Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir: On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. 140(2): 183-202 (1998)

Hadas Shachnai, Philip S. Yu: Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling. Multimedia Syst. 6(6): 382-394 (1998)

Hadas Shachnai, Philip S. Yu: On Analytic Modeling of Multimedia Batching Schemes. Perform. Eval. 33(3): 201-213 (1998)

Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai: Optimal Bounds on Tail Probabilities - A Simplified Approach. IPPS/SPDP Workshops 1998: 341-350

Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv: Dynamic Schemes for Speculative Execution of Code. MASCOTS 1998: 309-

Erol Gelenbe, Hadas Shachnai: On G-Networks and Resource Allocation in Multimedia Systems. RIDE 1998: 104-110

Joel L. Wolf, Philip S. Yu, Hadas Shachnai: Disk Load Balancing for Video-On-Demand Systems. Multimedia Syst. 5(6): 358-370 (1997)

Jason Glasgow, Hadas Shachnai: Channel Based Scheduling of Parallelizable Task. MASCOTS 1997: 11-16

Hagit Attiya, Hadas Shachnai: IDABased Protocols for Reliable Multicast. OPODIS 1997: 137-152

Alon Itai, Hadas Shachnai: Adaptive Source Routing in High-Speed Networks. J. Algorithms 20(2): 218-243 (1996)

Amotz Bar-Noy, Hadas Shachnai, Tami Tamir: On Chromatic Sums and Distributed Resource Allocation. ISTCS 1996: 119-128

Philip S. Yu, Joel L. Wolf, Hadas Shachnai: Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications. Multimedia Syst. 3(4): 137-149 (1995)

Joel L. Wolf, Philip S. Yu, Hadas Shachnai: DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer. SIGMETRICS 1995: 157-166

Micha Hofri, Hadas Shachnai: Efficient Reorganization of Binary Search Trees. CIAC 1994: 152-166

Hagit Attiya, Hadas Shachnai, Tami Tamir: Local Labeling and Resource Allocation Using Preprocessing. WDAG 1994: 194-208

Alon Itai, Hadas Shachnai: Adaptive Source Routing in High-Speed Networks. ISTCS 1993: 212-221

Micha Hofri, Hadas Shachnai: On the Optimality of the Counter Scheme for Dynamic Linear Lists. Inf. Process. Lett. 37(3): 175-179 (1991)

Micha Hofri, Hadas Shachnai: Self-Organizing Lists and Independent References: A Statistical Synergy. J. Algorithms 12(4): 533-555 (1991)