Sciweavers

DAM
2016
61views more  DAM 2016»
8 years 28 days ago
The challenges of unbounded treewidth in parameterised subgraph counting problems
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 ...
Kitty Meeks
DAM
2016
70views more  DAM 2016»
8 years 28 days ago
Strengthened bounds for the probability of k-out-of-n events
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...
Feng Qiu, Shabbir Ahmed, Santanu S. Dey
DAM
2016
114views more  DAM 2016»
8 years 28 days ago
An exact algorithm for maximum independent set in degree-5 graphs
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 ...
Mingyu Xiao, Hiroshi Nagamochi
DAM
2016
48views more  DAM 2016»
8 years 28 days ago
Convex hulls of superincreasing knapsacks and lexicographic orderings
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...
Akshay Gupte
DAM
2016
74views more  DAM 2016»
8 years 28 days ago
Network decontamination under m-immunity
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...
Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nic...
DAM
2016
43views more  DAM 2016»
8 years 28 days ago
The channel capacity of read/write isolated memory
In this paper, we reÿne upper and lower bounds for the channel capacity of a serial, binary rewritable medium in which no consecutive locations may store 1’s and no consecutive...
Chuan-Long Wang, Xuerong Yong, Mordecai J. Golin
DAM
2016
72views more  DAM 2016»
8 years 28 days ago
An upper bound on the extremal version of Hajnal's triangle-free game
A game starts with the empty graph on n vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a maxi...
Csaba Biró, Paul Horn, D. Jacob Wildstrom
DAM
2016
49views more  DAM 2016»
8 years 28 days ago
Bichain graphs: Geometric model and universal graphs
Bichain graphs form a bipartite analog of split permutation graphs, also known as split graphs of Dilworth number 2. Unlike graphs of Dilworth number 1 that enjoy many nice proper...
Robert Brignall, Vadim V. Lozin, Juraj Stacho
DAM
2016
70views more  DAM 2016»
8 years 28 days ago
Scheduling co-operating stacking cranes with predetermined container sequences
Crane scheduling in container terminals is known as a difficult optimization problem that has become even more challenging in recent years with the proliferation of multi-gantry a...
Dirk Briskorn, Panagiotis Angeloudis
DAM
2016
74views more  DAM 2016»
8 years 28 days ago
Enumerating minimal dominating sets in chordal bipartite graphs
We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating ...
Petr A. Golovach, Pinar Heggernes, Mamadou Moustap...