The following pages link to Johannes Uhlmann (Q391092):
Displaying 33 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- On the Computation of Fully Proportional Representation (Q2842192) (← links)
- Partitioning into Colorful Components by Minimum Edge Deletions (Q2904478) (← links)
- Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs (Q2999338) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing (Q3013154) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- On Tractable Cases of Target Set Selection (Q3060749) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- (Q3165966) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming (Q3439128) (← links)
- Two-Layer Planarization Parameterized by Feedback Edge Set (Q3569096) (← links)
- Extended Islands of Tractability for Parsimony Haplotyping (Q3575249) (← links)
- Kernelization and Complexity Results for Connectivity Augmentation Problems (Q3603551) (← links)
- Deconstructing Intractability: A Case Study for Interval Constrained Coloring (Q3637114) (← links)
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452) (← links)
- Editing Graphs into Disjoint Unions of Dense Clusters (Q3652245) (← links)
- Graph-Based Data Clustering with Overlaps (Q5323099) (← links)
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897992) (← links)
