Johannes Uhlmann

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