Block Crossings in Storyline Visualizations

[1]  Martin Nöllenburg,et al.  On Minimizing Crossings in Storyline Visualizations , 2015, Graph Drawing.

[2]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[3]  Alexander Wolff,et al.  Computing Storyline Visualizations with Few Block Crossings , 2017, Graph Drawing.

[4]  William T. Trotter,et al.  Characterization problems for graphs, partially ordered sets, lattices, and families of sets , 1976, Discret. Math..

[5]  Jeffrey Heer,et al.  Tracing genealogical data with TimeNets , 2010, AVI.

[6]  Ge Xia,et al.  Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..

[7]  Haim Kaplan,et al.  Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..

[8]  John I. Moore,et al.  Interval hypergraphs and D-interval hypergraphs , 1977, Discret. Math..

[9]  Bettina Speckmann,et al.  On Planar Supports for Hypergraphs , 2009, J. Graph Algorithms Appl..

[10]  Kwan-Liu Ma,et al.  Egocentric storylines for visual analysis of large dynamic graphs , 2013, 2013 IEEE International Conference on Big Data.

[11]  Kwan-Liu Ma,et al.  Design Considerations for Optimizing Storyline Visualizations , 2012, IEEE Transactions on Visualization and Computer Graphics.

[12]  Guillaume Fertin,et al.  Sorting by Transpositions Is Difficult , 2010, SIAM J. Discret. Math..

[13]  Michael Jünger,et al.  Crossing Minimization in Storyline Visualization , 2016, GD.

[14]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[15]  Alexander Wolff,et al.  Ordering Metro Lines by Block Crossings , 2015, J. Graph Algorithms Appl..

[16]  Henrik Eriksson,et al.  Sorting a bridge hand , 2001, Discret. Math..