Sciweavers

JDA
2010
122views more  JDA 2010»
13 years 5 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
JDA
2010
77views more  JDA 2010»
13 years 9 months ago
Computing sharp 2-factors in claw-free graphs
Hajo Broersma, Daniël Paulusma
JDA
2010
131views more  JDA 2010»
13 years 9 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»
13 years 9 months ago
On the generalized Berge sorting conjecture
Antoine Deza, Feng Xie
JDA
2010
88views more  JDA 2010»
13 years 9 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...