Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IWOCA
2010
Springer
229views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
IWOCA
2010
Springer
195views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Upper and Lower I/O Bounds for Pebbling r-Pyramids
Desh Ranjan, John E. Savage, Mohammad Zubair
IWOCA
2010
Springer
185views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Efficient Connectivity Testing of Hypercubic Networks with Faults
Tomás Dvorák, Jirí Fink, Petr...
IWOCA
2010
Springer
240views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Path-Based Supports for Hypergraphs
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A...
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
10 years 8 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
books