6 citations · 22 across the 11 of their papers we have counts for
5 papers · 1 filter
A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks
Assaf Kfoury
We present an alternative and simpler method for computing principal typings of flow networks. When limited to planar flow networks, the method can be made to run in fixed-paramete…
A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
Assaf Kfoury
We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas.
Efficient Reassembling of Three-Regular Planar Graphs
Assaf Kfoury, Benjamin Sisson
A reassembling of a simple graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. There are several equivalent definitions of graph reassemb…
A Compositional Approach to Network Algorithms
Assaf Kfoury
We present elements of a typing theory for flow networks, where "types", "typings", and "type inference" are formulated in terms of familiar notions from polyhedral analysis and co…
Mathematical Logic in Computer Science
Assaf Kfoury
The article retraces major events and milestones in the mutual influences between mathematical logic and computer science since the 1950s.