Cita APA (7a ed.)

Dey, P., Dhar, A., Hota, A., Kolay, S., & Mitra, A. (2026). Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices.

Cita Chicago Style (17a ed.)

Dey, Palash, Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay, y Aritra Mitra. Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices. 2026.

Cita MLA (9a ed.)

Dey, Palash, et al. Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices. 2026.