5.4k citations
- Pennsylvania State UniversityUS12 papers
- Goddard Space Flight CenterUS6 papers
- University College LondonGB6 papers
- University of California, BerkeleyUS6 papers
- University of ChicagoUS6 papers
- University of WashingtonUS6 papers
- Johns Hopkins UniversityUS5 papers
- University of ArizonaUS4 papers
- University of UtahUS4 papers
- Adler PlanetariumUS3 papers
- California Institute of TechnologyUS3 papers
- Center for Astrophysics Harvard & SmithsonianUS3 papers
26 papers
Bounding the tripartite-circle crossing number of complete tripartite graphs
Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…
Highly Irregular Functional Generalized Linear Regression with Electronic Health Records
Justin Petrovich, Matthew Reimherr, Carrie Daymont
This work presents a new approach, called MISFIT, for fitting generalized functional linear regression models with sparsely and irregularly sampled data. Current methods do not all…
Super-Solar Metallicity Stars in the Galactic Center Nuclear Star Cluster: Unusual Sc, V, and Y Abundances
Tuan Do, Wolfgang Kerzendorf, Quinn Konopacky +4
We present adaptive-optics assisted near-infrared high-spectral resolution observations of late-type giants in the nuclear star cluster of the Milky Way. The metallicity and elemen…
Electric polarizability in the three dimensional problem and the solution of an inhomogeneous differential equation
M. A. Maize, J. J. Smetanka
In previous publications, we illustrated the effectiveness of the method of the inhomogeneous differential equation in calculating the electric polarizability in the one-dimensiona…
On the Strong Chromatic Index of Sparse Graphs
Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara +7
The strong chromatic index of a graph , denoted , is the least number of colors needed to edge-color so that edges at distance at most two receive distinct colors.…
Color-blind index in graphs of very low degree
Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6
Let be an edge-coloring of a graph , not necessarily proper. For each vertex , let , where is the number of edges incident…