Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Alexander Schrijver

Known as: Lex Schrijver, Schrijver 
Alexander (Lex) Schrijver (born 4 May 1948 in Amsterdam) is a Dutch mathematician and computer scientist, a professor of discrete mathematics and… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The Atmospheric Imaging Assembly (AIA) provides multiple simultaneous high-resolution full-disk images of the corona and… Expand
  • figure 1
  • figure 3
  • table 1
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Let $f:2^{N} \rightarrow \cal R^{+}$ be a non-decreasing submodular set function, and let $(N,\cal I)$ be a matroid. We consider… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Sherali and Adams [SA90], Lov\''asz and Schrijver [LS91] and, recently, Lasserre [Las01b] have proposed lift and project methods… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
During the last thirty years of his life, Albert Einstein sought relentlessly for a so-called unified field theory—a theory… Expand
  • table 1.1
  • table 1.2
  • table 10.1
  • table 10.2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • D. Knuth
  • Electron. J. Comb.
  • 1994
  • Corpus ID: 18152765
This report contains expository notes about a function vartheta(G) that is popularly known as the Lovasz number of a graph G… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We propose a cutting plane algorithm for mixed 0–1 programs based on a family of polyhedra which strengthen the usual LP… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We give a randomized algorithm using O(n7 log’ n) separation calls to approximate the volume of a convex body with a fixed… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We announce a proof of the Tait flyping conjecture; the confirmation of this conjecture renders almost trivial the problem of… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Answering a question of Vera Sós, we show how Lovász’ lattice reduction can be used to find a point of a given lattice, nearest… Expand
Is this relevant?