Universität Rostock |  Fakultät für Informatik und Elektrotechnik |  Institut für Informatik |  Wissenschaftsbereich Theoretische Informatik

Dr. rer. nat. Christian Hundt

Anschrift	Universität Rostock	Büro	251
	Institut für Informatik	Telefon	+49 381 498-7648
	Theoretische Informatik	Fax	+49 381 498-7642
	Albert-Einstein-Strasse 22	eMail	Christian . Hundt @ informatik . uni - rostock . de
	D-18051 Rostock

Veröffentlichungen

Zeitschriftenartikel

2011

• Christian Hundt und Maciej Liskiewicz.
  New Complexity Bounds for Image Matching under Rotation and Scaling.
  In Journal of Discrete Algorithms, 9(1):122-136, 2011
  

2010

• Andreas Brandstädt, Christian Hundt, Federico Mancini und Peter Wagner.
  Rooted Directed Path Graphs are Leaf Powers.
  In Discrete Mathematics, 310(4):897-910, 2009
  

2009

• Christian Hundt, Maciej Liskiewicz und Ragnar Nevries.
  A Combinatorial Geometric Approach to Two-dimensional Robustly Pattern Matching with Scaling and Rotation.
  In Theoretical Computer Science, 410(51):5317-5333, 2009.
  

Konferenzbeiträge

2012

• Christian Hundt und Florian Wendland.
  Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation.
  erscheint in Proc. 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012.
  

2010

• Christian Hundt.
  Affine Image Matching is uniform TC⁰-complete.
  In Proc. 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, LNCS 6129, Springer-Verlag 2010, pp. 13-25.
  
• Andreas Brandstädt, Christian Hundt und Ragnar Nevries.
  Efficient Edge Domination on Hole-free Graphs in Polynomial Time.
  In Proc. 9th Latin American Theoretical Informatics Symposium, LATIN 2010, LNCS 6034, Springer-Verlag 2010, pp. 650-661.
  

2009

• Christian Hundt und Maciej Liskiewicz.
  New Complexity Bounds for Image Matching under Rotation and Scaling.
  In Proc. 20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009, LNCS 5577, Springer-Verlag 2009, pp. 127-141.
  

2008

• Christian Hundt und Maciej Liskiewicz.
  Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.
  In Proc. 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, LNCS 5162, Springer-Verlag 2008, pp. 395-406.
  
• Jason Ernst, Hongbing Fan, Christian Hundt und Yu-Liang Wu.
  Algorithms and Implementation for Interconnection Graph Problem.
  In Proc. 2nd Annual International Conference on Combinatorial Optimization and Applications, COCOA 2008, LNCS 5165, Springer-Verlag 2008, pp. 201-210.
  
• Christian Hundt und Ulf Ochsenfahrt.
  Damaged BZip Files are Difficult to Repair.
  In Proc. 14th Annual International Computing and Combinatorics Conference, COCOON 2008, LNCS 5092, Springer-Verlag 2008, pp. 11-20.
  
• Christian Hundt und Maciej Liskiewicz.
  Two-Dimensional Pattern Matching with Combined Scaling and Rotation.
  In Proc. 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, LNCS 5029, Springer-Verlag 2008, pp. 5-17.
  
• Andreas Brandstädt und Christian Hundt.
  Ptolemaic Graphs and Interval Graphs are Leaf Powers.
  In Proc. 8th Latin American Theoretical Informatics Symposium, LATIN 2008, LNCS 4957, Springer-Verlag 2008, pp. 479-491.
  

2007

• Christian Hundt und Maciej Liskiewicz.
  On the Complexity of Affine Image Matching.
  In Proc. 24th International Symposium on Theoretical Aspects of Computer Science, STACS 2007, LNCS 4393, Springer-Verlag 2007, pp. 284-295.
  

2006

• Christian Hundt, Maciej Liskiewicz und Ulrich Wölfel.
  Provably Secure Steganography and the Complexity of Sampling.
  In Proc. 17th International Symposium on Algorithms and Computation, ISAAC 2006, LNCS 4288, Springer-Verlag 2006, pp. 754-763.
  

Technische Berichte

2007

• Christian Hundt und Maciej Liskiewicz.
  A Combinatorial Geometric Approach to Linear Image Matching.
  In Electronic Colloquium on Computational Complexity, ECCC 2007, http://eccc.hpi-web.de/eccc/.
  

Dissertationen

• Christian Hundt.
  On the Computational Complexity of Projective Image Matching.
  Dissertation, Universität zu Lübeck, Institut für Theoretische Informatik, Juli 2011.
  
• Christian Hundt.
  Width-Bounded Query Languages.
  Diplomarbeit, Universität Rostock, Institut für Informatik, September 2005.
  

Programmierwettbewerbe

ACM ICPC (International Collegiate Programming Contest)

Zusammen mit Ragnar Nevries trainiere ich seit Anfang 2008 studentische Teams zur Teilnahme am ACM ICPC. Die folgende Tabelle zeigt die Teilnahme und die Ergebnisse unserer Teams:

InformatiCup

Ragnar Nevries und ich betreuen studentische Teams zur Teilnahme am InformatiCup der Gesellschaft für Informatik. Die folgende Tabelle zeigt die Teilnahme Rostocker Teams und das Ergebnis: