Keyword

modular-width

Description: A graph parameter based on the number of distinct neighborhoods among vertices, used in parameterized algorithms and complexity analysis.
OpenAlex ID: keywords/modular-width
1982 · Larry J. Stockmeyer, Vijay V. Vazirani · Information Processing Letters · 261
1973 · Nicholas D. Roussopoulos · Information Processing Letters · 196
· Michael Lampis, Sebastian Ordyniak · 101
2013 · Jakub Gajarský, Michael Lampis, et al. · Lecture notes in computer science · 90
2019 · David Coudert, Guillaume Ducoffe, et al. · ACM Transactions on Algorithms · 77
2008 · Michaël Rao · Discrete Mathematics · 61
2017 · Rémy Belmonte, Fedor V. Fomin, et al. · SIAM Journal on Discrete Mathematics · 49
2022 · Leon Kellerhals, Tomohiro Koana · Journal of Graph Algorithms and Applications · 39
2017 · Fedor V. Fomin, Mathieu Liedloff, et al. · Algorithmica · 32
2018 · Kratsch, Stefan, Nelles, Florian · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 31
2022 · Rémy Belmonte, Eun Jung Kim, et al. · SIAM Journal on Discrete Mathematics · 28
2022 · Pavel Dvořák, Dušan Knop, et al. · SIAM Journal on Discrete Mathematics · 28
2018 · David Coudert, Guillaume Ducoffe, et al. · Society for Industrial and Applied Mathematics eBooks · 26
2022 · Yasuaki Kobayashi, Yota Otachi · Algorithmica · 25
2017 · Faisal N. Abu-Khzam, Shouwei Li, et al. · Lecture notes in computer science · 18
2015 · Rémy Belmonte, Fedor V. Fomin, et al. · Lecture notes in computer science · 18
2020 · Gennaro Cordasco, Luisa Gargano, et al. · Lecture notes in computer science · 17
2018 · Knop, Dušan, Masařík, Tomáš, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 17
2020 · Belmonte, Rémy, Kim, Eun Jung, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 16
2019 · Rémy Belmonte, Tesshu Hanaka, et al. · Algorithmica · 16
2014 · Fedor V. Fomin, Mathieu Liedloff, et al. · Lecture notes in computer science · 16
2024 · Hanaka, Tesshu, Lampis, Michael, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 13
2023 · Sahab Hajebi, Ramin Javadi · Theoretical Computer Science · 13
2023 · Stefan Kratsch, Florian Nelles · Discrete Applied Mathematics · 11
2021 · Martin Kučera, Ondřej Suchý · Algorithmica · 11
Works count: 98
Citation count: 1,394
Year
Topic
Type