9 citations · 27 across the 9 of their papers we have counts for
10 papers
Reticulating Local Dynamics in Three-Dimensional Covalent Organic Frameworks
Francesco Tavani, Saber Mirzaei, M. Saeed Mirzaei +7
In covalent organic frameworks (COFs), the geometry of the building units predetermines the structure of the framework, yet comparable design principles relating the COF linkers to…
Local Structure and Dynamics of Three-Dimensional Covalent Organic Frameworks
Francesco Tavani, Saber Mirzaei, Jian Yin +7
Resolving and controlling the local dynamical properties of covalent organic frameworks (COFs) remains a central challenge, particularly when assembled from large, flexible buildin…
System of Agentic AI for the Discovery of Metal-Organic Frameworks
Theo Jaffrelot Inizan, Sherry Yang, Aaron Kaplan +12
Generative models and machine learning promise accelerated material discovery in MOFs for CO2 capture and water harvesting but face significant challenges navigating vast chemical…
Using Alloy to Formally Model and Reason About an OpenFlow Network Switch
Saber Mirzaei, Sanaz Bahargam, Richard Skowyra +2
Openflow provides a standard interface for separating a network into a data plane and a programmatic control plane. This enables easy network reconfiguration, but introduces the po…
Shortest path and maximum flow problems in planar flow networks with additive gains and losses
Saber Mirzaei, Assaf Kfoury
In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e…
Efficient Reassembling of Graphs, Part 2: The Balanced Case
Saber Mirzaei, Assaf Kfoury
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulat…
Minimum Average Delay of Routing Trees
Saber Mirzaei
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical net…
Linear Arrangement of Halin Graphs
Saber Mirzaei, Assaf Kfoury
We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin…
Efficient Reassembling of Graphs, Part 1: The Linear Case
Assaf Kfoury, Saber Mirzaei
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: (1)…
An Alloy Verification Model for Consensus-Based Auction Protocols
Saber Mirzaei, Flavio Esposito
Max Consensus-based Auction (MCA) protocols are an elegant approach to establish conflict-free distributed allocations in a wide range of network utility maximization problems. A s…