TagCloud
| Expertise | Combinatorialism and algorithmics, especially combinatorial optimisation, polyhedral combinatorialism and graphs theory |
| Expertise (NL) | Combinatoriek en algoritmiek, in het bijzonder de combinatorische optimalisering, polyedrale combinatoriek en grafentheorie |
| Digital Author IDThe Digital Author Identifier (DAI) is a number that has been assigned to all scientific authors in the Netherlands. This makes it possible to create links between information from different systems regardless the name variances of the author. | info:eu-repo/dai/nl/29806278X |
| KNAW member | Science Division |
Active as
-
Part-time professor
Korteweg-de Vries Instituut voor Wiskunde - KdVI (UvA)
Chair (EN) Discrete mathematics and optimization Chair (NL) Discrete wiskunde en optimalisering Phone +31-20-5256091 Email -
Program Leader
Centrum Wiskunde & Informatica - CWI (NWO)
Phone +31-20-5924087 Email URL http://homepages.cwi.nl/~lex/
Publications
RSS 2.0 export of all publications of Prof.dr. A. Schrijver based on the DAI (29806278X) of the author.
- Optimization and approximation on systems of geometric objects
- Tensor subalgebras and First Fundamental Theorems in invariant theory
- Graph parameters and semigroup functions
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Reduction of symmetric semidefinite programs using the regular *-representation
- Wat kunnen we berekenen?
- New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming
- Wiskunde gezever?
- A rolling stock circulation model for combining and splitting of passenger trains
- New limits on fault-tolerant quantum computation
- Efficient Circulation of Railway Rolling Stock
- Combinatorial optimization. Polyhedra and efficiency.
- Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "A generalization of the perfect graph theorem under the disjunctive index''
- Blocking nonorientability of a surface
- On the b-stable set polytope of graphs without bad K-4
- On the history of the transportation and the maximum flow problems
- A short proof of Guenin's characterization of weakly bipartite graphs
- Strong t-perfection of bad K-4 graphs.
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time
- Total dual integrality of matching forest constraints
RSS 2.0 export of all publications of Prof.dr. A. Schrijver based on the DAI (29806278X) of the author.
Current research
(the most recent research is at the top)
Project leader
|
Spinoza project |
Project leader
|
Discrete, Interactive and Algorithmic Mathematics, Algebra and Number Theory |
Project leader
|
Discrete mathematics and optimization |
Supervisor
|
Algorithms, Combinatorics and Optimization |
Completed research projects
Completed research:
|
Dutch Research Database (NOD) |
Classification
Update this data in the Dutch Research Database (NOD).
D11600
|
Probability theory, statistics |
D11700
|
Operations research |
D16200
|
Software, algorithms, control systems |
