Euclidean Greedy Drawings of Trees

Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embeddings in the Euclidean plane R^2 is known for certain graph classes such as 3-connected planar graphs. We completely characterize the trees that admit a greedy embedding in R^2. This answers a question by Angelini et al. (Graph Drawing 2009) and is a further step in characterizing the graphs that admit Euclidean greedy embeddings.Comment: Expanded version of a paper to appear in the 21st European Symposium on Algorithms (ESA 2013). 24 pages, 20 figure

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new characterization of c-planarity. It leads to efficient algorithms for c-planarity testing in the following cases. (i) Every cluster and every co-cluster (complement of a cluster) has at most two connected components. (ii) Every cluster has at most five outgoing edges. Moreover, the cd-tree reveals interesting connections between c-planarity and planarity with constraints on the order of edges around vertices. On one hand, this gives rise to a bunch of new open problems related to c-planarity, on the other hand it provides a new perspective on previous results.Comment: 17 pages, 2 figure

Splitting Clusters To Get C-Planarity

In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs. Namely, given a clustered graph, the goal of the S PLIT-C-P LANARITY problem is to split as few clusters as possible in order to make the graph c-planar. Determining whether zero splits are enough coincides with testing c-planarity. We show that S PLIT-C-P LANARITY is NP-complete for c-connected clustered triangulations and for non-c-connected clustered paths and cycles. On the other hand, we present a polynomial-time algorithm for flat c-connected clustered graphs whose underlying graph is a biconnected seriesparallel graph, both in the fixed and in the variable embedding setting, when the splits are assumed to maintain the c-connectivity of the clusters

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.Comment: Accepted at GD '1

Planar and Poly-Arc Lombardi Drawings

In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs, noting that every graph has a smooth 2-Lombardi drawing. We show that every planar graph has a smooth planar 3-Lombardi drawing and further investigate topics connecting planarity and Lombardi drawings.Comment: Expanded version of paper appearing in the 19th International Symposium on Graph Drawing (GD 2011). 16 pages, 8 figure

Indexing Information for Data Forensics

We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values specifically identified. We give forensic constructions for several fundamental data structures, including arrays, linked lists, binary search trees, skip lists, and hash tables. Some of our constructions are based on a new reduced-randomness construction for nonadaptive combinatorial group testing

Measurements of long-range near-side angular correlations in sNN=5\sqrt{s_{\text{NN}}}=5TeV proton-lead collisions in the forward region

Two-particle angular correlations are studied in proton-lead collisions at a nucleon-nucleon centre-of-mass energy of $\sqrt{s_{\text{NN}}}=5$TeV, collected with the LHCb detector at the LHC. The analysis is based on data recorded in two beam configurations, in which either the direction of the proton or that of the lead ion is analysed. The correlations are measured in the laboratory system as a function of relative pseudorapidity, $\Delta\eta$, and relative azimuthal angle, $\Delta\phi$, for events in different classes of event activity and for different bins of particle transverse momentum. In high-activity events a long-range correlation on the near side, $\Delta\phi \approx 0$, is observed in the pseudorapidity range $2.0<\eta<4.9$. This measurement of long-range correlations on the near side in proton-lead collisions extends previous observations into the forward region up to $\eta=4.9$. The correlation increases with growing event activity and is found to be more pronounced in the direction of the lead beam. However, the correlation in the direction of the lead and proton beams are found to be compatible when comparing events with similar absolute activity in the direction analysed.Comment: All figures and tables, along with any supplementary material and additional information, are available at https://lhcbproject.web.cern.ch/lhcbproject/Publications/LHCbProjectPublic/LHCb-PAPER-2015-040.htm

Study of the production of Λb0\Lambda_b^0 and B‾0\overline{B}^0 hadrons in pppp collisions and first measurement of the Λb0→J/ψpK−\Lambda_b^0\rightarrow J/\psi pK^- branching fraction

The product of the $\Lambda_b^0$ ($\overline{B}^0$) differential production cross-section and the branching fraction of the decay $\Lambda_b^0\rightarrow J/\psi pK^-$ ($\overline{B}^0\rightarrow J/\psi\overline{K}^*(892)^0$) is measured as a function of the beauty hadron transverse momentum, $p_{\rm T}$, and rapidity, $y$. The kinematic region of the measurements is $p_{\rm T}<20~{\rm GeV}/c$ and $2.0<y<4.5$. The measurements use a data sample corresponding to an integrated luminosity of $3~{\rm fb}^{-1}$ collected by the LHCb detector in $pp$ collisions at centre-of-mass energies $\sqrt{s}=7~{\rm TeV}$ in 2011 and $\sqrt{s}=8~{\rm TeV}$ in 2012. Based on previous LHCb results of the fragmentation fraction ratio, $f_{\Lambda_B^0}/f_d$, the branching fraction of the decay $\Lambda_b^0\rightarrow J/\psi pK^-$ is measured to be \begin{equation*} \mathcal{B}(\Lambda_b^0\rightarrow J/\psi pK^-)= (3.17\pm0.04\pm0.07\pm0.34^{+0.45}_{-0.28})\times10^{-4}, \end{equation*} where the first uncertainty is statistical, the second is systematic, the third is due to the uncertainty on the branching fraction of the decay $\overline{B}^0\rightarrow J/\psi\overline{K}^*(892)^0$, and the fourth is due to the knowledge of $f_{\Lambda_b^0}/f_d$. The sum of the asymmetries in the production and decay between $\Lambda_b^0$ and $\overline{\Lambda}_b^0$ is also measured as a function of $p_{\rm T}$ and $y$. The previously published branching fraction of $\Lambda_b^0\rightarrow J/\psi p\pi^-$, relative to that of $\Lambda_b^0\rightarrow J/\psi pK^-$, is updated. The branching fractions of $\Lambda_b^0\rightarrow P_c^+(\rightarrow J/\psi p)K^-$ are determined.Comment: 29 pages, 19figures. All figures and tables, along with any supplementary material and additional information, are available at https://lhcbproject.web.cern.ch/lhcbproject/Publications/LHCbProjectPublic/LHCb-PAPER-2015-032.htm

Evidence for the strangeness-changing weak decay Ξb−→Λb0π−\Xi_b^-\to\Lambda_b^0\pi^-

Using a $pp$ collision data sample corresponding to an integrated luminosity of 3.0~fb$^{-1}$, collected by the LHCb detector, we present the first search for the strangeness-changing weak decay $\Xi_b^-\to\Lambda_b^0\pi^-$. No $b$ hadron decay of this type has been seen before. A signal for this decay, corresponding to a significance of 3.2 standard deviations, is reported. The relative rate is measured to be ${{f_{\Xi_b^-}}\over{f_{\Lambda_b^0}}}{\cal{B}}(\Xi_b^-\to\Lambda_b^0\pi^-) = (5.7\pm1.8^{+0.8}_{-0.9})\times10^{-4}$, where $f_{\Xi_b^-}$ and $f_{\Lambda_b^0}$ are the $b\to\Xi_b^-$ and $b\to\Lambda_b^0$ fragmentation fractions, and ${\cal{B}}(\Xi_b^-\to\Lambda_b^0\pi^-)$ is the branching fraction. Assuming $f_{\Xi_b^-}/f_{\Lambda_b^0}$ is bounded between 0.1 and 0.3, the branching fraction ${\cal{B}}(\Xi_b^-\to\Lambda_b^0\pi^-)$ would lie in the range from $(0.57\pm0.21)\%$ to $(0.19\pm0.07)\%$.Comment: 7 pages, 2 figures, All figures and tables, along with any supplementary material and additional information, are available at https://lhcbproject.web.cern.ch/lhcbproject/Publications/LHCbProjectPublic/LHCb-PAPER-2015-047.htm

BB flavour tagging using charm decays at the LHCb experiment

An algorithm is described for tagging the flavour content at production of neutral $B$ mesons in the LHCb experiment. The algorithm exploits the correlation of the flavour of a $B$ meson with the charge of a reconstructed secondary charm hadron from the decay of the other $b$ hadron produced in the proton-proton collision. Charm hadron candidates are identified in a number of fully or partially reconstructed Cabibbo-favoured decay modes. The algorithm is calibrated on the self-tagged decay modes $B^+ \to J/\psi \, K^+$ and $B^0 \to J/\psi \, K^{*0}$ using $3.0\mathrm{\,fb}^{-1}$ of data collected by the LHCb experiment at $pp$ centre-of-mass energies of $7\mathrm{\,TeV}$ and $8\mathrm{\,TeV}$. Its tagging power on these samples of $B \to J/\psi \, X$ decays is $(0.30 \pm 0.01 \pm 0.01) \%$.Comment: All figures and tables, along with any supplementary material and additional information, are available at http://lhcbproject.web.cern.ch/lhcbproject/Publications/LHCbProjectPublic/LHCb-PAPER-2015-027.htm