pith. sign in

Alexander Wolff

Identifiers

  • name variant Alexander Wolff 0.60 · backfill

Papers (35)

  1. Navigating Posets with Few Maps math.CO · 2026 · author #4
  2. Modelling Network Resilience: The Complexity of Some Graph Division Games cs.CC · 2026 · author #4
  3. The Parameterized Complexity of Coloring Mixed Graphs cs.CC · 2026 · author #4
  4. One-Sided Local Crossing Minimization cs.DS · 2025 · author #9
  5. Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion cs.CG · 2025 · author #5
  6. Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity cs.DS · 2018 · author #8
  7. Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity cs.CG · 2018 · author #5
  8. Drawing Graphs on Few Circles and Few Spheres cs.CG · 2017 · author #3
  9. Computing Storyline Visualizations with Few Block Crossings cs.CG · 2017 · author #4
  10. Planar L-Drawings of Directed Graphs cs.DS · 2017 · author #8
  11. On the Maximum Crossing Number cs.CG · 2017 · author #6
  12. Block Crossings in Storyline Visualizations cs.CG · 2016 · author #8
  13. Snapping Graph Drawings to the Grid Optimally cs.CG · 2016 · author #3
  14. Drawing Graphs on Few Lines and Few Planes cs.CG · 2016 · author #6
  15. Obstructing Visibilities with One Obstacle cs.CG · 2016 · author #4
  16. Colored Non-Crossing Euclidean Steiner Forest cs.CG · 2015 · author #6
  17. Pixel and Voxel Representations of Graphs cs.DM · 2015 · author #5
  18. On Monotone Drawings of Trees cs.CG · 2015 · author #4
  19. Drawing Graphs within Restricted Area cs.CG · 2014 · author #4
  20. Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends cs.CG · 2014 · author #4
  21. Improved Approximation Algorithms for Box Contact Representations cs.DS · 2014 · author #8
  22. Smooth Orthogonal Drawings of Planar Graphs cs.CG · 2013 · author #6
  23. Semantic Word Cloud Representations: Hardness and Approximation Algorithms cs.CG · 2013 · author #10
  24. Multi-Sided Boundary Labeling cs.CG · 2013 · author #6
  25. Progress on Partial Edge Drawings cs.CG · 2012 · author #7
  26. Polylogarithmic Approximation for Generalized Minimum Manhattan Networks cs.CG · 2012 · author #6
  27. Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles cs.DS · 2011 · author #5
  28. Approximating Minimum Manhattan Networks in Higher Dimensions cs.CG · 2011 · author #6
  29. The Traveling Salesman Problem Under Squared Euclidean Distances cs.CG · 2010 · author #5
  30. Drawing Binary Tanglegrams: An Experimental Evaluation cs.DS · 2008 · author #4
  31. Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability cs.CG · 2008 · author #7
  32. Trimming of Graphs, with Application to Point Labeling cs.DM · 2008 · author #5
  33. Untangling a Planar Graph cs.CG · 2007 · author #6
  34. Moving Vertices to Make Drawings Plane cs.CG · 2007 · author #5
  35. Constructing Optimal Highways cs.CG · 2007 · author #10

Mentions

  • 1403.4861 #8 · backfill · confidence 0.70 Alexander Wolff
  • 1312.3538 #6 · backfill · confidence 0.70 Alexander Wolff
  • 1311.4778 #10 · backfill · confidence 0.70 Alexander Wolff
  • 1305.0750 #6 · backfill · confidence 0.70 Alexander Wolff
  • 1209.0830 #7 · backfill · confidence 0.70 Alexander Wolff
  • 1203.6481 #6 · backfill · confidence 0.70 Alexander Wolff
  • 1107.4970 #5 · backfill · confidence 0.70 Alexander Wolff
  • 2605.20877 #4 · arxiv_oai · confidence 0.70 Alexander Wolff
  • 1107.0901 #6 · backfill · confidence 0.70 Alexander Wolff
  • 2605.17572 #4 · arxiv_oai · confidence 0.70 Alexander Wolff
  • 1001.0236 #5 · backfill · confidence 0.70 Alexander Wolff
  • 0806.0928 #4 · backfill · confidence 0.70 Alexander Wolff
  • 0806.0920 #7 · backfill · confidence 0.70 Alexander Wolff
  • 0802.2854 #5 · backfill · confidence 0.70 Alexander Wolff
  • 0709.0170 #6 · backfill · confidence 0.70 Alexander Wolff
  • 0706.1002 #5 · backfill · confidence 0.70 Alexander Wolff

Frequent Coauthors