James Nastos

Generating author description...

All published works

Action	Title	Year	Authors
+	The phase transitions of diameters in random axis-parallel hyperrectangle intersection graphs	2025	Congsong Zhang Yong Gao James Nastos
+	Learning Branching Heuristics from Graph Neural Networks	2022	Congsong Zhang Yong Gao James Nastos
+	Exploring triad-rich substructures by graph-theoretic characterizations in complex networks	2016	Songwei Jia Lin Gao Yong Gao James Nastos Wen Xiao Xindong Zhang Haiyang Wang
+ PDF Chat	Statistical behavior of embeddedness and communities of overlapping cliques in online social networks	2011	Ajay Sridharan Yong Gao Kui Wu James Nastos
+	Statistical Behavior of Embeddedness and Communities of Overlapping Cliques in Online Social Networks	2010	Ajay Sridharan Yong Gao Kui Wu James Nastos
+ PDF Chat	Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes	2010	James Nastos Yong Gao
+ PDF Chat	A Novel Branching Strategy for Parameterized Graph Modification Problems	2010	James Nastos Yong Gao
+	Statistical Behavior of Embeddedness and Communities of Overlapping Cliques in Online Social Networks	2010	Ajay Sridharan Yong Gao Kui Wu James Nastos
+	A note on the hardness of graph diameter augmentation problems	2009	James Nastos Yong Gao

Common Coauthors

Coauthor	Papers Together
Ajay Sridharan	3
Yong Gao	3
Yong Gao	3
Congsong Zhang	2
Yong Gao	2
Kui Wu	2
Wen Xiao	1
Xindong Zhang	1
Haiyang Wang	1
Songwei Jia	1
Kui Wu	1
Lin Gao	1
Yong Gao	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Uncovering the overlapping community structure of complex networks in nature and society	2005	Gergely Palla Imre Derényi Illés J. Farkas Tamás Vicsek	3
+	Matrix multiplication via arithmetic progressions	1990	Don Coppersmith S. Winograd	2
+	Probability and Computing: Randomized Algorithms and Probabilistic Analysis	2005	Michael Mitzenmacher Eli Upfal	2
+	New Specifications for Exponential Random Graph Models	2006	Tom A. B. Snijders Philippa Pattison Garry Robins Mark S. Handcock	2
+	The degree distribution of random <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-trees	2008	Yong Gao	2
+	Adding an Edge in a Cograph	2005	Stavros D. Nikolopoulos Leonidas Palios	2
+	Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>)	2006	Dieter Kratsch Jeremy Spinrad	2
+ PDF Chat	Emergence of Scaling in Random Networks	1999	Albert‐László Barabási Réka Albert	2
+	The random triangle model	1999	Johan Jonasson	2
+	On semi-P4-sparse graphs	1997	Jean‐Luc Fouquet Vassilis Giakoumakis	2
+ PDF Chat	A comparative study of social network models: Network evolution models and nodal attribute models	2009	Riitta Toivonen Lauri Kovanen Mikko Kivelä Jukka‐Pekka Onnela Jari Saramäki Kimmo Kaski	2
+	A Linear Recognition Algorithm for Cographs	1985	Derek G. Corneil Yehoshua Perl Laura K. Stewart	2
+	Quasi-threshold graphs	1996	Yan Jing-Ho Chen Jer-Jeong Gerard J. Chang	2
+	Random graph dynamics	2007	Richard Durrett	2
+	Random interval graphs	1998	Nicholas Pippenger	1
+ PDF Chat	Community detection in networks: Structural communities versus ground truth	2014	Darko Hric Richard K. Darst Santo Fortunato	1
+ PDF Chat	Link communities reveal multiscale complexity in networks	2010	Yong‐Yeol Ahn James P. Bagrow Sune Lehmann	1
+ PDF Chat	Detecting the overlapping and hierarchical community structure in complex networks	2009	Andrea Lancichinetti Santo Fortunato János Kertész	1
+ PDF Chat	Community detection in graphs	2009	Santo Fortunato	1
+ PDF Chat	Fast unfolding of communities in large networks	2008	Vincent D. Blondel Jean‐Loup Guillaume Renaud Lambiotte Etienne Lefebvre	1
+ PDF Chat	Efficient community detection in large networks using content and links	2013	Yiye Ruan David Fuhry Srinivasan Parthasarathy	1
+ PDF Chat	Conserved network motifs allow protein–protein interaction prediction	2004	István Albert Réka Albert	1
+ PDF Chat	Detecting communities of triangles in complex networks using spectral optimization	2010	Belkacem Serrour Àlex Arenas Sergio Gómez	1
+ PDF Chat	Maps of random walks on complex networks reveal community structure	2008	Martin Rosvall Carl T. Bergstrom	1
+ PDF Chat	Clique graphs and overlapping communities	2010	Tim Evans	1
+ PDF Chat	A paradox in community detection	2014	Filippo Radicchi	1
+	Random Intervals	1990	Joyce Justicz Edward R. Scheinerman Peter Winkler	1
+	Normalized Mutual Information to evaluate overlapping community finding algorithms	2011	Aaron F. McDaid Derek Greene Neil Hurley	1
+ PDF Chat	Finding Statistically Significant Communities in Networks	2011	Andrea Lancichinetti Filippo Radicchi José J. Ramasco Santo Fortunato	1
+	Community structure in social and biological networks	2002	Michelle Girvan M. E. J. Newman	1
+ PDF Chat	Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities	2009	Andrea Lancichinetti Santo Fortunato	1
+	On semi- P 4 -sparse graphs	1997	Jean‐Luc Fouquet Vassilis Giakoumakis	1
+ PDF Chat	Defining and evaluating network communities based on ground-truth	2013	Jaewon Yang Jure Leskovec	1
+ PDF Chat	Benchmark graphs for testing community detection algorithms	2008	Andrea Lancichinetti Santo Fortunato Filippo Radicchi	1
+	Complement reducible graphs	1981	Derek G. Corneil H. Lerchs L.Stewart Burlingham	1
+	Defining and identifying communities in networks	2004	Filippo Radicchi Claudio Castellano Federico Cecconi Vittorio Loreto Domenico Parisi	1
+	On the connectivity of a random interval graph	1996	Erhard Godehardt Jerzy Jaworski	1
+ PDF Chat	The degree sequence of a scale‐free random graph process	2001	Béla Bollobás Oliver Riordan Joel Spencer Gábor Tusnády	1
+	Between O(nm) and O(nα)	2003	Dieter Kratsch Jeremy Spinrad	1
+	An evolution of interval graphs	1990	Edward R. Scheinerman	1