1. CSE 6410 Advanced Algorithmic Graph Theory 2 3 4 5 6 7 8 9 10 11 12 13 14 15 s = 1 t = 16 V 8 V 7 V 6 V 5 V 4 V 3 V 2 V 1 n u 1 u 2 u 9 16 1 2 3 4 5 6 7 8 14 21 12 13 20 10 19 11 17 15 18

2. Vertex Orderings: st-Numbering and Canonical Orderings; Graph Decompositions and Their Algorithmic Applications: Ear Decomposition, Canonical Decomposition, Tree Decomposition, Path Width and Tree Width, PQ-tree, SPQR-tree, Split Decomposition, Recursively Decomposable Graphs, Clique Separator Decomposition;. Course Contents

3. Graph Representations: Implicit Representations, Intersection and Containment Representations; Graph Classes Defined by Forbidden Subgraphs; Graph Classes Defined by Elimination Schemes; Classes of Graphs with Bounded Treewidth and Their Algorithmic Implications; Characterization, Construction and Recognition Algorithms for Some Special Classes of Graphs. Course Contents

4. Vertex Orderings: st-Numbering and Canonical Orderings; Graph Decompositions and Their Algorithmic Applications: Ear Decomposition, Canonical Decomposition, Tree Decomposition, Path Width and Tree Width, PQ-tree, SPQR-tree, Split Decomposition, Recursively Decomposable Graphs, Clique Separator Decomposition; Characterization, Construction and Recognition Algorithms for Some Special Classes of Graphs. Course Contents

5. Text Books T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004. J. P. Spinrad, Efficient Graph Representations, American Mathematical Society, 2003. Results from Journals

6. Fundation M. S. Rahman, Basic Graph Theory, Springer, 2016 (to appear).

7. Marks Distribution Attendance 10 Presentation 15 Review Paper Writing 15 Compilation of two class lectures in Latex 10 Examination 50

8. Presentation Choose a paper on any topic in the course content published in a reputed journal or conference proceedings. Show me the paper and take my approval. You have to read, understand and present the paper. Use PowerPoint /Beamer for presentation. Two Students in a Group

9. Presentation Format  Problem definition  Results of the paper  Contribution of the paper in respect to previous results  Algorithms and methodologies including proofs  Future works, open problems and your idea

10. Presentation Schedule Presentation time: 20 minutes Presentation will start from June 5, 2016.

11. Paper Writing Choose a topic from the course content. Write a survey paper for getting at most 85% marks of the item. You need to add some new results to get full marks. Use LaTex for writing the paper. Reporting of Topic: June 26, 2016 (5 min presentation) Submission Deadline of preliminary version: July 31, 2016. Final Submission: September 04, 2016 (A hard copy with all source files in a CD) Two Students in a Group

12. Compilation of Class Lectures Each student will compile my class lectures one topic using LaTex (I will assign). You need to add necessary figures for illustration. Xfig or Latexdraw is recommended for drawing figures.