Program of the BEST Summer School (June 26 - July 7, 2000)
and of the CEEPUS Summer School (July 3 - 14, 2000)
 
Site: Informatics building of the Budapest University of Technology and Economics; first floor (to be reached in the right hand side staircase), room # 138. The video presentation (2 p.m. in July 4th) will be in room # 025.


June 26, Monday

9:00-10:30 Gabor Simonyi: Graph theory - an introduction
11:00-12:30 Rita Csakany: Matchings in graphs

June 27, Tuesday

9:00-10:30 and
11:00-12:30 Gabor Simonyi: Graph colouring

June 28, Wednesday

9:00-10:30 Rita Csakany: Flows in graphs
11:00-12:30 Andras Recski: Introduction to the theory of computational complexity


July 3, Monday

9:30-10:45 and
11:00-12:30 Andras Recski: Introduction to matroid theory

July 4, Tuesday

9:00-10:30 Andras Recski: Matroid algorithms
14:00-15:00 Richard Karp: NP-Complete Problems
(video presentation -- recorded August 1993 when he received ACM's A. M. Turing Award,
often referred to as the Nobel Prize of Computer Science)
exceptionally in room # 025 (main floor)

July 5, Wednesday

9:00-10:30 Marie Demlova: Mathematical background of coding theory
11:00-12:00 Martin Baca: Special numberings of graphs
12:00-12:30 David Bartl: Optimization of students' curricula (joint work with Jan Plesingr)

July 6, Thursday

9:30-10:45 and
11:00-12:30 Andras Recski: Applications of combinatorial optimization in VLSI design

July 7, Friday

9:00-10:30 and
11:00-12:30 Andras Recski: Applications of combinatorial optimization in civil engineering


July 10, Monday

9:00-10:30 Peter Szeredi: A course in constrained (logic) programming, I
11:00-12:00 Tomaz Pisanski: Bridges between graphs and geometry
12:00-12:45 Neza Mramor Kosta: Lie geometry and the Apollonius problem
(joint work with Borut Jurcic Zlobec)

July 11, Tuesday

9:00-10:30 Peter Szeredi: A course in constrained (logic) programming, II
11:00-12:30 Jiri Velebil: Modal logic for programs

July 12, Wednesday

9:00-10:30 Peter Szeredi: A course in constrained (logic) programming, III
11:00-12:30 Karel Zimmermann: Disjunctive optimization problems with a special structure
14:00-15:30 Jitka Dupacova: Portfolio optimization via stochastic programming:
Model building and methods of output analysis
BUDAPESTI MŰSZAKI ÉS GAZDASÁGTUDOMÁNYI EGYETEM -- SZÁMÍTÁSTUDOMÁNYI ÉS INFORMÁCIÓELMÉLETI TANSZÉK