Further parameterized algorithms for the F -free edge deletion problem

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 933; s. 125 - 137
Hlavní autoři: Gaikwad, Ajinkya, Maity, Soumen
Médium: Journal Article
Jazyk:angličtina
Vydáno: 14.10.2022
ISSN:0304-3975
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Author Maity, Soumen
Gaikwad, Ajinkya
Author_xml – sequence: 1
  givenname: Ajinkya
  surname: Gaikwad
  fullname: Gaikwad, Ajinkya
– sequence: 2
  givenname: Soumen
  surname: Maity
  fullname: Maity, Soumen
BookMark eNp9j71OwzAUhT0UibbwAGx-gQQ7ieObEVUEkCqxwGz557pNlD_ZZoCnJxVMDNzlLPc7Ot-ObKZ5QkLuOMs54_V9nycb84IVRc4gZ4XYkC0rWZWVjRTXZBdjz9YTst6Stv0I6YyBLjroEROG7gsd1cNpDl06j5H6OdD1g7Y08wGRojshdThg6uaJLmE2A4435MrrIeLtb-7Je_v4dnjOjq9PL4eHY2Z5zVLWaMNLCbWtCleBMQCu4ZUDKzQIQCl9VYDn0nJTWTAohGyMrksLzApwvtwT_tNrwxxjQK-W0I06fCrO1EVe9WqVVxd5xUCt8isj_zC2S_qyPgXdDf-Q3_zfZPg
CitedBy_id crossref_primary_10_1016_j_jcss_2025_103635
Cites_doi 10.1287/moor.12.3.415
10.1145/185675.306789
10.1016/0166-218X(83)90101-4
10.1007/s00453-020-00700-y
10.1016/0095-8956(84)90013-3
10.1016/S0166-218X(00)00391-7
10.1007/s00453-017-0311-7
10.1006/jcss.2001.1774
10.1287/moor.8.4.538
10.1007/s00453-013-9837-5
10.1136/vr.153.2.43
10.1136/vr.149.24.729
10.1016/0020-0190(96)00050-6
10.1016/S0166-218X(98)00035-3
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1016/j.tcs.2022.08.025
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EndPage 137
ExternalDocumentID 10_1016_j_tcs_2022_08_025
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
7-5
71M
8P~
9DU
9JN
AABNK
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
AAYXX
ABAOU
ABBOA
ABDPE
ABEFU
ABFNM
ABJNI
ABMAC
ABWVN
ABXDB
ACDAQ
ACGFS
ACLOT
ACNNM
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADMUD
ADNMO
ADVLN
AEBSH
AEIPS
AEKER
AENEX
AEUPX
AEXQZ
AFJKZ
AFPUW
AFTJW
AGHFR
AGQPQ
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIGII
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
APXCP
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CITATION
CS3
DU5
EBS
EFJIC
EFKBS
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
YNT
ZMT
ZY4
~G-
~HD
ID FETCH-LOGICAL-c160t-9ab13786c42d48bb88d914d8c5a858e77f428f17c1b4c8be5579ba63c80c58df3
ISSN 0304-3975
IngestDate Thu Nov 27 01:03:30 EST 2025
Tue Nov 18 21:51:59 EST 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c160t-9ab13786c42d48bb88d914d8c5a858e77f428f17c1b4c8be5579ba63c80c58df3
PageCount 13
ParticipantIDs crossref_primary_10_1016_j_tcs_2022_08_025
crossref_citationtrail_10_1016_j_tcs_2022_08_025
PublicationCentury 2000
PublicationDate 2022-10-14
PublicationDateYYYYMMDD 2022-10-14
PublicationDate_xml – month: 10
  year: 2022
  text: 2022-10-14
  day: 14
PublicationDecade 2020
PublicationTitle Theoretical computer science
PublicationYear 2022
References Watanabe (10.1016/j.tcs.2022.08.025_br0220) 1983; 6
Fellows (10.1016/j.tcs.2022.08.025_br0060) 2008
Kannan (10.1016/j.tcs.2022.08.025_br0130) 1987; 12
Lund (10.1016/j.tcs.2022.08.025_br0170) 1994; 41
Ghosh (10.1016/j.tcs.2022.08.025_br0090) 2015; 71
Cygan (10.1016/j.tcs.2022.08.025_br0030) 2015
Enright (10.1016/j.tcs.2022.08.025_br0050) 2018; 80
Gaikwad (10.1016/j.tcs.2022.08.025_br0080)
Natanzon (10.1016/j.tcs.2022.08.025_br0190) 2001; 113
Robertson (10.1016/j.tcs.2022.08.025_br0200) 1984; 36
Lovász (10.1016/j.tcs.2022.08.025_br0160) 1993
Downey (10.1016/j.tcs.2022.08.025_br0040) 2012
Fujito (10.1016/j.tcs.2022.08.025_br0070) 1998; 86
Impagliazzo (10.1016/j.tcs.2022.08.025_br0120) 2001; 63
Lenstra (10.1016/j.tcs.2022.08.025_br0150) 1983; 8
Belmonte (10.1016/j.tcs.2022.08.025_br0010) 2020; 82
Gibbens (10.1016/j.tcs.2022.08.025_br0100) 2001; 149
Mansley (10.1016/j.tcs.2022.08.025_br0180) 2003; 153
Cai (10.1016/j.tcs.2022.08.025_br0020) 1996; 58
Szeider (10.1016/j.tcs.2022.08.025_br0210)
Guo (10.1016/j.tcs.2022.08.025_br0110) 2007
Kerr (10.1016/j.tcs.2022.08.025_br0140) 2011; 2011
Yannakakis (10.1016/j.tcs.2022.08.025_br0230) 1978
References_xml – volume: 2011
  year: 2011
  ident: 10.1016/j.tcs.2022.08.025_br0140
  article-title: Networks and the epidemiology of infectious disease
  publication-title: Interdiscip. Perspect. Infect. Dis.
– start-page: 253
  year: 1978
  ident: 10.1016/j.tcs.2022.08.025_br0230
  article-title: Node- and edge-deletion np-complete problems
– volume: 12
  start-page: 415
  issue: 3
  year: 1987
  ident: 10.1016/j.tcs.2022.08.025_br0130
  article-title: Minkowski's convex body theorem and integer programming
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.12.3.415
– volume: 41
  start-page: 960
  issue: 5
  year: 1994
  ident: 10.1016/j.tcs.2022.08.025_br0170
  article-title: On the hardness of approximating minimization problems
  publication-title: J. ACM
  doi: 10.1145/185675.306789
– volume: 6
  start-page: 63
  issue: 1
  year: 1983
  ident: 10.1016/j.tcs.2022.08.025_br0220
  article-title: On the np-hardness of edge-deletion and -contraction problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(83)90101-4
– volume: 82
  start-page: 2586
  issue: 9
  year: 2020
  ident: 10.1016/j.tcs.2022.08.025_br0010
  article-title: Independent set reconfiguration parameterized by modular-width
  publication-title: Algorithmica
  doi: 10.1007/s00453-020-00700-y
– start-page: 294
  year: 2008
  ident: 10.1016/j.tcs.2022.08.025_br0060
  article-title: Graph layout problems parameterized by vertex cover
– volume: 36
  start-page: 49
  issue: 1
  year: 1984
  ident: 10.1016/j.tcs.2022.08.025_br0200
  article-title: Graph minors. III. Planar tree-width
  publication-title: J. Comb. Theory, Ser. B
  doi: 10.1016/0095-8956(84)90013-3
– year: 2012
  ident: 10.1016/j.tcs.2022.08.025_br0040
– volume: 113
  start-page: 109
  issue: 1
  year: 2001
  ident: 10.1016/j.tcs.2022.08.025_br0190
  article-title: Complexity classification of some edge modification problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(00)00391-7
– volume: 80
  start-page: 1857
  issue: 6
  year: 2018
  ident: 10.1016/j.tcs.2022.08.025_br0050
  article-title: Deleting edges to restrict the size of an epidemic: a new application for treewidth
  publication-title: Algorithmica
  doi: 10.1007/s00453-017-0311-7
– volume: 63
  start-page: 512
  issue: 4
  year: 2001
  ident: 10.1016/j.tcs.2022.08.025_br0120
  article-title: Which problems have strongly exponential complexity?
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.2001.1774
– volume: 8
  start-page: 538
  issue: 4
  year: 1983
  ident: 10.1016/j.tcs.2022.08.025_br0150
  article-title: Integer programming with a fixed number of variables
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.4.538
– year: 2015
  ident: 10.1016/j.tcs.2022.08.025_br0030
– volume: 71
  start-page: 989
  issue: 4
  year: 2015
  ident: 10.1016/j.tcs.2022.08.025_br0090
  article-title: Faster parameterized algorithms for deletion to split graphs
  publication-title: Algorithmica
  doi: 10.1007/s00453-013-9837-5
– volume: 153
  start-page: 43
  issue: 2
  year: 2003
  ident: 10.1016/j.tcs.2022.08.025_br0180
  article-title: Early dissemination of foot-and-mouth disease virus through sheep marketing in February 2001
  publication-title: Vet. Rec.
  doi: 10.1136/vr.153.2.43
– start-page: 915
  year: 2007
  ident: 10.1016/j.tcs.2022.08.025_br0110
  article-title: Problem kernels for np-complete edge deletion problems: split and related graphs
– ident: 10.1016/j.tcs.2022.08.025_br0210
– ident: 10.1016/j.tcs.2022.08.025_br0080
– year: 1993
  ident: 10.1016/j.tcs.2022.08.025_br0160
– volume: 149
  start-page: 729
  issue: 24
  year: 2001
  ident: 10.1016/j.tcs.2022.08.025_br0100
  article-title: Descriptive epidemiology of the 2001 foot-and-mouth disease epidemic in Great Britain: the first five months
  publication-title: Vet. Rec.
  doi: 10.1136/vr.149.24.729
– volume: 58
  start-page: 171
  issue: 4
  year: 1996
  ident: 10.1016/j.tcs.2022.08.025_br0020
  article-title: Fixed-parameter tractability of graph modification problems for hereditary properties
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(96)00050-6
– volume: 86
  start-page: 213
  issue: 2
  year: 1998
  ident: 10.1016/j.tcs.2022.08.025_br0070
  article-title: A unified approximation algorithm for node-deletion problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(98)00035-3
SSID ssj0000576
Score 2.386663
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 125
Title Further parameterized algorithms for the F -free edge deletion problem
Volume 933
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection - Elsevier
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 20211209
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0000576
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZgywEOBQqI8pIPnFgFJbG9to-rqhEgWiGxSHuL_Cy7Ldkqmz7or68dO9lQVIkeuESRZVtJPms8E898HwDvXdSj01SiBJssTzCXaSLbQmCdC0y5MUS3JK5f6eEhm8_5t6i2uW7lBGhVsctLfvpfoXZtDmxfOnsHuPtJXYO7d6C7q4PdXf8J-OKs9k7d2JN6__LJLosr51SKk6NVvWh-Bv6F1t0sxomtjSdvPfLFU56Fe9UmbHmFmaHTOhsUO6qoAjGOW2efvyMWxxdhuUyXLr793Zv7AxGFB76vnB2shr8ZXITqszbwwBohf4TCg8xJZzo5QgPjl4US5riPZoHM5S8THf4WLD82yrOl53nLoNqNHNJh39im-uTBLi9tWbopSj9F6ZU0c3IfbOWUcDYCW9PP-_Mvmx2Z0HBmHV-hO91u8_xuPMfAPxk4GrMnYDtGCHAakH0K7plqBzzu1DdgNMY74NFBz7i7fgaKCDv8A3a4gR062KHrAQvYwg497LCDHUbYn4Mfxf5s71MSNTISlU3SJuFCug_NJgrnGjMpGdM8w5opIhhhhlLr4kubUZVJrJg0hFAuxQQplirCtEUvwKhaVeYlgEobaylC2HKLKeKCMcmENp4xSFtMdkHafZlSRQJ5r2NyUt6KyC740A85Dewpt3d-dZfOr8HDzSp9A0ZNfWbeggfqvFms63dxAVwDNsdpAw
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Further+parameterized+algorithms+for+the+F+-free+edge+deletion+problem&rft.jtitle=Theoretical+computer+science&rft.au=Gaikwad%2C+Ajinkya&rft.au=Maity%2C+Soumen&rft.date=2022-10-14&rft.issn=0304-3975&rft.volume=933&rft.spage=125&rft.epage=137&rft_id=info:doi/10.1016%2Fj.tcs.2022.08.025&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2022_08_025
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon