Schulz, André

1. Bounds on the maximum multiplicity of some common geometric graphs
   2010/12/27 by Adrian Dumitrescu, Dumitrescu, Adrian, André Schulz +5 · 3 citations
   Computer Science · #Advanced Graph Theory Research #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1 #G.2.2 #Graph Labeling and Dimension Problems
2. On the number of spanning trees a planar graph can have
   2009/12/03 by Buchin, Kevin, Schulz, André · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
3. On the geometric thickness of 2-degenerate graphs
   2023/02/28 by Jain, Rahul, Ricci, Marco, Rollin, Jonathan +1 · 2 citations
   #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics
4. Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
   2018/08/26 by Kindermann, Philipp, Montecchiani, Fabrizio, Schlipf, Lena +1 · 1 citation
   #Computational Geometry (cs.CG) #FOS: Computer and information sciences
5. Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
   2024/12/30 by Abrahamsen, Mikkel, Buchin, Kevin, Buchin, Maike +5 · 1 citation
   #Computational Geometry (cs.CG) #FOS: Computer and information sciences