Algorithms for Near-Planar Graphs: if We Know That a Graph Has Special Properties, How Can We Exploit This to Make Algorithms Faster?
1 faculty research Algorithms for Near-Planar Graphs: if We Know That a Graph Has Special Properties, How Can We Exploit This to Make Algorithms Faster? on GradNova.
Algorithms for Near-Planar Graphs: if We Know That a Graph Has Special Properties, How Can We Exploit This to Make Algorithms Faster?
Graph Drawing: How to Map a Graph to Geometric Objects (such as Points in the Planes for Vertices and Line Segments for Edges), Under Some Objective Function?
Computational Geometry and Mesh Generation
Advanced Graph Theory Research
+3