Zobrazeno 1 - 10
of 309
pro vyhledávání: '"MONTECCHIANI, FABRIZIO"'
Autor:
Garkov, Dimitar, Piselli, Tommaso, Di Giacomo, Emilio, Klein, Karsten, Liotta, Giuseppe, Montecchiani, Fabrizio, Schreiber, Falk
Problem solving is a composite cognitive process, invoking a number of systems and subsystems, such as perception and memory. Individuals may form collectives to solve a given problem together, in collaboration, especially when complexity is thought
Externí odkaz:
http://arxiv.org/abs/2412.14776
Autor:
Da Lozzo, Giordano, Didimo, Walter, Montecchiani, Fabrizio, Münch, Miriam, Patrignani, Maurizio, Rutter, Ignaz
An abstract topological graph (AT-graph) is a pair $A=(G,\mathcal{X})$, where $G=(V,E)$ is a graph and $\mathcal{X} \subseteq {E \choose 2}$ is a set of pairs of edges of $G$. A realization of $A$ is a drawing $\Gamma_A$ of $G$ in the plane such that
Externí odkaz:
http://arxiv.org/abs/2409.20108
Autor:
Förster, Henry, Klesen, Felix, Dwyer, Tim, Eades, Peter, Hong, Seok-Hee, Kobourov, Stephen G., Liotta, Giuseppe, Misue, Kazuo, Montecchiani, Fabrizio, Pastukhov, Alexander, Schreiber, Falk
Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation and powergrid systems. With the arrival of AI-based question-answering
Externí odkaz:
http://arxiv.org/abs/2409.02907
Autor:
Di Giacomo, Emilio, Förster, Henry, Kokhovich, Daria, Mchedlidze, Tamara, Montecchiani, Fabrizio, Symvonis, Antonios, Villedieu, Anaïs
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set embedding of outerplanar $st$-digraphs on arbitrary one-sided convex poi
Externí odkaz:
http://arxiv.org/abs/2401.03226
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen
The \emph{local edge-length ratio} of a planar straight-line drawing $\Gamma$ is the largest ratio between the lengths of any pair of edges of $\Gamma$ that share a common vertex. The \emph{global edge-length ratio} of $\Gamma$ is the largest ratio b
Externí odkaz:
http://arxiv.org/abs/2311.14634
Autor:
Khazaliya, Liana, Kindermann, Philipp, Liotta, Giuseppe, Montecchiani, Fabrizio, Simonov, Kirill
The problem of deciding whether a biconnected planar digraph $G=(V,E)$ can be augmented to become an $st$-planar graph by adding a set of oriented edges $E' \subseteq V \times V$ is known to be NP-complete. We show that the problem is fixed-parameter
Externí odkaz:
http://arxiv.org/abs/2309.15454
Autor:
Jansen, Bart M. P., Khazaliya, Liana, Kindermann, Philipp, Liotta, Giuseppe, Montecchiani, Fabrizio, Simonov, Kirill
Upward planarity testing and Rectilinear planarity testing are central problems in graph drawing. It is known that they are both NP-complete, but XP when parameterized by treewidth. In this paper we show that these two problems are W[1]-hard paramete
Externí odkaz:
http://arxiv.org/abs/2309.01264
Autor:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an orthogona
Externí odkaz:
http://arxiv.org/abs/2308.13665
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge of the in
Externí odkaz:
http://arxiv.org/abs/2306.03196
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for fundamental represen
Externí odkaz:
http://arxiv.org/abs/2302.10046