


default search action
Katharina Anna Zweig
Person information
- affiliation: TU Kaiserslautern, Department of Computer Science, Germany
- award: Communicator-Preis, 2019
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Tobias D. Krafft
, Marc P. Hauer
, Katharina Anna Zweig
:
Black-Box Testing and Auditing of Bias in ADM Systems. Minds Mach. 34(2): 15 (2024) - 2023
- [c41]Marc P. Hauer, Lena Müller-Kress
, Gertraud Leimüller, Katharina Anna Zweig:
Using Assurance Cases to assure the fulfillment of non-functional requirements of AI-based systems - Lessons learned. ICSTW 2023: 172-179 - [i11]Marc P. Hauer, Tobias D. Krafft, Andreas Sesing-Wagenpfeil, Katharina Anna Zweig:
Quantitative study about the estimated impact of the AI Act. CoRR abs/2304.06503 (2023) - 2022
- [j26]Hanna Hoffmann, Verena Vogt, Marc P. Hauer
, Katharina Anna Zweig
:
Fairness by awareness? On the inclusion of protected features in algorithmic decisions. Comput. Law Secur. Rev. 44: 105658 (2022) - [p3]André Lucas Chinazzo, Christian de Schryver, Katharina Anna Zweig, Norbert Wehn:
Increasing the Sampling Efficiency for the Link Assessment Problem. Algorithms for Big Data 2022: 39-56 - [p2]André Lucas Chinazzo, Christian de Schryver, Katharina Anna Zweig, Norbert Wehn:
A Custom Hardware Architecture for the Link Assessment Problem. Algorithms for Big Data 2022: 57-75 - 2021
- [j25]Abraham Bernstein, Claes H. de Vreese, Natali Helberger
, Wolfgang Schulz, Katharina Anna Zweig, Christian Baden, Michael A. Beam, Marc P. Hauer, Lucien Heitz
, Pascal Jürgens, Christian Katzenbach, Benjamin Kille, Beate Klimkiewicz, Wiebke Loosen, Judith Möller
, Goran Radanovic, Guy Shani, Nava Tintarev, Suzanne Tolmeijer
, Wouter van Atteveldt, Sanne Vrijenhoek
, Theresa Zueger:
Diversity in News Recommendation (Dagstuhl Perspectives Workshop 19482). Dagstuhl Manifestos 9(1): 43-61 (2021) - [j24]Mareike Bockholt
, Katharina Anna Zweig
:
A systematic evaluation of assumptions in centrality measures by empirical flow data. Soc. Netw. Anal. Min. 11(1): 25 (2021) - [c40]Tobias D. Krafft
, Martin Reber
, Roman Krafft
, Anna Couturier
, Katharina Anna Zweig
:
Crucial Challenges in Large-Scale Black Box Analyses. BIAS 2021: 143-155 - [c39]Marc P. Hauer
, Rasmus Adler, Katharina Anna Zweig:
Assuring Fairness of Algorithmic Decision Making. ICST Workshops 2021: 110-113 - [c38]Mischa Helfenstein, Katharina Anna Zweig, Marc Herrlich:
A Technical Framework for Investigating the Impact of Design Elements in the Wild: Using Instagram as an Example. MuC 2021: 490-493 - 2020
- [j23]Mareike Bockholt
, Katharina Anna Zweig:
Towards a process-driven network analysis. Appl. Netw. Sci. 5(1): 56 (2020) - [j22]Marc P. Hauer
, Xavier C. R. Hofmann
, Tobias D. Krafft
, Katharina Anna Zweig
:
Quantitative analysis of automatic performance evaluation systems based on the h-index. Scientometrics 123(2): 735-751 (2020) - [c37]Tobias D. Krafft
, Marc P. Hauer
, Katharina Anna Zweig
:
Why Do We Need to Be Bots? What Prevents Society from Detecting Biases in Recommendation Systems. BIAS 2020: 27-34 - [c36]Martin Reber, Tobias D. Krafft, Roman Krafft, Katharina Anna Zweig, Anna Couturier:
Data Donations for Mapping Risk in Google Search of Health Queries: A case study of unproven stem cell treatments in SEM. SSCI 2020: 2985-2992 - [c35]Maryam Amir Haeri, Katharina Anna Zweig:
The Crucial Role of Sensitive Attributes in Fair Classification. SSCI 2020: 2993-3002 - [i10]Abraham Bernstein, Claes H. de Vreese, Natali Helberger, Wolfgang Schulz, Katharina Anna Zweig, Christian Baden, Michael A. Beam, Marc P. Hauer
, Lucien Heitz, Pascal Jürgens, Christian Katzenbach, Benjamin Kille, Beate Klimkiewicz, Wiebke Loosen, Judith Möller
, Goran Radanovic, Guy Shani, Nava Tintarev, Suzanne Tolmeijer, Wouter van Atteveldt, Sanne Vrijenhoek, Theresa Zueger:
Diversity in News Recommendations. CoRR abs/2005.09495 (2020)
2010 – 2019
- 2019
- [j21]Tobias D. Krafft
, Michael Gamer
, Katharina Anna Zweig
:
What did you see? A study to measure personalization in Google's search engine. EPJ Data Sci. 8(1): 38 (2019) - [c34]Mareike Bockholt
, Katharina Anna Zweig:
Why We Need a Process-Driven Network Analysis. COMPLEX NETWORKS (2) 2019: 81-93 - [i9]Tom Hanika, Marek Herde, Jochen Kuhn, Jan Marco Leimeister, Paul Lukowicz, Sarah Oeste-Reiß, Albrecht Schmidt, Bernhard Sick, Gerd Stumme, Sven Tomforde, Katharina Anna Zweig:
Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields. CoRR abs/1905.07264 (2019) - [i8]Abraham Bernstein, Claes H. de Vreese, Natali Helberger
, Wolfgang Schulz, Katharina Anna Zweig:
Diversity, Fairness, and Data-Driven Personalization in (News) Recommender System (Dagstuhl Perspectives Workshop 19482). Dagstuhl Reports 9(11): 117-124 (2019) - 2018
- [j20]Christian Brugger, Valentin Grigorovici, Matthias Jung
, Christian de Schryver
, Christian Weis
, Norbert Wehn
, Katharina Anna Zweig:
A Memory Centric Architecture of the Link Assessment Algorithm in Large Graphs. IEEE Des. Test 35(1): 7-15 (2018) - [j19]Bernhard Sick
, Sarah Oeste-Reiß
, Albrecht Schmidt
, Sven Tomforde, Katharina Anna Zweig:
Collaborative Interactive Learning. Inform. Spektrum 41(1): 52-55 (2018) - [c33]Mareike Bockholt, Olaf Peters, Susanne Narciss, Katharina Anna Zweig:
Analysis of human problem solving drafts: a methodological approach on the example of Rush Hour. CogSci 2018 - [r5]Mareike Bockholt, Katharina Anna Zweig:
Paths in Complex Networks. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [r4]Emoke-Ágnes Horvát, Katharina Anna Zweig:
Multiplex Networks. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [r3]Katharina Anna Zweig:
Network Representations of Complex Data. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [i7]Tobias D. Krafft, Michael Gamer, Katharina Anna Zweig:
What did you see? Personalization, regionalization and the question of the filter bubble in Google's search engine. CoRR abs/1812.10943 (2018) - 2017
- [j18]Oliver Deussen, Katharina Anna Zweig:
Algorithmen und Meinungsbildung. Inform. Spektrum 40(4): 317 (2017) - [j17]Katharina Anna Zweig, Oliver Deussen, Tobias D. Krafft:
Algorithmen und Meinungsbildung - Eine grundlegende Einführung. Inform. Spektrum 40(4): 318-326 (2017) - [j16]Tobias D. Krafft, Katharina Anna Zweig:
Ein Faktencheck - Ließ ein Algorithmus Trump triumphieren? Inform. Spektrum 40(4): 336-344 (2017) - [c32]Mareike Bockholt
, Katharina Anna Zweig:
Process-Driven Betweenness Centrality Measures. ENIC 2017: 17-33 - [i6]Mohammed Abufouda, Katharina Anna Zweig:
Link Classification and Tie Strength Ranking in Online Social Networks with Exogenous Interaction Networks. CoRR abs/1708.04030 (2017) - 2016
- [b2]Katharina Anna Zweig:
Network Analysis Literacy - A Practical Approach to the Analysis of Networks. Lecture Notes in Social Networks, Springer 2016, ISBN 978-3-7091-0740-9, pp. 3-485 - [j15]Wolfgang Eugen Schlauch, Katharina Anna Zweig:
Motif detection speed up by using equations based on the degree sequence. Soc. Netw. Anal. Min. 6(1): 47:1-47:20 (2016) - [j14]Christian Brugger, André Lucas Chinazzo, Alexandre Flores John, Christian de Schryver
, Norbert Wehn
, Wolfgang Eugen Schlauch, Katharina Anna Zweig:
Increasing sampling efficiency for the fixed degree sequence model with phase transitions. Soc. Netw. Anal. Min. 6(1): 100:1-100:14 (2016) - [c31]Sude Tavassoli, Katharina Anna Zweig:
Analyzing Multiple Rankings of Influential Nodes in Multiplex Networks. COMPLEX NETWORKS 2016: 135-146 - [c30]Mareike Bockholt
, Katharina Anna Zweig:
Clustering of Paths in Complex Networks. COMPLEX NETWORKS 2016: 183-195 - [c29]Katharina Anna Zweig:
Von den 'digital humanities' zu einer humanen Digitalisierung. DHd 2016 - [c28]Sude Tavassoli, Katharina Anna Zweig:
Most Central or Least Central? How Much Modeling Decisions Influence a Node's Centrality Ranking in Multiplex Networks. ENIC 2016: 25-32 - [c27]Gernot Bahle, Adrian Calma, Jan Marco Leimeister, Paul Lukowicz, Sarah Oeste-Reiss
, Tobias Reitmaier, Albrecht Schmidt
, Bernhard Sick
, Gerd Stumme
, Katharina Anna Zweig:
Lifelong Learning and Collaboration of Smart Technical Systems in Open-Ended Environments - Opportunistic Collaborative Interactive Learning. ICAC 2016: 315-324 - [c26]Mohammed Abufouda, Katharina Anna Zweig:
Link Classification and Tie Strength Ranking in Online Social Networks with Exogenous Interaction Networks. MSM@WWW,MUSE@PKDD/ECML 2016: 1-27 - [e3]Ralf Dörner, Stefan Göbel, Michael D. Kickmeier-Rust, Maic Masuch, Katharina Anna Zweig:
Entertainment Computing and Serious Games - International GI-Dagstuhl Seminar 15283, Dagstuhl Castle, Germany, July 5-10, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9970, 2016, ISBN 978-3-319-46151-9 [contents] - [i5]Sude Tavassoli, Katharina Anna Zweig:
Most central or least central? How much modeling decisions influence a node's centrality ranking in multiplex networks. CoRR abs/1606.05468 (2016) - [i4]Mohammed Abufouda, Katharina Anna Zweig:
A Theoretical Model for Understanding the Dynamics of Online Social Networks Decay. CoRR abs/1610.01538 (2016) - 2015
- [j13]Katharina Anna Zweig:
Von der theoretischen Informatik zur Sozioinformatik - und zurück. Inform. Spektrum 38(1): 28-30 (2015) - [j12]Christoph Leng, Jens-Martin Loebel
, Manfred Nagl
, Ludger Porada, Alexander Rabe, Simone Rehm, Katharina Anna Zweig:
Die GI soll wachsen: Zustand und Ideen für ihre Stärkung. Inform. Spektrum 38(4): 296-301 (2015) - [j11]Wolfgang Eugen Schlauch, Emoke-Ágnes Horvát, Katharina Anna Zweig:
Different flavors of randomness: comparing random graph models with fixed degree sequences. Soc. Netw. Anal. Min. 5(1): 36:1-36:14 (2015) - [c25]Christian Brugger, André Lucas Chinazzo, Alexandre Flores John, Christian de Schryver
, Norbert Wehn
, Andreas Spitz, Katharina Anna Zweig:
Exploiting Phase Transitions for the Efficient Sampling of the Fixed Degree Sequence Model. ASONAM 2015: 308-313 - [c24]Wolfgang Eugen Schlauch, Katharina Anna Zweig:
Influence of the Null-Model on Motif Detection. ASONAM 2015: 514-519 - [c23]Sude Tavassoli, Katharina Anna Zweig:
Analyzing the activity of a person in a chat by combining network analysis and fuzzy logic. ASONAM 2015: 1565-1568 - [c22]Christian Brugger, Valentin Grigorovici, Matthias Jung
, Christian Weis, Christian de Schryver
, Katharina Anna Zweig, Norbert Wehn:
A Custom Computing System for Finding Similarties in Complex Networks. ISVLSI 2015: 262-267 - [c21]Mareike Bockholt
, Katharina Anna Zweig:
Why Is This So Hard? Insights from the State Space of a Simple Board Game. JCSG 2015: 147-157 - [c20]Wolfgang Eugen Schlauch, Katharina Anna Zweig:
Social Network Analysis and Gaming: Survey of the Current State of Art. JCSG 2015: 158-169 - [c19]Mohammed Abufouda, Katharina Anna Zweig:
Are We Really Friends?: Link Assessment in Social Networks Using Multiple Associated Interaction Networks. WWW (Companion Volume) 2015: 771-776 - [i3]Sude Tavassoli, Katharina Anna Zweig:
Analyzing the activity of a person in a chat by combining network analysis and fuzzy logic. CoRR abs/1507.04024 (2015) - 2014
- [j10]Katharina Anna Zweig:
Network analysis literacy, data analysis literacy, and socioinformatics. it Inf. Technol. 56(5): 255-258 (2014) - [c18]Mohammed Abufouda, Katharina Anna Zweig:
Interactions around social networks matter: Predicting the social network from associated interaction networks. ASONAM 2014: 142-145 - [c17]Sude Tavassoli, Markus Moessner, Katharina Anna Zweig:
Constructing social networks from semi-structured chat-log data. ASONAM 2014: 146-149 - [e2]Katharina Anna Zweig, Wolfgang Neuser, Volkmar Pipek
, Markus Rohde, Ingo Scholtes
:
Socioinformatics - The Social Impact of Interactions between Humans and IT. Springer 2014, ISBN 978-3-319-09377-2 [contents] - [r2]Emoke-Ágnes Horvát, Katharina Anna Zweig:
Multiplex Networks. Encyclopedia of Social Network Analysis and Mining 2014: 1019-1023 - [r1]Katharina Anna Zweig:
Network Representations of Complex Data. Encyclopedia of Social Network Analysis and Mining 2014: 1102-1113 - 2013
- [j9]Andreas Spitz, Katharina Anna Zweig
, Emoke-Ágnes Horvát:
SICOP: identifying significant co-interaction patterns. Bioinform. 29(19): 2503-2504 (2013) - [j8]Emoke-Ágnes Horvát, Katharina Anna Zweig
:
A fixed degree sequence model for the one-mode projection of multiplex bipartite graphs. Soc. Netw. Anal. Min. 3(4): 1209-1224 (2013) - 2012
- [j7]Carla Binucci
, Ulrik Brandes, Giuseppe Di Battista
, Walter Didimo, Marco Gaertler
, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis
, Katharina Anna Zweig
:
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - [j6]Sudarshan Iyengar, C. E. Veni Madhavan, Katharina Anna Zweig
, Abhiram Natarajan:
Understanding Human Navigation Using Network Analysis. Top. Cogn. Sci. 4(1): 121-134 (2012) - [c16]Isadora Dorn, Andreas Lindenblatt, Katharina Anna Zweig
:
The Trilemma of Network Analysis. ASONAM 2012: 9-14 - [c15]Emoke-Ágnes Horvát, Katharina Anna Zweig:
One-mode Projection of Multiplex Bipartite Graphs. ASONAM 2012: 599-606 - 2011
- [j5]Katharina Anna Zweig
:
Good versus optimal: Why network analytic methods need more systematic evaluation. Central Eur. J. Comput. Sci. 1(1): 137-153 (2011) - [j4]Katharina Anna Zweig
, Michael Kaufmann:
A systematic approach to the one-mode projection of bipartite graphs. Soc. Netw. Anal. Min. 1(3): 187-218 (2011) - 2010
- [c14]Katharina Anna Zweig
:
How to Forget the Second Side of the Story: A New Method for the One-Mode Projection of Bipartite Graphs. ASONAM 2010: 200-207 - [i2]Katharina Anna Zweig, Gergely Palla, Tamás Vicsek:
What makes a phase transition? Analysis of the random satisfiability problem. CoRR abs/1002.0217 (2010)
2000 – 2009
- 2009
- [j3]László A. Zahoránszky, Gyula Y. Katona
, Péter Hári, András Málnási-Csizmadia, Katharina Anna Zweig, Gergely Zahoránszky-Köhalmi:
Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods. Algorithms Mol. Biol. 4: 12 (2009) - [j2]Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail
, Romeo Rizzi
, Torsten Ueckerdt, Katharina Anna Zweig
:
Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4): 199-243 (2009) - [c13]Michael Kaufmann, Katharina Anna Zweig
:
Modeling and Designing Real-World Networks. Algorithmics of Large and Complex Networks 2009: 359-379 - [c12]Carla Binucci
, Ulrik Brandes, Giuseppe Di Battista
, Walter Didimo, Marco Gaertler
, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis
, Katharina Anna Zweig
:
Drawing Trees in a Streaming Model. GD 2009: 292-303 - [e1]Jürgen Lerner, Dorothea Wagner, Katharina Anna Zweig
:
Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126]. Lecture Notes in Computer Science 5515, Springer 2009, ISBN 978-3-642-02093-3 [contents] - 2008
- [c11]Katharina Anna Zweig
, Karin Zimmermann:
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios. SASO 2008: 309-318 - 2007
- [b1]Katharina Anna Zweig:
On local behavior and global structures in the evolution of complex networks. University of Tübingen, Germany, 2007 - 2006
- [j1]Katharina Anna Lehmann
, Michael Kaufmann, Stephan Steigele, Kay Nieselt
:
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences. Algorithms Mol. Biol. 1 (2006) - [c10]Pier Francesco Cortese, Giuseppe Di Battista
, Fabrizio Frati
, Luca Grilli
, Katharina Anna Lehmann, Giuseppe Liotta
, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta:
On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 - [c9]Katharina Anna Lehmann
, Stephan Kottler:
Visualizing Large and Clustered Networks. GD 2006: 240-251 - [c8]Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian:
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA 2006: 832-841 - 2005
- [c7]Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks. CCCG 2005: 84-87 - [c6]Katharina Anna Lehmann
:
Why simulating evolutionary processes is just as interesting as applying them. GECCO Workshops 2005: 370-373 - [c5]Katharina Anna Lehmann
, Michael Kaufmann:
Evolutionary algorithms for the self-organized evolution of networks. GECCO 2005: 563-570 - [c4]Olaf Landsiedel, Katharina Anna Lehmann, Klaus Wehrle:
T-DHT: Topology-based Distributed Hash Tables. Peer-to-Peer Computing 2005: 143-144 - [p1]Katharina Anna Lehmann
, Michael Kaufmann:
Random Graphs, Small-Worlds and Scale-Free Networks. Peer-to-Peer Systems and Applications 2005: 57-76 - [i1]Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks. CoRR abs/cs/0508006 (2005) - 2004
- [c3]Dirk Koschützki, Katharina Anna Lehmann
, Leon Peeters, Stefan Richter, Dagmar Tenfelde-Podehl, Oliver Zlotowski:
Centrality Indices. Network Analysis 2004: 16-61 - [c2]Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann
, Leon Peeters, Dagmar Tenfelde-Podehl:
Algorithms for Centrality Indices. Network Analysis 2004: 62-82 - [c1]Dirk Koschützki, Katharina Anna Lehmann
, Dagmar Tenfelde-Podehl, Oliver Zlotowski:
Advanced Centrality Concepts. Network Analysis 2004: 83-111
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 2025-03-04 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint