Sciweavers

TALG
2010
83views more  TALG 2010»
13 years 5 months ago
Finding shortest contractible and shortest separating cycles in embedded graphs
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
Sergio Cabello
TCS
2011
13 years 5 months ago
The three column Bandpass problem is solvable in linear time
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
Zhong Li, Guohui Lin
JCSS
2011
95views more  JCSS 2011»
13 years 5 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
CROSSROADS
2007
113views more  CROSSROADS 2007»
13 years 11 months ago
On the complexity of Katamari Damacy
We analyze the complexity of the popular PlayStation 2 game, Katamari Damacy. In particular, we prove that playing Katamari Damacy optimally is NP-hard and that it cannot be appro...
Gregory M. Zaverucha
DAM
2006
136views more  DAM 2006»
13 years 11 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
CATS
2008
14 years 11 days ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono