Results 11 to 20 of about 3,542 (227)

A Survey on Graph Drawing Beyond Planarity [PDF]

ACM Computing Surveys, 2019
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of nonplanar graphs in terms of forbidden crossing configurations. The aim of this survey is to describe the main research directions in this area, the most prominent known results, and some of the most challenging open problems.
Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio   +2 more
openaire   +3 more sources

SwarmFACE: A Python package for field-aligned currents exploration with Swarm

Frontiers in Astronomy and Space Sciences, 2023
The SwarmFACE package utilizes magnetic field measurements by the Swarm satellites to study systems of field-aligned currents (FACs). Improvements of well-established techniques as well as novel single- and multi-satellite methods or satellite ...
Adrian Blagau, Adrian Blagau, Joachim Vogt   +2 more
doaj   +1 more source

Investigation of the Electronic and pH-Sensing properties of Hydroxyl-Functionalized Imine-Linked Polymers via the UV-vis Absorption Spectra and the Density Functional Theory (DFT) Calculations [PDF]

Journal of Pure and Applied Chemistry Research, 2017
In this report, a synergetic computational and experimental studies were demonstrated on examples of poly-imine polymers; P(PI-IPI) and P(PIOH-IPI) to explore the role of hydroxyl substituent on their sensing and electronic properties. The polymer P(PIOH-
Ibtesam Y. Aljaafreh, Suha S Altarawneh, Mohammed Ibrahim Alomari , Alaa M. Almaabreh, Muna M. Al Amelat   +4 more
doaj   +1 more source

Fifth-force search with the bound-electron g factor

Physics Letters B, 2020
The use of high-precision measurements of the g factor of few-electron ions and its isotope shifts is put forward as a probe for physics beyond the Standard Model.
V. Debierre, C.H. Keitel, Z. Harman
doaj   +1 more source

The Price of Upwardness [PDF]

Discrete Mathematics & Theoretical Computer Science
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff   +10 more
doaj   +1 more source

The spectrum of FZZT branes beyond the planar limit [PDF]

Journal of High Energy Physics, 2011
Minimal string theory has a number of FZZT brane boundary states; one for each Cardy state of the minimal model. It was conjectured by Seiberg and Shih that all branes in a minimal string theory could be expressed as a linear combination of the brane associated to the identity operator of the minimal model with complex shifts in the boundary ...
Atkin, MR, Wheater, J
openaire   +2 more sources

Dual Conformal Structure Beyond the Planar Limit [PDF]

Physical Review Letters, 2018
The planar scattering amplitudes of $\mathcal{N} = 4$ super-Yang--Mills theory display symmetries and structures which underlie their relatively simple analytic properties such as having only logarithmic singularities and no poles at infinity. Recent work shows in various nontrivial examples that the simple analytic properties of the planar sector ...
Bern, Zvi, Enciso, Michael, Shen, Chia-Hsien, Zeng, Mao   +3 more
openaire   +3 more sources

Hints of integrability beyond the planar limit: nontrivial backgrounds [PDF]

Journal of High Energy Physics, 2010
25+1 pages; references added; v3: minor changes, references ...
de Mello Koch, Robert, Dey, Tanay K., Ives, Norman, Stephanou, Michael   +3 more
openaire   +2 more sources

Distributed Dominating Set Approximations beyond Planar Graphs [PDF]

ACM Transactions on Algorithms, 2019
The Minimum Dominating Set (MDS) problem is a fundamental and challenging problem in distributed computing. While it is well known that minimum dominating sets cannot be well approximated locally on general graphs, in recent years there has been much progress on computing good local approximations on sparse graphs and in particular on planar graphs. In
Saeed Akhoondian Amiri, Stefan Schmid 0001, Sebastian Siebertz   +2 more
openaire   +4 more sources

Min-$k$-planar Drawings of Graphs

Journal of Graph Algorithms and Applications
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing.
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini   +9 more
doaj   +1 more source