Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Carsten Gutwenger"'
Autor:
Markus Chimani, Carsten Gutwenger
Publikováno v:
Journal of Graph Algorithms and Applications. 19:191-222
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d72987be5572dbb9d828e010ec113fe7
https://doi.org/10.7155/jgaa.00353
https://doi.org/10.7155/jgaa.00353
Publikováno v:
Informatik-Spektrum. 36:162-173
Anhand zweier Beispiele illustrieren wir die Anwendung von Algorithm Engineering im Bereich des automatischen Zeichnens von Graphen. Zunachst berichten wir uber die Planarisierungsmethode und zeichnen ihre Entwicklung in den letzten ca. 10 Jahren nac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd467915bf72be5e3d197843c2728867
https://doi.org/10.1007/s00287-013-0682-3
https://doi.org/10.1007/s00287-013-0682-3
Autor:
Markus Chimani, Carsten Gutwenger
Publikováno v:
Journal of Graph Algorithms and Applications. 16:729-757
The planarization method is the strongest known method to heuristically find good solutions to the general crossing number problem in graphs: starting from a planar subgraph, one iteratively inserts edges, representing crossings via dummy nodes. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1a01bb638814e1664c18a14feedd1f7
https://doi.org/10.7155/jgaa.00264
https://doi.org/10.7155/jgaa.00264
Publikováno v:
Scopus-Elsevier
Technische Universität Dortmund
Technische Universität Dortmund
Recently, we presented a new practical method for upward crossing minimization [6], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe9821152b396a9054b0d567b9c7ae39
https://doi.org/10.7155/jgaa.00220
https://doi.org/10.7155/jgaa.00220
Autor:
Carsten Gutwenger, Markus Chimani
Publikováno v:
Discrete Mathematics. 309(7):1838-1855
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to non-planarity measures like crossing number, skewness, coarseness, and thickness. The core reduction is based on the decomposition of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9381425f201f8a3cd3dc7ee50edc606
Publikováno v:
Electronic Notes in Discrete Mathematics. 28:177-184
Every drawing of a non-planar graph G in the plane induces a planarization , i.e., a planar graph obtained by replacing edge crossings with dummy vertices. In this paper, we consider the relationship between the capacity of a minimum st -cut in a gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b01d246e333ba4cf07922556e2f8bb06
https://doi.org/10.1016/j.endm.2007.01.036
https://doi.org/10.1016/j.endm.2007.01.036
Autor:
Anna Lubiw, Petra Mutzel, Marcus Schaefer, Fabrizio Frati, Timothy M. Chan, Carsten Gutwenger
Publikováno v:
Scopus-Elsevier
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications ISBN: 9783319125671
Graph Drawing
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications ISBN: 9783319125671
Graph Drawing
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and the simulta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee1b4a19bfab393b621ddfb753712f19
http://jgaa.info/getPaper?id=375
http://jgaa.info/getPaper?id=375
Autor:
Markus Eiglsperger, Carsten Gutwenger, Joachim Kupke, Michael Kaufmann, Karsten Klein, Martin Siebenhaller, Sebastian Leipert, Petra Mutzel, Michael Jünger
Publikováno v:
Information Visualization. 3:189-208
Unified modelling language (UML) diagrams have become increasingly important in engineering and re-engineering processes for software systems. Of particular interest are UML class diagrams whose purpose is to display generalizations, associations, ag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0333719d1afc06dc368dd1ca7bdafd6a
https://doi.org/10.1057/palgrave.ivs.9500078
https://doi.org/10.1057/palgrave.ivs.9500078
Autor:
Petra Mutzel, Michael Kaufmann, Ulrik Brandes, Markus Geyer, Antonios Symvonis, Giuseppe Liotta, Cesim Erten, Alejandro Estrella-Balderrama, Stephen G. Kobourov, J. Joseph Fowler, Carsten Gutwenger, Fabrizio Frati, Seok-Hee Hong
Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to represent the same object as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b28aa301c5afe7f778cff02fcf06f6f
https://hdl.handle.net/11729/416
https://hdl.handle.net/11729/416
Publikováno v:
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ISBN: 9781611973198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f2486a4c91fe809084a8f29bdb46577
https://doi.org/10.1137/1.9781611973198.9
https://doi.org/10.1137/1.9781611973198.9