Johannes Uhlmann

Publication Activity (10 Years)

Years Active: 2004-2014
Publications (10 Years): 0

Top Venues

Discret. Appl. Math.

Algorithmica

J. Comput. Syst. Sci.

CoRR

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

Nadja Betzler, Arkadii Slinko, Johannes Uhlmann
On the Computation of Fully Proportional Representation. CoRR (2014)
Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica 68 (3) (2014)
Christian Komusiewicz, Johannes Uhlmann
A Cubic-Vertex Kernel for Flip Consensus Tree. Algorithmica 68 (1) (2014)
Johannes Uhlmann, Mathias Weller
Two-Layer Planarization parameterized by feedback edge set. Theor. Comput. Sci. 494 (2013)
Nadja Betzler, Arkadii Slinko, Johannes Uhlmann
On the Computation of Fully Proportional Representation. J. Artif. Intell. Res. 47 (2013)
André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3 (2) (2013)
Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160 (1-2) (2012)
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
On making directed graphs transitive. J. Comput. Syst. Sci. 78 (2) (2012)
Christian Komusiewicz, Johannes Uhlmann
Cluster editing with locally bounded modifications. Discret. Appl. Math. 160 (15) (2012)
Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
Partitioning into Colorful Components by Minimum Edge Deletions. CPM (2012)
Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM (2011)
Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Algorithms Mol. Biol. 6 (2011)
Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9 (1) (2011)
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Graph-based data clustering with overlaps. Discret. Optim. 8 (1) (2011)
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61 (4) (2011)
Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. TAPAS (2011)
Christian Komusiewicz, Johannes Uhlmann
Alternative Parameterizations for Cluster Editing. SOFSEM (2011)
Jiong Guo, Johannes Uhlmann
Kernelization and complexity results for connectivity augmentation problems. Networks 56 (2) (2010)
Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu
Extended Islands of Tractability for Parsimony Haplotyping. CPM (2010)
Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI (2010)
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discret. Math. 24 (4) (2010)
André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
On Tractable Cases of Target Set Selection. ISAAC (1) (2010)
Johannes Uhlmann, Mathias Weller
Two-Layer Planarization Parameterized by Feedback Edge Set. TAMC (2010)
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
On Making Directed Graphs Transitive. WADS (2009)
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Graph-Based Data Clustering with Overlaps. COCOON (2009)
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC (2009)
Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM (2009)
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM (2009)
Nadja Betzler, Johannes Uhlmann
Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410 (52) (2009)
Christian Komusiewicz, Johannes Uhlmann
A Cubic-Vertex Kernel for Flip Consensus Tree. FSTTCS (2008)
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. Eur. J. Oper. Res. 186 (2) (2008)
Jiong Guo, Rolf Niedermeier, Johannes Uhlmann
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. Inf. Process. Lett. 106 (2) (2008)
Nadja Betzler, Johannes Uhlmann
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. COCOA (2008)
Jiong Guo, Johannes Uhlmann
Kernelization and Complexity Results for Connectivity Augmentation Problems. WADS (2007)
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
Complexity and Exact Algorithms for Multicut. SOFSEM (2006)
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. 3 (3) (2006)
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electron. Notes Discret. Math. 17 (2004)
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW (2004)

Johannes Uhlmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Johannes Uhlmann