| Publication | Date of Publication | Type |
|---|
A competitive algorithm for throughput maximization on identical machines
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Scheduling with speed predictions
| 2024-07-19 | Paper |
A randomized algorithm for online metric b-matching
Operations Research Letters | 2024-06-17 | Paper |
Cluster before you hallucinate: node-capacitated network design and energy efficient routing
SIAM Journal on Computing | 2024-06-05 | Paper |
Matching Drivers to Riders: A Two-Stage Robust Approach
| 2023-11-20 | Paper |
Incremental Edge Orientation in Forests
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7646025 (Why is no real title available?)
| 2023-01-25 | Paper |
Scheduling jobs that arrive over time
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Improved length bounds for the shortest superstring problem
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Task scheduling in networks
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity
| 2022-11-30 | Paper |
A competitive algorithm for throughput maximization on identical machines
| 2022-08-16 | Paper |
scientific article; zbMATH DE number 7561507 (Why is no real title available?)
| 2022-07-21 | Paper |
Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)
| 2022-07-21 | Paper |
Submodular secretary problem with shortlists
| 2022-07-18 | Paper |
Distributed algorithms for matching in hypergraphs
| 2022-03-22 | Paper |
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
| 2021-07-28 | Paper |
Parallel approximate undirected shortest paths via low hop emulators
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A general framework for handling commitment in online throughput maximization
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Minimizing maximum flow time on related machines via dynamic posted pricing
| 2020-05-27 | Paper |
The online set aggregation problem
| 2020-02-12 | Paper |
A general framework for handling commitment in online throughput maximization
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Hallucination helps: energy efficient virtual circuit routing
SIAM Journal on Computing | 2020-01-21 | Paper |
Scheduling when you do not know the number of machines
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Solving Maximum Flow Problems on Real World Bipartite Graphs
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Using Markov chains to design algorithms for bounded-space on-line bin cover
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Fast algorithms for knapsack via convolution and prediction
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Maintaining assignments online: matching, scheduling, and flows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Hallucination helps: energy efficient virtual circuit routing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Finding real-valued single-source shortest paths in \(o(n^3)\) expected time
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Faster fully dynamic matchings with small approximation ratios
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Resource cost aware scheduling
European Journal of Operational Research | 2018-05-22 | Paper |
Advance Service Reservations with Heterogeneous Customers
| 2018-05-15 | Paper |
Simultaneously load balancing for every \(p\)-norm, with reassignments
| 2018-05-03 | Paper |
Scheduling when you don't know the number of machines
| 2018-03-15 | Paper |
A fast distributed stateless algorithm for \(\alpha\)-fair packing problems
| 2017-12-19 | Paper |
A 2-competitive algorithm for online convex optimization with switching costs
| 2017-08-31 | Paper |
Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
Algorithmica | 2017-07-07 | Paper |
Rounding algorithms for a geometric embedding of minimum multiway cut
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
Springer Proceedings in Mathematics & Statistics | 2015-12-03 | Paper |
Fully dynamic matching in bipartite graphs
Automata, Languages, and Programming | 2015-10-27 | Paper |
scientific article; zbMATH DE number 6472607 (Why is no real title available?)
| 2015-08-14 | Paper |
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
An Õ(n2) algorithm for minimum cuts
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Grouped distributed queues, distributed queue, proportional share multiprocessor scheduling
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Speed scaling for weighted flow time
| 2014-12-18 | Paper |
Better online buffer management
| 2014-12-18 | Paper |
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms | 2014-12-05 | Paper |
On distributing symmetric streaming computations
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An optimal online algorithm for packet scheduling with agreeable deadlines
| 2014-10-13 | Paper |
LP decoding achieves capacity
| 2014-10-13 | Paper |
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
Operations Research Letters | 2014-05-15 | Paper |
Solving maximum flow problems on real-world bipartite graphs
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Introduction to algorithms.
| 2013-12-12 | Paper |
Multicast routing for energy minimization using speed scaling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
The Complexity of Scheduling for p-Norms of Flow and Stretch
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Approximating semidefinite packing programs
SIAM Journal on Optimization | 2011-06-06 | Paper |
scientific article; zbMATH DE number 5834960 (Why is no real title available?)
| 2011-01-12 | Paper |
How to schedule when you have to buy your energy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Speed scaling for weighted flow time
SIAM Journal on Computing | 2010-09-06 | Paper |
Online stochastic packing applied to display ad allocation
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Divide-and-conquer approximation algorithm for vertex cover
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Feasible and accurate algorithms for covering semidefinite programs
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Introduction to algorithms.
| 2009-12-11 | Paper |
Bounded-space online bin cover
Journal of Scheduling | 2009-12-02 | Paper |
An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
Computational Geometry | 2009-06-18 | Paper |
scientific article; zbMATH DE number 5542185 (Why is no real title available?)
| 2009-04-09 | Paper |
scientific article; zbMATH DE number 5542232 (Why is no real title available?)
| 2009-04-09 | Paper |
scientific article; zbMATH DE number 5542186 (Why is no real title available?)
| 2009-04-09 | Paper |
LP Decoding Corrects a Constant Fraction of Errors
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Vertex Cover Approximations on Random Graphs
Experimental Algorithms | 2008-01-02 | Paper |
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Rounding algorithms for a geometric embedding of minimum multiway cut.
Mathematics of Operations Research | 2005-11-11 | Paper |
scientific article; zbMATH DE number 2119733 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2102785 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2089207 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2084818 (Why is no real title available?)
| 2004-08-09 | Paper |
Approximating disjoint-path problems using packing integer programs
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
scientific article; zbMATH DE number 1893571 (Why is no real title available?)
| 2003-04-07 | Paper |
scientific article; zbMATH DE number 1757971 (Why is no real title available?)
| 2002-06-20 | Paper |
Approximation algorithms for single-source unsplittable flow
SIAM Journal on Computing | 2002-04-23 | Paper |
Optimal time-critical scheduling via resource augmentation
Algorithmica | 2002-03-07 | Paper |
Introduction to algorithms
| 2001-10-14 | Paper |
Approximation techniques for average completion time scheduling
SIAM Journal on Computing | 2001-06-21 | Paper |
scientific article; zbMATH DE number 1559529 (Why is no real title available?)
| 2001-02-28 | Paper |
A \(2_3^2\) superstring approximation algorithm
Discrete Applied Mathematics | 2000-05-25 | Paper |
scientific article; zbMATH DE number 1342140 (Why is no real title available?)
| 1999-09-22 | Paper |
Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
Journal of Algorithms | 1999-08-23 | Paper |
Minimizing average completion time in the presence of release dates
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Improved bounds on relaxations of a parallel machine scheduling problem
Journal of Combinatorial Optimization | 1999-05-05 | Paper |
scientific article; zbMATH DE number 1187149 (Why is no real title available?)
| 1999-04-19 | Paper |
scientific article; zbMATH DE number 1305482 (Why is no real title available?)
| 1999-01-01 | Paper |
scientific article; zbMATH DE number 1187163 (Why is no real title available?)
| 1998-08-10 | Paper |
Task Scheduling in Networks
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
A new approach to the minimum cut problem
Journal of the ACM | 1998-01-22 | Paper |
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
Operations Research Letters | 1998-01-12 | Paper |
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing | 1996-07-04 | Paper |
Fast approximation algorithms for multicommodity flow problems
Journal of Computer and System Sciences | 1995-07-05 | Paper |
scientific article; zbMATH DE number 515936 (Why is no real title available?)
| 1994-09-26 | Paper |
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing | 1994-08-14 | Paper |
Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
SIAM Journal on Computing | 1994-08-14 | Paper |
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters | 1994-04-12 | Paper |
scientific article; zbMATH DE number 432815 (Why is no real title available?)
| 1993-10-20 | Paper |
A parallel algorithm for approximating the minimum cycle cover
Algorithmica | 1993-04-01 | Paper |
Approximating the minimum-cost maximum flow is P-complete
Information Processing Letters | 1993-01-16 | Paper |
A parallel algorithm for eliminating cycles in undirected graphs
Information Processing Letters | 1990-01-01 | Paper |
