Conferences in DBLP

Algorithmic Applications in Management (aaim)
2008 (conf/aaim/2008)

1. 
   Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. [Citation Graph (, )][DBLP]
   
   
2. 
   Nash Bargaining Via Flexible Budget Markets. [Citation Graph (, )][DBLP]
   
   
3. 
   On the Minimum Hitting Set of Bundles Problem. [Citation Graph (, )][DBLP]
   
   
4. 
   Speed Scaling with a Solar Cell. [Citation Graph (, )][DBLP]
   
   
5. 
   Engineering Label-Constrained Shortest-Path Algorithms. [Citation Graph (, )][DBLP]
   
   
6. 
   New Upper Bounds on Continuous Tree Edge-Partition Problem. [Citation Graph (, )][DBLP]
   
   
7. 
   A Meeting Scheduling Problem Respecting Time and Space. [Citation Graph (, )][DBLP]
   
   
8. 
   Fixed-Parameter Algorithms for Kemeny Scores. [Citation Graph (, )][DBLP]
   
   
9. 
   The Distributed Wireless Gathering Problem. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. [Citation Graph (, )][DBLP]
    
    
11. 
    An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. [Citation Graph (, )][DBLP]
    
    
12. 
    Line Facility Location in Weighted Regions. [Citation Graph (, )][DBLP]
    
    
13. 
    Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. [Citation Graph (, )][DBLP]
    
    
14. 
    Engineering Comparators for Graph Clusterings. [Citation Graph (, )][DBLP]
    
    
15. 
    On the Fast Searching Problem. [Citation Graph (, )][DBLP]
    
    
16. 
    Confidently Cutting a Cake into Approximately Fair Pieces. [Citation Graph (, )][DBLP]
    
    
17. 
    Copeland Voting Fully Resists Constructive Control. [Citation Graph (, )][DBLP]
    
    
18. 
    The Complexity of Power-Index Comparison. [Citation Graph (, )][DBLP]
    
    
19. 
    Facility Location Problems: A Parameterized View. [Citation Graph (, )][DBLP]
    
    
20. 
    Shortest Path Queries in Polygonal Domains. [Citation Graph (, )][DBLP]
    
    
21. 
    A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. [Citation Graph (, )][DBLP]
    
    
22. 
    Minimum Cost Homomorphism Dichotomy for Oriented Cycles. [Citation Graph (, )][DBLP]
    
    
23. 
    Minimum Leaf Out-Branching Problems. [Citation Graph (, )][DBLP]
    
    
24. 
    Graphs and Path Equilibria. [Citation Graph (, )][DBLP]
    
    
25. 
    No lGrid-Points in Spaces of Small Dimension. [Citation Graph (, )][DBLP]
    
    
26. 
    The Secret Santa Problem. [Citation Graph (, )][DBLP]
    
    
27. 
    Finding Optimal Refueling Policies in Transportation Networks. [Citation Graph (, )][DBLP]
    
    
28. 
    Scale Free Interval Graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    On Representation of Planar Graphs by Segments. [Citation Graph (, )][DBLP]
    
    
30. 
    An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the l_p Norm. [Citation Graph (, )][DBLP]
    
    
31. 
    An Optimal Strategy for Online Non-uniform Length Order Scheduling. [Citation Graph (, )][DBLP]
    
    
32. 
    Large-Scale Parallel Collaborative Filtering for the Netflix Prize. [Citation Graph (, )][DBLP]