Skip to content

Johannes Uhlmann

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

15

Venues

9

Active years

2006–2012

Best venue rank

A*

Where they publish

Papers

15 indexed papers, newest first.

YearVenueTitleAuthors
2012CPMPartitioning into Colorful Components by Minimum Edge Deletions.Sharon Bruckner, Falk Hffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
2011SOFSEMOn Making a Distinguished Vertex Minimum Degree by Vertex Deletion.Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2011SOFSEMAlternative Parameterizations for Cluster Editing.Christian Komusiewicz, Johannes Uhlmann
2010AAAIExact Algorithms and Experiments for Hierarchical Tree Clustering.Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2010CPMExtended Islands of Tractability for Parsimony Haplotyping.Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
2010ISAACOn Tractable Cases of Target Set Selection.Andr Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
2010TAMCTwo-Layer Planarization Parameterized by Feedback Edge Set.Johannes Uhlmann, Mathias Weller
2009AAIMA More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009COCOONGraph-Based Data Clustering with Overlaps.Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009CPMDeconstructing Intractability: A Case Study for Interval Constrained Coloring.Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009ISAACEditing Graphs into Disjoint Unions of Dense Clusters.Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
2009WADSOn Making Directed Graphs Transitive.Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2008COCOAParameterized Complexity of Candidate Control in Elections and Related Digraph Problems.Nadja Betzler, Johannes Uhlmann
2007WADSKernelization and Complexity Results for Connectivity Augmentation Problems.Jiong Guo, Johannes Uhlmann
2006SOFSEMComplexity and Exact Algorithms for Multicut.Jiong Guo, Falk Hffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann