Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs
DR Home
→
Computer Science and Engineering
→
Conference Papers
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs
Inamdar, Tanmay
;
Kanesh, Lawqueen
;
Krithika, R.
;
Mittal, Harshil
;
Saurabh, Saket
URI:
https://doi.org/10.1007/978-3-031-98740-3_28
https://repository.iitgn.ac.in/handle/123456789/11712
Date:
2025-07-21
Show full item record
Files in this item
Name:
Abstract.jpg
Size:
170.8Kb
Format:
JPEG image
Description:
Abstract
View/
Open
This item appears in the following Collection(s)
Conference Papers
[282]
Search Digital Repository
Search Digital Repository
This Collection
Browse
All of DSpace
Communities & Collections
Titles
Authors
By Advisor
By Issue Date
Subjects
By Type
By Degree
By Department
This Collection
Titles
Authors
By Advisor
By Issue Date
Subjects
By Type
By Degree
By Department
My Account
Login