Paths, trees and matchings under disjunctive constraints. (English)
Discrete Appl. Math. 159, No. 16, 1726-1735 (2011).
1
Finding socially best spanning treesî. (English)
Theory Decis. 70, No. 4, 511-527 (2011).
2
Resource allocation with time intervals. (English)
Theor. Comput. Sci. 411, No. 49, 4217-4234 (2010).
3
A note on maximizing the minimum voter satisfaction on spanning trees. (English)
Math. Soc. Sci. 60, No. 1, 82-85 (2010).
4
A note on maximizing the minimum voter satisfaction on spanning trees (English)
Mathematical Social Sciences 60, No. 1, 82-85 (2010).
5
Maximizing the minimum voter satisfaction on spanning trees. (English)
Math. Soc. Sci. 58, No. 2, 238-250 (2009).
6
Maximizing the minimum voter satisfaction on spanning trees (English)
Mathematical Social Sciences 58, No. 2, 238-250 (2009).
7
Determining a minimum spanning tree with disjunctive constraints (English)
ADT, 414-423 (2009).
8
Combinatorial optimization problems with conflict graphs (English)
CTW, 293-296 (2009).
9
Start
Contact
Print
General Help
