La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
Labeled shortest paths in digraphs with negative and positive edge weights
This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett et al. [SIAM J. Comput.30 (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based closely...
Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer
Level planar embedding in linear time.
Linear Algorithms for Testing the Sign Stability of a Matrix and for Finding Z-Maximum Matchings in Acyclic Graphs.
Linear Space Data Structures for Two Types of Range Search.
Lower bounds for sparse matrix vector multiplication on hypercubic networks.
Lower Bounds on Moving a Ladder in Two and Three Dimensions.
Lower bounds on the complexity of real-time branching programs
Lower bounds to the graph partitioning problem through generalized linear programming and network flows