Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Twins in Subdivision Drawings of Hypergraphs.

R. van Bevern, I. Kanj, C. Komusiewicz, R. Niedermeier, and M. Sorge. Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 67-80. Springer, (2016)

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.

Univ. -Prof. Dr. -Ing. Uwe Sörgel University of Stuttgart

Manuel Mauch University of Stuttgart

Dr. Manuel Keßler University of Stuttgart

Manuel Ilg University of Stuttgart

Dr. -Ing. Manuel Hirsch University of Stuttgart

Other publications of authors with the same name

The Minimum Feasible Tileset Problem.Y. Disser, S. Kratsch, and M. Sorge. Algorithmica, 81 (3): 1126-1151 (2019)The complexity of routing with collision avoidance.T. Fluschnik, M. Morik, and M. Sorge. J. Comput. Syst. Sci., (2019)On Kernelization and Approximation for the Vector Connectivity Problem.S. Kratsch, and M. Sorge. CoRR, (2014)A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.V. Froese, R. van Bevern, R. Niedermeier, and M. Sorge. MFCS, volume 8087 of Lecture Notes in Computer Science, page 445-456. Springer, (2013)Assessing the Computational Complexity of Multi-layer Subgraph Detection.R. Bredereck, C. Komusiewicz, S. Kratsch, H. Molter, R. Niedermeier, and M. Sorge. CIAC, volume 10236 of Lecture Notes in Computer Science, page 128-139. (2017)On the Parameterized Complexity of Computing Graph Bisections.R. van Bevern, A. Feldmann, M. Sorge, and O. Suchý. WG, volume 8165 of Lecture Notes in Computer Science, page 76-87. Springer, (2013)Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors.L. Bulteau, N. Grüttemeier, C. Komusiewicz, and M. Sorge. CoRR, (2018)Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.I. Kanj, C. Komusiewicz, M. Sorge, and E. van Leeuwen. CoRR, (2017)A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs.M. Sorge. CoRR, (2013)Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.J. Chen, C. Komusiewicz, R. Niedermeier, M. Sorge, O. Suchý, and M. Weller. ISAAC, volume 8283 of Lecture Notes in Computer Science, page 361-371. Springer, (2013)