Hadas Shachnai

According to our database1, Hadas Shachnai authored at least 134 papers between 1991 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Flexible bandwidth assignment with application to optical networks.
J. Scheduling, 2018

Parameterized approximation via fidelity preserving transformations.
J. Comput. Syst. Sci., 2018

Complexity and inapproximability results for the Power Edge Set problem.
J. Comb. Optim., 2018

A Theory and Algorithms for Combinatorial Reoptimization.
Algorithmica, 2018

Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Generalized Assignment of Time-Sensitive Item Groups.
Proceedings of the Approximation, 2018

2017
Parameterized Algorithms for Graph Partitioning Problems.
Theory Comput. Syst., 2017

Optimizing bandwidth allocation in elastic optical networks with application to scheduling.
J. Discrete Algorithms, 2017

A multivariate framework for weighted FPT algorithms.
J. Comput. Syst. Sci., 2017

Constrained Submodular Maximization via Greedy Local Search.
CoRR, 2017

Fast Distributed Approximation for Max-Cut.
CoRR, 2017

Fast Distributed Approximation for Max-Cut.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Tractable Parameterizations for the Minimum Linear Arrangement Problem.
TOCT, 2016

Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Theor. Comput. Sci., 2016

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
ACM Trans. Algorithms, 2016

Representative families: A unified tradeoff-based approach.
J. Comput. Syst. Sci., 2016

Deterministic parameterized algorithms for the Graph Motif problem.
Discrete Applied Mathematics, 2016

Flexible Resource Allocation for Clouds and All-Optical Networks.
CoRR, 2016

Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Real-Time k-bounded Preemptive Scheduling.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Real-time scheduling to minimize machine busy times.
J. Scheduling, 2015

Partial Information Network Queries.
J. Discrete Algorithms, 2015

On Lagrangian Relaxation and Reoptimization Problems.
CoRR, 2015

A Multivariate Approach for Weighted FPT Algorithms.
Proceedings of the Algorithms - ESA 2015, 2015

Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

The Container Selection Problem.
Proceedings of the Approximation, 2015

2014
Packing resizable items with application to video delivery over wireless networks.
Theor. Comput. Sci., 2014

FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted.
CoRR, 2014

Parameterized Algorithms for Graph Partitioning Problems.
CoRR, 2014

Faster Computation of Representative Families for Uniform Matroids with Applications.
CoRR, 2014

Tighter Bounds for Makespan Minimization on Unrelated Machines.
CoRR, 2014

Parameterized Algorithms for Graph Partitioning Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Deterministic Parameterized Algorithms for the Graph Motif Problem.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Improved Parameterized Algorithms for Network Query Problems.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Scheduling jobs with dwindling resource requirements in clouds.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Representative Families: A Unified Tradeoff-Based Approach.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Corrigendum: Improved results for data migration and open shop scheduling.
ACM Trans. Algorithms, 2013

Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints.
Math. Oper. Res., 2013

Online selection of intervals and t-intervals.
Inf. Comput., 2013

The Euclidean k-Supplier Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Tractable Parameterizations for the Minimum Linear Arrangement Problem.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Minimal cost reconfiguration of data placement in a storage area network.
Theor. Comput. Sci., 2012

Fast Information Spreading in Graphs with Large Weak Conductance.
SIAM J. Comput., 2012

Approximation schemes for generalized two-dimensional vector packing with application to data placement.
J. Discrete Algorithms, 2012

A Theory and Algorithms for Combinatorial Reoptimization.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Parameterized Approximation via Fidelity Preserving Transformations.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Packing Resizable Items with Application to Video Delivery over Wireless Networks.
Proceedings of the Algorithms for Sensor Systems, 2012

2011
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints.
Theor. Comput. Sci., 2011

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).
Dagstuhl Reports, 2011

Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
CoRR, 2011

Fast Information Spreading in Graphs with Large Weak Conductance.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010

There is no EPTAS for two-dimensional knapsack.
Inf. Process. Lett., 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
Algorithmica, 2010

Online Selection of Intervals and t-Intervals.
Proceedings of the Algorithm Theory, 2010

Partial information spreading with application to distributed maximum coverage.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Return of the Boss Problem: Competing Online against a Non-adaptive Adversary.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Minimizing Busy Time in Multiple Machine Real-time Scheduling.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Periodic scheduling with obligatory vacations.
Theor. Comput. Sci., 2009

Throughput maximization of real-time scheduling with batching.
ACM Trans. Algorithms, 2009

A note on generalized rank aggregation.
Inf. Process. Lett., 2009

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Algorithmica, 2009

Minimal Cost Reconfiguration of Data Placement in Storage Area Network.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Maximizing submodular set functions subject to multiple linear constraints.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Minimizing total busy time in parallel scheduling with application to optical networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
Improved bounds for scheduling conflicting jobs with minsum criteria.
ACM Trans. Algorithms, 2008

Exact algorithms for the master ring problem.
Networks, 2008

Approximation Schemes for Packing with Item Fragmentation.
Theory Comput. Syst., 2008

On Lagrangian Relaxation and Subset Selection Problems.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Batch Coloring Flat Graphs and Thin.
Proceedings of the Algorithm Theory, 2008

2007
Polynomial-Time Approximation Schemes.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Real-Time Scheduling with a Budget.
Algorithmica, 2007

Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
Improved results for data migration and open shop scheduling.
ACM Trans. Algorithms, 2006

Scheduling Split Intervals.
SIAM J. Comput., 2006

Transactional contention management as a non-clairvoyant scheduling problem.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Proceedings of the Approximation, 2006

2005
Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
Algorithmica, 2005

Approximation Schemes for Packing with Item Fragmentation.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Fairness-Free Periodic Scheduling with Vacations.
Proceedings of the Algorithms, 2005

2004
Tight bounds for online class-constrained packing.
Theor. Comput. Sci., 2004

Finding Large Independent Sets in Graphs and Hypergraphs.
SIAM J. Discrete Math., 2004

Strongly competitive algorithms for caching with pipelined prefetching.
Inf. Process. Lett., 2004

Tight bounds for FEC-based reliable multicast.
Inf. Comput., 2004

Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Improved Results for Data Migration and Open Shop Scheduling.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Dynamic schemes for speculative execution of code.
Perform. Eval., 2003

Multicoloring trees.
Inf. Comput., 2003

Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs.
Algorithmica, 2003

Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.
Proceedings of the Approximation, 2003

Real-Time Scheduling with a Budget.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
The passport control problem or how to keep a dynamic service system load balanced?
Theor. Comput. Sci., 2002

Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints.
Algorithmica, 2002

Scheduling split intervals.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Throughput maximization of real-time scheduling with batching.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Tight Bounds for Online Class-Constrained Packing.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
Proceedings of the Algorithms, 2002

2001
Scheduling memory accesses through a shared bus.
Perform. Eval., 2001

On Two Class-Constrained Versions of the Multiple Knapsack Problem.
Algorithmica, 2001

Efficient Reorganization of Binary Search Trees.
Algorithmica, 2001

Finding large independent sets of hypergraphs in parallel.
SPAA, 2001

Minimizing Average Completion of Dedicated Tasks and Interval Graphs.
Proceedings of the Approximation, 2001

Strongly Competitive Algorithms for Caching with Pipelined Prefetching.
Proceedings of the Algorithms, 2001

2000
Sum Multicoloring of Graphs.
J. Algorithms, 2000

On G-networks and resource allocation in multimedia systems.
European Journal of Operational Research, 2000

Polynominal time approximation schemes for class-constrained packing problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Local Labeling and Resource Allocation Using Preprocessing.
SIAM J. Comput., 1999

Multiresource Malleable Task Scheduling to Minimize Response Time.
Inf. Process. Lett., 1999

Self-Tuning Synchronization Mechanisms in Network Operating Systems.
Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Sum Multi-coloring of Graphs.
Proceedings of the Algorithms, 1999

Multi-coloring Trees.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
On Analytic Modeling of Multimedia Batching Schemes.
Perform. Eval., 1998

Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling.
Multimedia Syst., 1998

On Chromatic Sums and Distributed Resource Allocation.
Inf. Comput., 1998

The List Update Problem: Improved Bounds for the Counter Scheme.
Algorithmica, 1998

On G-Networks and Resource Allocation in Multimedia Systems.
Proceedings of the RIDE'98, 1998

Dynamic Schemes for Speculative Execution of Code.
Proceedings of the MASCOTS 1998, 1998

Optimal Bounds on Tail Probabilities - A Simplified Approach.
IPPS/SPDP Workshops, 1998

1997
Disk Load Balancing for Video-On-Demand Systems.
Multimedia Syst., 1997

IDABased Protocols for Reliable Multicast.
Proceedings of the On Principles Of Distributed Systems, 1997

Channel Based Scheduling of Parallelizable Task.
Proceedings of the MASCOTS 1997, 1997

1996
Adaptive Source Routing in High-Speed Networks.
J. Algorithms, 1996

On Chromatic Sums and Distributed Resource Allocation.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications.
Multimedia Syst., 1995

DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer.
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1995

1994
Local Labeling and Resource Allocation Using Preprocessing.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Efficient Reorganization of Binary Search Trees.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993
Adaptive Source Routing in High-Speed Networks.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1991
Self-Organizing Lists and Independent References: A Statistical Synergy.
J. Algorithms, 1991

On the Optimality of the Counter Scheme for Dynamic Linear Lists.
Inf. Process. Lett., 1991


  Loading...