Sciweavers

973 search results - page 37 / 195
» New Bounds on Crossing Numbers
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 4 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
CP
2007
Springer
15 years 6 months ago
Bound-Consistent Deviation Constraint
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Pierre Schaus, Yves Deville, Pierre Dupont
SPIRE
2009
Springer
15 years 4 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
ASIACRYPT
2001
Springer
15 years 3 months ago
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
Yuriy Tarannikov, Peter Korolev, Anton Botev
ICALP
2005
Springer
15 years 5 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...