PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Uhlmann, Johannes"

Author of the publication

copydeleteadd this publication to your clipboard
Graph-based data clustering with overlaps.

, , , , and . Discrete Optimization, 8 (1): 2-17 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Johannes Knittel University of Stuttgart

Univ. -Prof. Dr. Johannes Steidle University of Stuttgart

Johannes Oswald University of Stuttgart

Dr. -Ing. Johannes Engels University of Stuttgart

Johannes Schorr University of Stuttgart

 

Other publications of authors with the same name

On making directed graphs transitive., , , and . J. Comput. Syst. Sci., 78 (2): 559-574 (2012)Kernelization and complexity results for connectivity augmentation problems., and . Networks, 56 (2): 131-142 (2010)On the Computation of Fully Proportional Representation., , and . J. Artif. Intell. Res., (2013)On Making a Distinguished Vertex Minimum Degree by Vertex Deletion., , , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 123-134. Springer, (2011)A Cubic-Vertex Kernel for Flip Consensus Tree., and . FSTTCS, volume 2 of LIPIcs, page 280-291. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2008)Editing Graphs into Disjoint Unions of Dense Clusters., , , and . Algorithmica, 61 (4): 949-970 (2011)Two-Layer Planarization parameterized by feedback edge set., and . Theor. Comput. Sci., (2013)Multivariate Algorithmics in Biological Data Analysis.. Berlin Institute of Technology, (2011)Graph-based data clustering with overlaps., , , , and . Discrete Optimization, 8 (1): 2-17 (2011)On Making Directed Graphs Transitive., , , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 542-553. Springer, (2009)