1395 search results - page 183 / 279 » (k, )-Distance-Hereditary Graphs |
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
120
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
TCC
2007
Springer
15 years 4 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...