Ge Xia

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Luay Nakhleh

> Home > Persons > Ge Xia

Publications

2008
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KanjNX08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KanjNX08
Iyad A. Kanj, Luay Nakhleh, Ge Xia:
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008)
[j8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KanjNTX08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KanjNTX08
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401(1-3): 153-164 (2008)
2007
[c12]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ictcs/KanjNTX07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictcs/KanjNTX07
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93
2006
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/KanjNX06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/KanjNX06
Iyad A. Kanj, Luay Nakhleh, Ge Xia:
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.