Crossing Numbers of Graphs

Marcus Schaefer received his undergraduate degree from the University of Karlsruhe, then his Ph.D. in Computer Science from the University of Chicago. After getting his doctorate, he has worked at the Computer Science Department of DePaul University in Chicago where he became an associate professor. His research interests include graph drawing, graph theory, computational complexity, and computability. He currently has 57 publications on MathSciNet. He also co-authored a book, Algorithms.

• 1. Introduction and HistoryPart I: The Crossing Number2. Crossing Number3. Crossing Number and other Parameters4. Computational Complexity5. AlgorithmsPart II: Crossing Number Variants6. Rectilinear Crossing Number7. Local Crossing Number8. Monotone and Book crossing numbers9. Pair Crossing Number10. k-planar Crossing Number11. Independent Odd Crossing Number12. Maximum Crossing NumbersPart III: Applications13. Crossing Minimization14. Geometric ConfigurationsAppendixA Topological Graph Theory BasicsB Complexity Theory

Select Guide Rating