Your search returned the following 6 documents:

6. Counting Crossing Free Structures
   Victor Alvarez, Karl Bringmann, Radu Curticapean, and Saurabh Ray
   In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), Chapel Hill, NC, USA, 2012, 61-68
   
   
5. A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
   Katrin Dobrindt, Kurt Mehlhorn, and Mariette Yvinec
   In: Algorithms and data structures (WADS-93) : 3rd workshop, Montréal, Canada, 1993, 314-324
   
   
4. AGD: A Library of Algorithms for Graph Drawing
   Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, and Sebastian Leipert
   In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), Montréal, Canada, August 13 - 15, 1998, 456-457
   
3. Graph Drawing Contest Report
   Peter Eades, Joe Marks, Petra Mutzel, and Stephen North
   In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), Montreal, Canada, August 13-15, 1998, 1998, 423-435
   
2. Level Planarity Testing in Linear Time
   Michael Jünger, Sebastian Leipert, and Petra Mutzel
   In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), Montreal, Canada, August 13-15, 1998, 224-237
   
1. Planar Polyline Drawings with Good Angular Resolution
   Carsten Gutwenger and Petra Mutzel
   In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), Montreal, Canada, August 13-15, 1998, 1998, 167-182