Sciweavers

135
Voted
JDA
2010
122views more  JDA 2010»
14 years 10 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
113
Voted
JDA
2010
98views more  JDA 2010»
15 years 1 months ago
Fast index for approximate string matching
Dekel Tsur
JDA
2010
77views more  JDA 2010»
15 years 1 months ago
Computing sharp 2-factors in claw-free graphs
Hajo Broersma, Daniël Paulusma
JDA
2010
131views more  JDA 2010»
15 years 1 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
JDA
2010
71views more  JDA 2010»
15 years 1 months ago
On the generalized Berge sorting conjecture
Antoine Deza, Feng Xie
94
Voted
JDA
2010
94views more  JDA 2010»
15 years 1 months ago
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. H...
103
Voted
JDA
2010
88views more  JDA 2010»
15 years 1 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
125
Voted
JDA
2010
159views more  JDA 2010»
15 years 1 months ago
Popular matchings in the weighted capacitated house allocation problem
Colin T. S. Sng, David Manlove