Jonad Pulaj

29 papers B 3C 1Journal 23Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Satisfiability modulo theories for verifying MILP certificates.
J. Symb. Comput.
Kenan Wood, Runtian Zhou, Haoze Wu, Hammurabi Mendes, Jonad Pulaj
2025 J jnl
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters.
CoRR
Thomas R. Cameron, Jonad Pulaj
2025 J jnl
Local Configurations in Union-Closed Families.
Exp. Math.
Jonad Pulaj, Kenan Wood
2024 J jnl
An Optimal Multilevel Quorum System for Probabilistic Consensus.
CoRR
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2024 J jnl
Automating weight function generation in graph pebbling.
Discret. Appl. Math.
Dominic Flocco, Jonad Pulaj, Carl Yerger
2024 B conf
Distributed Agreement in the Arrovian Framework.
OPODIS
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2024 J jnl
Distributed Agreement in the Arrovian Framework.
CoRR
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2024 J jnl
Expiring Assets in Automated Market Makers.
CoRR
Kenan Wood, Maurice Herlihy, Hammurabi Mendes, Jonad Pulaj
2024 B conf
Optimal Multilevel Slashing for Blockchains.
OPODIS
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
2023 J jnl
Automating Weight Function Generation in Graph Pebbling.
CoRR
Dominic Flocco, Jonad Pulaj, Carl Yerger
2023 J jnl
Characterizing 3-Sets in Union-Closed Families.
Exp. Math.
Jonad Pulaj
2023 J jnl
Verifying MILP Certificates with SMT Solvers.
CoRR
Runtian Zhou, Haoze Wu, Hammurabi Mendes, Jonad Pulaj
2022 J jnl
A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture.
ACM Trans. Math. Softw.
Leon Eifler, Ambros M. Gleixner, Jonad Pulaj
2022 J jnl
Using skip graphs for increased NUMA locality.
J. Parallel Distributed Comput.
Samuel Thomas, Roxana Hayne, Jonad Pulaj, Hammurabi Mendes
2021 J jnl
On the Linear Ordering Problem and the Rankability of Data.
CoRR
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
2020 J jnl
Cutting planes for families implying Frankl's conjecture.
Math. Comput.
Jonad Pulaj
2020 J jnl
Diameter Polytopes of Feasible Binary Programs.
CoRR
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
2020 C conf
Using Skip Graphs for Increased NUMA Locality.
SBAC-PAD
Samuel Thomas, Roxana Hayne, Jonad Pulaj, Hammurabi Mendes
2019 J jnl
Characterizing 3-sets in Union-Closed Families.
CoRR
Jonad Pulaj
2017 J jnl
A hybrid primal heuristic for Robust Multiperiod Network Design.
CoRR
Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj
2017 J jnl
Integrating LP-guided variable fixing with MIP heuristics in the robust design of hybrid wired-wireless FTTx access networks.
Appl. Soft Comput.
Fabio D'Andreagiovanni, Fabian Mett, Antonella Nardin, Jonad Pulaj
2016 — conf
An (MI)LP-Based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design.
EvoApplications (1)
Fabio D'Andreagiovanni, Fabian Mett, Jonad Pulaj
2016 J jnl
New Conjectures for Union-Closed Families.
Electron. J. Comb.
Jonad Pulaj, Annie Raymond, Dirk Oliver Theis
2016 J jnl
New Conjectures for Union-Closed Families.
Electron. J. Comb.
Jonad Pulaj, Annie Raymond, Dirk Oliver Theis
2016 — conf
Towards the Integration of Power-Indexed Formulations in Multi-Architecture Connected Facility Location Problems for the Optimal Design of Hybrid Fiber-Wireless Access Networks.
SCOR
Fabio D'Andreagiovanni, Fabian Mett, Jonad Pulaj
2015 J jnl
A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods.
Appl. Soft Comput.
Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj
2015 J jnl
An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design.
CoRR
Fabio D'Andreagiovanni, Fabian Mett, Jonad Pulaj
2014 J jnl
A Fast Hybrid Primal Heuristic for Multiband Robust Capacitated Network Design with Multiple Time Periods.
CoRR
Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj
2014 B conf
A Hybrid Primal Heuristic for Robust Multiperiod Network Design.
EvoApplications
Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj