Drawing Graphs

[1]  Timothy M. Chan,et al.  Optimizing area and aspect ration in straight-line orthogonal tree drawings , 2002, Comput. Geom..

[2]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[3]  Alexander Wolff,et al.  Labeling Points with Circles , 2001, Int. J. Comput. Geom. Appl..

[4]  Maurizio Patrignani,et al.  On the complexity of orthogonal compaction , 1999, Comput. Geom..

[5]  Celina M. H. de Figueiredo,et al.  SPLITTING NUMBER is NP-complete , 1998, Discret. Appl. Math..

[6]  Alexander Wolff,et al.  A simple and efficient algorithm for high-quality line labeling , 2001 .

[7]  Michael Kaufmann,et al.  Orthogonal graph drawing with constraints , 2000, SODA '00.

[8]  Walter Didimo,et al.  Computing Orthogonal Drawings with the Minimum Number of Bends , 1997, IEEE Trans. Computers.

[9]  David R. Wood.  Three-Dimensional Orthogonal Graph Drawing , 2000 .

[10]  Petra Mutzel,et al.  Combining Graph Labeling and Compaction , 1999, GD.

[11]  Paul Molitor,et al.  Using Sifting for k -Layer Straightline Crossing Minimization , 1999, GD.

[12]  Karen Aardal,et al.  An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling , 1999, ESA.

[13]  Petra Mutzel,et al.  Optimal Compaction of Orthogonal Grid Drawings , 1999, IPCO.

[14]  Georg Sander,et al.  Graph Layout for Applications in Compiler Construction , 1999, Theor. Comput. Sci..

[15]  Sándor P. Fekete,et al.  Rectangle and Box Visibility Graphs in 3D , 1999, Int. J. Comput. Geom. Appl..

[16]  Marc J. van Kreveld,et al.  Labeling a Rectilinear Map More Efficiently , 1999, Inf. Process. Lett..

[17]  Peter Eades,et al.  Drawing Clustered Graphs on an Orthogonal Grid , 1997, J. Graph Algorithms Appl..

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  Timothy M. Chan.  A Near-Linear Area Bound for Drawing Binary Trees , 1999, SODA '99.

[20]  Andrea S. LaPaugh,et al.  VLSI Layout Algorithms , 1999, Algorithms and Theory of Computation Handbook.

[21]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[22]  Victoria H. Clayton,et al.  A New Algorithm and Open Problems in Three-Dimensional Orthogonal Graph Drawing , 1999 .

[23]  David R. Wood,et al.  Multi-Dimensional Orthogonal Graph Drawing in the General Position Model , 1999 .

[24]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[25]  Walter Didimo,et al.  Computing Orthogonal Drawings in a Variable Embedding Setting , 1998, ISAAC.

[26]  Giuseppe Liotta,et al.  Spirality and Optimal Orthogonal Drawings , 1998, SIAM J. Comput..

[27]  Ioannis G. Tollis,et al.  Interactive Orthogonal Graph Drawing , 1998, IEEE Trans. Computers.

[28]  Therese C. Biedl,et al.  Three Approaches to 3D-Orthogonal Box-Drawings , 1998, GD.

[29]  Petra Mutzel,et al.  Planar Polyline Drawings with Good Angular Resolution , 1998, GD.

[30]  Ulrik Brandes,et al.  Using Graph Layout to Visualize Train Interconnection Data , 1998, Graph Drawing.

[31]  Peter Eades,et al.  A Fully Animated Interactive System for Clustering and Navigating Huge Graphs , 1998, GD.

[32]  Sang Ho Lee,et al.  Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions , 1998, GD.

[33]  Michael Kaufmann,et al.  Adding Constraints to an Algorithm for Orthogonal Graph Drawing , 1998, Graph Drawing.

[34]  Michael Kaufmann,et al.  On Improving Orthogonal Drawings: The 4M-Algorithm , 1998, GD.

[35]  Alexander Wolff,et al.  A Combinatorial Framework for Map Labeling , 1998, Graph Drawing.

[36]  Toshimitsu Masuzawa,et al.  A layout adjustment problem for disjoint rectangles preserving orthogonal order , 1998, Systems and Computers in Japan.

[37]  David R. Wood,et al.  An Algorithm for Three-Dimensional Orthogonal Graph Drawing , 1998, GD.

[38]  G. Battista,et al.  A Split&Push Approach to 3D Orthogonal Drawing , 1998, Graph Drawing.

[39]  Ioannis G. Tollis,et al.  Refinement of Orthogonal Graph Drawings , 1998, GD.

[40]  Alexander Wolff,et al.  Point set labeling with sliding labels , 1998, SCG '98.

[41]  Ioannis G. Tollis,et al.  A unified approach to labeling graphical features , 1998, SCG '98.

[42]  Therese C. Biedl.  Orthogonal graph visualization: the three-phase method with applications , 1998 .

[43]  Petra Mutzel,et al.  A new approximation algorithm for the planar augmentation problem , 1998, SODA '98.

[44]  Petra Mutzel,et al.  Quasi-orthogonal drawing of planar graphs , 1998 .

[45]  Ioannis G. Tollis,et al.  On the multiple label placement problem , 1998, CCCG.

[46]  David R. Wood.  Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs , 1998 .

[47]  Hartmut Schmeck,et al.  An Evolutionary Algorithm for Drawing Directed Graphs , 1998 .

[48]  Kelly A. Lyons,et al.  Algorithms for Cluster Busting in Anchored Graph Drawing , 1998, J. Graph Algorithms Appl..

[49]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[50]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[51]  Rafael Martí,et al.  Arc crossing minimization in hierarchical digraphs with tabu search , 1997, Comput. Oper. Res..

[52]  Elmar Nöth,et al.  Integrated dialog act segmentation and classification using prosodic features and language models , 1997, EUROSPEECH.

[53]  Jan W. Amtrup,et al.  What's in a word graph evaluation and enhancement of word lattices? , 1997, EUROSPEECH.

[54]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[55]  Arunabha Sen,et al.  Graph Clustering Using Multiway Ratio Cut , 1997, GD.

[56]  Ulrich Fößmeier.  Interactive Orthogonal Graph Drawing: Algorithms and Bounds , 1997, Graph Drawing.

[57]  Michael Jünger,et al.  A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem , 1997, GD.

[58]  Maurizio Patrignani,et al.  3DCube: A Tool for Three Dimensional Graph Drawing , 1997, Graph Drawing.

[59]  Peter Eades,et al.  Finding the Best Viewpoints for Three-Dimensional Graph Drawings , 1997, GD.

[60]  Ioannis G. Tollis,et al.  The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing , 1997, Int. J. Comput. Geom. Appl..

[61]  Ioannis G. Tollis,et al.  Incremental Orthogonal Graph Drawing in Three Dimensions , 1997, GD.

[62]  Ioannis G. Tollis,et al.  An Algorithm for Labeling Edges of Hierarchical Drawings , 1997, GD.

[63]  Michael Kaufmann,et al.  Area-Efficient Static and Incremental Graph Drawings , 1997, ESA.

[64]  Jonathan D. Cohen,et al.  Drawing graphs to convey proximity: an incremental arrangement method , 1997, TCHI.

[65]  Ioannis G. Tollis,et al.  Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends , 1997, WADS.

[66]  Binhai Zhu,et al.  A polynomial time solution for labeling a rectilinear map , 1997, SCG '97.

[67]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1997, Networks.

[68]  Joe Marks,et al.  Empirical testing of algorithms for variable-sized label placement , 1997, SCG '97.

[69]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[70]  M. Chrobak,et al.  Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[71]  Alexander Wolff,et al.  A Practical Map Labeling Algorithm , 1997, Comput. Geom..

[72]  Madhav V. Marathe,et al.  Map labeling and its generalizations , 1997, SODA '97.

[73]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[74]  Ulrich Fößmeier.  Orthogonale Visualisierungstechniken für Graphen , 1997 .

[75]  Robert F. Cohen,et al.  An experimental study of the basis for graph drawing algorithms , 1997, JEAL.

[76]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[77]  Andreas J. Winter,et al.  Modules and Updatable Graph Views for PROgrammed Graph REwriting Systems , 1997 .

[78]  Joe Marks,et al.  A General Cartographic Labeling Algorithm , 1996 .

[79]  Edward L. Robertson,et al.  Techniques for non-linear magnification transformations , 1996, Proceedings IEEE Symposium on Information Visualization '96.

[80]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[81]  Arne Frick.  Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm , 1996, Graph Drawing.

[82]  Ioannis G. Tollis,et al.  On the Edge Label Placement Problem , 1996, GD.

[83]  Arne Frick,et al.  Automatic Graph Clustering , 1996, GD.

[84]  Ioannis G. Tollis,et al.  Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing , 1996, GD.

[85]  Antonios Symvonis,et al.  Two Algorithms for Three Dimensional Orthogonal Graph Drawing , 1996, GD.

[86]  I. Tollis,et al.  A Pairing Technique for Area-Efficient Orthogonal Drawings , 1996, Graph Drawing.

[87]  Goos Kant,et al.  2-Visibility Drawings of Planar Graphs , 1996, GD.

[88]  Roberto Tamassia,et al.  A New Minimum Cost Flow Algorithm with Applications to Graph Drawing , 1996, GD.

[89]  Roberto Tamassia,et al.  GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D , 1996, GD.

[90]  Petra Mutzel,et al.  An Alternative Method to Crossing Minimization on Hierarchical Graphs , 1996, GD.

[91]  Shin-Ichi Nakano,et al.  A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs , 1996, Inf. Process. Lett..

[92]  Michael T. Goodrich,et al.  Planar upward tree drawings with optimal area , 1996, Int. J. Comput. Geom. Appl..

[93]  R. Martí,et al.  A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs , 1996 .

[94]  K Schulten,et al.  VMD: visual molecular dynamics. , 1996, Journal of molecular graphics.

[95]  Roberto Tamassia,et al.  On-Line Planarity Testing , 1989, SIAM J. Comput..

[96]  Anusch Taraz,et al.  On the Maximum Planar Subgraph Problem , 1996 .

[97]  Frank Vogt.  Formale Begriffsanalyse mit C++ - Datenstrukturen und Algorithmen , 1996 .

[98]  Rudolf Wille,et al.  Introduction to formal concept analysis , 1996 .

[99]  Diethelm Ostry,et al.  Some Three-Dimensional Graph Drawing Algorithms , 1996 .

[100]  Andreas Zeller,et al.  DDD—a free graphical front-end for UNIX debuggers , 1996, SIGP.

[101]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[102]  Andrew V. Goldberg,et al.  An efficient cost scaling algorithm for the assignment problem , 1995, Math. Program..

[103]  Wen-Lian Hsu.  A Linear Time Algorithm For Finding Maximal Planar Subgraphs , 1995, ISAAC.

[104]  Ioannis G. Tollis,et al.  Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs , 1995, SIAM J. Comput..

[105]  Robert F. Cohen,et al.  Planarity for Clustered Graphs , 1995, ESA.

[106]  Petra Mutzel,et al.  A Polyhedral Approach to Planar Augmentation and Related Problems , 1995, ESA.

[107]  Arne Frick,et al.  Fast Interactive 3-D Graph Visualization , 1995, GD.

[108]  Stephen C. North,et al.  Incremental Layout in DynaDAG , 1995, GD.

[109]  Robert F. Cohen,et al.  Validating Graph Drawing Aesthetics , 1995, GD.

[110]  Michael Kaufmann,et al.  Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.

[111]  Arno Formella,et al.  Generalized Fisheye Views of Graphs , 1995, Graph Drawing.

[112]  Georg Sander,et al.  A Fast Heuristic for Hierarchical Manhattan Layout , 1995, GD.

[113]  Xiaobo Wang,et al.  Generating Customized Layouts , 1995, Graph Drawing.

[114]  Jim Blythe,et al.  The Effect of Graph Layout on Inference from Social Network Data , 1995, GD.

[115]  Isabel F. Cruz,et al.  3D Graph Drawing with Simulated Annealing , 1995, GD.

[116]  Burkhard Monien,et al.  A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs , 1995, GD.

[117]  Alexander Wolff,et al.  Map labeling heuristics: provably good and practically useful , 1995, SCG '95.

[118]  Hristo Djidjev.  A Linear Algorithm for the Maximal Planar Subgraph Problem , 1995, WADS.

[119]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[120]  Joe Marks,et al.  An empirical study of algorithms for point-feature label placement , 1995, TOGS.

[121]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[122]  R. Tamassia,et al.  Upward planarity testing , 1995 .

[123]  Tiziana Catarci,et al.  The assignment heuristic for crossing reduction , 1995, IEEE Trans. Syst. Man Cybern..

[124]  Ioannis G. Tollis,et al.  How to Draw a Series-Parallel Digraph , 1994, Int. J. Comput. Geom. Appl..

[125]  Manojit Sarkar,et al.  Graphical fisheye views , 1994, CACM.

[126]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[127]  Sunil K. Sarin,et al.  Experiences with workflow management: issues for the next generation , 1994, CSCW '94.

[128]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[129]  Achilleas Papakostas.  Upward Planarity Testing of Outerplanar Dags , 1994, Graph Drawing.

[130]  Georg Sander,et al.  Graph Layout through the VCG Tool , 1994, GD.

[131]  Frank Vogt,et al.  TOSCANA - a Graphical Tool for Analyzing and Exploring Data , 1994, GD.

[132]  Pierluigi Crescenzi,et al.  Optimal-Area Upward Drawings of AVL Trees , 1994, Graph Drawing.

[133]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[134]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[135]  Sougata Mukherjea,et al.  Interactive clustering for navigating in hypermedia systems , 1994, ECHT '94.

[136]  Peter Eades,et al.  Drawing Graphs in Two Layers , 1994, Theor. Comput. Sci..

[137]  Joe Marks,et al.  Automating the layout of network diagrams with specified visual organization , 1994, IEEE Trans. Syst. Man Cybern..

[138]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[139]  La Poutre,et al.  Alpha-algorithms for incremental planarity testing , 1994 .

[140]  E. Mäkinen,et al.  Genetic algorithms for drawing bipartite graphs , 1994 .

[141]  Robert Joseph Fowler,et al.  A Spring Modeling Algorithm to Position Nodes of an Undirected Graph in Three Dimensions , 1994 .

[142]  S. Dresbach.  A New Heuristic Layout Algorithm for Directed Acyclic Graphs , 1994 .

[143]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[144]  Frances Paulisch,et al.  The Design of an Extendible Graph Editor , 1993, Lecture Notes in Computer Science.

[145]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[146]  Michiel H. M. Smid,et al.  Static and Dynamic Algorithms for k-Point Clustering Problems , 1993, J. Algorithms.

[147]  Roberto Tamassia,et al.  An incremental approach to aesthetic graph layout , 1993, Proceedings of 6th International Workshop on Computer-Aided Software Engineering.

[148]  Hermann Ney,et al.  Word graphs: an efficient interface between continuous-speech recognition and language understanding , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[149]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[150]  Kurt Mehlhorn,et al.  Exact Algorithms for a Geometric Packing Problem (Extended Abstract) , 1993, STACS.

[151]  Robert E. Tarjan,et al.  An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem , 1992, SIAM J. Comput..

[152]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[153]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[154]  David Eppstein,et al.  Iterated nearest neighbors and finding minimal polytopes , 1993, SODA '93.

[155]  Giuseppe Di Battista,et al.  A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..

[156]  Kelly A. Lyons.  Cluster busting in anchored graph drawing , 1992, CASCON.

[157]  Toshiyuki Masui,et al.  Graphic object layout with interactive genetic algorithms , 1992, Proceedings IEEE Workshop on Visual Languages.

[158]  Vladimir Batagelj,et al.  Automatic clustering of languages , 1992 .

[159]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[160]  Ioannis G. Tollis,et al.  A framework for dynamic graph drawing , 1992, SCG '92.

[161]  Donald E. Knuth,et al.  The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..

[162]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

[163]  J. Leung.  A New Graph-Theoretic Heuristic for Facility Layout , 1992 .

[164]  Joseph Manning.  Geometric symmetry in graphs , 1992 .

[165]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[166]  John G. Hughes,et al.  Object-oriented databases , 1991, Prentice Hall International series in computer science.

[167]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[168]  Jock D. Mackinlay,et al.  Cone Trees: animated 3D visualizations of hierarchical information , 1991, CHI.

[169]  MICHAEL D. HUTTON,et al.  Upward planar drawing of single source acyclic digraphs , 1991, SODA '91.

[170]  Jurek Czyzowicz.  Lattice diagrams with few slopes , 1991, J. Comb. Theory, Ser. A.

[171]  Lawrence A. Rowe,et al.  A divide-and-conquer algorithm for the automatic layout of large directed graphs , 1991, IEEE Trans. Syst. Man Cybern..

[172]  Joe Marks,et al.  The Computational Complexity of Cartographic Label Placement , 1991 .

[173]  Giuseppe Di Battista,et al.  Bipartite Graphs, Upward Drawings, and Planarity , 1990, Inf. Process. Lett..

[174]  Gerhard J. Woeginger,et al.  Drawing graphs in the plane with high resolution , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[175]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[176]  Steven Zoraster,et al.  The Solution of Large 0-1 Integer Programming Problems Encountered in Automated Cartography , 1990, Oper. Res..

[177]  Peter Eades,et al.  Fixed edge-length graph drawing is NP-hard , 1990, Discret. Appl. Math..

[178]  Roberto Tamassia,et al.  On-Line Graph Algorithms with SPQR-Trees , 1990, ICALP.

[179]  Sven Moen,et al.  Drawing dynamic trees , 1990, IEEE Software.

[180]  Andrzej Pelc,et al.  Drawing orders with few slopes , 1990, Discret. Math..

[181]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[182]  Frances Paulisch,et al.  Using constraints to achieve stability in automatic graph layout algorithms , 1990, CHI '90.

[183]  Erkki Mäkinen,et al.  Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..

[184]  Bonnie Berger,et al.  Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.

[185]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[186]  Roberto Tamassia,et al.  Incremental planarity testing , 1989, 30th Annual Symposium on Foundations of Computer Science.

[187]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[188]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[189]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[190]  Thomas Lengauer,et al.  Hierarchical planarity testing algorithms , 1989, JACM.

[191]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[192]  Rudolf Wille,et al.  Lattices in Data Analysis: How to Draw Them with a Computer , 1989 .

[193]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[194]  Takao Nishizeki,et al.  Planar Graphs: Theory and Algorithms , 1988 .

[195]  Satoru Kawai,et al.  A simple method for computing general position in displaying three-dimensional objects , 1988, Comput. Vis. Graph. Image Process..

[196]  Marcello G. Reggiani,et al.  A proposed method for representing hierarchies , 1988, IEEE Trans. Syst. Man Cybern..

[197]  Y. C. Verdière,et al.  Empilements de cercles: Convergence d’une méthode de point fixe , 1989 .

[198]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[199]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[200]  Takao Shimomura,et al.  VIPS: A Visual Debugger , 1987, IEEE Software.

[201]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[202]  Steven Zoraster,et al.  INTEGER PROGRAMMING APPLIED TO THE MAP LABEL PLACEMENT PROBLEM , 1986 .

[203]  Takao Asano,et al.  Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..

[204]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[205]  Peter B. Gibbons,et al.  Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics , 1985, Oper. Res..

[206]  Gerhard Reinelt,et al.  On the acyclic subgraph polytope , 1985, Math. Program..

[207]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[208]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[209]  Gerhard Reinelt,et al.  The linear ordering problem: algorithms and applications , 1985 .

[210]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[211]  S. R. Hiltz,et al.  The International Network for Social Network Analysis , 1984 .

[212]  Hiroyuki Watanabe.  Ic layout generation and compaction using mathematical optimization , 1984 .

[213]  Takao Asano,et al.  Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.

[214]  Chak-Kuen Wong,et al.  An algorithm for optimal two-dimensional compaction of VLSI layouts , 1983, Integr..

[215]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[216]  Hiroyuki Watanabe,et al.  Graph-Optimization Techniques for IC Layout and Compaction , 1983, 20th Design Automation Conference Proceedings.

[217]  Akira Nakamura,et al.  On the NP-hardness of edge-deletion and -contraction problems , 1983, Discret. Appl. Math..

[218]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[219]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[220]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[221]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[222]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[223]  Marie-Jose Carpano,et al.  Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[224]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[225]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[226]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[227]  Daniel J. Kleitman,et al.  Matrix Tree Theorems , 1978, J. Comb. Theory A.

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

[229]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[230]  D. Robinson,et al.  Graph theoretic heuristics for the plant layout problem , 1978 .

[231]  D. Rose,et al.  Generalized nested dissection , 1977 .

[232]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[233]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[234]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

[235]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[236]  C. R. Platt,et al.  Planar lattices and planar graphs , 1976, J. Comb. Theory, Ser. B.

[237]  David Kelly,et al.  Planar Lattices , 1975, Canadian Journal of Mathematics.

[238]  E. Imhof.  Positioning Names on Maps , 1975 .

[239]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[240]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[241]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[242]  Pinhas Yoeli,et al.  The Logic of Automated Map Lettering , 1972 .

[243]  Peter C. Fishburn,et al.  Partial orders of dimension 2 , 1972, Networks.

[244]  E. M. Andreev.  ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES , 1970 .

[245]  E. M. Andreev.  ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE , 1970 .

[246]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[247]  A. Lempel,et al.  Minimum Feedback Arc and Vertex Sets of a Directed Graph , 1966 .

[248]  Clifford J. Fisk,et al.  “ACCEL” automated circuit card etching layout , 1965, DAC.

[249]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[250]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[251]  Pankaj Agarwal,et al.  An Efficient and Effective Approximation Algorithm for the Map Labeling Problem , 2022 .