The SCEAS System
Navigation Menu

Conferences in DBLP

European Symposium on Algorithms (ESA) (esa)
2010 (conf/esa/2010-1)


  1. The Robustness of Level Sets. [Citation Graph (, )][DBLP]


  2. Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. [Citation Graph (, )][DBLP]


  3. Non-clairvoyant Speed Scaling for Weighted Flow Time. [Citation Graph (, )][DBLP]


  4. A Robust PTAS for Machine Covering and Packing. [Citation Graph (, )][DBLP]


  5. Balancing Degree, Diameter and Weight in Euclidean Spanners. [Citation Graph (, )][DBLP]


  6. Testing Euclidean Spanners. [Citation Graph (, )][DBLP]


  7. Fast Approximation in Subspaces by Doubling Metric Decomposition. [Citation Graph (, )][DBLP]


  8. f-Sensitivity Distance Oracles and Routing Schemes. [Citation Graph (, )][DBLP]


  9. Fast Minor Testing in Planar Graphs. [Citation Graph (, )][DBLP]


  10. On the Number of Spanning Trees a Planar Graph Can Have. [Citation Graph (, )][DBLP]


  11. Contractions of Planar Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  12. Communication Complexity of Quasirandom Rumor Spreading. [Citation Graph (, )][DBLP]


  13. A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing. [Citation Graph (, )][DBLP]


  14. Contribution Games in Social Networks. [Citation Graph (, )][DBLP]


  15. Improved Bounds for Online Stochastic Matching. [Citation Graph (, )][DBLP]


  16. Online Stochastic Packing Applied to Display Ad Allocation. [Citation Graph (, )][DBLP]


  17. Caching Is Hard - Even in the Fault Model. [Citation Graph (, )][DBLP]


  18. Superselectors: Efficient Constructions and Applications. [Citation Graph (, )][DBLP]


  19. Estimating the Average of a Lipschitz-Continuous Function from One Sample. [Citation Graph (, )][DBLP]


  20. Streaming Graph Computations with a Helpful Advisor. [Citation Graph (, )][DBLP]


  21. Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract). [Citation Graph (, )][DBLP]


  22. Minimum Vertex Cover in Rectangle Graphs. [Citation Graph (, )][DBLP]


  23. Feedback Vertex Sets in Tournaments. [Citation Graph (, )][DBLP]


  24. n-Level Graph Partitioning. [Citation Graph (, )][DBLP]


  25. Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. [Citation Graph (, )][DBLP]


  26. Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. [Citation Graph (, )][DBLP]


  27. Budgeted Red-Blue Median and Its Generalizations. [Citation Graph (, )][DBLP]


  28. All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. [Citation Graph (, )][DBLP]


  29. Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. [Citation Graph (, )][DBLP]


  30. Robust Algorithms for Sorting Railway Cars. [Citation Graph (, )][DBLP]


  31. Cloning Voronoi Diagrams via Retroactive Data Structures. [Citation Graph (, )][DBLP]


  32. A Unified Approach to Approximate Proximity Searching. [Citation Graph (, )][DBLP]


  33. Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. [Citation Graph (, )][DBLP]


  34. Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location. [Citation Graph (, )][DBLP]


  35. Local Graph Exploration and Fast Property Testing. [Citation Graph (, )][DBLP]


  36. A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. [Citation Graph (, )][DBLP]


  37. Fast Prefix Search in Little Space, with Applications. [Citation Graph (, )][DBLP]


  38. On the Huffman and Alphabetic Tree Problem with General Cost Functions. [Citation Graph (, )][DBLP]


  39. Medium-Space Algorithms for Inverse BWT. [Citation Graph (, )][DBLP]


  40. Median Trajectories. [Citation Graph (, )][DBLP]


  41. Optimal Cover of Points by Disks in a Simple Polygon. [Citation Graph (, )][DBLP]


  42. Stability of epsilon-Kernels. [Citation Graph (, )][DBLP]


  43. The Geodesic Diameter of Polygonal Domains. [Citation Graph (, )][DBLP]


  44. Polyhedral and Algorithmic Properties of Quantified Linear Programs. [Citation Graph (, )][DBLP]


  45. Approximating Parameterized Convex Optimization Problems. [Citation Graph (, )][DBLP]


  46. Approximation Schemes for Multi-Budgeted Independence Systems. [Citation Graph (, )][DBLP]


  47. Algorithmic Meta-theorems for Restrictions of Treewidth. [Citation Graph (, )][DBLP]


  48. Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. [Citation Graph (, )][DBLP]


  49. Constructing the R* Consensus Tree of Two Trees in Subcubic Time. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002