We study the problem of scheduling an arbitrary computational DAG on a f...
We study the balanced k-way hypergraph partitioning problem, with a spec...
We present a novel graph neural network we call AgentNet, which is desig...
We study and compare different Graph Neural Network extensions that incr...
This paper studies Dropout Graph Neural Networks (DropGNNs), a new appro...
This paper introduces the Two-Class (r,k)-Coloring problem: Given a fixe...
We study the stabilization time of two common types of influence propaga...
We study financial networks where banks are connected by debt contracts....
We consider financial networks, where banks are connected by contracts s...
Red-blue pebble games model the computation cost of a two-level memory
h...
We study the stabilization time of a wide class of processes on graphs, ...
We study financial networks with debt contracts and credit default swaps...
We study the incentives of banks in a financial network, where the netwo...
We analyze the stabilization time of minority processes in graphs. A min...
A minority process in a weighted graph is a dynamically changing colorin...