Villedieu, Anaïs

1. Planarizing Graphs and their Drawings by Vertex Splitting
   2022/02/24 by Nöllenburg, Martin, Sorge, Manuel, Terziadis, Soeren +3 · 4 citations
   #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #FOS: Computer and information sciences
2. Multidimensional Manhattan Preferences
   2022/01/24 by Chen, Jiehua, Nöllenburg, Martin, Simola, Sofia +2 · 1 citation
   #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Economics and business #FOS: Mathematics #Multiagent Systems (cs.MA) #Theoretical Economics (econ.TH)
3. The Complexity of Cluster Vertex Splitting and Company
   2023/09/01 by Alexander Firbas, Firbas, Alexander, Alexander Dobler +11 · 1 citation
   Computer Science · Materials Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Nanocluster Synthesis and Applications
4. On 1-bend Upward Point-set Embeddings of st-digraphs
   2024/01/06 by Emilio Di Giacomo, Henry Förster, Di Giacomo, Emilio +11 · 1 citation
   Computer Science · Engineering · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Structural Analysis and Optimization
5. Crossing Minimization in Time Interval Storylines
   2023/02/28 by Dobler, Alexander, Nöllenburg, Martin, Stojanovic, Daniel +2 · 1 citation
   #Computational Geometry (cs.CG) #FOS: Computer and information sciences