( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of Community-Aware Network Sparsification.

, , , и . MFCS, том 306 из LIPIcs, стр. 60:1-60:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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.

Christian Komusiewicz

Christian Komusiewicz

Christian Komusiewicz

Christian Komusiewicz

Martin Komusiewicz

 

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

Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison., и . SOFSEM, том 11376 из Lecture Notes in Computer Science, стр. 272-284. Springer, (2019)H-Index Manipulation by Merging Articles: Models, Theory, and Experiments., , , , и . IJCAI, стр. 808-814. AAAI Press, (2015)Towards an Algorithmic Guide to Spiral Galaxies., , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 171-182. Springer, (2014)Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms., , и . IPEC, том 115 из LIPIcs, стр. 19:1-19:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems., и . ALENEX, стр. 12-26. SIAM, (2020)An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels., , , , и . Comput. Math. Methods Medicine, (2012)Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms., , и . Discret. Appl. Math., (2020)Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem., и . AAAI, стр. 846-852. AAAI Press, (2017)On the Complexity of Community-Aware Network Sparsification., , , и . MFCS, том 306 из LIPIcs, стр. 60:1-60:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Colored Cut Games., , , и . FSTTCS, том 182 из LIPIcs, стр. 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)