112
click to vote
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
79
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
131
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
94
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
104
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
65
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
81
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
93
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...