Results 31 to 40 of about 7,574 (255)

Upward Planar Drawings with Three and More Slopes

Journal of Graph Algorithms and Applications, 2023
The slope number of a graph $G$ is the smallest number of slopes needed for the segments representing the edges in any straight-line drawing of $G$. It serves as a measure of the visual complexity of a graph drawing.
Jonathan Klawitter, Johannes Zink
doaj   +1 more source

Strictly-convex drawings of 3-connected planar graphs

Journal of Computational Geometry
Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings of $n$-vertex graphs is $O(n^2) \times O(n^2)$, as shown by ...
Michael Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis   +3 more
doaj   +1 more source

Ideal Drawings of Rooted Trees With Approximately Optimal Width

Journal of Graph Algorithms and Applications, 2017
For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether
Therese Biedl
doaj   +1 more source

Drawing Clustered Planar Graphs on Disk Arrangements

Journal of Graph Algorithms and Applications, 2020
Let $G=(V, E)$ be a planar graph and let $\mathcal V$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal V$ as clusters.
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel   +3 more
doaj   +1 more source

Tracking Health Related Quality of Life From Diagnosis to Follow‐Up Among Australian Children With Acute Lymphoblastic Leukaemia

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Acute lymphoblastic leukaemia (ALL) is one of the most treatable forms of paediatric cancer; however, there is a substantial burden of treatment‐related toxicities (TRTs). In addition, the long‐term changes in children's health‐related quality of life (HRQoL) due to toxic treatments are not well understood.
Clare Ghows, Clarissa E. Schilstra, Karen McCleary, Nancy E. Briggs, Rishi S. Kotecha, Richard De Abreu Lourenco, Shanti Ramachandran, Ruelleyn Cockcroft, Rachel Conyers, Siobhan Cross, Luciano Dalla‐Pozza, Peter Downie, Tamas Revesz, Michael Osborn, Frank Alvaro, Claire E. Wakefield, Glenn M. Marshall, Toby Trahair, Marion K. Mateos, Joanna E. Fardell   +19 more
wiley   +1 more source

Progress on Partial Edge Drawings

Journal of Graph Algorithms and Applications, 2017
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been introduced. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs.
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff   +6 more
doaj   +1 more source

On Planar Straight-Line Dominance Drawings

CoRR
We study the following question, which has been considered since the 90's: Does every $st$-planar graph admit a planar straight-line dominance drawing? We show concrete evidence for the difficulty of this question, by proving that, unlike upward planar straight-line drawings, planar straight-line dominance drawings with prescribed $y$-coordinates do ...
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali   +5 more
openaire   +5 more sources

Natural Killer Cells in Paediatric Soft Tissue Sarcomas: A Systematic Review

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Paediatric soft tissue sarcomas (pSTS) are a rare and heterogeneous group of malignant tumours arising in tissues of mesenchymal origin. The role of natural killer (NK) cells in pSTS remains poorly understood, with evidence fragmented across small preclinical studies and early‐phase clinical trials.
Raya Dean, Lara V. Graham, Christina Putnam, Rosa Gomes Alves Martins, Daniel T. Harding, Tim J. Underwood, Zoë S. Walters, Matthew D. Blunt   +7 more
wiley   +1 more source

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

Journal of Graph Algorithms and Applications, 2003
This paper investigates the following question: Given a grid ϕ, where ϕ is a proper subset of the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with vertices located at (integral) grid points of ϕ?
Stefan Felsner, Giuseppe Liotta, Stephen Wismath   +2 more
doaj   +1 more source

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

Journal of Graph Algorithms and Applications, 2021
We show that the $1$-planar slope number of $3$-connected cubic $1$-planar graphs is at most four when edges are drawn as polygonal curves with at most one bend each, that is, any such graph admits a drawing with at most one bend per edge and such that ...
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz   +3 more
doaj   +1 more source