Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Uhlmann, Johannes"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On making a distinguished vertex of minimum degree by vertex deletion
Nadja Betzler
,
Hans L. Bodlaender
,
Robert Bredereck
,
Rolf Niedermeier
,
Johannes Uhlmann
Algorithmica
68
(3), 2014, pp. 715-738
A cubic-vertex kernel for flip consensus tree
Christian Komusiewicz
,
Johannes Uhlmann
Algorithmica
68
(1), 2014, pp. 81-108
Two-Layer Planarization parameterized by feedback edge set
Johannes Uhlmann
,
Mathias Weller
Theoretical Computer Science
494
, 2013, pp. 99-111
Partitioning into colorful components by minimum edge deletions
Sharon Bruckner
,
Falk Hüffner
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Sven Thiel
,
Johannes Uhlmann
Lecture Notes in Computer Science
7354
, 2012, pp. 56-69
On making directed graphs transitive
Mathias Weller
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
Journal of Computer and System Sciences
78
(2), 2012, pp. 559-574
Editing graphs into disjoint unions of dense clusters
Jiong Guo
,
Iyad A. Kanj
,
Christian Komusiewicz
,
Johannes Uhlmann
Algorithmica
61
(4), 2011, pp. 949-970
Extended islands of tractability for parsimony haplotyping
Rudolf Fleischer
,
Jiong Guo
,
Rolf Niedermeier
,
Johannes Uhlmann
,
Yihui Wang
,
Mathias Weller
,
Xi Wu
Lecture Notes in Computer Science
6129
, 2010, pp. 214-226
A more relaxed model for graph-based data clustering:
s
-Plex Cluster Editing
Jiong Guo
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1662-1683
Kernelization and complexity results for connectivity augmentation problems
Jiong Guo
,
Johannes Uhlmann
Networks
56
(2), 2010, pp. 131-142
On tractable cases of target set selection
André Nichterlein
,
Rolf Niedermeier
,
Johannes Uhlmann
,
Mathias Weller
Lecture Notes in Computer Science
6506
, 2010, pp. 378-389
Parameterized complexity of candidate control in elections and related digraph problems
Nadja Betzler
,
Johannes Uhlmann
Theoretical Computer Science
410
(52), 2009, pp. 5425-5442
Graph-based data clustering with overlaps
Michael R. Fellows
,
Jiong Guo
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
Lecture Notes in Computer Science
5609
, 2009, pp. 516-526
Editing graphs into disjoint unions of dense clusters
Jiong Guo
,
Iyad A. Kanj
,
Christian Komusiewicz
,
Johannes Uhlmann
Lecture Notes in Computer Science
5878
, 2009, pp. 583-593
Deconstructing intractability: A case study for interval constrained coloring
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
Lecture Notes in Computer Science
5577
, 2009, pp. 207-220
On making directed graphs transitive
Mathias Weller
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
Lecture Notes in Computer Science
5664
, 2009, pp. 542-553
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Jiong Guo
,
Rolf Niedermeier
,
Johannes Uhlmann
Information Processing Letters
106
(2), 2008, pp. 81-86
A cubic-vertex kernel for flip consensus tree
Christian Komusiewicz
,
Johannes Uhlmann
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
Kernelization and complexity results for connectivity augmentation problems
Jiong Guo
,
Johannes Uhlmann
Lecture Notes in Computer Science
4619
, 2007, pp. 483-494