| Publication | Date of Publication | Type |
|---|
| Influence, inertia, and independence: a diffusion model for temporal social networks | 2024-07-24 | Paper |
| Hardness Results for Seeding Complex Contagion with Neighborhoods | 2022-11-15 | Paper |
| Central Positions in Social Networks | 2022-10-19 | Paper |
| On Dasgupta's hierarchical clustering objective and its relation to other graph parameters | 2022-05-20 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
| A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) | 2021-12-20 | Paper |
| Stochastic Gradient Descent Works Really Well for Stress Minimization | 2021-12-01 | Paper |
| Triangle Listing Algorithms: Back from the Diversion | 2019-09-12 | Paper |
| Topology manipulations for speeding betweenness centrality computation | 2018-10-16 | Paper |
| Re-conceptualizing centrality in social networks | 2017-11-24 | Paper |
| A Sparse Stress Model | 2017-10-12 | Paper |
| Positional Dominance: Concepts and Algorithms | 2017-04-07 | Paper |
| A Sparse Stress Model | 2017-02-21 | Paper |
| Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks | 2017-02-01 | Paper |
| Structural similarity: spectral methods for relaxed blockmodeling | 2016-05-25 | Paper |
| Visualisierung von Verkehrsdaten | 2016-01-21 | Paper |
| Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks | 2016-01-07 | Paper |
| Fast Quasi-Threshold Editing | 2015-11-19 | Paper |
| Untangling Hairballs | 2015-01-07 | Paper |
| Conditional independence in dynamic networks | 2014-02-19 | Paper |
| Stub Bundling and Confluent Spirals for Geographic Networks | 2013-12-20 | Paper |
| Graph Drawing by Classical Multidimensional Scaling: New Perspectives | 2013-04-03 | Paper |
| Orthogonal-Ordering Constraints are Tough | 2013-01-07 | Paper |
| Path-based supports for hypergraphs | 2012-09-13 | Paper |
| Drawing trees in a streaming model | 2012-07-25 | Paper |
| A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing | 2012-03-09 | Paper |
| Colored simultaneous geometric embeddings and universal pointsets | 2011-06-30 | Paper |
| Path-Based Supports for Hypergraphs | 2011-05-19 | Paper |
| Blocks of Hypergraphs | 2011-05-19 | Paper |
| More Canonical Ordering | 2011-04-19 | Paper |
| More Flexible Radial Layout | 2011-04-19 | Paper |
| Leftist Canonical Ordering | 2010-04-27 | Paper |
| Drawing Trees in a Streaming Model | 2010-04-27 | Paper |
| More Flexible Radial Layout | 2010-04-27 | Paper |
| Vertex Bisection is Hard, too | 2009-10-21 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Group-Level Analysis and Visualization of Social Networks | 2009-07-09 | Paper |
| Phylogenetic graph models beyond trees | 2009-06-24 | Paper |
| An Experimental Study on Distance-Based Graph Drawing | 2009-03-03 | Paper |
| On the Hardness of Orthogonal-Order Preserving Graph Drawing | 2009-03-03 | Paper |
| Dynamic Spectral Layout with an Application to Small Worlds | 2009-01-19 | Paper |
| CENTRALITY ESTIMATION IN LARGE NETWORKS | 2008-07-04 | Paper |
| On Finding Graph Clusterings with Maximum Modularity | 2008-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3507780 | 2008-06-20 | Paper |
| Multi-circular Layout of Micro/Macro Graphs | 2008-03-25 | Paper |
| Visualizing Internet Evolution on the Autonomous Systems Level | 2008-03-25 | Paper |
| Optimal leaf ordering of complete binary trees | 2008-01-11 | Paper |
| Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities | 2007-09-05 | Paper |
| Angle and Distance Constraints on Tree Drawings | 2007-08-28 | Paper |
| Eigensolver Methods for Progressive Multidimensional Scaling of Large Data | 2007-08-28 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles | 2006-04-03 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Network Analysis | 2005-11-11 | Paper |
| Network Analysis | 2005-11-11 | Paper |
| Generating node coordinates for shortest-path computations in transportation networks | 2005-08-04 | Paper |
| How to draw the minimum cuts of a planar graph | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043702 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043770 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043791 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472296 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472300 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472329 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472330 | 2004-08-04 | Paper |
| Visual Ranking of Link Structures | 2003-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422257 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411363 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801186 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778557 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764160 | 2002-01-22 | Paper |
| A faster algorithm for betweenness centrality* | 2001-01-01 | Paper |
| Using Graph Layout to Visualize Train Interconnection Data | 2000-12-14 | Paper |
| Dynamic WWW Structures in 3D | 2000-12-14 | Paper |
| A linear time algorithm for the arc disjoint Menger problem in planar directed graphs | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836515 | 1999-12-09 | Paper |
| A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373672 | 1998-02-16 | Paper |
