The SCEAS System
Navigation Menu

Conferences in DBLP

Workshop on Algorithms and Data Structures (WADS) (wads)
2009 (conf/wads/2009)

  1. On the Power of the Semi-Separated Pair Decomposition. [Citation Graph (, )][DBLP]

  2. Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]

  3. Straight-Line Rectangular Drawings of Clustered Graphs. [Citation Graph (, )][DBLP]

  4. Online Priority Steiner Tree Problems. [Citation Graph (, )][DBLP]

  5. Connect the Dot: Computing Feed-Links with Minimum Dilation. [Citation Graph (, )][DBLP]

  6. Minimal Locked Trees. [Citation Graph (, )][DBLP]

  7. Approximating Transitive Reductions for Directed Networks. [Citation Graph (, )][DBLP]

  8. 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. [Citation Graph (, )][DBLP]

  9. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. [Citation Graph (, )][DBLP]

  10. A Distribution-Sensitive Dictionary with Low Space Overhead. [Citation Graph (, )][DBLP]

  11. A Comparison of Performance Measures for Online Algorithms. [Citation Graph (, )][DBLP]

  12. Delaunay Triangulation of Imprecise Points Simplified and Extended. [Citation Graph (, )][DBLP]

  13. An Improved SAT Algorithm in Terms of Formula Length. [Citation Graph (, )][DBLP]

  14. Shortest Path Problems on a Polyhedral Surface. [Citation Graph (, )][DBLP]

  15. Approximation Algorithms for Buy-at-Bulk Geometric Network Design. [Citation Graph (, )][DBLP]

  16. Rank-Sensitive Priority Queues. [Citation Graph (, )][DBLP]

  17. Algorithms Meet Art, Puzzles, and Magic. [Citation Graph (, )][DBLP]

  18. Skip-Splay: Toward Achieving the Unified Bound in the BST Model. [Citation Graph (, )][DBLP]

  19. Drawing Graphs with Right Angle Crossings. [Citation Graph (, )][DBLP]

  20. Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. [Citation Graph (, )][DBLP]

  21. Efficient Construction of Near-Optimal Binary and Multiway Search Trees. [Citation Graph (, )][DBLP]

  22. On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. [Citation Graph (, )][DBLP]

  23. On Reconfiguration of Disks in the Plane and Related Problems. [Citation Graph (, )][DBLP]

  24. Orientation-Constrained Rectangular Layouts. [Citation Graph (, )][DBLP]

  25. The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. [Citation Graph (, )][DBLP]

  26. Optimal Embedding into Star Metrics. [Citation Graph (, )][DBLP]

  27. Online Square Packing. [Citation Graph (, )][DBLP]

  28. Worst-Case Optimal Adaptive Prefix Coding. [Citation Graph (, )][DBLP]

  29. New Results on Visibility in Simple Polygons. [Citation Graph (, )][DBLP]

  30. Dynamic Graph Clustering Using Minimum-Cut Trees. [Citation Graph (, )][DBLP]

  31. Rank-Balanced Trees. [Citation Graph (, )][DBLP]

  32. Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. [Citation Graph (, )][DBLP]

  33. Reconfiguration of List Edge-Colorings in a Graph. [Citation Graph (, )][DBLP]

  34. The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. [Citation Graph (, )][DBLP]

  35. Two for One: Tight Approximation of 2D Bin Packing. [Citation Graph (, )][DBLP]

  36. Fault Tolerant External Memory Algorithms. [Citation Graph (, )][DBLP]

  37. Inspecting a Set of Strips Optimally. [Citation Graph (, )][DBLP]

  38. A Pseudopolynomial Algorithm for Alexandrov's Theorem. [Citation Graph (, )][DBLP]

  39. A Scheme for Computing Minimum Covers within Simple Regions. [Citation Graph (, )][DBLP]

  40. Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. [Citation Graph (, )][DBLP]

  41. Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. [Citation Graph (, )][DBLP]

  42. Streaming Embeddings with Slack. [Citation Graph (, )][DBLP]

  43. Computing the Implicit Voronoi Diagram in Triple Precision. [Citation Graph (, )][DBLP]

  44. Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. [Citation Graph (, )][DBLP]

  45. Integer Programming: Optimization and Evaluation Are Equivalent. [Citation Graph (, )][DBLP]

  46. Resolving Loads with Positive Interior Stresses. [Citation Graph (, )][DBLP]

  47. On Making Directed Graphs Transitive. [Citation Graph (, )][DBLP]

  48. Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees. [Citation Graph (, )][DBLP]

  49. Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. [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