Active Bibliography

12 Output-Sensitive Reporting of Disjoint Paths – Giuseppe Di Battista, Roberto Tamassia, Luca Vismara - 1996
544 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
1485 Fast approximate energy minimization via graph cuts – Yuri Boykov, Olga Veksler, Ramin Zabih - 2001
1011 Democratizing Innovation – Eric von Hippel - 2005
521 An algorithm for drawing general undirected graphs – Tomihisa Kamada, Satoru Kawai - 1989
6 IMPROVED COMPACT VISIBILITY REPRESENTATION OF Planar Graph via Schnyder’s Realizer – Ching-chi Lin, Hsueh-i Lu, I-fan Sun - 2004
480 Problems in Computational Geometry – Michael Ian Shamos - 1974
447 Achieving 100% Throughput in an Input-Queued Switch – Nick McKeown, Adisak Mekkittikul, Venkat Anantharam, Jean Walrand - 1996
395 HOW TO DRAW A Graph – W. T. Tutte - 1963