The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Johannes Uhlmann" ( http://dblp.L3S.de/Authors/Johannes_Uhlmann )

URL (Homepage):  http://theinf1.informatik.uni-jena.de/~uhlmann/  Author page on DBLP  Author page in RDF  Community of Johannes Uhlmann in ASPL-2

Publication years (Num. hits)
2004-2009 (15) 2010-2012 (18) 2013-2014 (6)
Publication types (Num. hits)
article(20) inproceedings(18) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 40 publication records. Showing 39 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann A Cubic-Vertex Kernel for Flip Consensus Tree. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Arkadii Slinko, Johannes Uhlmann On the Computation of Fully Proportional Representation. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Johannes Uhlmann, Mathias Weller Two-Layer Planarization parameterized by feedback edge set. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Arkadii Slinko, Johannes Uhlmann On the Computation of Fully Proportional Representation. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller On tractable cases of Target Set Selection. Search on Bibsonomy Social Netw. Analys. Mining The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann On making directed graphs transitive. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann On Bounded-Degree Vertex Deletion parameterized by treewidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann Cluster editing with locally bounded modifications. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann Partitioning into Colorful Components by Minimum Edge Deletions. Search on Bibsonomy CPM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Search on Bibsonomy Algorithms for Molecular Biology The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann Editing Graphs into Disjoint Unions of Dense Clusters. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann Graph-based data clustering with overlaps. Search on Bibsonomy Discrete Optimization The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. Search on Bibsonomy TAPAS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann Alternative Parameterizations for Cluster Editing. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Johannes Uhlmann Multivariate Algorithmics in Biological Data Analysis. Search on Bibsonomy 2011   RDF
1Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Johannes Uhlmann Kernelization and complexity results for connectivity augmentation problems. Search on Bibsonomy Networks The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller On Tractable Cases of Target Set Selection. Search on Bibsonomy ISAAC (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu 0001 Extended Islands of Tractability for Parsimony Haplotyping. Search on Bibsonomy CPM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Johannes Uhlmann, Mathias Weller Two-Layer Planarization Parameterized by Feedback Edge Set. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann Exact Algorithms and Experiments for Hierarchical Tree Clustering. Search on Bibsonomy AAAI The full citation details ... 2010 DBLP  BibTeX  RDF
1Nadja Betzler, Johannes Uhlmann Parameterized complexity of candidate control in elections and related digraph problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann Editing Graphs into Disjoint Unions of Dense Clusters. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann Deconstructing Intractability: A Case Study for Interval Constrained Coloring. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann On Making Directed Graphs Transitive. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann Graph-Based Data Clustering with Overlaps. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Rolf Niedermeier, Johannes Uhlmann Two fixed-parameter algorithms for Vertex Covering by Paths on Trees. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Johannes Uhlmann Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann A Cubic-Vertex Kernel for Flip Consensus Tree. Search on Bibsonomy FSTTCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Johannes Uhlmann Kernelization and Complexity Results for Connectivity Augmentation Problems. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann Tree decompositions of graphs: Saving memory in dynamic programming. Search on Bibsonomy Discrete Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann Complexity and Exact Algorithms for Multicut. Search on Bibsonomy SOFSEM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Search on Bibsonomy CTW The full citation details ... 2004 DBLP  BibTeX  RDF
Displaying result #1 - #39 of 39 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license