Combinatorial and Graph Algorithms, Fall 2001, NUS

Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Fall Semester 2001)
CS4234 Course Web-Site
(CS4234 is also cross-listed as CS5234 for grad students)

LATEST UPDATE

16-Nov-2001 @Exam-Hall
-- Surprise Fun Bonus Questions

15-Nov-2001 --- Winners of TTP Challenge

Zhu Wen-bin (45/46 best solutions) -- using Simulated Annealing
Tan JingSong (16/46 best solutions)
Liu Ming (15/46 best solutions)

General Information

Course: CS4234 : Combinatorial and Graph Algorithms
- Prerequisites: CS3230: Design and Analysis of Algorithms | See also Pre-Requisite Info |
- CS4234 is also cross-listed as CS5234 for graduate students.
  - Graduate students do more, and will be graded separately.
Instructor: A/P Leong Hon Wai --- (Email: leonghw@comp.nus.edu.sg)
- Consultation Hours: Tues 3-4pm; and Fri 3-4pm; (or by appointment)
Lectures -- Wed, 10:00am -- 12:00nn @SR1, (S16, Level 3)
- Final Exam (Open Book) -- Fri, 16 Nov 2001, 8:30-11:00AM, TR5

Course Information

Latest Announcements --- Always updated!

Course Summary ---

Pre-Requisite Information --- IMPORTANT!!
Test yourself on HW0 and HW1

Schedule of Lectures

See the Overview Lecture

Homework Information

LEDA Project Information -- TTP-Challenge Results are out!

First, read my lecture notes on LEDA.
Information on LEDA-in-SoC --

Student Roster and Scores --- Scores ARE out!

Teaching and Learning

Cattywampus?

Writing with Proper Style -- Elements of Style by Strunk and White

How to Present a Paper in Theoretical Computer Science, by Ian Parberry. (also in [ps])

How to be a Good Graduate Student in a US research based university.
Note: Although this article is based on a US PhD programme, which is slightly different from that in NUS, most of the points made in this article about motivation, attitude, research process are very similar. This article can provide a good starting reference point for beginning graduate students.