James Nastos
James Nastos
University of British Columbia Okanagan
Verified email at okanagan.bc.ca
TitleCited byYear
Defining and identifying cograph communities in complex networks
S Jia, L Gao, Y Gao, J Nastos, Y Wang, X Zhang, H Wang
New Journal of Physics 17 (1), 013044, 2015
252015
Familial groups in social networks
J Nastos, Y Gao
Social Networks 35 (3), 439-450, 2013
232013
The cluster deletion problem for cographs
Y Gao, DR Hare, J Nastos
Discrete Mathematics 313 (23), 2763-2771, 2013
212013
Statistical behavior of embeddedness and communities of overlapping cliques in online social networks
A Sridharan, Y Gao, K Wu, J Nastos
2011 Proceedings IEEE INFOCOM, 546-550, 2011
162011
The parametric complexity of graph diameter augmentation
Y Gao, DR Hare, J Nastos
Discrete Applied Mathematics 161 (10-11), 1626-1631, 2013
142013
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
J Nastos, Y Gao
Discrete Mathematics, Algorithms and Applications 4 (01), 2012
112012
A novel branching strategy for parameterized graph modification problems
J Nastos, Y Gao
International Conference on Combinatorial Optimization and Applications, 332-346, 2010
92010
A note on the hardness of graph diameter augmentation problems
J Nastos, Y Gao
arXiv preprint arXiv:0909.3877, 2009
32009
Exploring triad-rich substructures by graph-theoretic characterizations in complex networks
S Jia, L Gao, Y Gao, J Nastos, X Wen, X Zhang, H Wang
Physica A: Statistical Mechanics and its Applications 468, 53-69, 2017
22017
Utilizing graph classes for community detection in social and complex networks
J Nastos
University of British Columbia, 2015
12015
Viewing the Meso-Scale Structures in Protein-Protein Interaction Networks Using 2-Clubs
S Jia, L Gao, Y Gao, J Nastos, X Wen, X Huang, H Wang
IEEE Access 6, 36780-36797, 2018
2018
(P5, co-P5)-free Graphs Degree: Master of Science
J Nastos
University of Alberta, 2006
2006
The system can't perform the operation now. Try again later.
Articles 1–12