Search

Your search keyword '"MCHEDLIDZE, TAMARA"' showing total 329 results
Start Over Author "MCHEDLIDZE, TAMARA"
329 results on '"MCHEDLIDZE, TAMARA"'

51. -Stars or On Extending a Drawing of a Connected Subgraph

Author

Mchedlidze, Tamara, Urhausen, Jérôme, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Biedl, Therese, editor, and Kerren, Andreas, editor

Published
2018
Full Text
View/download PDF

52. How many vertex locations can be arbitrarily chosen when drawing planar graphs?

Author

Di Giacomo, Emilio, Liotta, Giuseppe, and Mchedlidze, Tamara

Subjects
Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms
Abstract

It is proven that every set $S$ of distinct points in the plane with cardinality $\lceil \frac{\sqrt{\log_2 n}-1}{4} \rceil$ can be a subset of the vertices of a crossing-free straight-line drawing of any planar graph with $n$ vertices. It is also proven that if $S$ is restricted to be a one-sided convex point set, its cardinality increases to $\lceil \sqrt[3]{n} \rceil$. The proofs are constructive and give rise to O(n)-time drawing algorithms. As a part of our proofs, we show that every maximal planar graph contains a large induced biconnected outerplanar graphs and a large induced outerpath (an outerplanar graph whose weak dual is a path).

Published
2012

55. Upward Point Set Embeddability for Convex Point Sets is in $P$

Author

Kaufmann, Michael, Mchedlidze, Tamara, and Symvonis, Antonios

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In this paper, we present a polynomial dynamic programming algorithm that tests whether a $n$-vertex directed tree $T$ has an upward planar embedding into a convex point-set $S$ of size $n$. Further, we extend our approach to the class of outerplanar digraphs. This nontrivial and surprising result implies that any given digraph can be efficiently tested for an upward planar embedding into a given convex point set.

Published
2011

56. Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles

Author

Fink, Martin, Haunert, Jan-Henrik, Mchedlidze, Tamara, Spoerhase, Joachim, and Wolff, Alexander

Subjects
Computer Science - Data Structures and Algorithms
Abstract

Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the point-set-embedding scenario, we are interested in how much we gain in terms of computational complexity, curve complexity, and generality if we allow large-angle crossings as compared to the planar case. We investigate two drawing styles where only bends or both bends and edges must be drawn on an underlying grid. We present various results for drawings with one, two, and three bends per edge.

Published
2011

57. Upward Point-Set Embeddability

Author

Geyer, Markus, Kaufmann, Michael, Mchedlidze, Tamara, and Symvonis, Antonios

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph $D$ has an upward planar embedding into a point set $S$. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of $k$-switch trees, that is a generalization of switch trees (according to this definition a switch tree is a $1$-switch tree), we show that not every $k$-switch tree admits an upward planar straight-line embedding into any convex point set, for any $k \geq 2$. Finally we show that the problem of Upward Point-Set Embeddability is NP-complete.

Published
2010
Full Text
View/download PDF

58. Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs

Author

Mchedlidze, Tamara and Symvonis, Antonios

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics
Abstract

In this paper we study the problem of existence of a crossing-free acyclic hamiltonian path completion (for short, HP-completion) set for embedded upward planar digraphs. In the context of book embeddings, this question becomes: given an embedded upward planar digraph $G$, determine whether there exists an upward 2-page book embedding of $G$ preserving the given planar embedding. Given an embedded $st$-digraph $G$ which has a crossing-free HP-completion set, we show that there always exists a crossing-free HP-completion set with at most two edges per face of $G$. For an embedded $N$-free upward planar digraph $G$, we show that there always exists a crossing-free acyclic HP-completion set for $G$ which, moreover, can be computed in linear time. For a width-$k$ embedded planar $st$-digraph $G$, we show that we can be efficiently test whether $G$ admits a crossing-free acyclic HP-completion set., Comment: Accepted to ISAAC2009

Published
2009

59. Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs

Author

Mchedlidze, Tamara and Symvonis, Antonios

Subjects
Computer Science - Data Structures and Algorithms
Abstract

Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to a hamiltonian acyclic digraph. Our results include: 1. We provide a characterization under which a planar st-digraph G is hamiltonian. 2. For an outerplanar st-digraph G, we define the st-polygon decomposition of G and, based on its properties, we develop a linear-time algorithm that solves the Acyclic-HPCCM problem. 3. For the class of planar st-digraphs, we establish an equivalence between the Acyclic-HPCCM problem and the problem of determining an upward 2-page topological book embedding with minimum number of spine crossings. We infer (based on this equivalence) for the class of outerplanar st-digraphs an upward topological 2-page book embedding with minimum number of spine crossings. To the best of our knowledge, it is the first time that edge-crossing minimization is studied in conjunction with the acyclic hamiltonian completion problem and the first time that an optimal algorithm with respect to spine crossing minimization is presented for upward topological book embeddings.

Published
2009

60. Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)

Author

Mchedlidze, Tamara and Symvonis, Antonios

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, G.2.2
Abstract

Given an embedded planar acyclic digraph G, we define the problem of "acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be the problem of determining an hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to a hamiltonian digraph. Our results include: --We provide a characterization under which a triangulated st-digraph G is hamiltonian. --For an outerplanar triangulated st-digraph G, we define the st-polygon decomposition of G and, based on its properties, we develop a linear-time algorithm that solves the Acyclic-HPCCM problem with at most one crossing per edge of G. --For the class of st-planar digraphs, we establish an equivalence between the Acyclic-HPCCM problem and the problem of determining an upward 2-page topological book embedding with minimum number of spine crossings. We infer (based on this equivalence) for the class of outerplanar triangulated st-digraphs an upward topological 2-page book embedding with minimum number of spine crossings and at most one spine crossing per edge. To the best of our knowledge, it is the first time that edge-crossing minimization is studied in conjunction with the acyclic hamiltonian completion problem and the first time that an optimal algorithm with respect to spine crossing minimization is presented for upward topological book embeddings.

Published
2008

62. Monotone Simultaneous Embeddings of Paths in d Dimensions

Author

Bremner, David, Devillers, Olivier, Glisse, Marc, Lazard, Sylvain, Liotta, Giuseppe, Mchedlidze, Tamara, Whitesides, Sue, Wismath, Stephen, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Hu, Yifan, editor, and Nöllenburg, Martin, editor

Published
2016
Full Text
View/download PDF

66. Towards Realistic Flow Control in Power Grid Operation

Author

Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz, Wagner, Dorothea, Wegner, Franziska, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Gottwalt, Sebastian, editor, König, Lukas, editor, and Schmeck, Hartmut, editor

Published
2015
Full Text
View/download PDF

70. Identifying Cluttering Edges in Near-Planar Graphs

Author

Sub Visualisation and Graphics, Visualisation and Graphics, Hoellt, Thomas, Aigner, Wolfgang, Wang, Bei, van Wageningen, Simon, Mchedlidze, Tamara, Telea, Alex, Sub Visualisation and Graphics, Visualisation and Graphics, Hoellt, Thomas, Aigner, Wolfgang, Wang, Bei, van Wageningen, Simon, Mchedlidze, Tamara, and Telea, Alex

Published
2023

72. Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

Author

Klemz, Boris, Mchedlidze, Tamara, Nöllenburg, Martin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Ravi, R., editor, and Gørtz, Inge Li, editor

Published
2014
Full Text
View/download PDF

73. Fitting Planar Graphs on Planar Maps

Author

Alam, Md. Jawaherul, Kaufmann, Michael, Kobourov, Stephen G., Mchedlidze, Tamara, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Geffert, Viliam, editor, Preneel, Bart, editor, Rovan, Branislav, editor, Štuller, Július, editor, and Tjoa, A Min, editor

Published
2014
Full Text
View/download PDF

76. Greedy Rectilinear Drawings

Author

Angelini, Patrizio, primary, Bekos, Michael A., additional, Didimo, Walter, additional, Grilli, Luca, additional, Kindermann, Philipp, additional, Mchedlidze, Tamara, additional, Prutkin, Roman, additional, Symvonis, Antonios, additional, and Tappini, Alessandra, additional

Published
2018
Full Text
View/download PDF

80. Gestalt Principles in Graph Drawing

Author

Kobourov, Stephen G., Mchedlidze, Tamara, Vonessen, Laura, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Di Giacomo, Emilio, editor, and Lubiw, Anna, editor

Published
2015
Full Text
View/download PDF

81. Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs

Author

Di Giacomo, Emilio, Liotta, Giuseppe, Mchedlidze, Tamara, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Brandstädt, Andreas, editor, Jansen, Klaus, editor, and Reischuk, Rüdiger, editor

Published
2013
Full Text
View/download PDF

82. Point-Set Embeddability of 2-Colored Trees

Author

Frati, Fabrizio, Glisse, Marc, Lenhart, William J., Liotta, Giuseppe, Mchedlidze, Tamara, Nishat, Rahnuma Islam, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Didimo, Walter, editor, and Patrignani, Maurizio, editor

Published
2013
Full Text
View/download PDF

83. Universal Point Subsets for Planar Graphs

Author

Angelini, Patrizio, Binucci, Carla, Evans, William, Hurtado, Ferran, Liotta, Giuseppe, Mchedlidze, Tamara, Meijer, Henk, Okamoto, Yoshio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chao, Kun-Mao, editor, Hsu, Tsan-sheng, editor, and Lee, Der-Tsai, editor

Published
2012
Full Text
View/download PDF

84. Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles

Author

Fink, Martin, Haunert, Jan-Henrik, Mchedlidze, Tamara, Spoerhase, Joachim, Wolff, Alexander, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Rahman, Md. Saidur, editor, and Nakano, Shin-ichi, editor

Published
2012
Full Text
View/download PDF

85. Monotone Drawings of Graphs with Fixed Embedding

Author

Angelini, Patrizio, Didimo, Walter, Kobourov, Stephen, Mchedlidze, Tamara, Roselli, Vincenzo, Symvonis, Antonios, Wismath, Stephen, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, van Kreveld, Marc, editor, and Speckmann, Bettina, editor

Published
2012
Full Text
View/download PDF

86. Small Point Sets for Simply-Nested Planar Graphs

Author

Angelini, Patrizio, Di Battista, Giuseppe, Kaufmann, Michael, Mchedlidze, Tamara, Roselli, Vincenzo, Squarcella, Claudio, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, van Kreveld, Marc, editor, and Speckmann, Bettina, editor

Published
2012
Full Text
View/download PDF

87. Upward Point Set Embeddability for Convex Point Sets Is in P

Author

Kaufmann, Michael, Mchedlidze, Tamara, Symvonis, Antonios, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, van Kreveld, Marc, editor, and Speckmann, Bettina, editor

Published
2012
Full Text
View/download PDF

88. Upward Geometric Graph Embeddings into Point Sets

Author

Angelini, Patrizio, Frati, Fabrizio, Geyer, Markus, Kaufmann, Michael, Mchedlidze, Tamara, Symvonis, Antonios, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Brandes, Ulrik, editor, and Cornelsen, Sabine, editor

Published
2011
Full Text
View/download PDF

89. Upward Point-Set Embeddability

Author

Geyer, Markus, Kaufmann, Michael, Mchedlidze, Tamara, Symvonis, Antonios, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Černá, Ivana, editor, Gyimóthy, Tibor, editor, Hromkovič, Juraj, editor, Jefferey, Keith, editor, Králović, Rastislav, editor, Vukolić, Marko, editor, and Wolf, Stefan, editor

Published
2011
Full Text
View/download PDF

90. Unilateral Orientation of Mixed Graphs

Author

Mchedlidze, Tamara, Symvonis, Antonios, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, van Leeuwen, Jan, editor, Muscholl, Anca, editor, Peleg, David, editor, Pokorný, Jaroslav, editor, and Rumpe, Bernhard, editor

Published
2010
Full Text
View/download PDF

92. Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

Author

Mchedlidze, Tamara, Symvonis, Antonios, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Das, Sandip, editor, and Uehara, Ryuhei, editor

Published
2009
Full Text
View/download PDF

96. Upward planar drawings with two slopes

Author

Klawitter, Jonathan, Mchedlidze, Tamara, Klawitter, Jonathan, and Mchedlidze, Tamara

Abstract

In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line segments in the upward direction without crossings using only two different slopes. We investigate whether a given upward planar digraph admits such a drawing and, if so, how to construct it. For the fixed embedding scenario, we give a simple characterisation and a linear-time construction by adopting algorithms from orthogonal drawings. For the variable embedding scenario, we describe a linear-time algorithm for single-source digraphs, a quartic-time algorithm for series-parallel digraphs, and a fixed-parameter tractable algorithm for general digraphs. For the latter two classes, we make use of SPQR-trees and the notion of upward spirality. As an application of this drawing style, we show how to draw an upward planar phylogenetic network with two slopes such that all leaves lie on a horizontal line.

Published
2022

97. Graph Drawing Contest Report

Author

Kindermann, Philipp, Klute, Fabian, Mchedlidze, Tamara, Meulemans, Wouter, Kindermann, Philipp, Klute, Fabian, Mchedlidze, Tamara, and Meulemans, Wouter

Abstract

This report describes the 29th Annual Graph Drawing Contest, held in conjunction with the 30th International Symposium on Graph Drawing and Network Visualization (GD’22) in Tokyo, Japan. Due to the continuing global COVID-19 pandemic, the conference and thus also the contest was held in a hybrid format, with both on-site and online participants. The mission of the Graph Drawing Contest is to monitor and challenge the current state of the art in graph-drawing technology.

Published
2022

98. Metaphoric Maps for Dynamic Vertex-weighted Graphs

Author

Mchedlidze, Tamara, Schnorr, Christian, Mchedlidze, Tamara, and Schnorr, Christian

Abstract

In this paper we study metaphoric maps of dynamic vertex-weighted graphs. Dynamic operations on such graphs allow a vertex to change the weight, vertices and edges appear and disappear. In the metaphoric map this is viewed as country shrink and growth, appearance and disappearance and change in the country adjacency. We present a force-based algorithm that supports these operations. In the design of the algorithm we prioritize the dynamic stability of the map, the accuracy in the size of countries and low complexity of the polygons representing the countries. We evaluate the algorithm based on the state-of-theart quality metrics for randomly generated inputs of various complexity.

Published
2022

99. Recognizing DAGs with Page-Number 2 Is NP-complete

Author

Sub Visualisation and Graphics, Visualisation and Graphics, Angelini, Patrizio, Hanxleden, Reinhard von, Bekos, Michael A., Lozzo, Giordano Da, Frati, Fabrizio, Gronemann, Martin, Mchedlidze, Tamara, Raftopoulou, Chrysanthi N., Sub Visualisation and Graphics, Visualisation and Graphics, Angelini, Patrizio, Hanxleden, Reinhard von, Bekos, Michael A., Lozzo, Giordano Da, Frati, Fabrizio, Gronemann, Martin, Mchedlidze, Tamara, and Raftopoulou, Chrysanthi N.

Published
2022

100. Metaphoric Maps for Dynamic Vertex-weighted Graphs

Author

Sub Visualisation and Graphics, Visualisation and Graphics, Agus, Marco, Aigner, Wolfgang, Höllt, Thomas, Mchedlidze, Tamara, Schnorr, Christian, Sub Visualisation and Graphics, Visualisation and Graphics, Agus, Marco, Aigner, Wolfgang, Höllt, Thomas, Mchedlidze, Tamara, and Schnorr, Christian

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results