|
|
Conferences in DBLP
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. [Citation Graph (, )][DBLP]
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. [Citation Graph (, )][DBLP]
Price Fluctuations: To Buy or to Rent. [Citation Graph (, )][DBLP]
Approximation Algorithms for Multiple Strip Packing. [Citation Graph (, )][DBLP]
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. [Citation Graph (, )][DBLP]
Longest Wait First for Broadcast Scheduling [Extended Abstract]. [Citation Graph (, )][DBLP]
The Routing Open Shop Problem: New Approximation Algorithms. [Citation Graph (, )][DBLP]
On the Price of Stability for Undirected Network Design. [Citation Graph (, )][DBLP]
Finding Dense Subgraphs in G(n, 1/2). [Citation Graph (, )][DBLP]
Parameterized Analysis of Paging and List Update Algorithms. [Citation Graph (, )][DBLP]
Online Scheduling of Bounded Length Jobs to Maximize Throughput. [Citation Graph (, )][DBLP]
On the Additive Constant of the k-Server Work Function Algorithm. [Citation Graph (, )][DBLP]
A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. [Citation Graph (, )][DBLP]
Guard Games on Graphs: Keep the Intruder Out! [Citation Graph (, )][DBLP]
Between a Rock and a Hard Place: The Two-to-One Assignment Problem. [Citation Graph (, )][DBLP]
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. [Citation Graph (, )][DBLP]
Online Minimization Knapsack Problem. [Citation Graph (, )][DBLP]
Optimization Problems in Multiple Subtree Graphs. [Citation Graph (, )][DBLP]
Multi-Criteria TSP: Min and Max Combined. [Citation Graph (, )][DBLP]
Packet Routing: Complexity and Algorithms. [Citation Graph (, )][DBLP]
Minimal Cost Reconfiguration of Data Placement in Storage Area Network. [Citation Graph (, )][DBLP]
Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing. [Citation Graph (, )][DBLP]
|
