DAM
2016
10 years 1 months ago
2016
Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with particular properties rely on bounding the treewidth of the ...
DAM
2016
10 years 1 months ago
2016
Given a set of n random events in a probability space, represented by n Bernoulli variables, we consider the probability that k out of n events occur. When partial distribution in...
119
click to vote
DAM
2016
10 years 1 months ago
2016
The maximum independent set problem is a basic NP-hard problem and has been extensively studied in exact algorithms. The maximum independent set problems in low-degree graphs are ...
DAM
2016
10 years 1 months ago
2016
We consider bounded integer knapsacks where the weights and variable upper bounds together form a superincreasing sequence. The elements of this superincreasing knapsack are exactl...
DAM
2016
10 years 1 months ago
2016
We consider the problem of decontaminating an infected network using as few mobile cleaning agents as possible and avoiding recontamination. After a cleaning agent has left a vert...