The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Allan Borodin
    Towards a Theory of Algorithms. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:1- [Conf]
  2. Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli
    k-Restricted Rotation with an Application to Search Tree Rebalancing. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:2-13 [Conf]
  3. Zhentao Li, Bruce A. Reed
    Heap Building Bounds. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:14-23 [Conf]
  4. Refael Hassin, Danny Segev
    The Multi-radius Cover Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:24-35 [Conf]
  5. Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    Parameterized Complexity of Generalized Vertex Cover Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:36-48 [Conf]
  6. Christian Worm Mortensen, Seth Pettie
    The Complexity of Implicit and Space Efficient Priority Queues. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:49-60 [Conf]
  7. Yuriy A. Reznik
    Analysis of a Class of Tries with Adaptive Multi-digit Branching. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:61-72 [Conf]
  8. Amitabh Chaudhary, Michael T. Goodrich
    Balanced Aspect Ratio Trees Revisited. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:73-85 [Conf]
  9. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:86-98 [Conf]
  10. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Parameterized Counting Algorithms for General Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:99-109 [Conf]
  11. Piotr Berman, Bhaskar DasGupta
    Approximating the Online Set Multicover Problems via Randomized Winnowing. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:110-121 [Conf]
  12. Kazuo Iwama, Andrzej Lingas, Masaki Okita
    Max-stretch Reduction for Tree Spanners. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:122-133 [Conf]
  13. Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
    Succinct Representation of Triangulations with a Boundary. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:134-145 [Conf]
  14. Jan Vahrenhold
    Line-Segment Intersection Made In-Place. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:146-157 [Conf]
  15. Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
    Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:158-168 [Conf]
  16. Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
    Communication-Aware Processor Allocation for Supercomputers. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:169-181 [Conf]
  17. Karim Douïeb, Stefan Langerman
    Dynamic Hotlinks. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:182-194 [Conf]
  18. Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
    The Minimum-Area Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:195-204 [Conf]
  19. Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
    Hinged Dissection of Polypolyhedra. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:205-217 [Conf]
  20. Shlomo Moran, Sagi Snir
    Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:218-232 [Conf]
  21. André Berger, Ojas Parekh
    Linear Time Algorithms for Generalized Edge Dominating Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:233-243 [Conf]
  22. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
    On Geometric Dilation and Halving Chords. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:244-255 [Conf]
  23. Csaba D. Tóth
    Orthogonal Subdivisions with Low Stabbing Numbers. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:256-268 [Conf]
  24. Giora Alexandron, Haim Kaplan, Micha Sharir
    Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:269-281 [Conf]
  25. Victor Chepoi, Bertrand Estellon, Yann Vaxès
    Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:282-293 [Conf]
  26. David Morgan
    A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:294-305 [Conf]
  27. Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
    The On-line Asymmetric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:306-317 [Conf]
  28. Timothy M. Chan
    All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:318-324 [Conf]
  29. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
    k-Link Shortest Paths in Weighted Subdivisions. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:325-337 [Conf]
  30. Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
    Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:338-349 [Conf]
  31. Markus Bläser, L. Shankar Ram, Maxim Sviridenko
    Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:350-359 [Conf]
  32. Piotr Berman, Surajit K. Das
    On the Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:360-371 [Conf]
  33. Mordecai J. Golin, Zhenming Liu
    The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:372-384 [Conf]
  34. Gerth Stølting Brodal, Gabriel Moruz
    Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:385-395 [Conf]
  35. Ankur Bhargava, S. Rao Kosaraju
    Derandomization of Dimensionality Reduction and SDP Based Algorithms. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:396-408 [Conf]
  36. Ilya Baran, Erik D. Demaine, Mihai Patrascu
    Subquadratic Algorithms for 3SUM. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:409-421 [Conf]
  37. Jason D. Hartline, Vladlen Koltun
    Near-Optimal Pricing in Near-Linear Time. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:422-431 [Conf]
  38. Minkyoung Cho, David M. Mount
    Improved Approximation Bounds for Planar Point Pattern Matching. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:432-443 [Conf]
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