IPL 2007 - PDF Preprint Papers

IPL 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPL-2007 Paper

click to vote

IPL
2007

143views more IPL 2007»

The cycle roommates problem: a hard case of kidney exchange

14 years 10 days ago

Download www.dcs.gla.ac.uk

Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...

Robert W. Irving

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	143	The cycle roommates problem: a hard case of kidney exchange	claim
2	130	Linear structure of bipartite permutation graphs and the longest path problem	claim
3	125	State explosion in almost-sure probabilistic reachability	claim
4	122	On the longest increasing subsequence of a circular list	claim
5	121	Parameterized complexity of the induced subgraph problem in directed graphs	claim
6	114	Spanning trees with minimum weighted degrees	claim
7	113	Greedy online frequency allocation in cellular networks	claim
8	111	Powering requires threshold depth 3	claim
9	111	Scalable Bloom Filters	claim
10	107	Flows in dynamic networks with aggregate arc capacities	claim
11	105	Approximability of identifying codes and locating-dominating codes	claim
12	105	Improving the arithmetic of elliptic curves in the Jacobi model	claim
13	105	A new algorithm for testing if a regular language is locally threshold testable	claim
14	104	A linear-time algorithm for Euclidean feature transform sets	claim
15	101	Adjacency queries in dynamic sparse graphs	claim
16	100	Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility	claim
17	99	Dynamic programming algorithms for the mosaic longest common subsequence problem	claim
18	99	Substitutions into propositional tautologies	claim
19	99	Approximation algorithms for minimizing segments in radiation therapy	claim
20	97	What is a free name in a process algebra?	claim
21	96	Fault diameter of product graphs	claim
22	96	On constructing an optimal consensus clustering from multiple clusterings	claim
23	95	Optimal implementations of UPGMA and other common clustering algorithms	claim
24	94	The finite horizon investor problem with a budget constraint	claim
25	94	A note on emptiness for alternating finite automata with a one-letter alphabet	claim
26	94	A note on the Hadwiger number of circular arc graphs	claim
27	91	Simple deterministic wildcard matching	claim
28	89	On the longest path algorithm for reconstructing trees from distance matrices	claim
29	87	The forwarding indices of augmented cubes	claim
30	81	Linear-time algorithms for problems on planar graphs with fixed disk dimension	claim
31	81	Lower bounds for testing Euclidean Minimum Spanning Trees	claim
32	80	Execution time analysis of a top-down R-tree construction algorithm	claim
33	79	Uniform metrical task systems with a limited number of states	claim
34	79	Analysis of noise-induced phase synchronization in nervous systems: from algorithmic perspective	claim
35	78	LP-based solution methods for the asymmetric TSP	claim
36	78	Ensuring the quasi-termination of needed narrowing computations	claim
37	77	Feedback arc set in bipartite tournaments is NP-complete	claim
38	77	Aspect-ratio Voronoi diagram and its complexity bounds	claim
39	76	Minimum cost subpartitions in graphs	claim
40	75	Some observations on LR-like parsing with delayed reduction	claim
41	75	New length bounds for cycle bases	claim
42	74	Minimum cycle bases of direct products of complete graphs	claim
43	74	Nonnegative integral subset representations of integer sets	claim
44	72	How to safely close a discussion	claim
45	71	A short proof of optimality for the MIN cache replacement algorithm	claim
46	71	Fault-tolerant analysis of a class of networks	claim
47	71	Relaxations of semiring constraint satisfaction problems	claim
48	70	An improved approximation ratio for the minimum linear arrangement problem	claim
49	69	On the fixed-parameter tractability of the equivalence test of monotone normal forms	claim
50	67	A variant of the Ford-Johnson algorithm that is more space efficient	claim
51	65	Fast exact string matching algorithms	claim
52	62	Jebelean-Weber's algorithm without spurious factors	claim
53	60	Robustness of PSPACE-complete sets	claim
54	55	Name-independent compact routing in trees	claim
55	52	The hardness of the Expected Decision Depth problem	claim
56	51	A note on the size of minimal covers	claim
57	50	Wait-free regular storage from Byzantine components	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers