1 citations · 1 across the 1 of their papers we have counts for
5 papers
On the Linear Ordering Problem and the Rankability of Data
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review…
Diameter Polytopes of Feasible Binary Programs
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
Feasible binary programs often have multiple optimal solutions, which is of interest in applications as they allow the user to choose between alternative optima without deteriorati…
Characterizing 3-sets in Union-Closed Families
Jonad Pulaj
A family of sets is union-closed (UC) if the union of any two sets in the family is also in the family. Frankl's UC sets conjecture states that for any nonempty UC family $\mathcal…
Using Skip Graphs for Increased NUMA Locality
Samuel Thomas, Ana Hayne, Jonad Pulaj +1
We present a data partitioning technique performed over skip graphs that promotes significant quantitative and qualitative improvements on NUMA locality in concurrent data structur…
A Safe Computational Framework for Integer Programming applied to Chvátal's Conjecture
Leon Eifler, Ambros Gleixner, Jonad Pulaj
We describe a general and safe computational framework that provides integer programming results with the degree of certainty that is required for machine-assisted proofs of mathem…