Teaching at the ENSIIE
- Graph theory
- Connectivity
- Independent sets, domination sets
- Planar graphs
- Coloring
- Trees, directed trees (Cours TD)
- Matching
- Operations research
- Minimum multicut
- Dynamic programming
- Mathematical programming
- Simplex algorithm
- Branch and bound
- Markov chains, stochastic process
- Functional programming
- Recursivity
- Records, sum types
- Iterators, higher order
- Imperative programming
- Loops
- Structures
- Inputs/outputs
- Pointers
- Formal verification : method B
- Compilation
Teaching at the IUT d'Orsay
- Analysis and design of databases