Sold Out
Book Categories |
Towards a theory of algorithms | 1 | |
k-Restricted rotation with art application to search tree rebalancing | 2 | |
Heap building bounds | 14 | |
The multi-radius cover problem | 24 | |
Parameterized complexity of generalized vertex cover problems | 36 | |
The complexity of implicit and space efficient priority queues | 40 | |
Analysis of a class of tries with adaptive multi-digit branching | 61 | |
Balanced aspect ratio trees revisited | 73 | |
Improved combinatorial croup testing for real-world problem sizes | 86 | |
Parameterized counting algorithms for general graph covering problems | 99 | |
Approximating the online set multicover problems via randomized winnowing | 110 | |
Max-stretch reduction for tree spanners | 122 | |
Succinct representation of triangulations with a boundary | 134 | |
Line-segment intersection made in-place | 146 | |
Improved fixed-parameter algorithms for two feedback set problems | 158 | |
Communication-aware processor allocation for supercomputers | 169 | |
Dynamic hotlinks | 182 | |
The minimum-area spanning tree problem | 195 | |
Hinged dissection of polypolyhedra | 205 | |
Convex recolorings of strings and trees : defnitions, hardness results and algorithms | 218 | |
Linear time algorithms for generalized edge dominating set problems | 233 | |
On geometric dilation and halving chords | 244 | |
Orthogonal subdivisions with low stabbing numbers | 256 | |
Kinetic and dynamic data structures for convex hulls and upper envelopes | 269 | |
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length | 282 | |
A dynamic implicit adjacency labelling schemes for line graphs | 294 | |
The on-line asymmetric traveling salesman problem | 306 | |
All-pairs shortest paths with real weights in O(n[superscript 3]/logn) time | 318 | |
k-Link shortest paths in weighted subdivisions | 325 | |
Power-saving scheduling for weakly dynamic voltage scaling devices | 338 | |
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems | 350 | |
On the vehicle routing problem | 360 | |
The structure of optimal prefix-free codes in restricted languages : the uniform probability case | 372 | |
Tradeoffs between branch mispredictions and comparisons for sorting algorithms | 385 | |
Derandomization of dimensionality reduction and SDP based algorithms | 396 | |
Subquadratic algorithms for 3SUM | 409 | |
Near-optimal pricing in near-linear time | 422 | |
Improved approximation bounds for planar point pattern matching | 432 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionAlgorithms and Data Structures
X
This Item is in Your InventoryAlgorithms and Data Structures
X
You must be logged in to review the productsX
X
X
Add Algorithms and Data Structures, , Algorithms and Data Structures to the inventory that you are selling on WonderClubX
X
Add Algorithms and Data Structures, , Algorithms and Data Structures to your collection on WonderClub |