David J. Abraham

According to our database, David J. Abraham authored at least 10 papers between 2002 and 2010.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2010

Voting Paths.

David J. Abraham, Telikepalli Kavitha

SIAM J. Discret. Math., 2010

2007

Two algorithms for the Student-Project Allocation problem.

David J. Abraham, Robert W. Irving, David F. Manlove

J. Discrete Algorithms, 2007

The Stable Roommates Problem with Globally-Ranked Pairs.

David J. Abraham, Ariel Levavi, David F. Manlove, Gregg O'Malley

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges.

David J. Abraham, Avrim Blum, Tuomas Sandholm

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006

Dynamic Matching Markets and Voting Paths.

David J. Abraham, Telikepalli Kavitha

Proceedings of the Algorithm Theory, 2006

2005

"Almost Stable" Matchings in the Roommates Problem.

David J. Abraham, Péter Biró, David F. Manlove

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Popular matchings.

David J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Pareto Optimality in House Allocation Problems.

David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

The Student-Project Allocation Problem.

David J. Abraham, Robert W. Irving, David F. Manlove

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem.

David J. Abraham, Jeffrey H. Kingston

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002