The following pages link to Ulrik Brandes (Q286615):
Displaying 50 items.
- Structural similarity: spectral methods for relaxed blockmodeling (Q286617) (← links)
- (Q436546) (redirect page) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Path-based supports for hypergraphs (Q450570) (← links)
- (Q548660) (redirect page) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) (Q826071) (← links)
- Phylogenetic graph models beyond trees (Q1026198) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
- (Q1578386) (redirect page) (← links)
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (Q1578388) (← links)
- How to draw the minimum cuts of a planar graph (Q1882854) (← links)
- 10 reasons to get interested in graph drawing (Q2075765) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Optimal leaf ordering of complete binary trees (Q2466020) (← links)
- Conditional independence in dynamic networks (Q2637084) (← links)
- (Q2764160) (← links)
- A faster algorithm for betweenness centrality* (Q2765440) (← links)
- Stub Bundling and Confluent Spirals for Geographic Networks (Q2867676) (← links)
- Untangling Hairballs (Q2936918) (← links)
- Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks (Q2958312) (← links)
- A Sparse Stress Model (Q2961500) (← links)
- Positional Dominance: Concepts and Algorithms (Q2971635) (← links)
- Path-Based Supports for Hypergraphs (Q3000490) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- (Q3043702) (← links)
- (Q3043770) (← links)
- (Q3043791) (← links)
- More Canonical Ordering (Q3168834) (← links)
- Vertex Bisection is Hard, too (Q3184606) (← links)
- A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing (Q3223947) (← links)
- Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles (Q3378509) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks (Q3460398) (← links)
- Visualisierung von Verkehrsdaten (Q3465528) (← links)
- (Q3507780) (← links)
- On Finding Graph Clusterings with Maximum Modularity (Q3508560) (← links)
- Leftist Canonical Ordering (Q3557875) (← links)
- Drawing Trees in a Streaming Model (Q3557886) (← links)
- Angle and Distance Constraints on Tree Drawings (Q3595467) (← links)
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data (Q3595483) (← links)
- An Experimental Study on Distance-Based Graph Drawing (Q3611854) (← links)
- On the Hardness of Orthogonal-Order Preserving Graph Drawing (Q3611858) (← links)
- Group-Level Analysis and Visualization of Social Networks (Q3637326) (← links)
- (Q3836515) (← links)
- (Q4373672) (← links)
- (Q4411363) (← links)
- (Q4422257) (← links)
- Visual Ranking of Link Structures (Q4435349) (← links)
- (Q4472296) (← links)
