![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Michael Laszlo Michael Laszlo, Sumitra Mukherjee : A class of heuristics for the constrained forest problem. Discrete Applied Mathematics 154 (1): 6-14 (2006) Michael Laszlo, Sumitra Mukherjee : Minimum Spanning Tree Partitioning Algorithm for Microaggregation. IEEE Trans. Knowl. Data Eng. 17 (7): 902-911 (2005) Michael Laszlo, Sumitra Mukherjee : Another greedy heuristic for the constrained forest problem. Oper. Res. Lett. 33 (6): 629-633 (2005) Michael Laszlo, Leila Kosseim , Guy Lapalme : Goal-Driven Answer Extraction. TREC 2000 1 [ 1 ] 2 [ 1 ] 3 [ 2 ] [ 3 ] [ 4 ] ![]() ©2006 Association for Computing Machinery |