Search the dblp DataBase
Henk Meijer :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Sándor P. Fekete , Henk Meijer , André Rohe , Walter Tietze Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] ALENEX, 2001, pp:1-16 [Conf ] Sándor P. Fekete , Henk Meijer Maximum dispersion and geometric maximum weight cliques. [Citation Graph (0, 0)][DBLP ] APPROX, 2000, pp:132-143 [Conf ] Kelly A. Lyons , Henk Meijer , David Rappaport Properties of the voronoi diagram cluster buster. [Citation Graph (0, 0)][DBLP ] CASCON, 1993, pp:1148-1163 [Conf ] Greg Aloupis , Prosenjit Bose , Erik D. Demaine , Stefan Langerman , Henk Meijer , Mark H. Overmars , Godfried T. Toussaint Computing signed permutations of polygons. [Citation Graph (0, 0)][DBLP ] CCCG, 2002, pp:68-71 [Conf ] Greg Aloupis , Erik D. Demaine , Henk Meijer , Joseph O'Rourke , Ileana Streinu , Godfried T. Toussaint On flat-state connectivity of chains with fixed acute angles. [Citation Graph (0, 0)][DBLP ] CCCG, 2002, pp:27-30 [Conf ] Mark de Berg , Henk Meijer , Mark H. Overmars , Gordon T. Wilfong Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP ] CCCG, 1996, pp:331-336 [Conf ] Prosenjit Bose , Ferran Hurtado , Henk Meijer , Suneeta Ramaswami , David Rappaport , Vera Sacristan , Thomas C. Shermer , Godfried T. Toussaint Finding specified sections of arrangements: 2d results. [Citation Graph (0, 0)][DBLP ] CCCG, 1998, pp:- [Conf ] Erik D. Demaine , Francisco Gomez-Martin , Henk Meijer , David Rappaport , Perouz Taslakian , Godfried T. Toussaint , Terry Winograd , David R. Wood The Distance Geometry of Deep Rhythms and Scales. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:163-166 [Conf ] Kathryn Duffy , Chris McAloney , Henk Meijer , David Rappaport Closest Segments. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:232-234 [Conf ] Paul Colley , Henk Meijer , David Rappaport Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. [Citation Graph (0, 0)][DBLP ] CCCG, 1994, pp:269-274 [Conf ] Henk Meijer , David Rappaport Simultaneous edge flips for convex subdivisions. [Citation Graph (0, 0)][DBLP ] CCCG, 2004, pp:57-59 [Conf ] Henk Meijer , Steven Skiena Reconstructing Polygons From X-Rays. [Citation Graph (0, 0)][DBLP ] CCCG, 1993, pp:381-386 [Conf ] Esther M. Arkin , Henk Meijer , Joseph S. B. Mitchell , David Rappaport , Steven Skiena Decision Trees for Geometric Models. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:369-378 [Conf ] Erik D. Demaine , Jeff Erickson , Ferran Hurtado , John Iacono , Stefan Langerman , Henk Meijer , Mark H. Overmars , Sue Whitesides Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2004, pp:10-16 [Conf ] Sándor P. Fekete , Henk Meijer On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:217-226 [Conf ] Carlisle M. Adams , Henk Meijer Security-Related Comments Regarding McEliece's Public-Key Cryptosystem. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1987, pp:224-228 [Conf ] Selim G. Akl , Henk Meijer A Fast Pseudo Random Permutation Generator With Applications to Cryptology. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1984, pp:269-275 [Conf ] Henk Meijer , Selim G. Akl Digital Signature Scheme for Computer Communication Networks. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1981, pp:65-70 [Conf ] Liam Keliher , Henk Meijer , Stafford E. Tavares New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2001, pp:420-436 [Conf ] Henk Meijer , Selim G. Akl Two New Secret Key Cryptosystems. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1985, pp:96-102 [Conf ] Therese C. Biedl , Anna Bretscher , Henk Meijer Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1999, pp:359-368 [Conf ] Hossam A. ElGindy , Giuseppe Liotta , Anna Lubiw , Henk Meijer , Sue Whitesides Recognizing Rectangle of Influence Drawable Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1994, pp:352-363 [Conf ] Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta , Henk Meijer Computing Radial Drawings on the Minimum Number of Circles. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2004, pp:251-261 [Conf ] Emilio Di Giacomo , Giuseppe Liotta , Henk Meijer , Stephen K. Wismath Volume Requirements of 3D Upward Drawings. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2005, pp:101-110 [Conf ] Emilio Di Giacomo , Henk Meijer Track Drawings of Graphs with Constant Queue Number. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2003, pp:214-225 [Conf ] Giuseppe Liotta , Henk Meijer Voronoi Drawings of Trees. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1999, pp:369-378 [Conf ] Emilio Di Giacomo , Walter Didimo , Giuseppe Liotta , Henk Meijer , Francesco Trotta , Stephen K. Wismath k -Colored Point-Set Embeddability of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2006, pp:318-329 [Conf ] Michael Hirsch , Henk Meijer , David Rappaport Biclique Edge Cover Graphs and Confluent Drawings. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2006, pp:405-416 [Conf ] José Miguel Díaz-Báñez , Ferran Hurtado , Henk Meijer , David Rappaport , Joan Antoni Sellarès The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (3), 2002, pp:46-54 [Conf ] Ke Qiu , Henk Meijer , Selim G. Akl Parallel Routing and Sorting of the Pancake Network. [Citation Graph (0, 0)][DBLP ] ICCI, 1991, pp:360-371 [Conf ] Greg Aloupis , Erik D. Demaine , Vida Dujmovic , Jeff Erickson , Stefan Langerman , Henk Meijer , Joseph O'Rourke , Mark H. Overmars , Michael A. Soss , Ileana Streinu , Godfried T. Toussaint Flat-State Connectivity of Linkages under Dihedral Motions. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:369-380 [Conf ] Liam Keliher , Henk Meijer , Stafford E. Tavares Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2001, pp:112-128 [Conf ] Liam Keliher , Henk Meijer , Stafford E. Tavares Modeling Linear Characteristics of Substitution-Permutation Networks. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 1999, pp:78-91 [Conf ] Sándor P. Fekete , Marco E. Lübbecke , Henk Meijer Minimizing the stabbing number of matchings, trees, and triangulations. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:437-446 [Conf ] Paul E. Kearney , Ryan Hayward , Henk Meijer Inferring Evolutionary Trees from Ordinal Data. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:418-426 [Conf ] Michael A. Bender , David P. Bunde , Erik D. Demaine , Sándor P. Fekete , Vitus J. Leung , Henk Meijer , Cynthia A. Phillips Communication-Aware Processor Allocation for Supercomputers. [Citation Graph (0, 0)][DBLP ] WADS, 2005, pp:169-181 [Conf ] Sándor P. Fekete , Henk Meijer The One-Round Voronoi Game Replayed. [Citation Graph (0, 0)][DBLP ] WADS, 2003, pp:150-171 [Conf ] Ferran Hurtado , Giuseppe Liotta , Henk Meijer Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. [Citation Graph (0, 0)][DBLP ] WADS, 2001, pp:2-13 [Conf ] Henk Meijer , R. Dawes Fault Tolerant Networks of Specified Diameter. [Citation Graph (0, 0)][DBLP ] WG, 1988, pp:74-86 [Conf ] Sándor P. Fekete , Henk Meijer Maximum Dispersion and Geometric Maximum Weight Cliques. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:38, n:3, pp:501-511 [Journal ] Paul E. Kearney , Ryan Hayward , Henk Meijer Evolutionary Trees and Ordinal Assertions. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1999, v:25, n:2-3, pp:196-221 [Journal ] Oswin Aichholzer , David Bremner , Erik D. Demaine , Henk Meijer , Vera Sacristan , Michael A. Soss Long proteins with unique optimal foldings in the H-P model. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2003, v:25, n:1-2, pp:139-159 [Journal ] Sándor P. Fekete , Henk Meijer The one-round Voronoi game replayed. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2005, v:30, n:2, pp:81-94 [Journal ] Emilio Di Giacomo , Giuseppe Liotta , Henk Meijer Computing straight-line 3D grid drawings of graphs in linear volume. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2005, v:32, n:1, pp:26-58 [Journal ] Giuseppe Liotta , Anna Lubiw , Henk Meijer , Sue Whitesides The rectangle of influence drawability problem. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1998, v:10, n:1, pp:1-22 [Journal ] Giuseppe Liotta , Henk Meijer Voronoi drawings of trees. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2003, v:24, n:3, pp:147-178 [Journal ] Ferran Hurtado , Giuseppe Liotta , Henk Meijer Optimal and suboptimal robust algorithms for proximity graphs. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2003, v:25, n:1-2, pp:35-49 [Journal ] Oswin Aichholzer , Carmen Cortés , Erik D. Demaine , Vida Dujmovic , Jeff Erickson , Henk Meijer , Mark H. Overmars , Belén Palop , Suneeta Ramaswami , Godfried T. Toussaint Flipturning polygons [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Oswin Aichholzer , David Bremner , Erik D. Demaine , Henk Meijer , Vera Sacristan , Michael A. Soss Long Proteins with Unique Optimal Foldings in the H-P Model [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Sándor P. Fekete , Henk Meijer The one-round Voronoi game replayed [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Sándor P. Fekete , Marco E. Lübbecke , Henk Meijer Minimizing the stabbing number of matchings, trees, and triangulations [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Sándor P. Fekete , Henk Meijer , André Rohe , Walter Tietze Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Sándor P. Fekete , Henk Meijer Maximum dispersion and geometric maximum weight cliques [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Michael A. Bender , David P. Bunde , Erik D. Demaine , Sándor P. Fekete , Vitus J. Leung , Henk Meijer , Cynthia A. Phillips Communication-Aware Processor Allocation for Supercomputers [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Thomas Fevens , Henk Meijer , David Rappaport Minimum convex partition of a constrained point set. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:95-107 [Journal ] Kiyoshi Hosono , Henk Meijer , David Rappaport On the visibility graph of convex translates. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:195-210 [Journal ] Giuseppe Liotta , Henk Meijer Advances in graph drawing: The 11th International Symposium on Graph Drawing. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:9, pp:1077- [Journal ] Sándor P. Fekete , Henk Meijer On Minimum Stars and Maximum Matchings. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2000, v:23, n:3, pp:389-407 [Journal ] Esther M. Arkin , Henk Meijer , Joseph S. B. Mitchell , David Rappaport , Steven Skiena Decision trees for geometric models. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:343-364 [Journal ] Mark de Berg , Henk Meijer , Mark H. Overmars , Gordon T. Wilfong Computing the Angularity Tolerance. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1998, v:8, n:4, pp:467-0 [Journal ] Erik D. Demaine , Jeff Erickson , Ferran Hurtado , John Iacono , Stefan Langerman , Henk Meijer , Mark H. Overmars , Sue Whitesides Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal ] José Miguel Díaz-Báñez , Ferran Hurtado , Henk Meijer , David Rappaport , Joan Antoni Sellarès The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:317-325 [Journal ] Sándor P. Fekete , Henk Meijer Rectangle and Box Visibility Graphs in 3D. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:1-0 [Journal ] Henk Meijer , David Rappaport Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:545-546 [Journal ] Dorothy E. Denning , Henk Meijer , Fred B. Schneider More on Master Keys for Group Sharing. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:13, n:3, pp:125-126 [Journal ] Henk Meijer A Note on `A Cryptosystem for Multiple Communication'. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:179-181 [Journal ] Henk Meijer , Selim G. Akl The Design and Analysis of a New Hybrid Sorting Algorithm. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1980, v:10, n:4/5, pp:213-218 [Journal ] Henk Meijer , David Rappaport Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:35-38 [Journal ] Ke Qiu , Henk Meijer A Note on Diameter of Acyclic Directed Hypercubes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:36, n:1, pp:51-52 [Journal ] Ke Qiu , Henk Meijer , Selim G. Akl Decomposing a Star Graph Into Disjoint Cycles. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:39, n:3, pp:125-129 [Journal ] Selim G. Akl , Henk Meijer On the Average-Case Complexity of "Bucketing" Algorithms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1982, v:3, n:1, pp:9-13 [Journal ] Marco Martens , Henk Meijer On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2007, v:5, n:1, pp:102-114 [Journal ] Sándor P. Fekete , Henk Meijer , André Rohe , Walter Tietze Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:11- [Journal ] Kelly A. Lyons , Henk Meijer , David Rappaport Algorithms for Cluster Busting in Anchored Graph Drawing. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 1998, v:2, n:1, pp:- [Journal ] Prosenjit Bose , Hazel Everett , Sándor P. Fekete , Michael E. Houle , Anna Lubiw , Henk Meijer , Kathleen Romanik , Günter Rote , Thomas C. Shermer , Sue Whitesides , Christian Zelle A Visibility Representation for Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal ] Prosenjit Bose , Ferran Hurtado , Henk Meijer , Suneeta Ramaswami , David Rappaport , Vera Sacristan , Thomas C. Shermer , Godfried T. Toussaint Finding Specified Sections of Arrangements: 2D Results. [Citation Graph (0, 0)][DBLP ] J. Math. Model. Algorithms, 2002, v:1, n:1, pp:3-16 [Journal ] Selim G. Akl , Henk Meijer , Ivan Stojmenovic An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1994, v:20, n:1, pp:84-91 [Journal ] Paraskevi Fragopoulou , Selim G. Akl , Henk Meijer Optimal Communication Primitives on the Generalized Hypercube Network. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1996, v:32, n:2, pp:173-187 [Journal ] Ke Qiu , Selim G. Akl , Henk Meijer On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1994, v:22, n:1, pp:16-25 [Journal ] Stephen J. MacKinnon , Peter D. Taylor , Henk Meijer , Selim G. Akl An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1985, v:34, n:9, pp:797-802 [Journal ] Carlisle M. Adams , Henk Meijer Security-related comments regarding McEliece's public-key cryptosystem. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1989, v:35, n:2, pp:454-455 [Journal ] Selim G. Akl , Henk Meijer Parallel Binary Search. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1990, v:1, n:2, pp:247-250 [Journal ] Kamrul Islam , Selim G. Akl , Henk Meijer On Planar Path Transformation. [Citation Graph (0, 0)][DBLP ] CCCG, 2006, pp:- [Conf ] Kamrul Islam , Henk Meijer , Yurai Núñez Rodríguez , David Rappaport , Henry Xiao Hamilton Circuits in Hexagonal Grid Graphs. [Citation Graph (0, 0)][DBLP ] CCCG, 2007, pp:85-88 [Conf ] Mirela Damian , Erik D. Demaine , Martin L. Demaine , Vida Dujmovic , Dania El-Khechen , Robin Y. Flatland , John Iacono , Stefan Langerman , Henk Meijer , Suneeta Ramaswami , Diane L. Souvaine , Perouz Taslakian , Godfried T. Toussaint Curves in the Sand: Algorithmic Drawing. [Citation Graph (0, 0)][DBLP ] CCCG, 2006, pp:- [Conf ] Erik D. Demaine , Francisco Gomez-Martin , Henk Meijer , David Rappaport , Perouz Taslakian , Godfried T. Toussaint , Terry Winograd , David R. Wood The Distance Geometry of Music [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Selim G. Akl , Kamrul Islam , Henk Meijer On planar path transformation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:104, n:2, pp:59-64 [Journal ] On the Complexity of Point Recolouring in Geometric Graphs. [Citation Graph (, )][DBLP ] Direct Planar Tree Transformation and Counterexample. [Citation Graph (, )][DBLP ] Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. [Citation Graph (, )][DBLP ] Bi-chromatic minimum spanning trees. [Citation Graph (, )][DBLP ] Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP ] Point-Set Embedding of Trees with Edge Constraints. [Citation Graph (, )][DBLP ] On Planar Supports for Hypergraphs. [Citation Graph (, )][DBLP ] Constrained Point-Set Embeddability of Planar Graphs. [Citation Graph (, )][DBLP ] Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. [Citation Graph (, )][DBLP ] A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. [Citation Graph (, )][DBLP ] Maximizing the lifetime of wireless sensor networks through domatic partition. [Citation Graph (, )][DBLP ] Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. [Citation Graph (, )][DBLP ] Matched Drawability of Graph Pairs and of Graph Triples. [Citation Graph (, )][DBLP ] Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. [Citation Graph (, )][DBLP ] Bounds for point recolouring in geometric graphs. [Citation Graph (, )][DBLP ] Editorial CCCG 2006. [Citation Graph (, )][DBLP ] Point-set embeddings of trees with given partial drawings. [Citation Graph (, )][DBLP ] The distance geometry of music. [Citation Graph (, )][DBLP ] Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP ] Matched drawability of graph pairs and of graph triples. [Citation Graph (, )][DBLP ] An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment [Citation Graph (, )][DBLP ] Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. [Citation Graph (, )][DBLP ] Volume requirements of 3D upward drawings. [Citation Graph (, )][DBLP ] Search in 0.007secs, Finished in 0.013secs