| On Lagrangian Relaxation For Constrained Maximization And Reoptimization Problems | 0 | 0.34 | 2021 |
| Maximizing Throughput in Flow Shop Real-Time Scheduling. | 0 | 0.34 | 2020 |
| A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. | 0 | 0.34 | 2020 |
| Flexible Resource Allocation to Interval Jobs | 0 | 0.34 | 2019 |
| Generalized Assignment via Submodular Optimization with Reserved Capacity. | 0 | 0.34 | 2019 |
| Constrained submodular maximization via greedy local search. | 1 | 0.36 | 2019 |
| Flexible Bandwidth Assignment with Application to Optical Networks | 3 | 0.45 | 2018 |
| Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. | 0 | 0.34 | 2018 |
| The Preemptive Resource Allocation Problem. | 0 | 0.34 | 2018 |
| Complexity and inapproximability results for the Power Edge Set problem. | 0 | 0.34 | 2018 |
| A Theory and Algorithms for Combinatorial Reoptimization. | 1 | 0.34 | 2018 |
| Generalized Assignment of Time-Sensitive Item Groups. | 0 | 0.34 | 2018 |
| Fast Distributed Approximation for Max-Cut. | 1 | 0.36 | 2017 |
| Interleaved Algorithms for Constrained Submodular Function Maximization. | 0 | 0.34 | 2017 |
| A Multivariate Framework for Weighted FPT Algorithms | 3 | 0.45 | 2017 |
| Optimizing bandwidth allocation in elastic optical networks with application to scheduling. | 0 | 0.34 | 2017 |
| Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. | 1 | 0.36 | 2016 |
| Real-Time k-bounded Preemptive Scheduling. | 1 | 0.36 | 2016 |
| Flexible Resource Allocation for Clouds and All-Optical Networks. | 1 | 0.37 | 2016 |
| On Lagrangian Relaxation and Reoptimization Problems | 0 | 0.34 | 2015 |
| Constructing minimum changeover cost arborescenses in bounded treewidth graphs. | 3 | 0.41 | 2015 |
| Real-time Scheduling to Minimize Machine Busy Times? | 5 | 0.46 | 2015 |
| The Container Selection Problem. | 0 | 0.34 | 2015 |
| A Multivariate Approach for Weighted FPT Algorithms. | 1 | 0.35 | 2015 |
| Parameterized Algorithms for Graph Partitioning Problems. | 3 | 0.40 | 2014 |
| Representative Families: A Unified Tradeoff-Based Approach. | 5 | 0.47 | 2014 |
| Tighter Bounds for Makespan Minimization on Unrelated Machines. | 0 | 0.34 | 2014 |
| Improved Parameterized Algorithms for Network Query Problems. | 2 | 0.37 | 2014 |
| Scheduling jobs with dwindling resource requirements in clouds | 7 | 0.44 | 2014 |
| Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling | 3 | 0.44 | 2014 |
| Faster Computation of Representative Families for Uniform Matroids with Applications. | 6 | 0.51 | 2014 |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem. | 0 | 0.34 | 2013 |
| The euclidean k-supplier problem | 5 | 0.46 | 2013 |
| All-or-Nothing generalized assignment with application to scheduling advertising campaigns | 0 | 0.34 | 2013 |
| Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints | 17 | 0.66 | 2013 |
| Partial Information Network Queries | 3 | 0.38 | 2013 |
| Corrigendum: Improved results for data migration and open shop scheduling | 0 | 0.34 | 2013 |
| Fast Information Spreading in Graphs with Large Weak Conductance | 19 | 0.89 | 2012 |
| Minimal cost reconfiguration of data placement in a storage area network | 9 | 0.55 | 2012 |
| A theory and algorithms for combinatorial reoptimization | 18 | 0.71 | 2012 |
| Approximation schemes for generalized two-dimensional vector packing with application to data placement | 8 | 0.52 | 2012 |
| Packing resizable items with application to video delivery over wireless networks | 0 | 0.34 | 2012 |
| Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). | 3 | 0.40 | 2011 |
| Approximation schemes for deal splitting and covering integer programs with multiplicity constraints | 0 | 0.34 | 2011 |
| Online selection of intervals and t-intervals. | 3 | 0.45 | 2010 |
| Transactional contention management as a non-clairvoyant scheduling problem | 40 | 1.43 | 2010 |
| Minimizing Busy Time in Multiple Machine Real-time Scheduling | 14 | 0.65 | 2010 |
| Partial information spreading with application to distributed maximum coverage | 16 | 0.75 | 2010 |
| Return of the boss problem: competing online against a non-adaptive adversary | 0 | 0.34 | 2010 |
| There is no EPTAS for two-dimensional knapsack | 21 | 0.88 | 2010 |
