Sciweavers

9842 search results - page 194 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
STTT
2008
162views more  STTT 2008»
13 years 10 months ago
Coping with large design spaces: design problem solving in fluidic engineering
Abstract This paper is about tool support for knowledgeintensive engineering tasks. In particular, it introduces software technology to assist the design of complex technical syste...
Benno Stein
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 10 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 5 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
ANOR
2011
117views more  ANOR 2011»
13 years 2 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
EUROCRYPT
2006
Springer
14 years 2 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret