Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP

Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs

Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

Local negative circuits and fixed points in Boolean networks

Localization on low-order eigenvectors of data matrices

Locally computable approximations for spectral clustering and absorption times of random walks

Locally identifying coloring of graphs

Locally monotone Boolean and pseudo-Boolean functions

Logic circuits from zero forcing

Low Dimensional Euclidean Volume Preserving Embeddings

Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices

Lower bounds for finding the maximum and minimum elements with k lies

Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori

Lower Bounds on the Complexity of MSO1 Model-Checking

Mácajová and Škoviera Conjecture on Cubic Graphs

MANETS: High mobility can make up for low transmission power

Map Graphs

Markov Modeling of Cooperative Multiplayer Coupon Collectors' Problems

Markovian Network Interdiction and the Four Color Theorem

Matching Interdiction