Johannes Uhlmann

Available identifiers

zbMath Open uhlmann.johannesWikidataQ102431511 ScholiaQ102431511MaRDI QIDQ391092

List of research outcomes

Publication	Date of Publication	Type
Generalizing Frobenius Inversion to Quaternion Matrices	2023-05-03	Paper
On making a distinguished vertex of minimum degree by vertex deletion	2017-05-17	Paper
A cubic-vertex kernel for flip consensus tree	2014-03-25	Paper
Two-layer planarization parameterized by feedback edge set	2014-01-10	Paper
On the computation of fully proportional representation	2013-08-13	Paper
Cluster editing with locally bounded modifications	2012-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q3165966	2012-10-19	Paper
Graph-based data clustering with overlaps	2012-10-16	Paper
Partitioning into Colorful Components by Minimum Edge Deletions	2012-08-14	Paper
On making directed graphs transitive	2012-05-11	Paper
On bounded-degree vertex deletion parameterized by treewidth	2012-03-19	Paper
Editing graphs into disjoint unions of dense clusters	2011-12-14	Paper
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing	2011-07-18	Paper
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs	2011-05-12	Paper
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring	2011-05-03	Paper
Alternative Parameterizations for Cluster Editing	2011-02-15	Paper
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion	2011-02-15	Paper
On Tractable Cases of Target Set Selection	2010-12-09	Paper
Kernelization and complexity results for connectivity augmentation problems	2010-11-24	Paper
Extended Islands of Tractability for Parsimony Haplotyping	2010-07-26	Paper
Two-Layer Planarization Parameterized by Feedback Edge Set	2010-06-17	Paper
Two fixed-parameter algorithms for vertex covering by paths on trees	2010-04-19	Paper
Editing Graphs into Disjoint Unions of Dense Clusters	2009-12-17	Paper
Parameterized complexity of candidate control in elections and related digraph problems	2009-11-25	Paper
On Making Directed Graphs Transitive	2009-10-20	Paper
Graph-Based Data Clustering with Overlaps	2009-07-23	Paper
Deconstructing Intractability: A Case Study for Interval Constrained Coloring	2009-07-07	Paper
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing	2009-07-02	Paper
Kernelization and Complexity Results for Connectivity Augmentation Problems	2009-02-17	Paper
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems	2009-01-27	Paper
Tree decompositions of graphs: saving memory in dynamic programming	2008-01-11	Paper
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs	2007-11-23	Paper
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming	2007-05-29	Paper
SOFSEM 2006: Theory and Practice of Computer Science	2006-11-14	Paper

Research outcomes over time

This page was built for person: Johannes Uhlmann