( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
When Can Graph Hyperbolicity be Computed in Linear Time?

, , , , , и . Algorithmica, 81 (5): 2016-2045 (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.

Christian Komusiewicz

Christian Komusiewicz

Christian Komusiewicz

Christian Komusiewicz

Martin Komusiewicz

 

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

H-Index Manipulation by Merging Articles: Models, Theory, and Experiments., , , , и . IJCAI, стр. 808-814. AAAI Press, (2015)Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison., и . SOFSEM, том 11376 из Lecture Notes in Computer Science, стр. 272-284. Springer, (2019)Towards an Algorithmic Guide to Spiral Galaxies., , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 171-182. Springer, (2014)Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis., и . J. Artif. Intell. Res., (2022)Computing Dense and Sparse Subgraphs of Weakly Closed Graphs., , и . Algorithmica, 85 (7): 2156-2187 (июля 2023)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., , и . 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)Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs., , , и . CoRR, (2022)On the Complexity of Community-aware Network Sparsification., , , и . CoRR, (2024)