2008 |
8 | EE | Arvind Gupta,
Ján Manuch,
Ladislav Stacho,
Xiaohong Zhao:
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete.
COCOON 2008: 287-298 |
7 | EE | Arvind Gupta,
Jan van den Heuvel,
Ján Manuch,
Ladislav Stacho,
Xiaohong Zhao:
On the Complexity of Ordered Colorings.
SIAM J. Discrete Math. 22(2): 832-847 (2008) |
2007 |
6 | EE | Arvind Gupta,
Ján Manuch,
Ladislav Stacho,
Xiaohong Zhao:
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls.
ISBRA 2007: 121-132 |
2006 |
5 | EE | Ján Manuch,
Xiaohong Zhao,
Ladislav Stacho,
Arvind Gupta:
Characterization of the Existence of Galled-Tree Networks.
APBC 2006: 297-306 |
4 | EE | Jonathan Kavanagh,
David G. Mitchell,
Eugenia Ternovska,
Ján Manuch,
Xiaohong Zhao,
Arvind Gupta:
Constructing Camin-Sokal Phylogenies Via Answer Set Programming.
LPAR 2006: 452-466 |
3 | EE | Arvind Gupta,
Ján Manuch,
Xiaohong Zhao,
Ladislav Stacho:
Characterization of the Existence of Galled-tree Networks.
J. Bioinformatics and Computational Biology 4(6): 1309-1328 (2006) |
2005 |
2 | EE | Arvind Gupta,
Ján Manuch,
Ladislav Stacho,
Xiaohong Zhao:
Ordered 3-colorings.
Electronic Notes in Discrete Mathematics 22: 299-300 (2005) |
2004 |
1 | EE | Cristina Conati,
Xiaohong Zhao:
Building and evaluating an intelligent pedagogical agent to improve the effectiveness of an educational game.
IUI 2004: 6-13 |