Johannes Uhlmann

Dipl.-Inf.

Friedrich-Schiller-Universität Jena

Fakultät für Mathematik und Informatik

Institut für Informatik

Lehrstuhl Theoretische Informatik I

Ernst-Abbe-Platz 2
Room: 3325
D-07743 Jena
Fed. Rep. of Germany

Phone: +49-3641-9-46326
Fax: +49-3641-9-46322
E-Mail: uhlmann@minet.uni-jena.de

Publications

Conference articles

• Christian Komusiewicz and Johannes Uhlmann:
  A cubic-vertex kernel for flip consensus tree.
  In Proceedings of the 28th Foundations of Software Technology and Theoretical Computer Science conference (FSTTCS'08), Bangalore, India. December 2008.

• Nadja Betzler and Johannes Uhlmann:
  Parameterized complexity of candidate control in elections and related digraph problems.
  In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, Canada. August 2008.
  Volume 5165 in Lecture Notes in Computer Science, pages 43–53, Springer (original publication).

• Jiong Guo and Johannes Uhlmann:
  Kernelization and complexity results for connectivity augmentation problems.
  In Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS'07), Halifax, Canada. August 2007.
  Volume 4619 in Lecture Notes in Computer Science, pages 484–495, Springer (original publication).

• Jiong Guo, Falk Hüffner, Erhan Kenar , Rolf Niedermeier, and Johannes Uhlmann:
  Complexity and exact algorithms for multicut.
  In Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'06), Merin, Czech Republic. January 2006.
  Volume 3831 in Lecture Notes in Computer Science, pages 303–312, Springer (original publication). Journal version available.

• Nadja Betzler, Rolf Niedermeier, and Johannes Uhlmann:
  Tree decompositions of graphs: saving memory in dynamic programming.
  In Proceedings of the Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW'04), Milano, Italy. May/June 2004. Journal version available.

Journal articles

• Jiong Guo, Rolf Niedermeier, and Johannes Uhlmann:
  Two fixed-parameter algorithms for vertex covering by paths on trees.
  Information Processing Letters, 106(2): 81–86, 2008 (original publication).

• Jiong Guo, Falk Hüffner, Erhan Kenar , Rolf Niedermeier, and Johannes Uhlmann:
  Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.
  European Journal of Operational Research, 186:542–553, 2008 (original publication).

• Nadja Betzler, Rolf Niedermeier, and Johannes Uhlmann:
  Tree decompositions of graphs: saving memory in dynamic programming.
  Discrete Optimization, 3(3): 220–229, 2006 (original publication).

Diploma thesis

• Johannes Uhlmann:
  Parameterized Algorithmics for Connectivity Augmentation Problems in Networks.
  Diplomarbeit, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 2007.