Sciweavers

ACID
2006
518views Algorithms» more  ACID 2006»
14 years 12 days ago
The Computer System GRAPHOGRAPH
Vadim E. Zverovich
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 12 days ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
ACID
2006
237views Algorithms» more  ACID 2006»
14 years 12 days ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos
ACID
2006
264views Algorithms» more  ACID 2006»
14 years 12 days ago
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Dániel Marx
ACID
2006
239views Algorithms» more  ACID 2006»
14 years 12 days ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
ACID
2006
220views Algorithms» more  ACID 2006»
14 years 12 days ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
ACID
2006
352views Algorithms» more  ACID 2006»
14 years 12 days ago
Matrix Robustness, with an Application to Power System Observability
Matthias Brosemann, Jochen Alber, Falk Hüffne...