Katharina Anna Zweig

According to our database1, Katharina Anna Zweig authored at least 65 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
What did you see? A study to measure personalization in Google's search engine.
EPJ Data Sci., 2019

Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields.
CoRR, 2019

Why We Need a Process-Driven Network Analysis.
Proceedings of the Complex Networks and Their Applications VIII, 2019

2018
Network Representations of Complex Data.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Multiplex Networks.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Paths in Complex Networks.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Collaborative Interactive Learning.
Informatik Spektrum, 2018

A Memory Centric Architecture of the Link Assessment Algorithm in Large Graphs.
IEEE Design & Test, 2018

What did you see? Personalization, regionalization and the question of the filter bubble in Google's search engine.
CoRR, 2018

Analysis of human problem solving drafts: a methodological approach on the example of Rush Hour.
Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018

2017
Algorithmen und Meinungsbildung - Eine grundlegende Einführung.
Informatik Spektrum, 2017

Ein Faktencheck - Ließ ein Algorithmus Trump triumphieren?
Informatik Spektrum, 2017

Algorithmen und Meinungsbildung.
Informatik Spektrum, 2017

Process-Driven Betweenness Centrality Measures.
Proceedings of the Network Intelligence Meets User Centered Social Media Networks [4th European Network Intelligence Conference, 2017

2016
Network Analysis Literacy - A Practical Approach to the Analysis of Networks
Lecture Notes in Social Networks, Springer, ISBN: 978-3-7091-0741-6, 2016

Motif detection speed up by using equations based on the degree sequence.
Social Netw. Analys. Mining, 2016

Increasing sampling efficiency for the fixed degree sequence model with phase transitions.
Social Netw. Analys. Mining, 2016

A Theoretical Model for Understanding the Dynamics of Online Social Networks Decay.
CoRR, 2016

Link Classification and Tie Strength Ranking in Online Social Networks with Exogenous Interaction Networks.
Proceedings of the Behavioral Analytics in Social and Ubiquitous Environments, 2016

Lifelong Learning and Collaboration of Smart Technical Systems in Open-Ended Environments - Opportunistic Collaborative Interactive Learning.
Proceedings of the 2016 IEEE International Conference on Autonomic Computing, 2016

Most Central or Least Central? How Much Modeling Decisions Influence a Node's Centrality Ranking in Multiplex Networks.
Proceedings of the Third European Network Intelligence Conference, 2016

Analyzing Multiple Rankings of Influential Nodes in Multiplex Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

Clustering of Paths in Complex Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2015
Different flavors of randomness: comparing random graph models with fixed degree sequences.
Social Netw. Analys. Mining, 2015

Von der theoretischen Informatik zur Sozioinformatik - und zurück.
Informatik Spektrum, 2015

Die GI soll wachsen: Zustand und Ideen für ihre Stärkung.
Informatik Spektrum, 2015

Are We Really Friends?: Link Assessment in Social Networks Using Multiple Associated Interaction Networks.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Social Network Analysis and Gaming: Survey of the Current State of Art.
Proceedings of the Serious Games - First Joint International Conference, 2015

Why Is This So Hard? Insights from the State Space of a Simple Board Game.
Proceedings of the Serious Games - First Joint International Conference, 2015

A Custom Computing System for Finding Similarties in Complex Networks.
Proceedings of the 2015 IEEE Computer Society Annual Symposium on VLSI, 2015

Analyzing the activity of a person in a chat by combining network analysis and fuzzy logic.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Influence of the Null-Model on Motif Detection.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Exploiting Phase Transitions for the Efficient Sampling of the Fixed Degree Sequence Model.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Network Representations of Complex Data.
Encyclopedia of Social Network Analysis and Mining, 2014

Multiplex Networks.
Encyclopedia of Social Network Analysis and Mining, 2014

Network analysis literacy, data analysis literacy, and socioinformatics.
it - Information Technology, 2014

Constructing social networks from semi-structured chat-log data.
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

Interactions around social networks matter: Predicting the social network from associated interaction networks.
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

2013
A fixed degree sequence model for the one-mode projection of multiplex bipartite graphs.
Social Netw. Analys. Mining, 2013

SICOP: identifying significant co-interaction patterns.
Bioinformatics, 2013

2012
Understanding Human Navigation Using Network Analysis.
topiCS, 2012

Drawing trees in a streaming model.
Inf. Process. Lett., 2012

One-mode Projection of Multiplex Bipartite Graphs.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

The Trilemma of Network Analysis.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
A systematic approach to the one-mode projection of bipartite graphs.
Social Netw. Analys. Mining, 2011

Good versus optimal: Why network analytic methods need more systematic evaluation.
Central Europ. J. Computer Science, 2011

2010
What makes a phase transition? Analysis of the random satisfiability problem
CoRR, 2010

How to Forget the Second Side of the Story: A New Method for the One-Mode Projection of Bipartite Graphs.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010

2009
Cycle bases in graphs characterization, algorithms, complexity, and applications.
Computer Science Review, 2009

Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods.
Algorithms for Molecular Biology, 2009

Modeling and Designing Real-World Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios.
Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

2007
On local behavior and global structures in the evolution of complex networks.
PhD thesis, 2007

2006
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences.
Algorithms for Molecular Biology, 2006

Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Visualizing Large and Clustered Networks.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

On the Topologies of Local Minimum Spanning Trees.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005
Random Graphs, Small-Worlds and Scale-Free Networks.
Proceedings of the Peer-to-Peer Systems and Applications, 2005

T-DHT: Topology-based Distributed Hash Tables.
Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), 31 August, 2005

Evolutionary algorithms for the self-organized evolution of networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Why simulating evolutionary processes is just as interesting as applying them.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

A New Approach for Boundary Recognition in Geometric Sensor Networks.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Advanced Centrality Concepts.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

Centrality Indices.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

Algorithms for Centrality Indices.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004


  Loading...