| Shortest feasible paths with charging stops for battery electric vehicles M Baum, J Dibbelt, A Gemsa, D Wagner, T Zündorf Proceedings of the 23rd SIGSPATIAL international conference on advances in …, 2015 | 107 | 2015 |
| Evaluation of labeling strategies for rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Experimental Algorithmics (JEA) 21, 1-21, 2016 | 54 | 2016 |
| Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011 | 48 | 2011 |
| Trajectory-based dynamic map labeling A Gemsa, B Niedermann, M Nöllenburg International Symposium on Algorithms and Computation, 413-423, 2013 | 37 | 2013 |
| Space-efficient SHARC-routing E Brunel, D Delling, A Gemsa, D Wagner International Symposium on Experimental Algorithms, 47-58, 2010 | 24 | 2010 |
| Towards route planning algorithms for electric vehicles with realistic constraints M Baum, J Dibbelt, A Gemsa, D Wagner Computer Science-Research and Development 31, 105-109, 2016 | 20 | 2016 |
| Multirow boundary-labeling algorithms for panorama images A Gemsa, JH Haunert, M Nöllenburg ACM Transactions on Spatial Algorithms and Systems (TSAS) 1 (1), 1-30, 2015 | 19 | 2015 |
| On d-regular schematization of embedded paths D Delling, A Gemsa, M Nöllenburg, T Pajor, I Rutter Computational Geometry 47 (3), 381-406, 2014 | 19 | 2014 |
| Path schematization for route sketches D Delling, A Gemsa, M Nöllenburg, T Pajor Scandinavian Workshop on Algorithm Theory, 285-296, 2010 | 19 | 2010 |
| Sliding labels for dynamic point labeling A Gemsa, M Nöllenburg, I Rutter | 18 | 2011 |
| Boundary-labeling algorithms for panorama images A Gemsa, JH Haunert, M Nöllenburg Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances …, 2011 | 17 | 2011 |
| On the readability of boundary labeling L Barth, A Gemsa, B Niedermann, M Nöllenburg Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015 | 16 | 2015 |
| On the readability of leaders in boundary labeling L Barth, A Gemsa, B Niedermann, M Nöllenburg Information Visualization 18 (1), 110-132, 2019 | 11 | 2019 |
| Efficient computation of jogging routes A Gemsa, T Pajor, D Wagner, T Zündorf International Symposium on Experimental Algorithms, 272-283, 2013 | 10 | 2013 |
| On d-Regular Schematization of Embedded Paths A Gemsa, M Nöllenburg, T Pajor, I Rutter SOFSEM 2011: Theory and Practice of Computer Science: 37th Conference on …, 2011 | 10 | 2011 |
| Higher order city Voronoi diagrams A Gemsa, DT Lee, CH Liu, D Wagner Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012 | 9 | 2012 |
| Scalable exact visualization of isocontours in road networks via minimum-link paths M Baum, T Bläsius, A Gemsa, I Rutter, F Wegner Journal of Computational Geometry 9 (1), 27–73-27–73, 2018 | 8 | 2018 |
| Label placement in road maps A Gemsa, B Niedermann, M Nöllenburg Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris …, 2015 | 8 | 2015 |
| A unified model and algorithms for temporal map labeling A Gemsa, B Niedermann, M Nöllenburg Algorithmica 82 (10), 2709-2736, 2020 | 5 | 2020 |
| Generalizing geometric graphs E Brunel, A Gemsa, M Krug, I Rutter, D Wagner Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012 | 5 | 2012 |
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienEmail verificata su ac.tuwien.ac.at
