( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding the Most Relevant Fragments in Networks.

, , , , , , , , и . J. Graph Algorithms Appl., 14 (2): 307-336 (2010)

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.

Lothar Rotermund

Johannes Roter

Inge Rotermund

Manfred Rötel

Franz Rotering

 

Другие публикации лиц с тем же именем

Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings, , и . CoRR, (2013)Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques.. MACIS, том 9582 из Lecture Notes in Computer Science, стр. 50-59. Springer, (2015)Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane., , и . ICALP, том 267 из Lecture Notes in Computer Science, стр. 364-375. Springer, (1987)Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results.. CoRR, (2019)On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays.. Aegean Workshop on Computing, том 227 из Lecture Notes in Computer Science, стр. 70-83. Springer, (1986)Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension., , , и . SODA, стр. 836-843. SIAM, (2008)Every Polygon Can Be Untangled., , и . EuroCG, стр. 62-65. (2000)Common Developments of Several Different Orthogonal Boxes., , , , , и . CCCG, (2011)Approximate Minimum-Weight Matching with Outliers Under Translation., , , , , , и . ISAAC, том 123 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Proper n-Cell Polycubes in n - 3 Dimensions., , , и . COCOON, том 6842 из Lecture Notes in Computer Science, стр. 180-191. Springer, (2011)