186.862 Seminar in Algorithms Graphs and Geometry
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2017W, SE, 2.0h, 3.0EC

Properties

  • Semester hours: 2.0
  • Credits: 3.0
  • Type: SE Seminar

Aim of course

Participants acquire in-depth knowledge about a current research topic in graph algorithms and computational geometry. Starting from selected original research papers, students independently perform literature research on related articles and obtain detailed and contextual knowledge about their topic. Through their seminar presentation and the written seminar paper students learn fundamtenal skills on presenting algorithmic research topics and scientific writing. By focusing the seminar on open research questions and research discussion the students acquire and expand their algorithmic problem solving skills. In particular, students learn and expand those skills that are also required for working on a Master's thesis in algorithmics.

Subject of course

The seminar topic in 2017W comes from the area of Graph Drawing, which deals with algorithmic questions that are concerned with geometric representations of graphs. In particular, we will cover recent approaches for drawing non-planar graphs, i.e., graphs that do not admit a crossing-free drawing in the plane.

Additional information

Course structure

The seminar covers a recent theme in the area of graph drawing and graph algorithms. Following a general introduction into the topic students can choose their seminar topic from a list of suggestions. After two weeks they give a short presentation to introduce their topic to the seminar group. In November we will have the long presentations with subsequent discussions. In addition to the research results, presentations shall cover the remaining open research questions. In December we will discuss selected open problems in groups and develop solution strategies. 

The written seminar paper is due before the Christmas break, will be peer-reviewed and the final version is handed in in February.

 

ECTS breakdown

  5h introduction and topic selection
15h presentations and seminar meetings

25h work on seminar topic
10h preparations for presentation
20h seminar paper
----
75h

 

Attendance required


Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: http://www.tuwien.ac.at/fileadmin/t/ukanzlei/t-ukanzlei-english/Plagiarism.pdf

Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: Directive concerning the handling of plagiarism (PDF)

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Mon10:00 - 12:0009.10.2017 AC group library room HB 04 08Vorbesprechung
Mon10:00 - 12:0016.10.2017 AC group library room HB 04 08Ipe Tutorial
Mon10:00 - 12:0023.10.2017 AC group library room HB 04 08Short presentations
Mon10:00 - 12:0020.11.2017 - 27.11.2017 AC group library room HB 04 08Talks
Mon10:00 - 12:0004.12.2017 - 18.12.2017 AC group library room HB 04 08Problem solving session
Seminar in Algorithms Graphs and Geometry - Single appointments
DayDateTimeLocationDescription
Mon09.10.201710:00 - 12:00 AC group library room HB 04 08Vorbesprechung
Mon16.10.201710:00 - 12:00 AC group library room HB 04 08Ipe Tutorial
Mon23.10.201710:00 - 12:00 AC group library room HB 04 08Short presentations
Mon20.11.201710:00 - 12:00 AC group library room HB 04 08Talks
Mon27.11.201710:00 - 12:00 AC group library room HB 04 08Talks
Mon04.12.201710:00 - 12:00 AC group library room HB 04 08Problem solving session
Mon11.12.201710:00 - 12:00 AC group library room HB 04 08Problem solving session
Mon18.12.201710:00 - 12:00 AC group library room HB 04 08Problem solving session

Examination modalities

Oral presentation, written seminar paper, peer review, research session minutes.

Course registration

Begin End Deregistration end
01.09.2017 09:00 10.10.2017 12:00

Curricula

Study CodeObligationSemesterPrecon.Info
066 504 Master programme Embedded Systems Mandatory elective
066 931 Logic and Computation Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
066 950 Didactic for Informatics Mandatory elective
860 GW Optional Courses - Technical Mathematics Not specified

Literature

No lecture notes are available.

Previous knowledge

design and analysis of algorithms, in particular graph algorithms

basic geometry knowledge (high school level)

Preceding courses

Continuative courses

Language

English