Conferences in DBLP

(cocoa)
2009 (conf/cocoa/2009)

1. 
   Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. [Citation Graph (, )][DBLP]
   
   
2. 
   A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices. [Citation Graph (, )][DBLP]
   
   
3. 
   A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines. [Citation Graph (, )][DBLP]
   
   
4. 
   A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs. [Citation Graph (, )][DBLP]
   
   
5. 
   DNA Library Screening, Pooling Design and Unitary Spaces. [Citation Graph (, )][DBLP]
   
   
6. 
   Improved Algorithms for the Gene Team Problem. [Citation Graph (, )][DBLP]
   
   
7. 
   Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting. [Citation Graph (, )][DBLP]
   
   
8. 
   Generalized Russian Cards Problem. [Citation Graph (, )][DBLP]
   
   
9. 
   Computing the Transitive Closure of a Union of Affine Integer Tuple Relations. [Citation Graph (, )][DBLP]
   
   
10. 
    Matching Techniques Ride to Rescue OLED Displays. [Citation Graph (, )][DBLP]
    
    
11. 
    On Open Rectangle-of-Influence Drawings of Planar Graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems. [Citation Graph (, )][DBLP]
    
    
13. 
    Variable-Size Rectangle Covering. [Citation Graph (, )][DBLP]
    
    
14. 
    On-Line Multiple-Strip Packing. [Citation Graph (, )][DBLP]
    
    
15. 
    A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game. [Citation Graph (, )][DBLP]
    
    
16. 
    Improved Bounds for Facility Location Games with Fair Cost Allocation. [Citation Graph (, )][DBLP]
    
    
17. 
    Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    On Construction of Almost-Ramanujan Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    A 2log2(n)-Approximation Algorithm for Directed Tour Cover. [Citation Graph (, )][DBLP]
    
    
20. 
    Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation. [Citation Graph (, )][DBLP]
    
    
21. 
    Hamiltonian Decomposition of Some Interconnection Networks. [Citation Graph (, )][DBLP]
    
    
22. 
    Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge. [Citation Graph (, )][DBLP]
    
    
23. 
    A Note on Edge Choosability and Degeneracy of Planar Graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices. [Citation Graph (, )][DBLP]
    
    
25. 
    On Integrity of Harary Graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    A Note on n-Critical Bipartite Graphs and Its Application. [Citation Graph (, )][DBLP]
    
    
27. 
    Real-Time Algorithm Scheme for n-Vehicle Exploration Problem. [Citation Graph (, )][DBLP]
    
    
28. 
    Deterministically Estimating Data Stream Frequencies. [Citation Graph (, )][DBLP]
    
    
29. 
    Positive Influence Dominating Set in Online Social Networks. [Citation Graph (, )][DBLP]
    
    
30. 
    Optimal Algorithms for the Online Time Series Search Problem. [Citation Graph (, )][DBLP]
    
    
31. 
    A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information. [Citation Graph (, )][DBLP]
    
    
32. 
    Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine. [Citation Graph (, )][DBLP]
    
    
33. 
    A Note on Online Scheduling for Jobs with Arbitrary Release Times. [Citation Graph (, )][DBLP]
    
    
34. 
    Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem. [Citation Graph (, )][DBLP]
    
    
35. 
    On Disjoint Shortest Paths Routing on the Hypercube. [Citation Graph (, )][DBLP]
    
    
36. 
    A New Approach for Rearrangeable Multicast Switching Networks. [Citation Graph (, )][DBLP]
    
    
37. 
    Bicriteria Scheduling on Single-Machine with Inventory Operations. [Citation Graph (, )][DBLP]
    
    
38. 
    Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine. [Citation Graph (, )][DBLP]
    
    
39. 
    Scheduling with Rejection to Minimize the Makespan. [Citation Graph (, )][DBLP]
    
    
40. 
    Scheduling Problems in Cross Docking. [Citation Graph (, )][DBLP]
    
    
41. 
    Makespan Minimization with Machine Availability Constraints. [Citation Graph (, )][DBLP]
    
    
42. 
    A Mathematical Programming Approach for Online Hierarchical Scheduling. [Citation Graph (, )][DBLP]
    
    
43. 
    Recoverable Robust Timetables on Trees. [Citation Graph (, )][DBLP]
    
    
44. 
    Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems. [Citation Graph (, )][DBLP]
    
    
45. 
    Integrated Production and Delivery Scheduling with Disjoint Windows. [Citation Graph (, )][DBLP]
    
    
46. 
    Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks. [Citation Graph (, )][DBLP]
    
    
47. 
    A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks. [Citation Graph (, )][DBLP]
    
    
48. 
    Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas. [Citation Graph (, )][DBLP]
    
    
49. 
    Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. [Citation Graph (, )][DBLP]
    
    
50. 
    An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. [Citation Graph (, )][DBLP]