EDBT 2026 Demo / reviewers in the wild / expert
Komal Muluk
dblp:266/2245
· DBLP profile ↗
4ranked-venue papers
0as first author
3since 2021 · last 2023
0009-0002-3915-7198ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Make a Graph Singly Connected by Edge Orientations
Tim A. Hartmann, Komal Muluk |
IWOCA | 2 |
| 2022 | On the complexity of singly connected vertex deletion
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh 0001 |
Theor. Comput. Sci. | 4 |
| 2021 | Parameterized complexity of fair feedback vertex set problem
Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh 0001 |
Theor. Comput. Sci. | 3 |
| 2020 | On the Complexity of Singly Connected Vertex Deletion
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh 0001 |
IWOCA | 4 |