Sciweavers

Share
DAM
2010
104views more  DAM 2010»
8 years 4 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
DAM
2008
140views more  DAM 2008»
8 years 5 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
DAM
2008
102views more  DAM 2008»
8 years 5 months ago
Formulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. ...
DAM
2008
83views more  DAM 2008»
8 years 5 months ago
Models and quantifier elimination for quantified Horn formulas
Uwe Bubeck, Hans Kleine Büning

Publication
69views
8 years 6 months ago
Fun-Sort--or the chaos of unordered binary search
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
DAM
2008
70views more  DAM 2008»
8 years 6 months ago
Pairings for cryptographers
Many research papers in pairing based cryptography treat pairings as a "black box". These papers build cryptographic schemes making use of various properties of pairings....
Steven D. Galbraith, Kenneth G. Paterson, Nigel P....
DAM
2008
78views more  DAM 2008»
8 years 6 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
DAM
2008
68views more  DAM 2008»
8 years 6 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
DAM
2008
85views more  DAM 2008»
8 years 6 months ago
The competition numbers of complete tripartite graphs
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
Suh-Ryung Kim, Yoshio Sano
books