LEA

Matthias Baumgart

Contact

Email:  


Phone: +49-89-289-17700
Fax: +49-89-289-17707
Room: 03.09.060
Address: Institut für Informatik
Technische Universität München
Boltzmannstr. 3
D-85748 Garching
PGP/GPG: 1024D/DBA4C7F5 2005-03-10 Matthias Baumgart <mail@matthias-baumgart.de>
(Fingerprint: 447E 9972 0B84 8C53 455C B91C 03A1 2D2C DBA4 C7F5)

Research

My research topics are:
  • (weighted) Spanning Trees
  • Base Ordering
  • Lowest Common Ancestor in (weighted) DAGs
  • Approximation of Independent Sets in Graphs
  • IT-Security
  • Visual Cryptography

Publications and Talks

Partitioning Bispanning Graphs into Spanning Trees
In Advances in Combinatorial Algorithms I, Band 3 von Mathematics in Computer Science, 3-15, Birkhäuser, 2010.

with Christian Scheideler, Stefan Schmid
A DoS-Resilient Information System for Dynamic Data Management
In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'09), 300-309, ACM, 2009.

Ranking and Ordering Problems of Spanning Trees
Dissertation, Department of Computer Science, Technische Universität München, 2009

with Christian Scheideler, Stefan Schmid
A DoS-Resilient Information System for Dynamic Data Management
Technical Report TUM-I0906, Technische Universität München, Department of Computer Science, March 2009

Partitioning Bispanning Graphs into Spanning Trees
In Proceedings of the 19th International Workshop on Combinatorial Algorithms (IWOCA'08), 50-62, 2008.

with Hanjo Täubig
The Complexity of Computing Graph-Approximating Spanning Trees
Technical Report TUM-I0822, Technische Universität München, Department of Computer Science, July 2008
(PDF-File)

Partitioning Bispanning Graphs into Spanning Trees
Technical Report TUM-I0813, Technische Universität München, Department of Computer Science, May 2008
(PDF-File)

with M. Yaser Houri, Özlem Maras
Critical Rationalism
Talk in seminar "Modern Aspects and Applications of Philosophy of Science" (CeDoSIA), April 2007
(PDF-File 109 KB)

with M. Yaser Houri, Thomas Rückstieß, Frank Sehnke
Design-Oriented Research
Talk in seminar "Research Methods in Informatics and its Applications" (CeDoSIA), April 27th, 2007
(PDF-File 279 KB)

with Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak
All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606, Technische Universität München, Department of Computer Science, April 2006
(PDF-File 245 KB)

Effiziente Approximation unabhängiger Mengen in Graphen
Talk in post-graduate seminar about diploma thesis, May 18th, 2005
(Slides German PDF-File, 107 KB)
(Slides German (revised) PDF-File, 227 KB)

Efficient Approximation of Independent Sets in Graphs
Talk at Max-Planck-Institut for Informatics (AG 1), October 26th, 2004
(Slides English PDF-File, 102 KB)

Effiziente Approximation unabhängiger Mengen in Graphen
Diploma thesis, September 15th, 2004
(PDF-File, 577 KB)
(Slides PDF-File, 113 KB)

Approximation unabhängiger Mengen mit der Theta-Funktion
Talk in post-graduate seminar about diploma thesis, June 16th, 2004
(Slides PDF-File, 109 KB)

Approximation der Cliquenzahl in Graphen
Talk in post-graduate seminar about diploma thesis, April 28th, 2004
(Slides PDF-File, 148 KB)

Introduction to Visual Cryptography
Talk in Unicert-course level 3 module 3, January 19th, 2004
(Slides PDF-File, 67 KB)

Approximation von unabhängigen Mengen in dünnbesetzten Graphen
Seminar paper
(PS.GZ-File, 157 KB)

Approximation unabhängiger Mengen mit dem Greedy-Algorithmus
Talk in post-graduate seminar about seminar paper, July 16th and December 9th, 2003
(Slides part 1 PDF-File, 160 KB)
(Slides part 2 PDF-File, 167 KB)

with Tobias Baumann, Daniel Steger
VisualCrypt - eine Implementierung der visuellen Kryptographie für CrypTool
Lab course: Visal Cryptography, April 23rd, 2003

Überdeckungen und Nichtdeterminismus
Talk in seminar: Communicationcomplexity, Dezember 5th, 2002

Entscheidungsfindung im Unternehmen
Talk in seminar

Robocup - Fußballspielende Roboter
Talk in seminar: Selected topics of artifical intelligence

Rocks at the Mars Pathfinder Landing Site
Talk in Unicert-course level 2 module 3

Teaching

SS 2009 Lab Course: Discrete Optimization Supervisor
Efficient Algorithms and Data Structures II Teaching Assistant
WS 2008/09 Lab Course: Design of Algorithms Supervisor
Seminar: IT-Security Threats Mentoring of a participant
SS 2008 Efficient Algorithms and Data Structures II
(Prof. Dr. Ernst W. Mayr)
Teaching Assistant
Proseminar: Algorithms in Computer Graphics Organization and Mentoring
WS 2007/2008 Efficient Algorithms and Data Structures I
(Prof. Dr. Ernst W. Mayr)
Teaching Assistant
Seminar: Inside Google: Algorithmics of Search Engines Mentoring of a participant
Proseminar: Graph Drawing Organization and Mentoring
SS 2007 Efficient Algorithms and Data Structures II
(Prof. Dr. Ernst W. Mayr)
Teaching Assistant
Proseminar: Data Compression Mentoring of a participant
WS 2006/2007 Efficient Algorithms and Data Structures I
(Prof. Dr. Ernst W. Mayr)
Teaching Assistant
Seminar: Algorithm Engineering Mentoring of a participant
SS 2006 Fundamentals of Algorithms and Data Structures
(Dr. Sven Kosub)
Teaching Assistant
Proseminar: Text Algorithms Mentoring of a participant
WS 2005/2006 Discrete Structures
(Prof. Dr. Ernst W. Mayr)
Tutor of two tutorial groups
SS 2005 Introduction to Computer Science IV
(Prof. Dr. Ernst W. Mayr)
Tutor of a tutorial group
Theoretische Informatik für Wirtschaftsinformatiker
(Prof. Dr. Hanno Lefmann)
Teaching Assistant
Theoretische Informatik III für Informatiker
(Prof. Dr. Hanno Lefmann)
Teaching Assistant
WS 2004/2005 Praktikum Datenschutz und Datensicherheit Mentoring of the participants
Proseminar Scheduling Mentoring of the participants
SS 2004 Theoretische Informatik II
(Prof. Dr. Hanno Lefmann)
Tutor of two tutorial groups
SS 2003 Theoretische Informatik II
(Prof. Dr. Hanno Lefmann)
Tutor of two tutorial groups
WS 2002/2003 Theoretische Informatik I
(Prof. Dr. Hanno Lefmann)
Tutor of two tutorial groups