Skip to content

Author

Tamer Kahveci

We have 1 of 226 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

MOSAIC: MOtif Set with mAximal InfluenCe on network.

The Closest $k$-Motif Set Selection problem is proved to be NP-hard and MOSAIC (MOtif Set with mAximal InfluenCe), a novel greedy algorithm to address this problem is developed and proves that MOSAIC is efficient with a low degree polynomial time complexity.

Murat Çalış, Volkan Altuntaş, Tamer Kahveci · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.