James Nastos

According to our database, James Nastos authored at least 12 papers between 2009 and 2024.

Collaborative distances:

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

2024

A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems.

Congsong Zhang, Yong Gao, James Nastos

IEEE Trans. Neural Networks Learn. Syst., September, 2024

2022

Learning Branching Heuristics from Graph Neural Networks.

Congsong Zhang, Yong Gao, James Nastos

CoRR, 2022

2018

Viewing the Meso-Scale Structures in Protein-Protein Interaction Networks Using 2-Clubs.

Songwei Jia, Lin Gao, Yong Gao, James Nastos, Xiao Wen, Xiaotai Huang, Haiyang Wang

IEEE Access, 2018

2016

Exploring triad-rich substructures by graph-theoretic characterizations in complex networks.

Songwei Jia, Lin Gao, Yong Gao, James Nastos, Xiao Wen, Xindong Zhang, Haiyang Wang

CoRR, 2016

2013

Familial groups in social networks.

James Nastos, Yong Gao

Soc. Networks, 2013

The cluster deletion problem for cographs.

Yong Gao, Donovan R. Hare, James Nastos

Discret. Math., 2013

The parametric complexity of graph diameter augmentation.

Yong Gao, Donovan R. Hare, James Nastos

Discret. Appl. Math., 2013

2012

Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes.

James Nastos, Yong Gao

Discret. Math. Algorithms Appl., 2012

2011

Statistical behavior of embeddedness and communities of overlapping cliques in online social networks.

Ajay Sridharan, Yong Gao, Kui Wu, James Nastos

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes

James Nastos, Yong Gao

CoRR, 2010

A Novel Branching Strategy for Parameterized Graph Modification Problems.

James Nastos, Yong Gao

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

A note on the hardness of graph diameter augmentation problems

James Nastos, Yong Gao

CoRR, 2009