2 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…