Alexander Schrijver
Affiliations:- University of Amsterdam, NL
- CWI Amsterdam, NL
According to our database1,
Alexander Schrijver
authored at least 110 papers
between 1977 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
2015
0
1
2
3
4
5
6
7
8
9
10
1
1
1
1
3
1
1
1
2
2
3
2
1
4
2
3
3
1
4
1
3
3
1
5
4
5
7
3
4
5
1
2
4
1
2
1
3
2
2
2
1
1
1
2
4
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2019
New lower bound on the Shannon capacity of <i>C</i><sub>7</sub> from circular graphs.
Inf. Process. Lett., 2019
2018
2017
Des. Codes Cryptogr., 2017
2016
Eur. J. Comb., 2016
2015
J. Comb. Theory A, 2015
2013
2012
2011
ACM Trans. Algorithms, 2011
2010
2009
2008
2007
Math. Program., 2007
2006
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming.
J. Comb. Theory A, 2006
Eur. J. Oper. Res., 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
New Code Bounds with Algebra and Semidefinite Programming.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006
2005
IEEE Trans. Inf. Theory, 2005
SIAM J. Discret. Math., 2005
2003
SIAM J. Discret. Math., 2003
Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index".
Math. Oper. Res., 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
2002
J. Comb. Theory B, 2002
2001
2000
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time.
J. Comb. Theory B, 2000
Equilateral Dimension of the Rectilinear Space.
Des. Codes Cryptogr., 2000
1999
Proceedings of the Algebraic Specification in Action, 1999
Theory of linear and integer programming.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-98232-6, 1999
1998
1997
1995
1994
J. Comb. Theory B, 1994
1993
J. Comb. Theory B, 1993
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
1992
1991
SIAM J. Discret. Math., 1991
J. Comb. Theory A, 1991
J. Comb. Theory B, 1991
J. Comb. Theory B, 1991
Induced circuits in graphs on surfaces.
Proceedings of the Graph Structure Theory, 1991
Finding disjoint trees in planar graphs in linear time.
Proceedings of the Graph Structure Theory, 1991
1990
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.
Math. Oper. Res., 1990
J. Comb. Theory B, 1990
Proceedings of the Polyhedral Combinatorics, 1990
Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces.
Proceedings of the Polyhedral Combinatorics, 1990
Proceedings of the Polyhedral Combinatorics, 1990
Proceedings of the Polyhedral Combinatorics, 1990
1989
On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems.
SIAM J. Discret. Math., 1989
1988
Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988
1986
1985
1984
Math. Program., 1984
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
Comb., 1984
1983
1982
Proceedings of the Mathematical Programming The State of the Art, 1982
1981
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields.
Comb., 1981
1980
1979
1978
1977
A Note on David Lubell's Article "Local Matchings in the Function Space of a Partial Order".
J. Comb. Theory A, 1977