Articles with public access mandates - Alexander WolffLearn more
Not available anywhere: 1
Cover Contact Graphs
MN Atienza Martínez, N Castro Ochoa, MC Cortés Parejo, ...
Lecture Notes in Computer Science, 4875, 171-182., 2007
Mandates: German Research Foundation
Available somewhere: 60
Drawing and labeling high-quality metro maps by mixed-integer programming
M Nollenburg, A Wolff
IEEE Transactions on Visualization and Computer Graphics 17 (5), 626-641, 2011
Mandates: German Research Foundation
Boundary labeling: Models and efficient algorithms for rectangular maps
MA Bekos, M Kaufmann, A Symvonis, A Wolff
Computational Geometry 36 (3), 215-236, 2007
Mandates: German Research Foundation
Drawing subway maps: A survey
A Wolff
Informatik-Forschung und Entwicklung 22, 23-44, 2007
Mandates: German Research Foundation
Morphing polylines: A step towards continuous generalization
M Nöllenburg, D Merrick, A Wolff, M Benkert
Computers, Environment and Urban Systems 32 (4), 248-260, 2008
Mandates: German Research Foundation
Optimizing active ranges for consistent dynamic map labeling
K Been, M Nöllenburg, SH Poon, A Wolff
Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008
Mandates: German Research Foundation
Drawing (complete) binary tanglegrams
K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ...
Algorithmica 62 (1–2), 309–332, 2012
Mandates: German Research Foundation
The minimum Manhattan network problem: approximations and exact solutions
M Benkert, A Wolff, F Widmann, T Shirabe
Computational Geometry 35 (3), 188-208, 2006
Mandates: German Research Foundation
Augmenting the connectivity of planar and geometric graphs
I Rutter, A Wolff
Journal of Graph Algorithms and Applications 16 (2), 599–628, 2012
Mandates: German Research Foundation
Constructing minimum-interference networks
M Benkert, J Gudmundsson, H Haverkort, A Wolff
Computational Geometry 40 (3), 179-194, 2008
Mandates: German Research Foundation
Multi-sided boundary labeling
P Kindermann, B Niedermann, I Rutter, M Schaefer, A Schulz, A Wolff
Algorithmica 76, 225-258, 2016
Mandates: German Research Foundation
Drawing binary tanglegrams: An experimental evaluation
M Nöllenburg, M Völker, A Wolff, D Holten
2009 proceedings of the eleventh workshop on algorithm engineering and …, 2009
Mandates: German Research Foundation
Minimizing intra-edge crossings in wiring diagrams and public transportation maps
M Benkert, M Nöllenburg, T Uno, A Wolff
Graph Drawing: 14th International Symposium, GD 2006, Karlsruhe, Germany …, 2007
Mandates: German Research Foundation
Multi-level Steiner trees
R Ahmed, P Angelini, FD Sahneh, A Efrat, D Glickenstein, M Gronemann, ...
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
Mandates: US National Science Foundation
Farthest-point queries with geometric and combinatorial constraints
O Daescu, N Mi, CS Shin, A Wolff
Computational Geometry 33 (3), 174-185, 2006
Mandates: German Research Foundation
Drawing graphs on few lines and few planes
S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff
Journal of Computational Geometry 11 (1), 433–475-433–475, 2020
Mandates: German Research Foundation, European Commission
Delineating boundaries for imprecise regions
I Reinbacher, M Benkert, M van Kreveld, JSB Mitchell, J Snoeyink, A Wolff
Algorithmica 50, 386-414, 2008
Mandates: German Research Foundation
The complexity of drawing graphs on few lines and few planes
S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff
Journal of Graph Algorithms and Applications 27 (6), 459-488, 2023
Mandates: German Research Foundation
Constructing optimal highways
HK Ahn, H Alt, T Asano, SW Bae, P Brass, O Cheong, C Knauer, HS Na, ...
International Journal of Foundations of Computer Science 20 (01), 3-23, 2009
Mandates: German Research Foundation
On monotone drawings of trees
P Kindermann, A Schulz, J Spoerhase, A Wolff
Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014
Mandates: German Research Foundation
Publication and funding information is determined automatically by a computer program