Filters








34,198 Hits in 2.2 sec

A Letter from the Reverend Mr. John Forster to Mr. Henry Baker F. R. S. concerning an Earthquake at Taunton

John Forster
1748 Philosophical Transactions  
fatcat:tcsym2faujhkli4nmkk2s5izfy

The Art of E. M. Forster; T. F. Powys; Anna Livia Plurabelle; Thomas Wolfe; Henry James; Mark Twain; Henry James; Ezra Pound; Robert Graves; Wallace Stevens

P. West
1961 English  
Henry James. By Leon Ever. Mark Twain. By Lewis Leary. University of Reviews of Books Minnesota Pamphlets on American Writers. Oxford. 55. each (paper). Henry James. By D. W. Jerrerson. Ezra Pound.  ...  For Henry James, Mr. Jefferson and Mr. Edel take 120 and 41 pages respectively. Mr.  ... 
doi:10.1093/english/13.76.154 fatcat:iffrh2fiibgovc2q5japfjq4lq

[Dean Henry W. Ballantine's Military Dictatorship]

Henry A. Forster
1917 California Law Review  
Henry H. Forster. 9 Elphinstone v. Bedrechund (1818), 1 Knapp 316. In re Milligan (1866), 4 Wall. 2, 18 L. Ed. 281. Lanoir, German Spy System in France, 70-72. U. S. Rev.  ...  EDITOR CALIFORNIA LAW REVIEW SIR : In answer to t)ean Henry \;V.  ... 
doi:10.2307/3474722 fatcat:ka5su25nojd6fj27fo2gxkuiry

A Letter from the Reverend Mr. John Forster to Mr. Henry Baker F. R. S. concerning an Earthquake at Taunton

J. Forster
1748 Philosophical Transactions of the Royal Society of London  
doi:10.1098/rstl.1748.0048 fatcat:hmodrj6jljdhngdqdeuzph6cv4

Monotone Arc Diagrams with few Biarcs [article]

Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2020 arXiv   pre-print
We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.
arXiv:2003.05332v1 fatcat:qdaiwf4mffas7akhn63ejd2hrq

The QuaSEFE Problem [article]

Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta, Maurizio Patrignani
2019 arXiv   pre-print
We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph individually is drawn quasiplanar, that is, no three edges pairwise cross. We show that a triple consisting of two planar graphs and a tree admit a QuaSEFE. This result also implies that a pair consisting of a 1-planar graph and a planar graph admits a QuaSEFE. We show several other positive results for triples of planar
more » ... graphs, in which certain structural properties for their common subgraphs are fulfilled. For the case in which simplicity is also required, we give a triple consisting of two quasiplanar graphs and a star that does not admit a QuaSEFE. Moreover, in contrast to the planar SEFE problem, we show that it is not always possible to obtain a QuaSEFE for two matchings if the quasiplanar drawing of one matching is fixed.
arXiv:1908.08708v1 fatcat:kqsi4plterarjeygdd6anzmdpy

Law Reform—New York

Henry A. Forster
1915 American Political Science Review  
HENRY A. FORSTER. New York City. Legislation of 1914 Affecting Nominations and Elections.  ...  This year Judge Clearwater was succeeded as chairman by Henry W. Taft.  ... 
doi:10.2307/1946388 fatcat:4uv2mentuzf75lldunioohu4zq

On Arrangements of Orthogonal Circles [article]

Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff
2019 arXiv   pre-print
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have only a linear number of faces. This implies that orthogonal circle intersection graphs have only a linear number of edges. When we restrict ourselves to orthogonal unit circles, the resulting class of intersection graphs is a subclass of penny graphs (that is,
more » ... contact graphs of unit circles). We show that, similarly to penny graphs, it is NP-hard to recognize orthogonal unit circle intersection graphs.
arXiv:1907.08121v2 fatcat:3hmkvxu62ncfxpth7x4gubizna

Drawing Shortest Paths in Geodetic Graphs [article]

Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, Thomas Schneck
2020 arXiv   pre-print
Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph G, i.e., an unweighted graph in which the shortest path between any pair of vertices is unique, is there a philogeodetic drawing of G, i.e., a drawing of G in which the curves of any two shortest paths meet at most once? We answer this question in the negative by showing the existence of geodetic graphs that require some pair
more » ... shortest paths to cross at least four times. The bound on the number of crossings is tight for the class of graphs we construct. Furthermore, we exhibit geodetic graphs of diameter two that do not admit a philogeodetic drawing.
arXiv:2008.07637v1 fatcat:pp7zfwmd4jcjbofvnh44fkl53e

Estimating protein-protein interaction affinity in living cells using quantitative Förster resonance energy transfer measurements

Huanmian Chen, Henry L. Puhl, Stephen R. Ikeda
2007 Journal of Biomedical Optics  
We have previously demonstrated that Förster resonance energy transfer ͑FRET͒ efficiency and the relative concentration of donor and acceptor fluorophores can be determined in living cells using three-cube  ...  Introduction Förster resonance energy transfer ͑FRET͒ is a physical process in which a donor fluorophore molecule in the excited state transfers energy nonradiatively to an acceptor molecule ͑often also  ... 
doi:10.1117/1.2799171 pmid:17994899 fatcat:segyr6g6nnghbokr32wqntzizq

On RAC Drawings of Graphs with one Bend per Edge [article]

Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2018 arXiv   pre-print
A k-bend right-angle-crossing drawing or (k-bend RAC drawing, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing points of the edges are 90 degrees. Accordingly, a graph that admits a k-bend RAC drawing is referred to as k-bend right-angle-crossing graph (or k-bend RAC, for short). In this paper, we continue the study of the maximum edge-density of 1-bend RAC graphs. We show that an n-vertex 1-bend RAC graph cannot have more
more » ... 5.5n-O(1) edges. We also demonstrate that there exist infinitely many n-vertex 1-bend RAC graphs with exactly 5n-O(1) edges. Our results improve both the previously known best upper bound of 6.5n-O(1) edges and the corresponding lower bound of 4.5n-O(√(n)) edges by Arikushi et al. (Comput. Geom. 45(4), 169--177 (2012)).
arXiv:1808.10470v1 fatcat:vmoqfxp2ubbv3gd5fhv6nomura

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings [article]

Michael A. Bekos, Henry Förster, Michael Kaufmann
2017 arXiv   pre-print
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove NP-hardness for a restricted version of the bendless drawing problem for both
more » ... dels. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.
arXiv:1708.09197v1 fatcat:ws6cfn2q4bhmne66dbcyxiisgu

On Compact RAC Drawings

Henry Förster, Michael Kaufmann, Peter Sanders, Grzegorz Herman, Fabrizio Grandoni
2020 European Symposium on Algorithms  
We present new bounds for the required area of Right Angle Crossing (RAC) drawings for complete graphs, i.e. drawings where any two crossing edges are perpendicular to each other. First, we improve upon results by Didimo et al. [Walter Didimo et al., 2011] and Di Giacomo et al. [Emilio Di Giacomo et al., 2011] by showing how to compute a RAC drawing with three bends per edge in cubic area. We also show that quadratic area can be achieved when allowing eight bends per edge in general or with
more » ... e bends per edge for p-partite graphs. As a counterpart, we prove that in general quadratic area is not sufficient for RAC drawings with three bends per edge.
doi:10.4230/lipics.esa.2020.53 dblp:conf/esa/Forster020 fatcat:r2vjw25zkfcoxi7t7wnwnnayje

2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth [article]

Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck
2020 arXiv   pre-print
The 2-layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, however, the fundamental class of k-planar graphs has been considered only for k=1 in this context. We provide several contributions that address this gap in the literature. First, we show tight density bounds for the classes of 2-layer k-planar graphs with k∈{2,3,4,5}. Based on these results, we provide a Crossing Lemma
more » ... 2-layer k-planar graphs, which then implies a general density bound for 2-layer k-planar graphs. We prove this bound to be almost optimal with a corresponding lower bound construction. Finally, we study relationships between k-planarity and h-quasiplanarity in the 2-layer model and show that 2-layer k-planar graphs have pathwidth at most k+1.
arXiv:2008.09329v1 fatcat:q3hyggamubcjvgxecznztl7bdu

Recognizing and Embedding Simple Optimal 2-Planar Graphs [article]

Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2021 arXiv   pre-print
Henry Förster1[0000−0002−1441−4189] , Michael Kaufmann1[0000−0001−9186−3538] , and Chrysanthi N.  ...  Förster and M. Kaufmann are supported by DFG grant KA812-18/2. 2 Förster, Kaufmann and Raftopoulou 4-planar graphs, respectively.  ... 
arXiv:2108.00665v2 fatcat:vv7lfqujyzfrvp5wb7xu7p4zmq
« Previous Showing results 1 — 15 out of 34,198 results