Presentation of recent publications in discrete mathematics; this term topics focus on the Combinatorial Nullstellensatz and its applications.

Presentation of recent publications in discrete mathematics; topics focus on extremal graph theory.

Presentation of recent publications in discrete mathematics; topics focus on property testing and sublinear algorithms.

Turan-type problems for graphs are studied in depth. A special emphasis is given to algebraic constructions. Explicit constructions for various Ramsey-type problems are also treated. The very basics of the probabilistic method is also introduced.

Study and presentation of research papers from the literature on "Boolean Satisfiability-Combinatorics and Algorithms".

Introduction to the theory of graphs with a great emphasis given to reading, understanding and developing proofs. Topics include: trees, cycles, Eulerian circuits, bipartite graphs, extremality (Erdos-Stone Thm), matchings (Hall's and Tutte's Thm), connectivity (Menger's Thm), colorings (Brooks', Dirac's, Vizing's Thm), list-colorings (Galvin's Thm), planarity (Euler's Formula, Five Color Thm).

k-trees, matchings (Tutte's Theorem, Edmonds' Algorithm), network flows(Goldberg-Tarjan Algorithm), planar graphs (Kuratowski's Theorem,Lipton-Tarjan separators), stable matchings, list coloring(Galvin's Theorem), extremal graph theory (Erdos-Stone Theorem)

Presentations of important papers in the area of Discrete Mathematics and Theoretical Computer Science by PhD students

Study and presentation of research papers from the literature on "Boolean Satisfiability-Combinatorics and Algorithms".

Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.

Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.