Hongmei He

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

10EEJonathan Lawry, Hongmei He: Multi-Attribute Decision Making Based on Label Semantics. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 16(Supplement-2): 69-86 (2008)
9EEJonathan Lawry, Hongmei He: Linguistic Attribute Hierarchies for Multiple-Attribute Decision Making. FUZZ-IEEE 2007: 1-6
8EEHongmei He, Ondrej Sýkora, Erkki Mäkinen: Genetic algorithms for the 2-page book drawing problem of graphs. J. Heuristics 13(1): 77-93 (2007)
7EEHongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen: Parallelisation of genetic algorithms for the 2-page crossing number problem. J. Parallel Distrib. Comput. 67(2): 229-241 (2007)
6 Hongmei He, Ondrej Sýkora: A Hopfield Neural Network Model for the Outerplanar Drawing Problem. IMECS 2006: 42-47
5 Hongmei He, Ondrej Sýkora, Ana Salagean: Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. Parallel and Distributed Computing and Networks 2006: 316-323
4EEHongmei He, O. Skora, E. Mkinen: An Improved Neural Network Model for the Two-Page Crossing Number Problem. IEEE Transactions on Neural Networks 17(6): 1642-1646 (2006)
3EEXuan Liu, Hongmei He, Ondrej Sýkora: Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. ADMA 2005: 591-597
2EERadoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto: Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. SOFSEM 2005: 376-379
1EEHongmei He, Ondrej Sýkora, Imrich Vrto: Crossing Minimisation Heuristics for 2-page Drawings. Electronic Notes in Discrete Mathematics 22: 527-534 (2005)

Coauthor Index

1Radoslav Fulek [2]
2Jonathan Lawry [9] [10]
3Xuan Liu [3]
4Erkki Mäkinen [7] [8]
5E. Mkinen [4]
6Ana Salagean [5] [7]
7O. Skora [4]
8Ondrej Sýkora [1] [2] [3] [5] [6] [7] [8]
9Imrich Vrto [1] [2]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)