New results on the computation of median orders

Approximate and dynamic rank aggregation

Theoretical Computer Science - Special papers from: COCOON 2003

A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02

Approximate rank aggregation

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Crossings and permutations

GD'05 Proceedings of the 13th international conference on Graph Drawing