( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of Min-Power Asymmetric Connectivity.

, , , , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2019)

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.

Holger Bentert

Matthias Meyer

Musterbasiertes Re-Engineering von Softwaresystemen. Uni Paderborn, (2009)

Matthias Hägele

Immunrekonstitution nach haploidenter hämatopoetischer Stammzelltransplantation: Einfluss eines CD3-CD19-depletierten gegenüber einem CD34-selektionierten Transplantat. Uni Tübingen, (2008)

Matthias Schmidt

Topographische Verteilung und Morphometrie von retinalen Mikrogliazellen. Uni Münster, (2009)

Matthias Möller

Antikaons in infinite nuclear matter and nuclei. TU Darmstadt, (2007)
 

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

Parameterized Complexity of Diameter., и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 50-61. Springer, (2019)Good Things Come to Those Who Swap Objects on Paths., , , и . CoRR, (2019)Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints., , , и . COMPLEX NETWORKS (2), том 882 из Studies in Computational Intelligence, стр. 494-506. Springer, (2019)Fair Short Paths in Vertex-Colored Graphs., , и . AAAI, стр. 12346-12354. AAAI Press, (2023)On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model., , и . IPEC, том 285 из LIPIcs, стр. 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Listing All Maximal k-Plexes in Temporal Graphs., , , , , и . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)An Adaptive Version of Brandes' Algorithm for Betweenness Centrality., , , , и . ISAAC, том 123 из LIPIcs, стр. 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient computation of optimal temporal walks under waiting-time constraints., , , и . Appl. Netw. Sci., 5 (1): 73 (2020)A multivariate complexity analysis of the material consumption scheduling problem., , , , и . J. Sched., 26 (4): 369-382 (августа 2023)Comparing Election Methods Where Each Voter Ranks Only Few Candidates., и . AAAI, стр. 2218-2225. AAAI Press, (2020)