Mark K. Goldberg

According to our database1, Mark K. Goldberg authored at least 62 papers between 1981 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Actionable Information in Social Networks, Diffusion of.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

2015
Extracting Hidden Groups and their Structure from Streaming Interaction Data.
CoRR, 2015

2014
Actionable Information in Social Networks, Diffusion of.
Encyclopedia of Social Network Analysis and Mining, 2014

2012
Application of connected iterative scan in biological neural network.
Neural Comput. Appl., 2012

Information cascades in social media in response to a crisis: a preliminary model and a case study.
Proceedings of the 21st World Wide Web Conference, 2012

Graph search beyond text: Relational searches in semantic hyperlinked data.
Proceedings of the 2012 IEEE International Conference on Intelligence and Security Informatics, 2012

Identifying Long Lived Social Communities Using Structural Properties.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Overlapping communities in social networks.
Int. J. Soc. Comput. Cyber Phys. Syst., 2011

Embedding a Forest in a Graph.
Electron. J. Comb., 2011

Aborting a Message Flowing through Social Communities.
Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

Tracking and Predicting Evolution of Social Communities.
Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

2010
Simulating the Diffusion of Information: An Agent-Based Modeling Approach.
Int. J. Agent Technol. Syst., 2010

Agent-based simulation of the diffusion of warnings.
Proceedings of the 2010 Spring Simulation Multiconference, 2010

Finding Overlapping Communities in Social Networks.
Proceedings of the 2010 IEEE Second International Conference on Social Computing, 2010

Measuring Similarity between Sets of Overlapping Clusters.
Proceedings of the 2010 IEEE Second International Conference on Social Computing, 2010

Measuring behavioral trust in social networks.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2010

2009
graphOnt: An ontology based library for conversion from semantic graphs to JUNG.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2009

Stability of individual and group behavior in a blog network.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2009

Models of Communication Dynamics for Simulation of Information Diffusion.
Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

2008
ViSAGE: A <i>Vi</i>rtual Laboratory for <i>S</i>imulation and <i>A</i>nalysis of Social <i>G</i>roup <i>E</i>volution.
ACM Trans. Auton. Adapt. Syst., 2008

Reverse Engineering a Social Agent-Based Hidden Markov Model - VISAGE.
Int. J. Neural Syst., 2008

Communication Dynamics of Blog Networks.
Proceedings of the Advances in Social Network Mining and Analysis, 2008

Stable Statistics of the Blogograph.
Proceedings of the Protecting Persons While Protecting the People, 2008

A Generative Model for Statistical Determination of Information Content from Conversation Threads.
Proceedings of the Intelligence and Security Informatics, 2008

A locality model of the evolution of blog networks.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2008

2007
Clusters in a Multigraph with Elevated Density.
Electron. J. Comb., 2007

SIGHTS: A Software System for Finding Coalitions and Leaders in a Social Network.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2007

Reverse Engineering an Agent-Based Hidden Markov Model for Complex Social Systems.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2007

Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups.
Proceedings of the Sixth International Conference on Machine Learning and Applications, 2007

Learning What Makes a Society Tick.
Proceedings of the Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006
Performance Characterization of a Reconfigurable Planar-Array Digital Microfluidic System.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006

Finding Hidden Group Structure in a Stream of Communications.
Proceedings of the Intelligence and Security Informatics, 2006

2005
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Efficient Identification of Overlapping Communities.
Proceedings of the Intelligence and Security Informatics, 2005

Detecting conversing groups of chatters: a model, algorithms, and tests.
Proceedings of the AC 2005, 2005

Finding communities by clustering a graph into overlapping subgraphs.
Proceedings of the AC 2005, 2005

2004
Identifying Multi-ID Users in Open Forums.
Proceedings of the Intelligence and Security Informatics, 2004

Discovering Hidden Groups in Communication Networks.
Proceedings of the Intelligence and Security Informatics, 2004

2003
A learning algorithm for the longest common subsequence problem.
ACM J. Exp. Algorithmics, 2003

Locating Hidden Groups in Communication Networks Using Hidden Markov Models.
Proceedings of the Intelligence and Security Informatics, First NSF/NIJ Symposium, 2003

2002
Learning Significant Alignments: An Alternative to Normalized Local Alignment.
Proceedings of the Foundations of Intelligent Systems, 13th International Symposium, 2002

2001
On the Height of a Random Set of Points in a d-Dimensional Unit Cube.
Exp. Math., 2001

Designing algorithms by sampling.
Discret. Appl. Math., 2001

A learning algorithm for string assembly.
Proceedings of the ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2001), 2001

Discovering Optimization Algorithms Through Automated Learning.
Proceedings of the Graphs and Discovery, 2001

Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
LINK: a system for graph computation.
Softw. Pract. Exp., 2000

1999
Path Optimization for Graph Partitioning Problems.
Discret. Appl. Math., 1999

1997
Database Learning: a Method for Empirical Algorithm Design.
Proceedings of the Workshop on Algorithm Engineering, 1997

Graph Drawing and Manipulation with <i>LINK</i>.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1995
Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1993
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.
SIAM J. Discret. Math., 1993

Implementing Progress Indicators for Recursive Algorithms.
Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, 1993

Constructing cliques using restricted backtracking.
Proceedings of the Cliques, 1993

1992
The Set Player System for Symbolic Computation on Power Sets.
J. Symb. Comput., 1992

Monitoring an Algorithm's Execution.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1989
Constructing a Maximal Independent Set in Parallel.
SIAM J. Discret. Math., 1989

A New Parallel Algorithm for the Maximal Independent Set Problem.
SIAM J. Comput., 1989

1984
Edge-coloring of multigraphs: Recoloring technique.
J. Graph Theory, 1984

A Non-Factorial Algorithm for Canonical Numbering of a Graph.
J. Algorithms, 1984

1983
A nonfactorial algorithm for testing isomorphism of two graphs.
Discret. Appl. Math., 1983

1981
Construction of class 2 graphs with maximum vertex degree 3.
J. Comb. Theory, Ser. B, 1981


  Loading...