Hadas Shachnai

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 68

Top Venues

CoRR

ESA

J. Comput. Syst. Sci.

APPROX-RANDOM

Publications

Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
The preemptive resource allocation problem. J. Sched. 27 (1) (2024)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matroid Independent Set. SOSA (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM (2023)
Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld
Finding Possible and Necessary Winners in Spatial Voting with Partial Information. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Tight Lower Bounds for Weighted Matroid Problems. CoRR (2023)
Tomer Cohen, Ariel Kulik, Hadas Shachnai
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR (2023)
Ilan Doron Arad, Hadas Shachnai
Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR (2023)
Ilan Doron Arad, Hadas Shachnai
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. CoRR (2023)
Tomer Cohen, Ariel Kulik, Hadas Shachnai
Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR (2023)
Ariel Kulik, Matthias Mnich, Hadas Shachnai
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51 (6) (2023)
Ilan Doron Arad, Hadas Shachnai
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. WG (2023)
Ariel Kulik, Matthias Mnich, Hadas Shachnai
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR (2022)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matroid Independent Set. CoRR (2022)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125 (2022)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. CoRR (2022)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An APTAS for Bin Packing with Clique-Graph Conflicts. WADS (2021)
Ariel Kulik, Roy Schwartz, Hadas Shachnai
A refined analysis of submodular Greedy. Oper. Res. Lett. 49 (4) (2021)
Ariel Kulik, Hadas Shachnai, Gal Tamir
On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. 296 (2021)
Ariel Kulik, Roy Schwartz, Hadas Shachnai
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR (2021)
Yaron Fairstein, Ariel Kulik, Hadas Shachnai
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA (2021)
Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai
-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR (2020)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA (2020)
Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM (2020)
Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
-Supplier Problem. Math. Oper. Res. 45 (1) (2020)
Ilan Doron Arad, Hadas Shachnai
An APTAS for Bin Packing with Clique-graph Conflicts. CoRR (2020)
Ariel Kulik, Hadas Shachnai
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. FOCS (2020)
Yaron Fairstein, Ariel Kulik, Hadas Shachnai
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR (2020)
Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
Improved Parameterized Algorithms for Network Query Problems. Algorithmica 81 (6) (2019)
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47 (1) (2019)
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
The Preemptive Resource Allocation Problem. FSTTCS (2019)
Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA (2019)
Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR (2019)
Ariel Kulik, Hadas Shachnai
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR (2019)
Dmitriy Katz, Baruch Schieber, Hadas Shachnai
Flexible Resource Allocation to Interval Jobs. Algorithmica 81 (8) (2019)
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
The Preemptive Resource Allocation Problem. CoRR (2018)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Flexible bandwidth assignment with application to optical networks. J. Sched. 21 (3) (2018)
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA (2018)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93 (2018)
Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80 (2) (2018)
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM (2018)
Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35 (3) (2018)
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Constrained Submodular Maximization via Greedy Local Search. CoRR (2017)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms 45 (2017)
Hadas Shachnai, Meirav Zehavi
A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. 89 (2017)
Hadas Shachnai, Meirav Zehavi
Parameterized Algorithms for Graph Partitioning Problems. Theory Comput. Syst. 61 (3) (2017)
Keren Censor-Hillel, Rina Levy, Hadas Shachnai
Fast Distributed Approximation for Max-Cut. ALGOSENSORS (2017)
Keren Censor-Hillel, Rina Levy, Hadas Shachnai
Fast Distributed Approximation for Max-Cut. CoRR (2017)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621 (2016)
Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir
Real-Time k-bounded Preemptive Scheduling. ALENEX (2016)
Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
Deterministic parameterized algorithms for the Graph Motif problem. Discret. Appl. Math. 213 (2016)
Dmitriy Katz, Baruch Schieber, Hadas Shachnai
Flexible Resource Allocation for Clouds and All-Optical Networks. CoRR (2016)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory 8 (2) (2016)
Dmitriy Katz, Baruch Schieber, Hadas Shachnai
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. SPAA (2016)
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. ACM Trans. Algorithms 12 (3) (2016)
Hadas Shachnai, Meirav Zehavi
Representative families: A unified tradeoff-based approach. J. Comput. Syst. Sci. 82 (3) (2016)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW (2015)
Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
Partial Information Network Queries. J. Discrete Algorithms 31 (2015)
Ariel Kulik, Hadas Shachnai, Gal Tamir
On Lagrangian Relaxation and Reoptimization Problems. CoRR (2015)
Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf
The Container Selection Problem. APPROX-RANDOM (2015)
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
Real-time scheduling to minimize machine busy times. J. Sched. 18 (6) (2015)
Hadas Shachnai, Meirav Zehavi
A Multivariate Approach for Weighted FPT Algorithms. ESA (2015)
Hadas Shachnai, Meirav Zehavi
Parameterized Algorithms for Graph Partitioning Problems. WG (2014)
Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
Improved Parameterized Algorithms for Network Query Problems. IPEC (2014)
Dor Arad, Yael Mordechai, Hadas Shachnai
Tighter Bounds for Makespan Minimization on Unrelated Machines. CoRR (2014)
Hadas Shachnai, Meirav Zehavi
Faster Computation of Representative Families for Uniform Matroids with Applications. CoRR (2014)
Hadas Shachnai, Meirav Zehavi
FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. CoRR (2014)
Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
Deterministic Parameterized Algorithms for the Graph Motif Problem. MFCS (2) (2014)
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. 553 (2014)
Hadas Shachnai, Meirav Zehavi
Representative Families: A Unified Tradeoff-Based Approach. ESA (2014)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). MFCS (2) (2014)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling. IPDPS (2014)
Hadas Shachnai, Meirav Zehavi
Parameterized Algorithms for Graph Partitioning Problems. CoRR (2014)
Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir
Scheduling jobs with dwindling resource requirements in clouds. INFOCOM (2014)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA (2013)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38 (4) (2013)
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)
Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
The Euclidean k-Supplier Problem. IPCO (2013)
Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
Online selection of intervals and t-intervals. Inf. Comput. 233 (2013)
Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9 (4) (2013)
Keren Censor-Hillel, Hadas Shachnai
Fast Information Spreading in Graphs with Large Weak Conductance. SIAM J. Comput. 41 (6) (2012)
Hadas Shachnai, Tami Tamir
Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms 10 (2012)
Hadas Shachnai, Gal Tamir, Tami Tamir
Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. 460 (2012)
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir
Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS (2012)
Hadas Shachnai, Gal Tamir, Tami Tamir
A Theory and Algorithms for Combinatorial Reoptimization. LATIN (2012)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) (2012)
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) (2011)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints CoRR (2011)
Keren Censor-Hillel, Hadas Shachnai
Fast Information Spreading in Graphs with Large Weak Conductance. SODA (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) (2011)
Keren Censor-Hillel, Hadas Shachnai
Partial information spreading with application to distributed maximum coverage. PODC (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) (2010)
Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
-Intervals. SWAT (2010)
Magnús M. Halldórsson, Hadas Shachnai
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN (2010)

Hadas Shachnai.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hadas Shachnai