1
0
0
(1 - 22 von 22
)
Martin Nöllenburg - Algorithms and Complexity Group - TU WienTU Wien
www.ac.tuwien.ac.at
Publications ; ; [13], Morphing Polylines: A Step Towards Continuous Generalization Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert Publications ; ; [13], Morphing Polylines: A Step Towards Continuous Generalization Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert
KIT - ITI Algorithmik - Curriculum vitae
i11www.iti.kit.edu
23. Feb · Marc Benkert; Marcel Radermacher, M.Sc. Marco Gaertler; Dr. Marcus Krug; Dr. Markus Völker; Martin Holzer; PD Dr. Martin Nöllenburg; Dr. Matthias Wolf; Dr. Michael Baur; Dr. Moritz Baum; Dr. Reinhard Bauer; Univ.-Prof. Dr. Rob van Stee; Dr. rer. nat. Robert Görke; Michael Hamann, M.Sc. Dipl.-Inform. Roman Prutkin; Dr. Sascha ...
ITI Algorithmik I - Morphen von Polygonzügen - KITi11www.iti.uni-karlsruhe.de › projects › geonet › gen
i11www.iti.kit.edu
Publikationen. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. Morphing polygonal lines: A step towards continuous generalization.
KIT - ITI Algorithmik I - Veröffentlichungen
i11www.iti.kit.edu
... Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, and Alexander Wolff. ...
dblp: Martin Nöllenburg
dblp.uni-trier.de
List of computer science publications by Martin Nöllenburg
Minimizing Intra-edge Crossings in Wiring Diagrams and Public ...link.springer.com › Graph Drawing
link.springer.com
Marc Benkert, Martin Nöllenburg & Alexander Wolff. National Institute of Informatics, Tokyo, Japan. Takeaki Uno. Authors. Marc Benkert.
Algorithms for Multi-Criteria Boundary LabelingRIMS, Kyoto University
www.kurims.kyoto-u.ac.jp
von M Benkert · Zitiert von: 40 — ... (Marc Benkert) (Herman Haverkort) (Moritz Kroll) .de (Martin Nöllenburg). Page M. Benkert ... von M Benkert · Zitiert von: 40 — ... (Marc Benkert) (Herman Haverkort) (Moritz Kroll) .de (Martin Nöllenburg). Page M. Benkert ...
Holdings: Graph drawingAUT
librarysearch.aut.ac.nz
... Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff; Upright-Quad Drawing of st-Planar Learning Spaces / David Eppstein; Choosing Colors for Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff; Upright-Quad Drawing of st-Planar Learning Spaces / David Eppstein; Choosing Colors for ...
Minimizing Intra-edge Crossings in Wiring Diagrams and ...OUCI
ouci.dntb.gov.ua
Authors: Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff. List of references. Cortese, P.F., Battista, G.D., Patrignani, M., Pizzonia, M.: On ... Authors: Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff. List of references. Cortese, P.F., Battista, G.D., Patrignani, M., Pizzonia, M.: On ...
KIT - ITI Algorithmik - Marc Benkert
i11www.iti.kit.edu
26. Mai · Marc Benkert; Dr. Marcel Radermacher; Marco Gaertler; Dr. Marcus Krug; Dr. Markus Völker; Martin Holzer; PD Dr. Martin Nöllenburg; Dr. Matthias Wolf; Dr. Michael Baur; Dr. Moritz Baum; Dr. Reinhard Bauer; Univ.-Prof. Dr. Rob van Stee; Dr. rer. nat. Robert Görke; Dr. Roman Prutkin; Dr. Sascha Meinert; Dipl.-Math. Silke Wagner; Dipl ...
KIT - ITI Algorithmik - Lehre
i11www.iti.kit.edu
Marc Benkert; Dr. Marcel Radermacher; Marco Gaertler; Dr. Marcus Krug; Dr. Markus Völker; Martin Holzer; PD Dr. Martin Nöllenburg; Dr. Matthias Wolf; Dr. Michael Baur; Dr. Moritz Baum; Dr. Reinhard Bauer; Univ.-Prof. Dr. Rob van Stee; Dr. rer. nat. Robert Görke; Dr. Roman Prutkin; Dr. Sascha Meinert; Dipl.-Math. Silke Wagner; Dipl.-Math ...
GD Accepted Papers
gd2006.iti.kit.edu
Marc Benkert, Martin Nöllenburg, Takeaki Uno and Alexander Wolff. Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps; Martin Siebenhaller.
GD Program
gd2006.iti.kit.edu
Marc Benkert, Martin Nöllenburg, Takeaki Uno and Alexander Wolff. Upright-Quad Drawing of st-Planar Learning Spaces. David Eppstein Choosing Colors for Geometric ...
Automated cartography - Herman Haverkort
herman.haverkort.net
— By Marc Benkert, Herman Haverkort, Moritz Kroll, and Martin Nöllenburg. Journal on Graph Algorithms and Applications, 13(3):289–317, › doku
Algorithms for Multi-Criteria Boundary LabelingJournal of Graph Algorithms and Applications
jgaa.info
von M Benkert · Zitiert von: 36 — DOI: jgaa Algorithms for Multi-Criteria Boundary Labeling. Marc Benkert, Herman Haverkort, Moritz Kroll, and Martin Nöllenburg. Vol. 13, no.
EWCG PROGRAM - Wednesdayeurocg.org › ewcg07.tugraz.at › program-Wednesday
eurocg.org
Marc Benkert, Martin Nöllenburg. 10: :00, Coffee Break. 11: :30, Session 10. Optimal Higher Order Delaunay Triangulations of Polygons.
Morphing polylines: A step towards continuous ...Infona.pl
www.infona.pl
von M Nöllenburg · · Zitiert von: 95 — Morphing polylines: A step towards continuous generalization. Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert.
Volume 13, 2009Tata Institute of Fundamental Research
emis.math.tifr.res.in
Marc Benkert , Herman Haverkort , Moritz Kroll , and Martin Nöllenburg Vol. 13, no. 3, pp , Regular paper; DOI: jgaa
Journal of Graph Algorithms and Applications
jgaa.info
, DOI: jgaa · Algorithms for Multi-Criteria Boundary Labeling. Marc Benkert, Herman Haverkort, Moritz Kroll, and Martin Nöllenburg.
Volume 13, RIMS, Kyoto Universitywww.kurims.kyoto-u.ac.jp › EMIS › journals › JGAA
www.kurims.kyoto-u.ac.jp
Marc Benkert , Herman Haverkort , Moritz Kroll , and Martin Nöllenburg Vol. 13, no. 3, pp , Regular paper; DOI: jgaa
Alle Infos zum Namen "Marc Benkert"
sortiert nach Relevanz / Datum