Nguyen Ngoc Tuy

According to our database, Nguyen Ngoc Tuy authored at least 7 papers between 2006 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2012

Complexity of Finding Graph Roots with Girth Conditions.

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy

Algorithmica, 2012

2011

A good characterization of squares of strongly chordal split graphs.

Van Bang Le, Nguyen Ngoc Tuy

Inf. Process. Lett., 2011

2010

The square of a block graph.

Van Bang Le, Nguyen Ngoc Tuy

Discret. Math., 2010

2009

Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms

Nguyen Ngoc Tuy

PhD thesis, 2009

Hardness Results and Efficient Algorithms for Graph Powers.

Van Bang Le, Nguyen Ngoc Tuy

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Computing Graph Roots Without Short Cycles.

Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2006

Graph classes related to chordal graphs and chordal bipartite graphs.

Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le

Electron. Notes Discret. Math., 2006