We study the NP-complete Maximum Outerplanar Subgraph problem. The previ...
We offer a general approach to modeling longitudinal network data, inclu...
We present a flexible public transit network design model which optimize...
We consider a linear relaxation of a generalized minimum-cost network fl...
The chromatic polynomial of a graph G, denoted P(G,m), is equal to the
n...