The following pages link to Hadas Shachnai (Q313813):
Displaying 50 items.
- (Q172559) (redirect page) (← links)
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Minimal cost reconfiguration of data placement in a storage area network (Q690477) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- On the optimality of the counter-scheme for dynamic linear lists (Q751280) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Real-time scheduling with a budget (Q878439) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Periodic scheduling with obligatory vacations (Q1034630) (← links)
- The list update problem: Improved bounds for the counter scheme (Q1277389) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Multiprocessor scheduling with machine allotment and parallelism constraints (Q1348915) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Multicoloring trees. (Q1401922) (← links)
- On G-network and resource allocation in multimedia systems (Q1584785) (← links)
- The passport control problem or how to keep a dynamic service system load balanced? (Q1603718) (← links)
- Multiresource malleable task scheduling to minimize response time (Q1606927) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365) (← links)
- Partial information network queries (Q2018546) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Strongly competitive algorithms for caching with pipelined prefetching (Q2390276) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- (Q2753744) (← links)
- Parameterized Approximation via Fidelity Preserving Transformations (Q2843261) (← links)
- Tractable Parameterizations for the Minimum Linear Arrangement Problem (Q2849336) (← links)
- A Theory and Algorithms for Combinatorial Reoptimization (Q2894503) (← links)
- Minimizing Busy Time in Multiple Machine Real-time Scheduling (Q2908847) (← links)
