Sciweavers

Share
ALGORITHMICA
2008
71views more  ALGORITHMICA 2008»
9 years 5 months ago
Improved Approximate String Matching Using Compressed Suffix Data Structures
Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong
ALGORITHMICA
2008
95views more  ALGORITHMICA 2008»
9 years 5 months ago
Optimality in External Memory Hashing
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
Morten Skaarup Jensen, Rasmus Pagh
ALGORITHMICA
2008
72views more  ALGORITHMICA 2008»
9 years 5 months ago
Treewidth Lower Bounds with Brambles
Hans L. Bodlaender, Alexander Grigoriev, Arie M. C...
ALGORITHMICA
2008
110views more  ALGORITHMICA 2008»
9 years 5 months ago
Bandwidth-Constrained Allocation in Grid Computing
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
Anshul Kothari, Subhash Suri, Yunhong Zhou
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
9 years 5 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
ALGORITHMICA
2008
88views more  ALGORITHMICA 2008»
9 years 5 months ago
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
Andreas Björklund, Thore Husfeldt
ALGORITHMICA
2008
115views more  ALGORITHMICA 2008»
9 years 5 months ago
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
Falk Hüffner, Sebastian Wernicke, Thomas Zich...
ALGORITHMICA
2008
95views more  ALGORITHMICA 2008»
9 years 5 months ago
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, I...
ALGORITHMICA
2008
42views more  ALGORITHMICA 2008»
9 years 5 months ago
Solving Connected Dominating Set Faster than 2 n
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
9 years 5 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
books