Linked e-resources

Details

Introduction
N. Alon: Lovász, Vectors, Graphs and Codes
A. Björner: Continuous matroids revisited
C. Borgs, J. T. Chayes, H. Cohn and L. M. Lovász: Identifiability for Graphexes and the Weak Kernel Metric
D. Conlon, J. Fox, A. Grinshpun and Xiaoyu He: Online Ramsey Numbers and the Subraph Query Problem
P. Csikvári: Statistical Matching Theory
P. Diaconis: A conversation with Laci
U. Feige: Tighter Bounds for Bipartite Matching
T. Jordán and A. Mihálykó: Minimum Cost Globally Rigid Subgraphs
P. Keevash: Colored and Directed Designs
Jin Tat Lee, A. Sidford and S. S. Vempala: Efficient Convex Optimization with Oracles
J. Nesetril and P. Osona de Mendes: Approximations of Mappings
O. E. Raz and A. Wigderson: Derandomization Through Submodular Optimization
A. Schrijver: Finding k Partially Disjoint Paths in a Directed Planar Graph
M. Simonovits and E. Szemerédi: Embedding graphs into larger graphs, results, methods and problems.

Browse Subjects

Show more subjects...

Statistics

from
to
Export