Mark Goldberg

2.0k total citations
53 papers, 994 citations indexed

About

Mark Goldberg is a scholar working on Statistical and Nonlinear Physics, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Mark Goldberg has authored 53 papers receiving a total of 994 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Statistical and Nonlinear Physics, 16 papers in Computational Theory and Mathematics and 12 papers in Computer Networks and Communications. Recurrent topics in Mark Goldberg's work include Complex Network Analysis Techniques (20 papers), Opinion Dynamics and Social Influence (19 papers) and Advanced Graph Theory Research (14 papers). Mark Goldberg is often cited by papers focused on Complex Network Analysis Techniques (20 papers), Opinion Dynamics and Social Influence (19 papers) and Advanced Graph Theory Research (14 papers). Mark Goldberg collaborates with scholars based in United States, Netherlands and Canada. Mark Goldberg's co-authors include Malik Magdon‐Ismail, Thomas H. Spencer, William A. Wallace, Srinivas Akella, Eric J. Griffith, Jeffrey Baumes, Mukkai S. Krishnamoorthy, Bolesław K. Szymański, Sibel Adalı and Gregory Todd Williams and has published in prestigious journals such as Physica A Statistical Mechanics and its Applications, SIAM Journal on Computing and IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

In The Last Decade

Mark Goldberg

51 papers receiving 933 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Mark Goldberg United States 17 273 269 241 214 176 53 994
Marı́a Serna Spain 15 155 0.6× 437 1.6× 125 0.5× 449 2.1× 190 1.1× 110 1.1k
Venkatesh Srinivasan Canada 14 141 0.5× 166 0.6× 413 1.7× 192 0.9× 41 0.2× 77 783
Xiaoyang Wang China 16 434 1.6× 81 0.3× 403 1.7× 192 0.9× 67 0.4× 93 957
Srikanta Tirthapura United States 22 230 0.8× 249 0.9× 743 3.1× 825 3.9× 95 0.5× 88 1.6k
Sandra M. Hedetniemi United States 16 78 0.3× 966 3.6× 144 0.6× 1.1k 5.0× 310 1.8× 35 1.9k
Pavel Chebotarev Russia 13 252 0.9× 138 0.5× 156 0.6× 168 0.8× 23 0.1× 41 648
Zvi Lotker Israel 23 143 0.5× 369 1.4× 186 0.8× 936 4.4× 342 1.9× 97 1.3k
Fernando Silva Portugal 17 206 0.8× 101 0.4× 349 1.4× 205 1.0× 37 0.2× 74 870
D. Hughes United Kingdom 12 29 0.1× 41 0.2× 207 0.9× 300 1.4× 206 1.2× 32 713
Siyu Yang China 7 1.2k 4.6× 61 0.2× 278 1.2× 376 1.8× 132 0.8× 25 1.6k

Countries citing papers authored by Mark Goldberg

Since Specialization
Citations

This map shows the geographic impact of Mark Goldberg's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark Goldberg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Goldberg more than expected).

Fields of papers citing papers by Mark Goldberg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mark Goldberg. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark Goldberg. The network helps show where Mark Goldberg may publish in the future.

Co-authorship network of co-authors of Mark Goldberg

This figure shows the co-authorship network connecting the top 25 collaborators of Mark Goldberg. A scholar is included among the top collaborators of Mark Goldberg based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mark Goldberg. Mark Goldberg is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Yan, Xiaodan, Stephen Kelley, Mark Goldberg, & Bharat B. Biswal. (2011). Detecting overlapped functional clusters in resting state fMRI with Connected Iterative Scan: A graph theory based clustering algorithm. Journal of Neuroscience Methods. 199(1). 108–118. 17 indexed citations
2.
Kelley, Stephen, et al.. (2011). Overlapping communities in social networks. 1(2). 135–135. 9 indexed citations
3.
Adalı, Sibel, Robert Escriva, Mark Goldberg, et al.. (2010). Measuring behavioral trust in social networks. 150–152. 150 indexed citations
4.
Goldberg, Mark, et al.. (2010). Measuring Similarity between Sets of Overlapping Clusters. 303–308. 37 indexed citations
5.
Chen, Hung-Ching, Mark Goldberg, Malik Magdon‐Ismail, & William A. Wallace. (2008). REVERSE ENGINEERING A SOCIAL AGENT-BASED HIDDEN MARKOV MODEL — ViSAGE. International Journal of Neural Systems. 18(6). 491–526. 13 indexed citations
6.
Chen, Hung-Ching, Mark Goldberg, Malik Magdon‐Ismail, & William A. Wallace. (2007). Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups. 154–159. 33 indexed citations
7.
Griffith, Eric J., Srinivas Akella, & Mark Goldberg. (2006). Performance Characterization of a Reconfigurable Planar-Array Digital Microfluidic System. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 25(2). 345–357. 123 indexed citations
8.
Baumes, Jeffrey, et al.. (2005). FINDING COMMUNITIES BY CLUSTERING A GRAPH INTO OVERLAPPING SUBGRAPHS. 97–104. 107 indexed citations
9.
Camtepe, Seyit, et al.. (2005). Detecting conversing groups of chatters : a model, algorithms, and tests. 89–96. 10 indexed citations
10.
Goldberg, Mark, et al.. (2001). Designing algorithms by sampling. Discrete Applied Mathematics. 110(1). 59–75. 1 indexed citations
11.
Goldberg, Mark, et al.. (2001). On the Height of a Random Set of Points in a d-Dimensional Unit Cube. Experimental Mathematics. 10(4). 583–597. 1 indexed citations
12.
Berry, Jonathan W. & Mark Goldberg. (1995). Path optimization and near-greedy analysis for graph partitioning: an empirical study. Symposium on Discrete Algorithms. 223–232. 4 indexed citations
13.
Goldberg, Mark, et al.. (1992). The SetPlayer System for Symbolic Computation on Power Sets. Journal of Symbolic Computation. 14(6). 645–662. 5 indexed citations
14.
Goldberg, Mark & Thomas H. Spencer. (1990). An efficient parallel algorithm that finds independent sets of guaranteed size. Symposium on Discrete Algorithms. 219–225. 1 indexed citations
15.
Erdös, P., et al.. (1988). Cutting a graph into two dissimilar halves. Journal of Graph Theory. 12(1). 121–131. 22 indexed citations
16.
Goldberg, Mark. (1983). A nonfactorial algorithm for testing isomorphism of two graphs. Discrete Applied Mathematics. 6(3). 229–236. 9 indexed citations
17.
Glasser, M. L. & Mark Goldberg. (1983). The Ising model on a closed Cayley tree. Physica A Statistical Mechanics and its Applications. 117(2-3). 670–672. 7 indexed citations
18.
Goldberg, Mark. (1981). Construction of class 2 graphs with maximum vertex degree 3. Journal of Combinatorial Theory Series B. 31(3). 282–291. 59 indexed citations
19.
Malinowski, Edmund R., et al.. (1974). Dipole moment studies of lactams. Journal of Molecular Structure. 23(3). 321–327. 2 indexed citations
20.
Goldberg, Mark, et al.. (1968). On minimal universal trees. Mathematical Notes. 4(3). 713–717. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026