The SCEAS System
Navigation Menu

Conferences in DBLP

European Symposium on Algorithms (ESA) (esa)
2008 (conf/esa/2008)

  1. Flexible Path Planning Using Corridor Maps. [Citation Graph (, )][DBLP]

  2. A Bridging Model for Multi-core Computing. [Citation Graph (, )][DBLP]

  3. Robust Kinetic Convex Hulls in 3D. [Citation Graph (, )][DBLP]

  4. On Dominance Reporting in 3D. [Citation Graph (, )][DBLP]

  5. Stabbing Convex Polygons with a Segment or a Polygon. [Citation Graph (, )][DBLP]

  6. An Efficient Algorithm for 2D Euclidean 2-Center with Outliers. [Citation Graph (, )][DBLP]

  7. A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. [Citation Graph (, )][DBLP]

  8. Cache-Oblivious Red-Blue Line Segment Intersection. [Citation Graph (, )][DBLP]

  9. The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. [Citation Graph (, )][DBLP]

  10. Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. [Citation Graph (, )][DBLP]

  11. A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. [Citation Graph (, )][DBLP]

  12. Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. [Citation Graph (, )][DBLP]

  13. Straight Skeletons of Three-Dimensional Polyhedra. [Citation Graph (, )][DBLP]

  14. Randomized Competitive Analysis for Two-Server Problems. [Citation Graph (, )][DBLP]

  15. Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. [Citation Graph (, )][DBLP]

  16. Approximating Multi-criteria Max-TSP. [Citation Graph (, )][DBLP]

  17. An Integer Programming Algorithm for Routing Optimization in IP Networks. [Citation Graph (, )][DBLP]

  18. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. [Citation Graph (, )][DBLP]

  19. Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. [Citation Graph (, )][DBLP]

  20. Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. [Citation Graph (, )][DBLP]

  21. A Practical Quicksort Algorithm for Graphics Processors. [Citation Graph (, )][DBLP]

  22. Bloomier Filters: A Second Look. [Citation Graph (, )][DBLP]

  23. Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy. [Citation Graph (, )][DBLP]

  24. A New Approach to Exact Crossing Minimization. [Citation Graph (, )][DBLP]

  25. A Characterization of 2-Player Mechanisms for Scheduling. [Citation Graph (, )][DBLP]

  26. A Local-Search 2-Approximation for 2-Correlation-Clustering. [Citation Graph (, )][DBLP]

  27. The Alcuin Number of a Graph. [Citation Graph (, )][DBLP]

  28. Time-Dependent SHARC-Routing. [Citation Graph (, )][DBLP]

  29. Detecting Regular Visit Patterns. [Citation Graph (, )][DBLP]

  30. Improved Approximation Algorithms for Relay Placement. [Citation Graph (, )][DBLP]

  31. Selfish Bin Packing. [Citation Graph (, )][DBLP]

  32. Improved Randomized Results for That Interval Selection Problem. [Citation Graph (, )][DBLP]

  33. Succinct Representations of Arbitrary Graphs. [Citation Graph (, )][DBLP]

  34. Edge Coloring and Decompositions of Weighted Graphs. [Citation Graph (, )][DBLP]

  35. The Complexity of Sorting with Networks of Stacks and Queues. [Citation Graph (, )][DBLP]

  36. Faster Steiner Tree Computation in Polynomial-Space. [Citation Graph (, )][DBLP]

  37. Fitting a Step Function to a Point Set. [Citation Graph (, )][DBLP]

  38. Faster Swap Edge Computation in Minimum Diameter Spanning Trees. [Citation Graph (, )][DBLP]

  39. The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. [Citation Graph (, )][DBLP]

  40. An Optimal Dynamic Spanner for Doubling Metric Spaces. [Citation Graph (, )][DBLP]

  41. RFQ: Redemptive Fair Queuing. [Citation Graph (, )][DBLP]

  42. Range Medians. [Citation Graph (, )][DBLP]

  43. Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. [Citation Graph (, )][DBLP]

  44. Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison. [Citation Graph (, )][DBLP]

  45. On the Complexity of Optimal Hotlink Assignment. [Citation Graph (, )][DBLP]

  46. Oblivious Randomized Direct Search for Real-Parameter Optimization. [Citation Graph (, )][DBLP]

  47. Path Minima in Incremental Unrooted Trees. [Citation Graph (, )][DBLP]

  48. Improved Competitive Performance Bounds for CIOQ Switches. [Citation Graph (, )][DBLP]

  49. Two-Stage Robust Network Design with Exponential Scenarios. [Citation Graph (, )][DBLP]

  50. An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. [Citation Graph (, )][DBLP]

  51. More Robust Hashing: Cuckoo Hashing with a Stash. [Citation Graph (, )][DBLP]

  52. Better and Simpler Approximation Algorithms for the Stable Marriage Problem. [Citation Graph (, )][DBLP]

  53. Edit Distances and Factorisations of Even Permutations. [Citation Graph (, )][DBLP]

  54. Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. [Citation Graph (, )][DBLP]

  55. Facility Location in Dynamic Geometric Data Streams. [Citation Graph (, )][DBLP]

  56. The Effects of Local Randomness in the Adversarial Queueing Model. [Citation Graph (, )][DBLP]

  57. Parallel Imaging Problem. [Citation Graph (, )][DBLP]

  58. An Online Algorithm for Finding the Longest Previous Factors. [Citation Graph (, )][DBLP]

  59. Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. [Citation Graph (, )][DBLP]

  60. Improved BDD Algorithms for the Simulation of Quantum Circuits. [Citation Graph (, )][DBLP]

  61. Mobile Route Planning. [Citation Graph (, )][DBLP]

  62. How Reliable Are Practical Point-in-Polygon Strategies?. [Citation Graph (, )][DBLP]

  63. Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. [Citation Graph (, )][DBLP]

  64. Approximability of Average Completion Time Scheduling on Unrelated Machines. [Citation Graph (, )][DBLP]

  65. Relative Convex Hulls in Semi-dynamic Subdivisions. [Citation Graph (, )][DBLP]

  66. An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. [Citation Graph (, )][DBLP]

  67. On the Size of the 3D Visibility Skeleton: Experimental Results. [Citation Graph (, )][DBLP]

  68. An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. [Citation Graph (, )][DBLP]

  69. Deterministic Sampling Algorithms for Network Design. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002