2013
91All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir. IPCO 2013, 13-24. Web SearchBibTeXDownload
90The Euclidean k-Supplier Problem. Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai. IPCO 2013, 290-301. Web SearchBibTeXDownload
2012
89Packing Resizable Items with Application to Video Delivery over Wireless Networks. Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir. ALGOSENSORS 2012, 6-17. Web SearchBibTeXDownload
88Parameterized Approximation via Fidelity Preserving Transformations. Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai. ICALP (1) 2012, 351-362. Web SearchBibTeXDownload
87Approximation schemes for generalized two-dimensional vector packing with application to data placement. Hadas Shachnai, Tami Tamir. J. Discrete Algorithms (10): 35-48 (2012). Web SearchBibTeXDownload
86A Theory and Algorithms for Combinatorial Reoptimization. Hadas Shachnai, Gal Tamir, Tami Tamir. LATIN 2012, 618-630. Web SearchBibTeXDownload
85Fast Information Spreading in Graphs with Large Weak Conductance. Keren Censor-Hillel, Hadas Shachnai. SIAM J. Comput. (41): 1451-1465 (2012). Web SearchBibTeXDownload
84Minimal cost reconfiguration of data placement in a storage area network. Hadas Shachnai, Gal Tamir, Tami Tamir. Theor. Comput. Sci. (460): 42-53 (2012). Web SearchBibTeXDownload
2011
83Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. Ariel Kulik, Hadas Shachnai, Tami Tamir. CoRR (abs/1101.2940) (2011). Web SearchBibTeXDownload
82Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young. Dagstuhl Reports (1): 67-93 (2011). Web SearchBibTeXDownload
81Fast Information Spreading in Graphs with Large Weak Conductance. Keren Censor-Hillel, Hadas Shachnai. SODA 2011, 440-448. Web SearchBibTeXDownload
80Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh. Theor. Comput. Sci. (412): 7087-7098 (2011). Web SearchBibTeXDownload
2010
79Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir. Algorithmica (57): 44-61 (2010). Web SearchBibTeXDownload
78Minimizing Busy Time in Multiple Machine Real-time Scheduling. Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir. FSTTCS 2010, 169-180. Web SearchBibTeXDownload
77Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. Magnús M. Halldórsson, Hadas Shachnai. FUN 2010, 237-248. Web SearchBibTeXDownload
76There is no EPTAS for two-dimensional knapsack. Ariel Kulik, Hadas Shachnai. Inf. Process. Lett. (110): 707-710 (2010). Web SearchBibTeXDownload
75Partial information spreading with application to distributed maximum coverage. Keren Censor Hillel, Hadas Shachnai. PODC 2010, 161-170. Web SearchBibTeXDownload
74Online Selection of Intervals and t-Intervals. Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai. SWAT 2010, 383-394. Web SearchBibTeXDownload
73Minimizing total busy time in parallel scheduling with application to optical networks. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks. Theor. Comput. Sci. (411): 3553-3562 (2010). Web SearchBibTeXDownload
2009
72Throughput maximization of real-time scheduling with batching. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai. ACM Transactions on Algorithms (5) (2009). Cited by 25Web SearchBibTeXDownload
71Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai. Algorithmica (55): 643-665 (2009). Web SearchBibTeXDownload
70A note on generalized rank aggregation. Hadas Shachnai, Lisa Zhang, Tomomi Matsui. Inf. Process. Lett. (109): 647-651 (2009). Web SearchBibTeXDownload
69Minimizing total busy time in parallel scheduling with application to optical networks. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks. IPDPS 2009, 1-12. Web SearchBibTeXDownload
68Maximizing submodular set functions subject to multiple linear constraints. Ariel Kulik, Hadas Shachnai, Tami Tamir. SODA 2009, 545-554. Web SearchBibTeXDownload
67Periodic scheduling with obligatory vacations. Jiri Sgall, Hadas Shachnai, Tami Tamir. Theor. Comput. Sci. (410): 5112-5121 (2009). Web SearchBibTeXDownload
66Minimal Cost Reconfiguration of Data Placement in Storage Area Network. Hadas Shachnai, Gal Tamir, Tami Tamir. WAOA 2009, 229-241. Web SearchBibTeXDownload
2008
65Improved bounds for scheduling conflicting jobs with minsum criteria. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
64Exact algorithms for the master ring problem. Hadas Shachnai, Lisa Zhang, Tomomi Matsui. Networks (52): 98-107 (2008). Web SearchBibTeXDownload
63Batch Coloring Flat Graphs and Thin. Magnús M. Halldórsson, Hadas Shachnai. SWAT 2008, 198-209. Web SearchBibTeXDownload
62Approximation Schemes for Packing with Item Fragmentation. Hadas Shachnai, Tami Tamir, Omer Yehezkely. Theory Comput. Syst. (43): 81-98 (2008). Web SearchBibTeXDownload
61On Lagrangian Relaxation and Subset Selection Problems. Ariel Kulik, Hadas Shachnai. WAOA 2008, 160-173. Web SearchBibTeXDownload
2007
60Real-Time Scheduling with a Budget. Joseph Naor, Hadas Shachnai, Tami Tamir. Algorithmica (47): 343-364 (2007). Web SearchBibTeXDownload
59Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. Hadas Shachnai, Omer Yehezkely. FCT 2007, 482-493. Web SearchBibTeXDownload
2006
58Improved results for data migration and open shop scheduling. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. ACM Transactions on Algorithms (2): 116-129 (2006). Web SearchBibTeXDownload
57Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai. APPROX-RANDOM 2006, 116-127. Web SearchBibTeXDownload
56Transactional contention management as a non-clairvoyant scheduling problem. Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir. PODC 2006, 308-315. Web SearchBibTeXDownload
55Scheduling Split Intervals. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira. SIAM J. Comput. (36): 1-15 (2006). Web SearchBibTeXDownload
2005
54Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger. Algorithmica (42): 309-334 (2005). Web SearchBibTeXDownload
53Fairness-Free Periodic Scheduling with Vacations. Jiri Sgall, Hadas Shachnai, Tami Tamir. ESA 2005, 592-603. Web SearchBibTeXDownload
52Approximation Schemes for Packing with Item Fragmentation. Hadas Shachnai, Tami Tamir, Omer Yehezkely. WAOA 2005, 334-347. Web SearchBibTeXDownload
2004
51Improved Results for Data Migration and Open Shop Scheduling. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. ICALP 2004, 658-669. Web SearchBibTeXDownload
50Tight bounds for FEC-based reliable multicast. Hagit Attiya, Hadas Shachnai. Inf. Comput. (190): 117-135 (2004). Web SearchBibTeXDownload
49Strongly competitive algorithms for caching with pipelined prefetching. Alexander Gaysinsky, Alon Itai, Hadas Shachnai. Inf. Process. Lett. (91): 19-27 (2004). Web SearchBibTeXDownload
48Finding Large Independent Sets in Graphs and Hypergraphs. Hadas Shachnai, Aravind Srinivasan. SIAM J. Discrete Math. (18): 488-500 (2004). Web SearchBibTeXDownload
47Tight bounds for online class-constrained packing. Hadas Shachnai, Tami Tamir. Theor. Comput. Sci. (321): 103-123 (2004). Web SearchBibTeXDownload
46Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. Hadas Shachnai, Oded Shmueli, Robert Sayegh. WAOA 2004, 111-125. Cited by 4Web SearchBibTeXDownload
45Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. WAOA 2004, 68-82. Web SearchBibTeXDownload
2003
44Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. Algorithmica (37): 187-209 (2003). Web SearchBibTeXDownload
43Real-Time Scheduling with a Budget. Joseph Naor, Hadas Shachnai, Tami Tamir. ICALP 2003, 1123-1137. Web SearchBibTeXDownload
42Multicoloring trees. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle. Inf. Comput. (180): 113-129 (2003). Web SearchBibTeXDownload
41Dynamic schemes for speculative execution of code. Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv. Perform. Eval. (53): 125-142 (2003). Cited by 2Web SearchBibTeXDownload
40Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. Hadas Shachnai, Tami Tamir. RANDOM-APPROX 2003, 165-177. Web SearchBibTeXDownload
2002
39Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Hadas Shachnai, Tami Tamir. Algorithmica (32): 651-678 (2002). Web SearchBibTeXDownload
38Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger. ESA 2002, 859-871. Web SearchBibTeXDownload
37Tight Bounds for Online Class-Constrained Packing. Hadas Shachnai, Tami Tamir. LATIN 2002, 569-583. Web SearchBibTeXDownload
36Scheduling split intervals. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira. SODA 2002, 732-741. Web SearchBibTeXDownload
35Throughput maximization of real-time scheduling with batching. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai. SODA 2002, 742-751. Cited by 25Web SearchBibTeXDownload
34The passport control problem or how to keep a dynamic service system load balanced?. Alon Itai, Michael Rodeh, Hadas Shachnai. Theor. Comput. Sci. (282): 303-318 (2002). Web SearchBibTeXDownload
2001
33On Two Class-Constrained Versions of the Multiple Knapsack Problem. Hadas Shachnai, Tami Tamir. Algorithmica (29): 442-467 (2001). Web SearchBibTeXDownload
32Efficient Reorganization of Binary Search Trees. Micha Hofri, Hadas Shachnai. Algorithmica (31): 378-402 (2001). Web SearchBibTeXDownload
31Strongly Competitive Algorithms for Caching with Pipelined Prefetching. Alexander Gaysinsky, Alon Itai, Hadas Shachnai. ESA 2001, 49-61. Web SearchBibTeXDownload
30Scheduling memory accesses through a shared bus. Eli Almog, Hadas Shachnai. Perform. Eval. (46): 193-218 (2001). Web SearchBibTeXDownload
29Minimizing Average Completion of Dedicated Tasks and Interval Graphs. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. RANDOM-APPROX 2001, 114-126. Web SearchBibTeXDownload
28Finding large independent sets of hypergraphs in parallel. Hadas Shachnai, Aravind Srinivasan. SPAA 2001, 163-168. Web SearchBibTeXDownload
2000
27Polynominal time approximation schemes for class-constrained packing problem. Hadas Shachnai, Tami Tamir. APPROX 2000, 238-249. Web SearchBibTeXDownload
26On G-networks and resource allocation in multimedia systems. Erol Gelenbe, Hadas Shachnai. European Journal of Operational Research (126): 308-318 (2000). Web SearchBibTeXDownload
25Sum Multicoloring of Graphs. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. J. Algorithms (37): 422-450 (2000). Web SearchBibTeXDownload
1999
24Multi-coloring Trees. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle. COCOON 1999, 271-280. Web SearchBibTeXDownload
23Sum Multi-coloring of Graphs. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. ESA 1999, 390-401. Web SearchBibTeXDownload
22Multiresource Malleable Task Scheduling to Minimize Response Time. Hadas Shachnai, John Turek. Inf. Process. Lett. (70): 47 (1999). Web SearchBibTeXDownload
21Local Labeling and Resource Allocation Using Preprocessing. Hagit Attiya, Hadas Shachnai, Tami Tamir. SIAM J. Comput. (28): 1397-1414 (1999). Web SearchBibTeXDownload
20Self-Tuning Synchronization Mechanisms in Network Operating Systems. Yuval Hershko, Daniel Segal, Hadas Shachnai. SIGMETRICS 1999, 224-225. Web SearchBibTeXDownload
1998
19The List Update Problem: Improved Bounds for the Counter Scheme. Hadas Shachnai, Micha Hofri. Algorithmica (22): 650-659 (1998). Web SearchBibTeXDownload
18On Chromatic Sums and Distributed Resource Allocation. Amotz Bar-Noy, Hadas Shachnai, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir. Inf. Comput. (140): 183-202 (1998). Web SearchBibTeXDownload
17Optimal Bounds on Tail Probabilities - A Simplified Approach. Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai. IPPS/SPDP Workshops 1998, 341-350. Web SearchBibTeXDownload
16Dynamic Schemes for Speculative Execution of Code. Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv. MASCOTS 1998, 309. Web SearchBibTeXDownload
15Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling. Hadas Shachnai, Philip S. Yu. Multimedia Syst. (6): 382-394 (1998). Cited by 43Web SearchBibTeXDownload
14On Analytic Modeling of Multimedia Batching Schemes. Hadas Shachnai, Philip S. Yu. Perform. Eval. (33): 201-213 (1998). Cited by 11Web SearchBibTeXDownload
13On G-Networks and Resource Allocation in Multimedia Systems. Erol Gelenbe, Hadas Shachnai. RIDE 1998, 104-110. Web SearchBibTeXDownload
1997
12Channel Based Scheduling of Parallelizable Task. Jason Glasgow, Hadas Shachnai. MASCOTS 1997, 11-16. Web SearchBibTeXDownload
11Disk Load Balancing for Video-On-Demand Systems. Joel L. Wolf, Philip S. Yu, Hadas Shachnai. Multimedia Syst. (5): 358-370 (1997). Cited by 79Web SearchBibTeXDownload
10IDABased Protocols for Reliable Multicast. Hagit Attiya, Hadas Shachnai. OPODIS 1997, 137-152. Web SearchBibTeX
1996
9On Chromatic Sums and Distributed Resource Allocation. Amotz Bar-Noy, Hadas Shachnai, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir. ISTCS 1996, 119-128. Web SearchBibTeX
8Adaptive Source Routing in High-Speed Networks. Alon Itai, Hadas Shachnai. J. Algorithms (20): 218-243 (1996). Web SearchBibTeXDownload
1995
7Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications. Philip S. Yu, Joel L. Wolf, Hadas Shachnai. Multimedia Syst. (3): 137-149 (1995). Cited by 62Web SearchBibTeXDownload
6DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer. Joel L. Wolf, Philip S. Yu, Hadas Shachnai. SIGMETRICS 1995, 157-166. Cited by 94Web SearchBibTeXDownload
1994
5Efficient Reorganization of Binary Search Trees. Micha Hofri, Hadas Shachnai. CIAC 1994, 152-166. Web SearchBibTeXDownload
4Local Labeling and Resource Allocation Using Preprocessing. Hagit Attiya, Hadas Shachnai, Tami Tamir. WDAG 1994, 194-208. Web SearchBibTeXDownload
1993
3Adaptive Source Routing in High-Speed Networks. Alon Itai, Hadas Shachnai. ISTCS 1993, 212-221. Web SearchBibTeX
1991
2On the Optimality of the Counter Scheme for Dynamic Linear Lists. Micha Hofri, Hadas Shachnai. Inf. Process. Lett. (37): 175-179 (1991). Web SearchBibTeXDownload
1Self-Organizing Lists and Independent References: A Statistical Synergy. Micha Hofri, Hadas Shachnai. J. Algorithms (12): 533-555 (1991). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research