Sciweavers

WALCOM
2010
IEEE
232views Algorithms» more  WALCOM 2010»
14 years 6 months ago
Cutting a Convex Polyhedron Out of a Sphere
Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Isla...
WALCOM
2010
IEEE
238views Algorithms» more  WALCOM 2010»
14 years 6 months ago
FPT Algorithms for Connected Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
14 years 6 months ago
Parallel Algorithms for Encoding and Decoding Blob Code
Saverio Caminiti, Rossella Petreschi
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 6 months ago
Harmonious Coloring on Subclasses of Colinear Graphs
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
Kyriaki Ioannidou, Stavros D. Nikolopoulos
WALCOM
2010
IEEE
206views Algorithms» more  WALCOM 2010»
14 years 6 months ago
Crossings between Curves with Many Tangencies
Let A and B be two families of two-way infinite x-monotone curves, no three of which pass through the same point. Assume that every curve in A lies above every curve in B and that...
Jacob Fox, Fabrizio Frati, János Pach, Rom ...
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 6 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 6 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
CVPR
2010
IEEE
14 years 7 months ago
Manifold Blurring Mean Shift Algorithms
We propose a new family of algorithms for denoising data assumed to lie on a low-dimensional manifold. The algorithms are based on the blurring mean-shift update, which moves each...
Weiran Wang, Miguel Carreira-perpinan
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 9 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
14 years 9 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...