ISAAC 2003 - PDF Preprint Papers

ISAAC 2003 International Symposium on Algorithms and Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ISAAC-2003 Paper

click to vote

ISAAC
2003
Springer

210views Algorithms» more ISAAC 2003»

The Student-Project Allocation Problem

13 years 9 months ago

Download www.dcs.gla.ac.uk

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	210	The Student-Project Allocation Problem	claim
2	144	Biconnectivity on Symbolically Represented Graphs: A Linear Solution	claim
3	141	Quasi-optimal Arithmetic for Quaternion Polynomials	claim
4	134	New Ways to Construct Binary Search Trees	claim
5	133	The Intractability of Computing the Hamming Distance	claim
6	129	Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution	claim
7	129	Lower Bounds on Correction Networks	claim
8	125	A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact	claim
9	117	Approximate Regular Expression Searching with Arbitrary Integer Weights	claim
10	115	Counting Complexity Classes over the Reals I: The Additive Case	claim
11	115	A Faster Lattice Reduction Method Using Quantum Search	claim
12	104	Deterministic Algorithm for the t-Threshold Set Problem	claim
13	103	Upper Bounds on the Complexity of Some Galois Theory Problems	claim
14	103	On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts	claim
15	101	Rapid Mixing of Several Markov Chains for a Hard-Core Model	claim
16	97	Equilibria for Networks with Malicious Users	claim
17	96	On the Geometric Dilation of Finite Point Sets	claim
18	95	Finding a Length-Constrained Maximum-Density Path in a Tree	claim
19	93	Range Mode and Range Median Queries on Lists and Trees	claim
20	92	Wavelength Conversion in Shortest-Path All-Optical Networks	claim
21	91	Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?	claim
22	85	Geometric Restrictions on Producible Polygonal Protein Chains	claim
23	75	On the Existence and Determination of Satisfactory Partitions in a Graph	claim
24	70	Settling the Intractability of Multiple Alignment	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers