![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Johannes Uhlmann
Person information
- affiliation: University of Jena, Germany
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j19]Christian Komusiewicz
, Johannes Uhlmann:
A Cubic-Vertex Kernel for Flip Consensus Tree. Algorithmica 68(1): 81-108 (2014) - [j18]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): 715-738 (2014) - [i1]Nadja Betzler, Arkadii Slinko, Johannes Uhlmann:
On the Computation of Fully Proportional Representation. CoRR abs/1402.0580 (2014) - 2013
- [j17]Nadja Betzler, Arkadii Slinko
, Johannes Uhlmann:
On the Computation of Fully Proportional Representation. J. Artif. Intell. Res. 47: 475-519 (2013) - [j16]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3(2): 233-256 (2013) - [j15]Johannes Uhlmann, Mathias Weller:
Two-Layer Planarization parameterized by feedback edge set. Theor. Comput. Sci. 494: 99-111 (2013) - 2012
- [j14]Nadja Betzler, Robert Bredereck
, Rolf Niedermeier, Johannes Uhlmann:
On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160(1-2): 53-60 (2012) - [j13]Christian Komusiewicz
, Johannes Uhlmann:
Cluster editing with locally bounded modifications. Discret. Appl. Math. 160(15): 2259-2270 (2012) - [j12]Mathias Weller, Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
On making directed graphs transitive. J. Comput. Syst. Sci. 78(2): 559-574 (2012) - [c18]Sharon Bruckner, Falk Hüffner
, Christian Komusiewicz
, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann:
Partitioning into Colorful Components by Minimum Edge Deletions. CPM 2012: 56-69 - 2011
- [b1]Johannes Uhlmann:
Multivariate Algorithmics in Biological Data Analysis. Berlin Institute of Technology, 2011, ISBN 978-3-7983-2352-0, pp. 1-186 - [j11]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz
, Johannes Uhlmann:
Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011) - [j10]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: 21 (2011) - [j9]Michael R. Fellows
, Jiong Guo, Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
Graph-based data clustering with overlaps. Discret. Optim. 8(1): 2-17 (2011) - [j8]Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1): 137-151 (2011) - [c17]Nadja Betzler, Robert Bredereck
, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM 2011: 123-134 - [c16]Christian Komusiewicz
, Johannes Uhlmann:
Alternative Parameterizations for Cluster Editing. SOFSEM 2011: 344-355 - [c15]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: 104-115 - 2010
- [j7]Jiong Guo, Johannes Uhlmann:
Kernelization and complexity results for connectivity augmentation problems. Networks 56(2): 131-142 (2010) - [j6]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): 1662-1683 (2010) - [c14]Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010: 457-462 - [c13]Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu:
Extended Islands of Tractability for Parsimony Haplotyping. CPM 2010: 214-226 - [c12]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On Tractable Cases of Target Set Selection. ISAAC (1) 2010: 378-389 - [c11]Johannes Uhlmann, Mathias Weller:
Two-Layer Planarization Parameterized by Feedback Edge Set. TAMC 2010: 431-442
2000 – 2009
- 2009
- [j5]Nadja Betzler, Johannes Uhlmann:
Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52): 5425-5442 (2009) - [c10]Jiong Guo, Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239 - [c9]Michael R. Fellows
, Jiong Guo, Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 - [c8]Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM 2009: 207-220 - [c7]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz
, Johannes Uhlmann:
Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593 - [c6]Mathias Weller, Christian Komusiewicz
, Rolf Niedermeier, Johannes Uhlmann:
On Making Directed Graphs Transitive. WADS 2009: 542-553 - 2008
- [j4]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): 542-553 (2008) - [j3]Jiong Guo, Rolf Niedermeier, Johannes Uhlmann:
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. Inf. Process. Lett. 106(2): 81-86 (2008) - [c5]Nadja Betzler, Johannes Uhlmann:
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. COCOA 2008: 43-53 - [c4]Christian Komusiewicz, Johannes Uhlmann:
A Cubic-Vertex Kernel for Flip Consensus Tree. FSTTCS 2008: 280-291 - 2007
- [c3]Jiong Guo, Johannes Uhlmann:
Kernelization and Complexity Results for Connectivity Augmentation Problems. WADS 2007: 483-494 - 2006
- [j2]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. 3(3): 220-229 (2006) - [c2]Jiong Guo, Falk Hüffner
, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312 - 2004
- [j1]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electron. Notes Discret. Math. 17: 57-62 (2004) - [c1]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW 2004: 56-60
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint