WADS B

38 papers

YearTitle / Authors
2005A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs.
David Morgan
2005Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack
2005All-Pairs Shortest Paths with Real Weights in
Timothy M. Chan
2005Analysis of a Class of Tries with Adaptive Multi-digit Branching.
Yuriy A. Reznik
2005Approximating the Online Set Multicover Problems via Randomized Winnowing.
Piotr Berman, Bhaskar DasGupta
2005Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length.
Victor Chepoi, Bertrand Estellon, Yann Vaxès
2005Balanced Aspect Ratio Trees Revisited.
Amitabh Chaudhary, Michael T. Goodrich
2005Communication-Aware Processor Allocation for Supercomputers.
Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
2005Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms.
Shlomo Moran, Sagi Snir
2005Derandomization of Dimensionality Reduction and SDP Based Algorithms.
Ankur Bhargava, S. Rao Kosaraju
2005Dynamic Hotlinks.
Karim Douïeb, Stefan Langerman
2005Heap Building Bounds.
Zhentao Li, Bruce A. Reed
2005Hinged Dissection of Polypolyhedra.
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
2005Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.
Markus Bläser, L. Shankar Ram, Maxim Sviridenko
2005Improved Approximation Bounds for Planar Point Pattern Matching.
Minkyoung Cho, David M. Mount
2005Improved Combinatorial Group Testing for Real-World Problem Sizes.
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2005Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
2005Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes.
Giora Alexandron, Haim Kaplan, Micha Sharir
2005Line-Segment Intersection Made In-Place.
Jan Vahrenhold
2005Linear Time Algorithms for Generalized Edge Dominating Set Problems.
André Berger, Ojas Parekh
2005Max-stretch Reduction for Tree Spanners.
Kazuo Iwama, Andrzej Lingas, Masaki Okita
2005Near-Optimal Pricing in Near-Linear Time.
Jason D. Hartline, Vladlen Koltun
2005On Geometric Dilation and Halving Chords.
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
2005On the Vehicle Routing Problem.
Piotr Berman, Surajit K. Das
2005Orthogonal Subdivisions with Low Stabbing Numbers.
Csaba D. Tóth
2005Parameterized Complexity of Generalized Vertex Cover Problems.
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
2005Parameterized Counting Algorithms for General Graph Covering Problems.
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2005Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices.
Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
2005Subquadratic Algorithms for 3SUM.
Ilya Baran, Erik D. Demaine, Mihai Patrascu
2005Succinct Representation of Triangulations with a Boundary.
Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
2005The Complexity of Implicit and Space Efficient Priority Queues.
Christian Worm Mortensen, Seth Pettie
2005The Minimum-Area Spanning Tree Problem.
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
2005The Multi-radius Cover Problem.
Refael Hassin, Danny Segev
2005The On-line Asymmetric Traveling Salesman Problem.
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
2005The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case.
Mordecai J. Golin, Zhenming Liu
2005Towards a Theory of Algorithms.
Allan Borodin
2005Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.
Gerth Stølting Brodal, Gabriel Moruz
2005k-Restricted Rotation with an Application to Search Tree Rebalancing.
Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli