Sciweavers

ISAAC
2003
Springer
103views Algorithms» more  ISAAC 2003»
14 years 4 months ago
Upper Bounds on the Complexity of Some Galois Theory Problems
Vikraman Arvind, Piyush P. Kurur
ISAAC
2003
Springer
75views Algorithms» more  ISAAC 2003»
14 years 4 months ago
On the Existence and Determination of Satisfactory Partitions in a Graph
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
14 years 4 months ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon
ISAAC
2003
Springer
210views Algorithms» more  ISAAC 2003»
14 years 4 months ago
The Student-Project Allocation Problem
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David J. Abraham, Robert W. Irving, David Manlove