Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Gutwenger, Carsten"'
Autor:
Chan, Timothy M., Frati, Fabrizio, Gutwenger, Carsten, Lubiw, Anna, Mutzel, Petra, Schaefer, Marcus
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:
http://arxiv.org/abs/1410.8205
Autor:
Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Wolff, Alexander
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs. We focus on
Externí odkaz:
http://arxiv.org/abs/1209.0830
Autor:
Bachmaier, Christian, Brandenburg, Franz J., Effinger, Philip, Gutwenger, Carsten, Katajainen, Jyrki, Klein, Karsten, Spönemann, Miro, Stegmaier, Matthias, Wybrow, Michael
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimental results, this creates a demand for a public archive to gather and st
Externí odkaz:
http://arxiv.org/abs/1109.1465
Autor:
van Dyk, Danny, Geveler, Markus, Mallach, Sven, Ribbrock, Dirk, Goeddeke, Dominik, Gutwenger, Carsten
Publikováno v:
Computer Physics Communications 180(12), pp. 2534-2543, December 2009
We present HONEI, an open-source collection of libraries offering a hardware oriented approach to numerical calculations. HONEI abstracts the hardware, and applications written on top of HONEI can be executed on a wide range of computer architectures
Externí odkaz:
http://arxiv.org/abs/0904.4152
Autor:
Chimani, Markus, Gutwenger, Carsten
Publikováno v:
In Discrete Mathematics 2009 309(7):1838-1855
Autor:
Buchheim, Christoph, Chimani, Markus, Ebner, Dietmar, Gutwenger, Carsten, Jünger, Michael, Klau, Gunnar W., Mutzel, Petra, Weiskircher, René
Publikováno v:
In Discrete Optimization 2008 5(2):373-388
Autor:
Bachmaier, Christian, Brandenburg, Franz J., Effinger, Philip, Gutwenger, Carsten, Katajainen, Jyrki, Klein, Karsten, Spönemann, Miro, Wybrow, Michael
Publikováno v:
Bachmaier, C, Brandenburg, F J, Effinger, P, Gutwenger, C, Katajainen, J, Klein, K, Spönemann, M & Wybrow, M 2011, Graph archive . in C Demetrescu, M Kaufmann, S Kobourov & P Mutzel (eds), Graph drawing with algorithm engineering methods (Dagstuhl Seminar 11191) : report from Dagstuhl Seminar 11191 . Schloss Dagstuhl-Leibniz-Zentrum für Informatik, pp. 52-53, Dagstuhl Seminar 11191 “Graph Drawing with Algorithm Engineering Methods”, 08/05/2011 . https://doi.org/10.4230/DagRep.1.5.47
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2751::3a80a89306b948a5ede9103155b305be
https://curis.ku.dk/portal/da/publications/graph-archive(ea56c2ad-6421-4542-98f3-87a87f83d7a1).html
https://curis.ku.dk/portal/da/publications/graph-archive(ea56c2ad-6421-4542-98f3-87a87f83d7a1).html
We present a linear-time algorithm for solving the simulta- neous embedding problem with ?xed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one cycle) by reducing it to the following embedding problem: Given a planar graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______199::3f116b65413efc82440ec42a627bb11f
https://kups.ub.uni-koeln.de/54985/
https://kups.ub.uni-koeln.de/54985/
Autor:
Albrecht, Mario, Estrella-Balderrama, Alejandro, Geyer, Markus, Gutwenger, Carsten, Klein, Karsten, Kohlbacher, Oliver, Schulz, Michael
We consider methods to visually compare graphs, more to focus on the differences of the graphs than on the similarities. Our two-level approach constructs a meaningful overview of the given graphs combined with a detailed view focusing on a local are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67fa6a795aabedeb1395f87b2ffbe8a9
Autor:
Brandes, Ulrik, Erten, Cesim, Fowler, James, Frati, Fabrizio, Geyer, Markus, Gutwenger, Carsten, Hong, Seokhee, Kaufmann, Michael, Kobourov, Stephen G., Liotta, Giuseppe
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______715::f41da41c70c2a0a67a3b3a100737f42d