( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fair Matchings and Related Problems.

, , , и . FSTTCS, том 24 из LIPIcs, стр. 339-350. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)

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.

Dimitrios Michail

Michail Logvinov

Michail Jordanoff

Michail Krausnick

Michail Petrow

 

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

JGraphT - A Java Library for Graph Data Structures and Algorithms., , , и . ACM Trans. Math. Softw., 46 (2): 16:1-16:29 (2020)An experimental comparison of single-sided preference matching algorithms.. ACM J. Exp. Algorithmics, (2011)Wildfire monitoring using satellite images, ontologies and linked geospatial data., , , , , , , , , и . J. Web Semant., (2014)Detection of fake news campaigns using graph convolutional networks., , и . Int. J. Inf. Manag. Data Insights, 2 (2): 100104 (2022)Minimum cycle basis.. Saarland University, Germany, (2006)Benchmark Comparison of Methods for Approximate Neighborhood Estimation of Road Segments in Large-Scale Traffic Networks., , , и . PCI, стр. 295-300. ACM, (2020)Graph matching on social networks without any side information., , и . IEEE BigData, стр. 1060-1065. IEEE, (2019)Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem., , , и . STACS, том 2996 из Lecture Notes in Computer Science, стр. 222-233. Springer, (2004)Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem., , , и . ACM Trans. Algorithms, 3 (2): 15 (2007)Cycle bases in graphs characterization, algorithms, complexity, and applications., , , , , , и . Comput. Sci. Rev., 3 (4): 199-243 (2009)