Conferences in DBLP

(faw)
2010 (conf/faw/2010)

1. 
   Progress on Certifying Algorithms. [Citation Graph (, )][DBLP]
   
   
2. 
   Computational Geometry for Uncertain Data - (Abstract of Keynote Talk). [Citation Graph (, )][DBLP]
   
   
3. 
   On Foundations of Services Interoperation in Cloud Computing. [Citation Graph (, )][DBLP]
   
   
4. 
   Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets. [Citation Graph (, )][DBLP]
   
   
5. 
   Truthful Auction for CPU Time Slots. [Citation Graph (, )][DBLP]
   
   
6. 
   Top-d Rank Aggregation in Web Meta-search Engine - (Extended Abstract). [Citation Graph (, )][DBLP]
   
   
7. 
   Minimum Common String Partition Revisited. [Citation Graph (, )][DBLP]
   
   
8. 
   Inapproximability of Maximal Strip Recovery: II. [Citation Graph (, )][DBLP]
   
   
9. 
   Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximation Schemes for Scheduling with Availability Constraints. [Citation Graph (, )][DBLP]
    
    
11. 
    An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding epsilon-Approximate Quantiles in a Data Stream. [Citation Graph (, )][DBLP]
    
    
12. 
    Improved Sublinear Time Algorithm for Width-Bounded Separators. [Citation Graph (, )][DBLP]
    
    
13. 
    Constant Time Generation of Biconnected Rooted Plane Graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Solving General Lattice Puzzles. [Citation Graph (, )][DBLP]
    
    
15. 
    A Hybrid Graph Representation for Recursive Backtracking Algorithms. [Citation Graph (, )][DBLP]
    
    
16. 
    On Tractable Exponential Sums. [Citation Graph (, )][DBLP]
    
    
17. 
    Recognizing d-Interval Graphs and d-Track Interval Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Categorial Semantics of a Solution to Distributed Dining Philosophers Problem. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximation Algorithms for the Capacitated Domination Problem. [Citation Graph (, )][DBLP]
    
    
20. 
    A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle. [Citation Graph (, )][DBLP]
    
    
21. 
    FPTAS's for Some Cut Problems in Weighted Trees. [Citation Graph (, )][DBLP]
    
    
22. 
    Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. [Citation Graph (, )][DBLP]
    
    
23. 
    Online Algorithms for the Newsvendor Problem with and without Censored Demands. [Citation Graph (, )][DBLP]
    
    
24. 
    O((logn)²) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. [Citation Graph (, )][DBLP]
    
    
25. 
    Path Separability of Graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. [Citation Graph (, )][DBLP]
    
    
27. 
    Computing Minimum Diameter Color-Spanning Sets. [Citation Graph (, )][DBLP]
    
    
28. 
    Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares. [Citation Graph (, )][DBLP]
    
    
29. 
    Optimum Sweeps of Simple Polygons with Two Guards. [Citation Graph (, )][DBLP]
    
    
30. 
    Adaptive Algorithms for Planar Convex Hull Problems. [Citation Graph (, )][DBLP]
    
    
31. 
    New Algorithms for Barrier Coverage with Mobile Sensors. [Citation Graph (, )][DBLP]