Complexity and Algorithms in Graphs
356 faculty research Complexity and Algorithms in Graphs 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
A
Professor; Associate Director of Graduate Studies
P
S
Seeley G. Mudd Professor of Engineering, and University Professor of Computer Science and Mathematics
A
Assistant Professor of Computer Science and Data Science