Hadas Shachnai

191 papers A* 18A 15B 23C 4Misc 2Journal 107Unranked 20

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Online Contract Design. CoRR Elad Lavi, Hadas Shachnai, Inbal Talgam-Cohen
2026	J	`jnl`	Techniques in parameterized approximation. Comput. Sci. Rev. Ariel Kulik, Hadas Shachnai
2026	A*	`conf`	You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. SODA Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2025	J	`jnl`	An Algorithm-to-Contract Framework without Demand Queries. CoRR Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler, Inbal Talgam-Cohen
2025	A*	`conf`	Finding Possible Winners in Spatial Voting with Incomplete Information. IJCAI Hadas Shachnai, Rotem Shavitt, Andreas Wiese
2025	J	`jnl`	Finding Possible Winners in Spatial Voting with Incomplete Information. CoRR Hadas Shachnai, Rotem Shavitt, Andreas Wiese
2025	J	`jnl`	Improved approximation for two-dimensional vector multiple knapsack. Comput. Geom. Tomer Cohen, Ariel Kulik, Hadas Shachnai
2025	J	`jnl`	Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs. Discret. Appl. Math. Ilan Doron-Arad, Hadas Shachnai
2024	A	`conf`	An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. APPROX/RANDOM Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2024	B	`conf`	Approximations and Hardness of Covering and Packing Partially Ordered Items. WG Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024	J	`jnl`	Approximations and Hardness of Packing Partially Ordered Items. CoRR Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024	A*	`conf`	Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2024	A*	`conf`	Spatial Voting with Incomplete Voter Information. AAAI Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld
2024	J	`jnl`	The preemptive resource allocation problem. J. Sched. Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2024	J	`jnl`	You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	A	`conf`	An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	A*	`conf`	An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	—	`conf`	An EPTAS for Budgeted Matroid Independent Set. SOSA Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	B	`conf`	Approximating Bin Packing with Conflict Graphs via Maximization Techniques. WG Ilan Doron-Arad, Hadas Shachnai
2023	J	`jnl`	Approximating Bin Packing with Conflict Graphs via Maximization Techniques. CoRR Ilan Doron-Arad, Hadas Shachnai
2023	B	`conf`	Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	Finding Possible and Necessary Winners in Spatial Voting with Partial Information. CoRR Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld
2023	B	`conf`	Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC Tomer Cohen, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR Tomer Cohen, Ariel Kulik, Hadas Shachnai
2023	A*	`conf`	Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS Ariel Kulik, Matthias Mnich, Hadas Shachnai
2023	J	`jnl`	Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs. CoRR Ilan Doron-Arad, Hadas Shachnai
2023	J	`jnl`	Tight Lower Bounds for Weighted Matroid Problems. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022	J	`jnl`	An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR Ariel Kulik, Matthias Mnich, Hadas Shachnai
2022	J	`jnl`	An EPTAS for Budgeted Matroid Independent Set. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022	J	`jnl`	An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
2022	J	`jnl`	Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2021	J	`jnl`	A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR Ariel Kulik, Roy Schwartz, Hadas Shachnai
2021	J	`jnl`	A refined analysis of submodular Greedy. Oper. Res. Lett. Ariel Kulik, Roy Schwartz, Hadas Shachnai
2021	B	`conf`	An APTAS for Bin Packing with Clique-Graph Conflicts. WADS Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2021	A	`conf`	Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA Yaron Fairstein, Ariel Kulik, Hadas Shachnai
2021	J	`jnl`	On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. Ariel Kulik, Hadas Shachnai, Gal Tamir
2020	A	`conf`	A (1-e ESA Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
2020	J	`jnl`	A (1-e CoRR Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai
2020	J	`jnl`	An APTAS for Bin Packing with Clique-graph Conflicts. CoRR Ilan Doron-Arad, Hadas Shachnai
2020	A*	`conf`	Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. FOCS Ariel Kulik, Hadas Shachnai
2020	—	`conf`	Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2020	J	`jnl`	The Euclidean Math. Oper. Res. Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
2020	J	`jnl`	tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR Yaron Fairstein, Ariel Kulik, Hadas Shachnai
2019	J	`jnl`	Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR Ariel Kulik, Hadas Shachnai
2019	J	`jnl`	Constrained submodular maximization via greedy local search. Oper. Res. Lett. Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Flexible Resource Allocation to Interval Jobs. Algorithmica Dmitriy Katz, Baruch Schieber, Hadas Shachnai
2019	A	`conf`	Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Improved Parameterized Algorithms for Network Query Problems. Algorithmica Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2019	—	`conf`	The Preemptive Resource Allocation Problem. FSTTCS Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir
2018	B	`conf`	Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	Flexible bandwidth assignment with application to optical networks. J. Sched. Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2018	—	`conf`	Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2018	—	`ch.`	Polynomial Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics (1) Hadas Shachnai, Tami Tamir
2018	J	`jnl`	The Preemptive Resource Allocation Problem. CoRR Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2017	J	`jnl`	A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. Hadas Shachnai, Meirav Zehavi
2017	J	`jnl`	Constrained Submodular Maximization via Greedy Local Search. CoRR Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2017	C	`conf`	Fast Distributed Approximation for Max-Cut. ALGOSENSORS Keren Censor-Hillel, Rina Levy, Hadas Shachnai
2017	J	`jnl`	Fast Distributed Approximation for Max-Cut. CoRR Keren Censor-Hillel, Rina Levy, Hadas Shachnai
2017	J	`jnl`	Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2017	J	`jnl`	Parameterized Algorithms for Graph Partitioning Problems. Theory Comput. Syst. Hadas Shachnai, Meirav Zehavi
2016	J	`jnl`	All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
2016	B	`conf`	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. SPAA Dmitriy Katz, Baruch Schieber, Hadas Shachnai
2016	J	`jnl`	Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
2016	J	`jnl`	Deterministic parameterized algorithms for the Graph Motif problem. Discret. Appl. Math. Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2016	J	`jnl`	Flexible Resource Allocation for Clouds and All-Optical Networks. CoRR Dmitriy Katz, Baruch Schieber, Hadas Shachnai
2016	A	`conf`	Real-Time k-bounded Preemptive Scheduling. ALENEX Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir
2016	J	`jnl`	Representative families: A unified tradeoff-based approach. J. Comput. Syst. Sci. Hadas Shachnai, Meirav Zehavi
2016	J	`jnl`	Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2015	A	`conf`	A Multivariate Approach for Weighted FPT Algorithms. ESA Hadas Shachnai, Meirav Zehavi
2015	C	`conf`	Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
2015	J	`jnl`	On Lagrangian Relaxation and Reoptimization Problems. CoRR Ariel Kulik, Hadas Shachnai, Gal Tamir
2015	J	`jnl`	Partial Information Network Queries. J. Discrete Algorithms Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2015	J	`jnl`	Real-time scheduling to minimize machine busy times. J. Sched. Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
2015	—	`conf`	The Container Selection Problem. APPROX-RANDOM Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf
2014	—	`conf`	Deterministic Parameterized Algorithms for the Graph Motif Problem. MFCS (2) Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. CoRR Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	Faster Computation of Representative Families for Uniform Matroids with Applications. CoRR Hadas Shachnai, Meirav Zehavi
2014	—	`conf`	Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). MFCS (2) Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2014	B	`conf`	Improved Parameterized Algorithms for Network Query Problems. IPEC Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
2014	A	`conf`	Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling. IPDPS Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2014	J	`jnl`	Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
2014	B	`conf`	Parameterized Algorithms for Graph Partitioning Problems. WG Hadas Shachnai, Meirav Zehavi
2014	J	`jnl`	Parameterized Algorithms for Graph Partitioning Problems. CoRR Hadas Shachnai, Meirav Zehavi
2014	A	`conf`	Representative Families: A Unified Tradeoff-Based Approach. ESA Hadas Shachnai, Meirav Zehavi
2014	A*	`conf`	Scheduling jobs with dwindling resource requirements in clouds. INFOCOM Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir
2014	J	`jnl`	Tighter Bounds for Makespan Minimization on Unrelated Machines. CoRR Dor Arad, Yael Mordechai, Hadas Shachnai
2013	B	`conf`	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
2013	J	`jnl`	Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. Ariel Kulik, Hadas Shachnai, Tami Tamir
2013	J	`jnl`	Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2013	J	`jnl`	Online selection of intervals and t-intervals. Inf. Comput. Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
2013	B	`conf`	The Euclidean k-Supplier Problem. IPCO Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
2013	A	`conf`	Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2012	B	`conf`	A Theory and Algorithms for Combinatorial Reoptimization. LATIN Hadas Shachnai, Gal Tamir, Tami Tamir
2012	J	`jnl`	Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms Hadas Shachnai, Tami Tamir
2012	J	`jnl`	Fast Information Spreading in Graphs with Large Weak Conductance. SIAM J. Comput. Keren Censor-Hillel, Hadas Shachnai
2012	J	`jnl`	Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. Hadas Shachnai, Gal Tamir, Tami Tamir
2012	C	`conf`	Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
2012	—	`conf`	Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2011	J	`jnl`	Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh
2011	J	`jnl`	Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints CoRR Ariel Kulik, Hadas Shachnai, Tami Tamir
2011	A*	`conf`	Fast Information Spreading in Graphs with Large Weak Conductance. SODA Keren Censor-Hillel, Hadas Shachnai
2011	J	`jnl`	Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young
2010	—	`conf`	Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
2010	J	`jnl`	Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
2010	—	`conf`	Online Selection of Intervals and SWAT Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
2010	A*	`conf`	Partial information spreading with application to distributed maximum coverage. PODC Keren Censor-Hillel, Hadas Shachnai
2010	Misc	`conf`	Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN Magnús M. Halldórsson, Hadas Shachnai
2010	J	`jnl`	There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. Ariel Kulik, Hadas Shachnai
2010	J	`jnl`	Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
2009	J	`jnl`	A note on generalized rank aggregation. Inf. Process. Lett. Hadas Shachnai, Lisa Zhang, Tomomi Matsui
2009	A*	`conf`	Maximizing submodular set functions subject to multiple linear constraints. SODA Ariel Kulik, Hadas Shachnai, Tami Tamir
2009	B	`conf`	Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA Hadas Shachnai, Gal Tamir, Tami Tamir
2009	A	`conf`	Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
2009	J	`jnl`	Periodic scheduling with obligatory vacations. Theor. Comput. Sci. Jirí Sgall, Hadas Shachnai, Tami Tamir
2009	J	`jnl`	Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2009	J	`jnl`	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2008	J	`jnl`	Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. Hadas Shachnai, Tami Tamir, Omer Yehezkely
2008	—	`conf`	Batch Coloring Flat Graphs and Thin. SWAT Magnús M. Halldórsson, Hadas Shachnai
2008	J	`jnl`	Exact algorithms for the master ring problem. Networks Hadas Shachnai, Lisa Zhang, Tomomi Matsui
2008	J	`jnl`	Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2008	B	`conf`	On Lagrangian Relaxation and Subset Selection Problems. WAOA Ariel Kulik, Hadas Shachnai
2007	B	`conf`	Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. FCT Hadas Shachnai, Omer Yehezkely
2007	—	`ch.`	Polynomial-Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics Hadas Shachnai, Tami Tamir
2007	J	`jnl`	Real-Time Scheduling with a Budget. Algorithmica Joseph Naor, Hadas Shachnai, Tami Tamir
2006	J	`jnl`	Improved results for data migration and open shop scheduling. ACM Trans. Algorithms Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2006	J	`jnl`	Scheduling Split Intervals. SIAM J. Comput. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
2006	A*	`conf`	Transactional contention management as a non-clairvoyant scheduling problem. PODC Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
2006	—	`conf`	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2005	B	`conf`	Approximation Schemes for Packing with Item Fragmentation. WAOA Hadas Shachnai, Tami Tamir, Omer Yehezkely
2005	A	`conf`	Fairness-Free Periodic Scheduling with Vacations. ESA Jirí Sgall, Hadas Shachnai, Tami Tamir
2005	J	`jnl`	Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
2004	B	`conf`	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. WAOA Hadas Shachnai, Oded Shmueli, Robert Sayegh
2004	J	`jnl`	Finding Large Independent Sets in Graphs and Hypergraphs. SIAM J. Discret. Math. Hadas Shachnai, Aravind Srinivasan
2004	B	`conf`	Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2004	A*	`conf`	Improved Results for Data Migration and Open Shop Scheduling. ICALP Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2004	J	`jnl`	Strongly competitive algorithms for caching with pipelined prefetching. Inf. Process. Lett. Alexander Gaysinsky, Alon Itai, Hadas Shachnai
2004	J	`jnl`	Tight bounds for FEC-based reliable multicast. Inf. Comput. Hagit Attiya, Hadas Shachnai
2004	J	`jnl`	Tight bounds for online class-constrained packing. Theor. Comput. Sci. Hadas Shachnai, Tami Tamir
2003	—	`conf`	Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. RANDOM-APPROX Hadas Shachnai, Tami Tamir
2003	J	`jnl`	Dynamic schemes for speculative execution of code. Perform. Evaluation Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv
2003	J	`jnl`	Multicoloring trees. Inf. Comput. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
2003	A*	`conf`	Real-Time Scheduling with a Budget. ICALP Joseph Naor, Hadas Shachnai, Tami Tamir
2003	J	`jnl`	Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Algorithmica Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2002	A	`conf`	Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
2002	J	`jnl`	Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica Hadas Shachnai, Tami Tamir
2002	A*	`conf`	Scheduling split intervals. SODA Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
2002	J	`jnl`	The passport control problem or how to keep a dynamic service system load balanced? Theor. Comput. Sci. Alon Itai, Michael Rodeh, Hadas Shachnai
2002	A*	`conf`	Throughput maximization of real-time scheduling with batching. SODA Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2002	B	`conf`	Tight Bounds for Online Class-Constrained Packing. LATIN Hadas Shachnai, Tami Tamir
2001	J	`jnl`	Efficient Reorganization of Binary Search Trees. Algorithmica Micha Hofri, Hadas Shachnai
2001	B	`conf`	Finding large independent sets of hypergraphs in parallel. SPAA Hadas Shachnai, Aravind Srinivasan
2001	—	`conf`	Minimizing Average Completion of Dedicated Tasks and Interval Graphs. RANDOM-APPROX Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2001	J	`jnl`	On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica Hadas Shachnai, Tami Tamir
2001	J	`jnl`	Scheduling memory accesses through a shared bus. Perform. Evaluation Eli Almog, Hadas Shachnai
2001	A	`conf`	Strongly Competitive Algorithms for Caching with Pipelined Prefetching. ESA Alexander Gaysinsky, Alon Itai, Hadas Shachnai
2000	J	`jnl`	On G-networks and resource allocation in multimedia systems. Eur. J. Oper. Res. Erol Gelenbe, Hadas Shachnai
2000	—	`conf`	Polynominal time approximation schemes for class-constrained packing problem. APPROX Hadas Shachnai, Tami Tamir
2000	J	`jnl`	Sum Multicoloring of Graphs. J. Algorithms Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
1999	J	`jnl`	Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. Hagit Attiya, Hadas Shachnai, Tami Tamir
1999	Misc	`conf`	Multi-coloring Trees. COCOON Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
1999	J	`jnl`	Multiresource Malleable Task Scheduling to Minimize Response Time. Inf. Process. Lett. Hadas Shachnai, John Turek
1999	A*	`conf`	Self-Tuning Synchronization Mechanisms in Network Operating Systems. SIGMETRICS Yuval Hershko, Daniel Segal, Hadas Shachnai
1999	A	`conf`	Sum Multi-coloring of Graphs. ESA Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
1998	B	`conf`	Dynamic Schemes for Speculative Execution of Code. MASCOTS Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv
1998	J	`jnl`	Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling. Multim. Syst. Hadas Shachnai, Philip S. Yu
1998	J	`jnl`	On Analytic Modeling of Multimedia Batching Schemes. Perform. Evaluation Hadas Shachnai, Philip S. Yu
1998	J	`jnl`	On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir
1998	—	`conf`	On G-Networks and Resource Allocation in Multimedia Systems. RIDE Erol Gelenbe, Hadas Shachnai
1998	—	`conf`	Optimal Bounds on Tail Probabilities - A Simplified Approach. IPPS/SPDP Workshops Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai
1998	J	`jnl`	The List Update Problem: Improved Bounds for the Counter Scheme. Algorithmica Hadas Shachnai, Micha Hofri
1997	B	`conf`	Channel Based Scheduling of Parallelizable Task. MASCOTS Jason Glasgow, Hadas Shachnai
1997	J	`jnl`	Disk Load Balancing for Video-On-Demand Systems. Multim. Syst. Joel L. Wolf, Philip S. Yu, Hadas Shachnai
1997	B	`conf`	IDABased Protocols for Reliable Multicast. OPODIS Hagit Attiya, Hadas Shachnai
1996	J	`jnl`	Adaptive Source Routing in High-Speed Networks. J. Algorithms Alon Itai, Hadas Shachnai
1996	—	`conf`	On Chromatic Sums and Distributed Resource Allocation. ISTCS Amotz Bar-Noy, Hadas Shachnai, Tami Tamir
1995	A*	`conf`	DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer. SIGMETRICS Joel L. Wolf, Philip S. Yu, Hadas Shachnai
1995	J	`jnl`	Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications. Multim. Syst. Philip S. Yu, Joel L. Wolf, Hadas Shachnai
1994	C	`conf`	Efficient Reorganization of Binary Search Trees. CIAC Micha Hofri, Hadas Shachnai
1994	—	`conf`	Local Labeling and Resource Allocation Using Preprocessing. WDAG Hagit Attiya, Hadas Shachnai, Tami Tamir
1993	—	`conf`	Adaptive Source Routing in High-Speed Networks. ISTCS Alon Itai, Hadas Shachnai
1991	J	`jnl`	On the Optimality of the Counter Scheme for Dynamic Linear Lists. Inf. Process. Lett. Micha Hofri, Hadas Shachnai
1991	J	`jnl`	Self-Organizing Lists and Independent References: A Statistical Synergy. J. Algorithms Micha Hofri, Hadas Shachnai