default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark K. Goldberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[r2]Cindy Hui, William A. Wallace, Malik Magdon-Ismail, Mark K. Goldberg:
Actionable Information in Social Networks, Diffusion of. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018- 2015
- [i2]Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail, William A. Wallace:
Extracting Hidden Groups and their Structure from Streaming Interaction Data. CoRR abs/1502.04154 (2015) - 2014
- [r1]Cindy Hui, William A. Wallace, Malik Magdon-Ismail, Mark K. Goldberg:
Actionable Information in Social Networks, Diffusion of. Encyclopedia of Social Network Analysis and Mining 2014: 1-9 - 2012
- [j21]Xiao-Dan Yan, Stephen Kelley, Mark K. Goldberg:
Application of connected iterative scan in biological neural network. Neural Comput. Appl. 21(8): 2097-2103 (2012) - [c40]Mark K. Goldberg, Malik Magdon-Ismail, James Thompson:
Identifying Long Lived Social Communities Using Structural Properties. ASONAM 2012: 647-653 - [c39]Mark K. Goldberg, J. Greenman, Bridget Gutting, Malik Magdon-Ismail, John Schwartz, William A. Wallace:
Graph search beyond text: Relational searches in semantic hyperlinked data. ISI 2012: 153-155 - [c38]Cindy Hui, Yulia Tyshchuk, William A. Wallace, Malik Magdon-Ismail, Mark K. Goldberg:
Information cascades in social media in response to a crisis: a preliminary model and a case study. WWW (Companion Volume) 2012: 653-656 - 2011
- [j20]Mark K. Goldberg, Malik Magdon-Ismail:
Embedding a Forest in a Graph. Electron. J. Comb. 18(1) (2011) - [j19]Stephen Kelley, Mark K. Goldberg, Konstantin Mertsalov, Malik Magdon-Ismail, William A. Wallace:
Overlapping communities in social networks. Int. J. Soc. Comput. Cyber Phys. Syst. 1(2): 135-159 (2011) - [c37]Cindy Hui, Malik Magdon-Ismail, William A. Wallace, Mark K. Goldberg:
Aborting a Message Flowing through Social Communities. SocialCom/PASSAT 2011: 410-417 - [c36]Mark K. Goldberg, Malik Magdon-Ismail, Srinivas Nambirajan, James Thompson:
Tracking and Predicting Evolution of Social Communities. SocialCom/PASSAT 2011: 780-783 - 2010
- [j18]Cindy Hui, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Simulating the Diffusion of Information: An Agent-Based Modeling Approach. Int. J. Agent Technol. Syst. 2(3): 31-46 (2010) - [c35]Sibel Adali, Robert Escriva, Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail, Boleslaw K. Szymanski
, William A. Wallace, Gregory Todd Williams:
Measuring behavioral trust in social networks. ISI 2010: 150-152 - [c34]Mark K. Goldberg, Stephen Kelley, Malik Magdon-Ismail, Konstantin Mertsalov, Al Wallace:
Finding Overlapping Communities in Social Networks. SocialCom/PASSAT 2010: 104-113 - [c33]Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail:
Measuring Similarity between Sets of Overlapping Clusters. SocialCom/PASSAT 2010: 303-308 - [c32]Cindy Hui, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Agent-based simulation of the diffusion of warnings. SpringSim 2010: 9 - [i1]Mark K. Goldberg, Malik Magdon-Ismail:
Embedding a Forest in a Graph. CoRR abs/1011.3882 (2010)
2000 – 2009
- 2009
- [c31]Konstantin Mertsalov, Malik Magdon-Ismail, Mark K. Goldberg:
Models of Communication Dynamics for Simulation of Information Diffusion. ASONAM 2009: 194-199 - [c30]Stephen Kelley, Mark K. Goldberg, Malik Magdon-Ismail, Konstantin Mertsalov:
Stability of individual and group behavior in a blog network. ISI 2009: 7-12 - [c29]Stephen Kelley, Mark K. Goldberg, Malik Magdon-Ismail, Konstantin Mertsalov, William A. Wallace, Mohammed Javeed Zaki:
graphOnt: An ontology based library for conversion from semantic graphs to JUNG. ISI 2009: 170-172 - 2008
- [j17]Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Reverse Engineering a Social Agent-Based Hidden Markov Model - VISAGE. Int. J. Neural Syst. 18(6): 491-526 (2008) - [j16]Jeffrey Baumes, Hung-Ching Chen, Matthew Francisco, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
ViSAGE: A Virtual Laboratory for Simulation and Analysis of Social Group Evolution. ACM Trans. Auton. Adapt. Syst. 3(3): 8:1-8:35 (2008) - [c28]Mark K. Goldberg, Malik Magdon-Ismail, Stephen Kelley, Konstantin Mertsalov:
A locality model of the evolution of blog networks. ISI 2008: 191-193 - [c27]Yingjie Zhou, Malik Magdon-Ismail, William A. Wallace, Mark K. Goldberg:
A Generative Model for Statistical Determination of Information Content from Conversation Threads. ISI Workshops 2008: 331-342 - [c26]Mark K. Goldberg, Malik Magdon-Ismail, Stephen Kelley, Konstantin Mertsalov:
Stable Statistics of the Blogograph. ISIPS 2008: 104-114 - [c25]Mark K. Goldberg, Stephen Kelley, Malik Magdon-Ismail, Konstantin Mertsalov, William A. Wallace:
Communication Dynamics of Blog Networks. SNAKDD 2008: 36-54 - 2007
- [j15]Mark K. Goldberg:
Clusters in a Multigraph with Elevated Density. Electron. J. Comb. 14(1) (2007) - [c24]Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Learning What Makes a Society Tick. ICDM Workshops 2007: 195-200 - [c23]Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups. ICMLA 2007: 154-159 - [c22]Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Reverse Engineering an Agent-Based Hidden Markov Model for Complex Social Systems. IDEAL 2007: 940-949 - [c21]Jeffrey Baumes, Mark K. Goldberg, Mykola Hayvanovych, Stephen Kelley, Malik Magdon-Ismail, Konstantin Mertsalov, William A. Wallace:
SIGHTS: A Software System for Finding Coalitions and Leaders in a Social Network. ISI 2007: 193-199 - 2006
- [j14]Eric J. Griffith, Srinivas Akella, Mark K. Goldberg:
Performance Characterization of a Reconfigurable Planar-Array Digital Microfluidic System. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(2): 345-357 (2006) - [c20]Jeffrey Baumes, Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail, William A. Wallace, Mohammed Javeed Zaki:
Finding Hidden Group Structure in a Stream of Communications. ISI 2006: 201-212 - 2005
- [c19]Seyit Ahmet Çamtepe, Mark K. Goldberg, Malik Magdon-Ismail, Mukkai Krishn:
Detecting conversing groups of chatters: a model, algorithms, and tests. IADIS AC 2005: 89-96 - [c18]Jeffrey Baumes, Mark K. Goldberg, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail, Nathan Preston:
Finding communities by clustering a graph into overlapping subgraphs. IADIS AC 2005: 97-104 - [c17]Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail:
Efficient Identification of Overlapping Communities. ISI 2005: 27-36 - [c16]Mark K. Goldberg, David L. Hollinger, Malik Magdon-Ismail:
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs. WEA 2005: 513-523 - 2004
- [c15]Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail:
Identifying Multi-ID Users in Open Forums. ISI 2004: 176-186 - [c14]Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace:
Discovering Hidden Groups in Communication Networks. ISI 2004: 378-389 - 2003
- [j13]Eric Breimer, Mark K. Goldberg, Darren T. Lim:
A learning algorithm for the longest common subsequence problem. ACM J. Exp. Algorithmics 8 (2003) - [c13]Malik Magdon-Ismail, Mark K. Goldberg, William A. Wallace, David Siebecker:
Locating Hidden Groups in Communication Networks Using Hidden Markov Models. ISI 2003: 126-137 - 2002
- [c12]Eric Breimer, Mark K. Goldberg:
Learning Significant Alignments: An Alternative to Normalized Local Alignment. ISMIS 2002: 37-45 - 2001
- [j12]Mark K. Goldberg, David L. Hollinger:
Designing algorithms by sampling. Discret. Appl. Math. 110(1): 59-75 (2001) - [j11]Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail:
On the Height of a Random Set of Points in a d-Dimensional Unit Cube. Exp. Math. 10(4): 583-597 (2001) - [c11]Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail:
Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube. ALENEX 2001: 161-171 - [c10]Eric Breimer, Mark K. Goldberg, David L. Hollinger, Darren T. Lim:
Discovering Optimization Algorithms Through Automated Learning. Graphs and Discovery 2001: 7-26 - [c9]Mark K. Goldberg, Darren T. Lim, Malik Magdon-Ismail:
A learning algorithm for string assembly. BIOKDD 2001: 31-37 - 2000
- [j10]Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena:
LINK: a system for graph computation. Softw. Pract. Exp. 30(11): 1285-1302 (2000)
1990 – 1999
- 1999
- [j9]Jonathan W. Berry, Mark K. Goldberg:
Path Optimization for Graph Partitioning Problems. Discret. Appl. Math. 90(1-3): 27-50 (1999) - 1997
- [c8]Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena:
Graph Drawing and Manipulation with LINK. GD 1997: 425-437 - [c7]Mark K. Goldberg, David L. Hollinger:
Database Learning: a Method for Empirical Algorithm Design. WAE 1997: 231-239 - 1995
- [c6]Jonathan W. Berry, Mark K. Goldberg:
Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study. SODA 1995: 223-232 - 1993
- [j8]Mark K. Goldberg, Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. SIAM J. Discret. Math. 6(3): 443-459 (1993) - [c5]Mark K. Goldberg, Reid D. Rivenburgh:
Constructing cliques using restricted backtracking. Cliques, Coloring, and Satisfiability 1993: 89-101 - [c4]Dave A. Berque, Mark K. Goldberg, Jeffrey A. Edmonds:
Implementing Progress Indicators for Recursive Algorithms. SAC 1993: 533-538 - 1992
- [j7]Dave A. Berque, R. Cecchini, Mark K. Goldberg, Reid D. Rivenburgh:
The Set Player System for Symbolic Computation on Power Sets. J. Symb. Comput. 14(6): 645-662 (1992) - [c3]Dave A. Berque, Mark K. Goldberg:
Monitoring an Algorithm's Execution. Computational Support for Discrete Mathematics 1992: 153-163 - 1990
- [c2]Mark K. Goldberg, Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. SODA 1990: 219-225
1980 – 1989
- 1989
- [j6]Mark K. Goldberg, Thomas H. Spencer:
A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 18(2): 419-427 (1989) - [j5]Mark K. Goldberg, Thomas H. Spencer:
Constructing a Maximal Independent Set in Parallel. SIAM J. Discret. Math. 2(3): 322-328 (1989) - 1987
- [c1]Mark K. Goldberg, Thomas H. Spencer:
A New Parallel Algorithm for the Maximal Independent Set Problem. FOCS 1987: 161-165 - 1984
- [j4]Derek G. Corneil, Mark K. Goldberg:
A Non-Factorial Algorithm for Canonical Numbering of a Graph. J. Algorithms 5(3): 345-362 (1984) - [j3]Mark K. Goldberg:
Edge-coloring of multigraphs: Recoloring technique. J. Graph Theory 8(1): 123-137 (1984) - 1983
- [j2]Mark K. Goldberg:
A nonfactorial algorithm for testing isomorphism of two graphs. Discret. Appl. Math. 6(3): 229-236 (1983) - 1981
- [j1]Mark K. Goldberg:
Construction of class 2 graphs with maximum vertex degree 3. J. Comb. Theory B 31(3): 282-291 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
