70 citations · 80 across the 14 of their papers we have counts for
19 papers
Solution Space Partitioning for Extremal Set Theory
Jesse Looney, Jonah McDonald, Allison Klingler +3
We present a method for partitioning the solution space of statements in extremal set theory. Compared with domain-agnostic partitioning methods like look-ahead, we perform case an…
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Thomas R. Cameron, Jonad Pulaj
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero for…
Bilevel Programming for Pebbling Numbers of Lemke Graph Products
Jonad Pulaj, Kenan Wood, Carl Yerger
Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacen…
Distributed Agreement in the Arrovian Framework
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
Preference aggregation is a fundamental problem in voting theory, in which public input rankings of a set of alternatives (called preferences) must be aggregated into a single pref…
Optimal Multilevel Slashing for Blockchains
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a g…
Expiring Assets in Automated Market Makers
Kenan Wood, Maurice Herlihy, Hammurabi Mendes +1
An automated market maker (AMM) is a state machine that manages pools of assets, allowing parties to buy and sell those assets according to a fixed mathematical formula. AMMs are t…
Automating Weight Function Generation in Graph Pebbling
Dominic Flocco, Jonad Pulaj, Carl Yerger
Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and…
Satisfiability Modulo Theories for Verifying MILP Certificates
Kenan Wood, Runtian Zhou, Haoze Wu +2
Correctness of results from mixed-integer linear programming (MILP) solvers is critical, particularly in the context of applications such as hardware verification, compiler optimiz…
Local Configurations in Union-Closed Families
Jonad Pulaj, Kenan Wood
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets containing some nonempty set, there is some element in the groun…
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…
A hybrid primal heuristic for Robust Multiperiod Network Design
Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj
We investigate the Robust Multiperiod Network Design Problem, a generalization of the classical Capacitated Network Design Problem that additionally considers multiple design perio…
Cutting Planes for Families Implying Frankl's Conjecture
Jonad Pulaj
We find previously unknown families of sets which ensure Frankl's conjecture holds for all families that contain them using an algorithmic framework. The conjecture states that for…
An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design
Fabio D'Andreagiovanni, Fabian Mett, Jonad Pulaj
We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks. We propose an original optimization model fo…
New Conjectures for Union-Closed Families
Jonad Pulaj, Annie Raymond, Dirk Theis
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets…
A Fast Hybrid Primal Heuristic for Multiband Robust Capacitated Network Design with Multiple Time Periods
Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj
We investigate the Robust Multiperiod Network Design Problem, a generalization of the Capacitated Network Design Problem (CNDP) that, besides establishing flow routing and network…