A survey of parameterized algorithms and the complexity of edge modification

The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, w...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer science review Ročník 48; s. 100556
Hlavní autoři: Crespelle, Christophe, Drange, Pål Grønås, Fomin, Fedor V., Golovach, Petr
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.05.2023
Témata:
Algorithms
Edge modification
Graph modification
Parameterized graph algorithms
Edge modification
Algorithms
Graph modification
Parameterized graph algorithms
ISSN:1574-0137, 1876-7745
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!
Abstract The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, where the task is to change some adjacencies in a graph to satisfy some required properties. To facilitate further research, we list many open problems in the area.
AbstractList The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, where the task is to change some adjacencies in a graph to satisfy some required properties. To facilitate further research, we list many open problems in the area.
ArticleNumber 100556
Author Golovach, Petr
Crespelle, Christophe
Fomin, Fedor V.
Drange, Pål Grønås
Author_xml – sequence: 1
  givenname: Christophe
  surname: Crespelle
  fullname: Crespelle, Christophe
  email: christophe.crespelle@univ-cotedazur.fr
  organization: Université Côte d’Azur, France
– sequence: 2
  givenname: Pål Grønås
  orcidid: 0000-0001-7228-6640
  surname: Drange
  fullname: Drange, Pål Grønås
  email: Pal.Drange@uib.no
  organization: University of Bergen, Norway
– sequence: 3
  givenname: Fedor V.
  surname: Fomin
  fullname: Fomin, Fedor V.
  email: Fedor.Fomin@uib.no
  organization: University of Bergen, Norway
– sequence: 4
  givenname: Petr
  orcidid: 0000-0002-2619-2990
  surname: Golovach
  fullname: Golovach, Petr
  email: Petr.Golovach@uib.no
  organization: University of Bergen, Norway
BookMark eNqFkM1OwzAQhC1UJErhDTj4BVJsx4kTDkhVxZ9UiQucra29aV0lcWWbivL0pC0nDnDa1WpmtPNdklHveyTkhrMpZ7y83UyNjwF3U8FEPpxYUZRnZMwrVWZKyWI07IWSGeO5uiCXMW4YU4OqHJPFjMaPsMM99Q3dQoAOEwb3hZZCu_LBpXUXKfSWpjVS47tti58uHeVoV0g7b13jDCTn-yty3kAb8fpnTsj748Pb_DlbvD69zGeLzOSFSBmoZcWkMgoE1GDrBoDndSllJSyXQoKsRQPGGAm8Gr4Ezg0uhVSyXMoSbD4h8pRrgo9D8UZvg-sg7DVn-kBEb_SJiD4Q0Scig-3ul824dHw8BXDtf-b7kxmHYjuHQUfjsDdoXUCTtPXu74Bv44aCKg
CitedBy_id crossref_primary_10_1016_j_disc_2025_114699
crossref_primary_10_1016_j_jcss_2025_103635
crossref_primary_10_1016_j_ic_2024_105211
crossref_primary_10_1137_23M1609373
crossref_primary_10_1016_j_tcs_2025_115483
crossref_primary_10_1080_02533839_2025_2509597
crossref_primary_10_1016_j_ipl_2024_106530
crossref_primary_10_3390_a17020069
Cites_doi 10.1016/j.ipl.2013.12.001
10.1016/j.ic.2012.10.016
10.1109/TCBB.2013.177
10.1007/s00453-015-0014-x
10.1016/j.ipl.2020.106082
10.1016/0304-3975(91)90159-Y
10.1007/s00224-010-9270-y
10.1016/j.dam.2013.01.016
10.1007/s00453-021-00891-y
10.1016/0020-0190(96)00050-6
10.1137/17M1129428
10.1016/j.jctb.2004.08.001
10.1016/j.tcs.2005.10.007
10.1007/s00453-022-00940-0
10.1016/j.jctb.2005.03.003
10.1145/2566616
10.1016/j.tcs.2008.10.021
10.1016/S0304-3975(01)00007-X
10.1016/j.jda.2017.07.003
10.1016/j.socnet.2013.05.001
10.1007/s00453-015-0046-2
10.1007/s00453-019-00617-1
10.1016/j.tcs.2019.09.011
10.1145/2071379.2071386
10.1016/j.ipl.2011.05.003
10.1016/S0166-218X(00)00221-3
10.1007/s00453-022-00969-1
10.1007/s00453-016-0235-7
10.1145/3381426
10.1007/s00453-016-0127-x
10.1016/S0166-218X(02)00242-1
10.1016/j.jda.2012.04.005
10.1016/j.dam.2019.12.010
10.1016/j.tcs.2009.05.006
10.3233/COM-180220
10.1016/j.comgeo.2014.11.001
10.1137/130935756
10.1016/j.jcss.2017.05.016
10.1007/s00224-019-09938-8
10.1016/j.tcs.2015.07.004
10.1006/jctb.1995.1006
10.1017/S1446181100013894
10.1137/110834810
10.1137/050643350
10.1016/j.jcss.2011.02.001
10.1145/1412228.1412236
10.1109/TCBB.2006.26
10.1137/18M1176087
10.1145/504794.504798
10.1007/s00453-005-1180-z
10.1016/j.dam.2008.01.007
10.1137/140961808
10.1145/3284356
10.1007/BF02523685
10.1016/j.jcss.2016.03.009
10.1016/j.jcss.2021.12.002
10.1007/s00454-017-9867-x
10.1016/j.jcss.2014.04.015
10.1016/j.tcs.2015.04.034
10.1145/3196834
10.1016/j.jcss.2018.10.001
10.1137/16M1055797
10.1016/j.jda.2008.09.005
10.1142/S1793830912500085
10.1137/17M1146233
10.1016/j.dam.2010.07.002
10.1137/18M1228839
10.1007/s00453-020-00746-y
10.1016/j.ic.2014.12.017
10.1007/s00453-016-0139-6
10.1137/S0097539796303044
10.1016/j.jcss.2011.04.001
10.1016/j.disopt.2013.02.001
10.1016/j.jcss.2018.03.001
10.1016/j.tcs.2016.02.004
10.1016/j.tcs.2011.11.040
10.1007/s00453-020-00684-9
10.1016/j.ic.2017.01.008
10.1007/s00453-019-00609-1
10.1007/s00453-012-9661-3
10.1137/090767285
10.1016/j.ic.2020.104514
10.1016/j.jcss.2009.09.002
10.1145/1411509.1411511
10.1016/0012-365X(94)90084-1
10.1016/j.jda.2012.04.007
10.1016/0378-8733(83)90028-X
10.1007/s00453-008-9233-8
10.1145/2973749
10.1145/2700209
10.1007/s00453-014-9872-x
10.1137/S0097539792225297
10.4153/CJM-1956-045-5
10.1137/0205044
10.1007/s00453-021-00798-8
10.1007/s00453-012-9667-x
10.1007/s00453-017-0319-z
10.1016/0022-0000(80)90060-4
10.1007/s00453-014-9886-4
10.1145/2500119
10.1016/0167-6377(92)90007-P
10.1016/j.jcss.2010.10.001
10.1137/130907392
10.1016/j.comgeo.2014.01.001
10.1137/140988565
10.1016/j.ipl.2011.11.014
10.1137/16M1088740
10.1016/j.dam.2011.12.024
10.1137/S0097539798336073
10.1137/100787507
10.1016/S0021-9800(70)80019-9
10.1016/j.jcss.2006.02.001
10.1007/s00453-018-0494-6
10.1137/17M112035X
10.1007/s00453-022-01004-z
10.1007/s00453-011-9595-1
10.1016/S0166-218X(02)00218-4
10.1137/110855247
10.1016/j.tcs.2016.02.020
10.1137/0210021
10.1109/TST.2014.6867519
10.1016/j.ipl.2011.10.007
10.1007/s00453-017-0340-2
10.1145/2629595
10.1016/j.dam.2006.03.031
10.1007/s10107-014-0854-1
10.1016/j.dam.2012.05.019
10.1007/s00453-017-0401-6
10.1016/j.ic.2013.08.006
10.1137/0602010
10.1137/11085390X
10.1145/3186896
10.1007/s10951-011-0241-1
10.1007/s00453-013-9837-5
10.1007/s00224-016-9746-5
10.1016/0012-365X(95)00324-P
10.1016/j.comgeo.2008.04.001
10.1007/s00453-012-9663-1
10.1016/j.jcss.2016.03.003
10.1016/j.ic.2021.104708
10.7155/jgaa.00337
10.1007/s00224-009-9215-5
10.1016/j.ipl.2013.09.004
10.1016/j.ipl.2009.04.023
10.1007/BF02579333
10.1016/j.jda.2011.03.004
10.1007/s00453-016-0215-y
10.1137/0405003
10.1109/TST.2014.6867517
10.1016/j.orl.2003.10.009
10.1002/net.20081
10.1145/3519935.3520018
10.1145/2700210
10.1016/j.tcs.2012.12.041
10.1137/140988553
10.1137/070710913
10.1016/0166-218X(95)00061-U
10.1016/j.tcs.2017.03.019
10.1006/jcss.2001.1774
10.1016/j.jcss.2021.09.003
10.1006/jagm.2001.1195
10.1137/S0097539799359683
10.1145/2635810
10.1137/120904202
10.1016/j.ipl.2021.106095
10.1090/S0894-0347-1988-0928904-4
10.1145/1101821.1101823
10.1016/j.jda.2009.08.001
10.1016/j.ic.2017.07.007
10.1007/PL00009191
10.1016/j.tcs.2016.12.007
10.1007/s00453-014-9937-x
10.1002/net.21832
10.7155/jgaa.00462
10.1016/0022-0000(87)90038-9
10.1016/j.disopt.2010.09.006
10.1016/j.dam.2004.01.007
10.1016/j.ic.2017.04.013
10.1007/s00453-021-00820-z
10.1007/s00453-010-9421-1
10.1145/3201775
10.1016/j.jcss.2017.01.003
10.1016/j.tcs.2015.01.056
10.1016/j.jcss.2009.04.001
10.1016/j.tcs.2012.03.013
10.1016/0012-365X(94)90277-1
10.1002/jgt.3190010115
10.1016/j.endm.2009.02.008
10.1016/j.tcs.2015.01.049
10.1016/j.tcs.2021.08.015
10.1002/net.3230190112
10.1007/s00224-004-1178-y
10.1016/S0166-218X(96)00133-3
10.1016/j.jctb.2004.01.004
10.1016/j.ipl.2010.04.022
10.1016/j.jcss.2020.05.008
10.1137/12086217X
10.1002/jgt.3190100306
10.1007/s00224-016-9689-x
10.1016/j.jcss.2021.03.001
10.1007/s10878-014-9733-1
10.1006/jctb.1994.1007
10.1016/j.disopt.2010.09.009
10.7155/jgaa.00106
10.1016/j.jcss.2016.11.009
10.1016/S0166-218X(00)00391-7
10.1007/s00453-018-0408-7
10.1145/2799640
10.1016/S0378-8733(99)00019-2
10.1016/j.jcss.2015.10.003
10.1007/s00453-012-9619-5
10.1016/S1571-0661(04)81014-4
10.1016/j.jcss.2019.05.004
ContentType Journal Article
Copyright 2023 The Authors
Copyright_xml – notice: 2023 The Authors
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.cosrev.2023.100556
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1876-7745
ExternalDocumentID 10_1016_j_cosrev_2023_100556
S1574013723000230
GrantInformation_xml – fundername: Horizon 2020
  grantid: 749022
  funderid: http://dx.doi.org/10.13039/501100007601
– fundername: Research Council of Norway
  grantid: 314528
  funderid: http://dx.doi.org/10.13039/501100005416
GroupedDBID --K
--M
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
6I.
6J9
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AARIN
AAXUO
AAYFN
ABBOA
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEFWE
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
AXJTR
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FIRID
FNPLU
FYGXN
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
Q38
RIG
ROL
RPZ
SDF
SDG
SES
SPC
SPCBC
SSB
SSD
SSV
SSZ
T5K
UNMZH
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c352t-a7b8047c7a2a9ad9faa13964482d1424a492faccc4a18056a11ceb24746b46ad3
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000989429500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1574-0137
IngestDate Tue Nov 18 20:40:39 EST 2025
Sat Nov 29 07:04:08 EST 2025
Fri Feb 23 02:40:01 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Keywords Edge modification
Algorithms
Graph modification
Parameterized graph algorithms
Language English
License This is an open access article under the CC BY license.
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c352t-a7b8047c7a2a9ad9faa13964482d1424a492faccc4a18056a11ceb24746b46ad3
ORCID 0000-0001-7228-6640
0000-0002-2619-2990
OpenAccessLink https://dx.doi.org/10.1016/j.cosrev.2023.100556
ParticipantIDs crossref_primary_10_1016_j_cosrev_2023_100556
crossref_citationtrail_10_1016_j_cosrev_2023_100556
elsevier_sciencedirect_doi_10_1016_j_cosrev_2023_100556
PublicationCentury 2000
PublicationDate May 2023
2023-05-00
PublicationDateYYYYMMDD 2023-05-01
PublicationDate_xml – month: 05
  year: 2023
  text: May 2023
PublicationDecade 2020
PublicationTitle Computer science review
PublicationYear 2023
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Haarberg (b239) 2019
Crowston, Gutin, Jones, Yeo (b252) 2012; 112
Hartung, Nichterlein (b264) 2015; 29
Ray, Deogun (b192) 1994; 16
Kratsch, Kloks, Müller (b200) 1997; 77
Pilz (b285) 2014; 47
Cai, Sun (b202) 1989; 19
Chen, Molter, Sorge, Suchý (b221) 2018; vol. 123
Beineke (b61) 1970; 9
van Bevern, Froese, Komusiewicz (b68) 2018; 62
Chandrasekaran, Mnich, Mozaffari (b155) 2020; 34
Frick, Grohe (b230) 2001; 48
Fan, Raichel, Van Buskirk (b178) 2018
Yuan, Ke, Cao (b47) 2021; 891
Seidman (b265) 1983; 5
Chen, Flum, Müller (b133) 2011; 48
Fellows, Guo, Komusiewicz, Niedermeier, Uhlmann (b59) 2011; 8
Majumdar, Neogi, Raman, Vaishali (b146) 2019; 796
Bose, Hurtado (b283) 2009; 42
Feng, Li, Meng, Wang (b291) 2021; 281
Dumas, Perez, Todinca (b92) 2021; vol. 214
Lokshtanov, Marx (b180) 2013; 222
Giannopoulou, Pilipczuk, Raymond, Thilikos, Wrochna (b298) 2021; 35
Dom, Guo, Hüffner, Niedermeier (b90) 2005; vol. 3787
Jelínková, Suchý, Hlinený, Kratochvíl (b276) 2011; 13
Bodlaender, Heggernes, Villanger (b114) 2011; 61
Cygan, Kowalik, Pilipczuk (b145) 2013
Garg, Vazirani, Yannakakis (b163) 1997; 18
Drange, Dregi, van ’t Hof (b193) 2016; 76
van Bevern, Feldmann, Sorge, Suchý (b183) 2013; vol. 8165
Cleary, John (b287) 2009; 109
Natanzon, Shamir, Sharan (b75) 2000; 30
Fluschnik, Hermelin, Nichterlein, Niedermeier (b172) 2018; 32
Liu, Wang, Guo (b34) 2014; 19
Casas-Roma, Herrera-Joancomartí, Torra (b257) 2017; 47
Marx (b79) 2010; 57
Frank (b203) 1992; 5
Gutin, Ramanujan, Reidl, Wahlström (b212) 2019; 101
Flum, Grohe (b18) 2006
Lokshtanov (b27) 2008; vol. 5018
Cao, Marx (b85) 2015; 11
Sorge, van Bevern, Niedermeier, Weller (b254) 2011; vol. 6986
Kobayashi, Tamaki (b142) 2015; 72
Robertson, Seymour (b271) 1995; 63
Boesch, Suffel, Tindell (b243) 1977; 1
Bodlaender, Heggernes, Lokshtanov (b125) 2014; 4
Höhn, Jacobs, Megow (b253) 2012; 15
Bredereck, Froese, Hartung, Nichterlein, Niedermeier, Talmon (b261) 2015; 607
Klein, Marx (b153) 2012; vol. 7391
Fan, Gilbert, Raichel, Sonthalia, Van Buskirk (b179) 2020; vol. 162
Fellows, immersion order (b196) 1989; 6
Lubiw, Pathak (b284) 2015; 49
Grüttemeier, Komusiewicz, Schestag, Sommer (b297) 2021; 23
Watanabe, Nakamura (b201) 1987; 35
Fomin, Golovach, Thilikos (b282) 2019; vol. 126
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström, Directed flow-augmentation, in: Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC), 2022, pp. 938–947.
Kawarabayashi, Reed (b26) 2007
Komusiewicz, Uhlmann (b118) 2012; 160
Sandeep, Sivadasan (b49) 2015; vol. 43
Mathieson (b241) 2017; 677
Nastos, Gao (b57) 2012; 4
Pilipczuk, Pilipczuk, Wrochna (b103) 2019; 81
Downey, Fellows (b19) 2013
Yannakakis (b6) 1981; 2
Barefoot, Entringer, Swart (b197) 1987; 1
Frati, Gaspers, Gudmundsson, Mathieson (b269) 2015; 72
Alon, Lokshtanov, Saurabh (b111) 2009; vol. 5555
Cao, Chen, Fan (b152) 2014; 114
Crespelle, Gras, Perez (b93) 2021; vol. 12911
Xiao, Nagamochi (b160) 2012; 112
Dabrowski, Golovach, van ’t Hof, Paulusma, Thilikos (b234) 2017; 85
Guo, Gramm, Hüffner, Niedermeier, Wernicke (b102) 2006; 72
Oum (b278) 2005; 95
Zehavi (b143) 2022; 45
Lucas (b289) 2010; 110
Golovach, Thilikos (b171) 2011; 8
Niedermeier (b21) 2006; vol. 31
Reed, Smith, Vetta (b100) 2004; 32
Xiao (b151) 2010; 46
Aravind, Sandeep, Sivadasan (b62) 2017; 79
Bliznets, Fomin, Pilipczuk, Pilipczuk (b83) 2018; 14
Böcker, Damaschke (b66) 2011; 111
Nastos, Gao (b73) 2013; 35
Chen, Meng (b44) 2012; 78
Kratsch, Pilipczuk, Pilipczuk, Wahlström (b168) 2015; 29
Bessy, Paul, Perez (b89) 2010; 158
Adler, Grohe, Kreutzer (b98) 2008
Kratsch, Li, Marx, Pilipczuk, Wahlström (b161) 2020; 82
Cai, Cai (b52) 2015; 71
Deborah, Raychaudhuri (b236) 2002; 44
Bousquet, Daligault, Thomassé (b165) 2018; 47
Bodlaender, Demaine, Fellows, Guo, Hermelin, Lokshtanov, Müller, Raman, van Rooij, Rosamond (b110) 2008
Hammer, Simeone (b9) 1981
Ghosh, Kolay, Kumar, Misra, Panolan, Rai, Ramanujan (b72) 2015; 71
Dorn, Moser, Niedermeier, Weller (b245) 2013; 27
Golovach, van ’t Hof, Paulusma (b12) 2013; 476
Cygan, Lokshtanov, Pilipczuk, Pilipczuk, Saurabh (b182) 2019; 48
Bouchitté, Todinca (b116) 2002; 276
Cai (b33) 1996; 58
Chitnis, Talmon (b266) 2018; vol. 10846
Misra, Panolan, Saurabh (b215) 2020; 113
Kolman (b176) 2018; 22
Fernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh (b141) 2014; 19
Chitnis, Cygan, Hajiaghayi, Marx (b159) 2015; 11
Bocci, Capresi, Meeks, Sylvester (b222) 2022; vol. 13270
Cao (b131) 2017; 253
Tsur (b51) 2021; 167
Guo (b65) 2009; 410
Heggernes, van ’t Hof, Lokshtanov, Paul (b15) 2013; 27
Bazgan, Fluschnik, Nichterlein, Niedermeier, Stahlberg (b174) 2019; 73
Claudio, Younger (b162) 1978; 2–17
Gomes, Sau (b191) 2021; 83
Bouchitté, Todinca (b115) 2001; 31
Fomin, Lokshtanov, Misra, Saurabh (b99) 2012
Jansen, Pilipczuk (b77) 2018; 32
Dvorák, Knop (b173) 2018; 80
Cechlárová, Schlotter (b251) 2010; vol. 6478
Grüttemeier, Komusiewicz (b295) 2020; 82
Bock, Chandrasekaran, Könemann, Peis, Sanitá (b147) 2015; 154
Bessy, Perez (b37) 2013; 231
Marx (b108) 2012; vol. 7370
Talmon, Hartung (b262) 2017; 256
Fernau, Fluschnik, Hermelin, Krebs, Molter, Niedermeier (b134) 2020; 9
Chen, Eulenstein, Fernández-Baca, Sanderson (b135) 2006; 3
Hüffner, Komusiewicz, Sorge (b210) 2015; vol. 8939
Borgatti, Everett (b126) 2000; 21
Fomin, Golovach, Thilikos (b281) 2018; 32
Jr., Fulkerson (b148) 1956; 8
Guo, Komusiewicz, Niedermeier, Uhlmann (b36) 2010; 24
Gross, Heinig, Iswara, William Kazmierczak, Luttrell, Saccoman, Suffel (b194) 2013; 12
Cygan, Marx, Pilipczuk, Pilipczuk, Schlotter (b249) 2014; 68
Cai, Yang (b248) 2011; 9
Clark, Entringer, Fellows (b195) 1987; 2
Downey, Fellows (b17) 1992; vol. 87
Mancini (b4) 2008
Kaplan, Shamir, Tarjan (b74) 1999; 28
Cohen, Gonçalves, Kim, Paul, Sau, Thilikos, Weller (b273) 2017; 89
Sorge, van Bevern, Niedermeier, Weller (b255) 2012; 16
Lokshtanov, Ramanujan (b154) 2012; vol. 7391
Kotzig (b277) 1968
Kratsch, Wahlström (b104) 2014; 10
Kovác, Selecéniová, Steinová (b127) 2014; vol. 8635
Chitnis, Feldmann (b169) 2019; vol. 148
Guo, Niedermeier (b164) 2005; 46
Drange (b43) 2015
Fellows, Langston, Rosamond, Shaw (b55) 2007; vol. 4639
Cao, Chen (b45) 2012; 64
Bang-Jensen, Eiben, Gutin, Wahlström, Yeo (b198) 2022; 84
Fan, Raichel, Van Buskirk (b177) 2022; 84
Kim, Paul, Sau, Thilikos (b184) 2017; 86
Gao, Hare, Nastos (b268) 2013; 161
Xia, Zhang (b70) 2012; 160
Agrawal, Misra, Saurabh, Zehavi (b84) 2019
Drange, Pilipczuk (b32) 2018; 80
Chen, Liu, Lu, O’Sullivan, Razgon (b157) 2008; 55
Guo, Uhlmann (b207) 2010; 56
Marx, O’Sullivan, Razgon (b189) 2013; 9
Luo, Molter, Nichterlein, Niedermeier (b220) 2021; 83
Easley, Kleinberg (b292) 2010
Abu-Khzam (b35) 2010; 76
Even, Naor, Schieber, Sudan (b158) 1998; 20
Moser, Thilikos (b223) 2009; 7
Fomin, Villanger (b30) 2013; 42
Agrawal, Lokshtanov, Misra, Saurabh, Zehavi (b76) 2019; 15
Liu, Wang, Guo, Chen (b58) 2012; 461
Adler, Kolliopoulos, Thilikos (b211) 2016; 76
Golovach, Heggernes, Konstantinidis, Lima, Papadopoulos (b294) 2020; 82
Stewart (b226) 1994; 126
van ’t Hof, Villanger (b106) 2013; 65
Bliznets, Cygan, Komosa, Pilipczuk, Mach (b120) 2020; 16
Lokshtanov, Narayanaswamy, Raman, Ramanujan, Saurabh (b144) 2014; 11
Marx, Razgon (b166) 2014; 43
Brandstädt, Le, Spinrad (b25) 1999
Meesum, Misra, Saurabh (b128) 2016; 654
Bliznets, Karpov (b217) 2017; vol. 83
Bulian, Dawar (b231) 2017; 79
Moran, Wolfstahl (b237) 1991; 84
Dom, Guo, Hüffner, Niedermeier (b91) 2008; 156
Drange, Dregi, Lokshtanov, Sullivan (b38) 2022; 124
Dom, Guo, Hüffner, Niedermeier (b88) 2006; 44
Hartung, Nichterlein, Niedermeier, Suchý (b260) 2015; 243
Böcker, Bui, Truß (b136) 2012; 8
Kratsch, Wahlström (b56) 2013; 10
Kanj, Sedgwick, Xia (b290) 2017; 58
Guo (b53) 2007; vol. 4835
Golumbic (b24) 1980
Eiben, Lochet, Saurabh (b48) 2020; vol. 180
Dom, Guo, Hüffner, Niedermeier, Truß (b112) 2010; 8
Feng, Zhou, Li (b105) 2014; vol. 8497
Cattanéo, Perdrix (b279) 2015; vol. 9472
Tsur (b139) 2021; 168
Diestel (b246) 2012; vol. 173
Bliznets, Fomin, Pilipczuk, Pilipczuk (b124) 2015; 29
Bulteau, Grüttemeier, Komusiewicz, Sorge (b296) 2021; 120
Garey, Johnson (b225) 1979
Froese, Nichterlein, Niedermeier (b233) 2016; 82
Liu, Wang, You, Chen, Cao (b71) 2015; 573
Demaine, Fomin, Hajiaghayi, Thilikos (b109) 2005; 52
Bentert, Heeger, Knop (b175) 2022; 126
Golovach, Mertzios (b263) 2017; 665
Brügmann, Komusiewicz, Moser (b46) 2009; 32
Dumas, Perez, Todinca (b41) 2021; vol. 202
Golovach (b235) 2017; 256
Zheleva, Getoor (b256) 2011
Dabrowski, Golovach, van ’t Hof, Paulusma (b247) 2016; 82
Natanzon, Shamir, Sharan (b5) 2001; 113
Nagamochi (b206) 2003; 126
Goyal, Misra, Panolan, Philip, Saurabh (b250) 2018; 97
Li, Thomas McCormick, Simchi-Levi (b267) 1992; 11
Sintos, Tsaparas (b293) 2014
Bodlaender, Fomin, Lokshtanov, Penninkx, Saurabh, Thilikos (b242) 2016; 63
Fomin, Golovach, Korhonen (b181) 2013; vol. 8087
Downey, Estivill-Castro, Fellows, Prieto, Rosamond (b187) 2003; 78
Aravind, Sandeep, Sivadasan (b122) 2017; 31
Guo, Cai (b14) 2015; 607
Gramm, Guo, Hüffner, Niedermeier (b64) 2005; 38
Robertson, Seymour (b96) 2004; 92
Fomin, Kratsch, Pilipczuk, Pilipczuk, Villanger (b123) 2014; 80
Gramm, Guo, Hüffner, Niedermeier (b54) 2009; 13
Chitnis, Hajiaghayi, Marx (b156) 2013; 42
Lesniak, Oellermann (b244) 1986; 10
Golovach, Thilikos (b218) 2019; vol. 115
Cygan, Pilipczuk, Pilipczuk, van Leeuwen, Wrochna (b42) 2017; 60
Cao, Sandeep (b130) 2020; 271
Courcelle, Makowsky, Rotics (b94) 2001; 108
Shamir, Sharan, Tsur (b8) 2004; 144
ichi Kawarabayashi, Thorup (b188) 2011
Fomin, Golovach, Thilikos (b299) 2020; 64
Cai (b29) 2012
Demaine, Reidl, Rossmanith, Villaamil, Sikdar, Sullivan (b259) 2019; 105
Bagga, Beineke, Lipman, Pippert (b199) 1994; 124
Mathieson, Szeider (b224) 2012; 78
Bazgan, Bredereck, Hartung, Nichterlein, Woeginger (b258) 2016; 622
Böcker, Baumbach (b63) 2013; vol. 7921
Sleator, Tarjan, Thurston (b288) 1988; 1
Dahlhaus, Johnson, Papadimitriou, Seymour, Yannakakis (b149) 1994; 23
Cao (b81) 2013
Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (b10) 2015
Cao, Rai, Sandeep, Ye (b50) 2022; 84
Fernau (b140) 2005; 9
Bodlaender, Downey, Fellows, Hermelin (b22) 2009; 75
Cai (b16) 2003; 127
Guillemot, Havet, Paul, Perez (b28) 2013; 65
Golovach (b232) 2015; 591
Fomin, Golovach, Str
Xia (10.1016/j.cosrev.2023.100556_b70) 2012; 160
Cao (10.1016/j.cosrev.2023.100556_b81) 2013
Crespelle (10.1016/j.cosrev.2023.100556_b93) 2021; vol. 12911
Cao (10.1016/j.cosrev.2023.100556_b131) 2017; 253
Froese (10.1016/j.cosrev.2023.100556_b233) 2016; 82
Guo (10.1016/j.cosrev.2023.100556_b164) 2005; 46
Niedermeier (10.1016/j.cosrev.2023.100556_b21) 2006; vol. 31
Lokshtanov (10.1016/j.cosrev.2023.100556_b154) 2012; vol. 7391
Oum (10.1016/j.cosrev.2023.100556_b278) 2005; 95
Jr. (10.1016/j.cosrev.2023.100556_b148) 1956; 8
Gao (10.1016/j.cosrev.2023.100556_b268) 2013; 161
Drange (10.1016/j.cosrev.2023.100556_b31) 2015; 7
Fomin (10.1016/j.cosrev.2023.100556_b280) 2018; vol. 101
Guo (10.1016/j.cosrev.2023.100556_b53) 2007; vol. 4835
Courcelle (10.1016/j.cosrev.2023.100556_b94) 2001; 108
Drange (10.1016/j.cosrev.2023.100556_b38) 2022; 124
Chandrasekaran (10.1016/j.cosrev.2023.100556_b155) 2020; 34
Burzyn (10.1016/j.cosrev.2023.100556_b3) 2006; 154
Flum (10.1016/j.cosrev.2023.100556_b18) 2006
Zehavi (10.1016/j.cosrev.2023.100556_b143) 2022; 45
Marx (10.1016/j.cosrev.2023.100556_b108) 2012; vol. 7370
Dumas (10.1016/j.cosrev.2023.100556_b41) 2021; vol. 202
Hartung (10.1016/j.cosrev.2023.100556_b260) 2015; 243
Claudio (10.1016/j.cosrev.2023.100556_b162) 1978; 2–17
Bose (10.1016/j.cosrev.2023.100556_b283) 2009; 42
Kratsch (10.1016/j.cosrev.2023.100556_b56) 2013; 10
Bessy (10.1016/j.cosrev.2023.100556_b89) 2010; 158
Heggernes (10.1016/j.cosrev.2023.100556_b15) 2013; 27
Pilipczuk (10.1016/j.cosrev.2023.100556_b167) 2018; 10
Kratsch (10.1016/j.cosrev.2023.100556_b161) 2020; 82
Shamir (10.1016/j.cosrev.2023.100556_b8) 2004; 144
Adler (10.1016/j.cosrev.2023.100556_b211) 2016; 76
Lokshtanov (10.1016/j.cosrev.2023.100556_b272) 2019; vol. 115
Liu (10.1016/j.cosrev.2023.100556_b213) 2012; vol. 7285
Bodlaender (10.1016/j.cosrev.2023.100556_b242) 2016; 63
Easley (10.1016/j.cosrev.2023.100556_b292) 2010
Golovach (10.1016/j.cosrev.2023.100556_b263) 2017; 665
Mancini (10.1016/j.cosrev.2023.100556_b4) 2008
Fan (10.1016/j.cosrev.2023.100556_b179) 2020; vol. 162
Cai (10.1016/j.cosrev.2023.100556_b52) 2015; 71
Zheleva (10.1016/j.cosrev.2023.100556_b256) 2011
Chen (10.1016/j.cosrev.2023.100556_b221) 2018; vol. 123
Guo (10.1016/j.cosrev.2023.100556_b102) 2006; 72
Cleary (10.1016/j.cosrev.2023.100556_b287) 2009; 109
Kratochvíl (10.1016/j.cosrev.2023.100556_b275) 1992; vol. 51
Kobayashi (10.1016/j.cosrev.2023.100556_b142) 2015; 72
Sandeep (10.1016/j.cosrev.2023.100556_b49) 2015; vol. 43
Borgatti (10.1016/j.cosrev.2023.100556_b126) 2000; 21
Gutin (10.1016/j.cosrev.2023.100556_b212) 2019; 101
Chitnis (10.1016/j.cosrev.2023.100556_b266) 2018; vol. 10846
Lokshtanov (10.1016/j.cosrev.2023.100556_b27) 2008; vol. 5018
Damaschke (10.1016/j.cosrev.2023.100556_b121) 2014; 18
Mathieson (10.1016/j.cosrev.2023.100556_b229) 2009
Drange (10.1016/j.cosrev.2023.100556_b32) 2018; 80
Ghosh (10.1016/j.cosrev.2023.100556_b72) 2015; 71
Chitnis (10.1016/j.cosrev.2023.100556_b159) 2015; 11
Yannakakis (10.1016/j.cosrev.2023.100556_b2) 1981; 10
Golovach (10.1016/j.cosrev.2023.100556_b171) 2011; 8
Golumbic (10.1016/j.cosrev.2023.100556_b24) 1980
Cattanéo (10.1016/j.cosrev.2023.100556_b279) 2015; vol. 9472
Jackson (10.1016/j.cosrev.2023.100556_b205) 2005; 94
Bliznets (10.1016/j.cosrev.2023.100556_b83) 2018; 14
Kovác (10.1016/j.cosrev.2023.100556_b127) 2014; vol. 8635
Höhn (10.1016/j.cosrev.2023.100556_b253) 2012; 15
Sorge (10.1016/j.cosrev.2023.100556_b254) 2011; vol. 6986
Sleator (10.1016/j.cosrev.2023.100556_b288) 1988; 1
Chen (10.1016/j.cosrev.2023.100556_b157) 2008; 55
Clark (10.1016/j.cosrev.2023.100556_b195) 1987; 2
Klein (10.1016/j.cosrev.2023.100556_b153) 2012; vol. 7391
Cygan (10.1016/j.cosrev.2023.100556_b182) 2019; 48
Cao (10.1016/j.cosrev.2023.100556_b50) 2022; 84
Giannopoulou (10.1016/j.cosrev.2023.100556_b298) 2021; 35
Stewart (10.1016/j.cosrev.2023.100556_b228) 1997; 163
Villanger (10.1016/j.cosrev.2023.100556_b80) 2009; 38
Fellows (10.1016/j.cosrev.2023.100556_b196) 1989; 6
Bliznets (10.1016/j.cosrev.2023.100556_b132) 2018; 10
Kratsch (10.1016/j.cosrev.2023.100556_b168) 2015; 29
Hanke (10.1016/j.cosrev.2023.100556_b286) 1996; 2
Guo (10.1016/j.cosrev.2023.100556_b36) 2010; 24
Komusiewicz (10.1016/j.cosrev.2023.100556_b190) 2020; 283
Xiao (10.1016/j.cosrev.2023.100556_b160) 2012; 112
Marx (10.1016/j.cosrev.2023.100556_b150) 2006; 351
Fan (10.1016/j.cosrev.2023.100556_b177) 2022; 84
Bliznets (10.1016/j.cosrev.2023.100556_b120) 2020; 16
Haarberg (10.1016/j.cosrev.2023.100556_b239) 2019
Cao (10.1016/j.cosrev.2023.100556_b45) 2012; 64
Jansen (10.1016/j.cosrev.2023.100556_b77) 2018; 32
Aravind (10.1016/j.cosrev.2023.100556_b122) 2017; 31
Böcker (10.1016/j.cosrev.2023.100556_b66) 2011; 111
Hammer (10.1016/j.cosrev.2023.100556_b9) 1981
Böcker (10.1016/j.cosrev.2023.100556_b63) 2013; vol. 7921
Gross (10.1016/j.cosrev.2023.100556_b194) 2013; 12
Dom (10.1016/j.cosrev.2023.100556_b91) 2008; 156
Chitnis (10.1016/j.cosrev.2023.100556_b169) 2019; vol. 148
Seidman (10.1016/j.cosrev.2023.100556_b265) 1983; 5
Yannakakis (10.1016/j.cosrev.2023.100556_b6) 1981; 2
Dom (10.1016/j.cosrev.2023.100556_b88) 2006; 44
Watanabe (10.1016/j.cosrev.2023.100556_b201) 1987; 35
Pilz (10.1016/j.cosrev.2023.100556_b285) 2014; 47
Cygan (10.1016/j.cosrev.2023.100556_b249) 2014; 68
10.1016/j.cosrev.2023.100556_b186
Golovach (10.1016/j.cosrev.2023.100556_b235) 2017; 256
Cao (10.1016/j.cosrev.2023.100556_b40) 2021; vol. 214
Tsur (10.1016/j.cosrev.2023.100556_b51) 2021; 167
Yuan (10.1016/j.cosrev.2023.100556_b47) 2021; 891
Kim (10.1016/j.cosrev.2023.100556_b184) 2017; 86
Liu (10.1016/j.cosrev.2023.100556_b71) 2015; 573
Crowston (10.1016/j.cosrev.2023.100556_b252) 2012; 112
Bathie (10.1016/j.cosrev.2023.100556_b39) 2022; 84
Fernau (10.1016/j.cosrev.2023.100556_b140) 2005; 9
Even (10.1016/j.cosrev.2023.100556_b158) 1998; 20
Luo (10.1016/j.cosrev.2023.100556_b220) 2021; 83
Cai (10.1016/j.cosrev.2023.100556_b248) 2011; 9
Hüffner (10.1016/j.cosrev.2023.100556_b210) 2015; vol. 8939
Deborah (10.1016/j.cosrev.2023.100556_b236) 2002; 44
Impagliazzo (10.1016/j.cosrev.2023.100556_b23) 2001; 63
Guo (10.1016/j.cosrev.2023.100556_b65) 2009; 410
Hüffner (10.1016/j.cosrev.2023.100556_b216) 2014; 11
Frank (10.1016/j.cosrev.2023.100556_b203) 1992; 5
Chitnis (10.1016/j.cosrev.2023.100556_b156) 2013; 42
Fomin (10.1016/j.cosrev.2023.100556_b99) 2012
Jelínková (10.1016/j.cosrev.2023.100556_b276) 2011; 13
Guo (10.1016/j.cosrev.2023.100556_b14) 2015; 607
Cao (10.1016/j.cosrev.2023.100556_b152) 2014; 114
Böcker (10.1016/j.cosrev.2023.100556_b136) 2012; 8
Bagga (10.1016/j.cosrev.2023.100556_b199) 1994; 124
Bliznets (10.1016/j.cosrev.2023.100556_b124) 2015; 29
Golovach (10.1016/j.cosrev.2023.100556_b232) 2015; 591
Aravind (10.1016/j.cosrev.2023.100556_b62) 2017; 79
Cygan (10.1016/j.cosrev.2023.100556_b10) 2015
Moser (10.1016/j.cosrev.2023.100556_b223) 2009; 7
Cai (10.1016/j.cosrev.2023.100556_b29) 2012
Lucas (10.1016/j.cosrev.2023.100556_b289) 2010; 110
Bentert (10.1016/j.cosrev.2023.100556_b175) 2022; 126
Bessy (10.1016/j.cosrev.2023.100556_b37) 2013; 231
Kratsch (10.1016/j.cosrev.2023.100556_b200) 1997; 77
Lewis (10.1016/j.cosrev.2023.100556_b1) 1980; 20
Golovach (10.1016/j.cosrev.2023.100556_b274) 2015; vol. 43
Grohe (10.1016/j.cosrev.2023.100556_b20) 2007
Garg (10.1016/j.cosrev.2023.100556_b163) 1997; 18
Dejter (10.1016/j.cosrev.2023.100556_b270) 1993
Fomin (10.1016/j.cosrev.2023.100556_b117) 2008; 38
Frati (10.1016/j.cosrev.2023.100556_b269) 2015; 72
Bessy (10.1016/j.cosrev.2023.100556_b113) 2011; 77
Bodlaender (10.1016/j.cosrev.2023.100556_b125) 2014; 4
Fan (10.1016/j.cosrev.2023.100556_b178) 2018
Diestel (10.1016/j.cosrev.2023.100556_b246) 2012; vol. 173
Cao (10.1016/j.cosrev.2023.100556_b85) 2015; 11
Cygan (10.1016/j.cosrev.2023.100556_b145) 2013
Downey (10.1016/j.cosrev.2023.100556_b19) 2013
Lesniak (10.1016/j.cosrev.2023.100556_b244) 1986; 10
Cygan (10.1016/j.cosrev.2023.100556_b60) 2013
Nishimura (10.1016/j.cosrev.2023.100556_b87) 2002; 42
Eswaran (10.1016/j.cosrev.2023.100556_b7) 1976; 5
Marx (10.1016/j.cosrev.2023.100556_b79) 2010; 57
Bouchitté (10.1016/j.cosrev.2023.100556_b116) 2002; 276
Stewart (10.1016/j.cosrev.2023.100556_b226) 1994; 126
Chitnis (10.1016/j.cosrev.2023.100556_b185) 2017; 78
Frick (10.1016/j.cosrev.2023.100556_b230) 2001; 48
Cao (10.1016/j.cosrev.2023.100556_b78) 2016; 75
Bang-Jensen (10.1016/j.cosrev.2023.100556_b198) 2022; 84
Cai (10.1016/j.cosrev.2023.100556_b33) 1996; 58
Cechlárová (10.1016/j.cosrev.2023.100556_b251) 2010; vol. 6478
Fellows (10.1016/j.cosrev.2023.100556_b59) 2011; 8
Mathieson (10.1016/j.cosrev.2023.100556_b224) 2012; 78
Chen (10.1016/j.cosrev.2023.100556_b135) 2006; 3
Dahlhaus (10.1016/j.cosrev.2023.100556_b149) 1994; 23
Casas-Roma (10.1016/j.cosrev.2023.100556_b257) 2017; 47
Bazgan (10.1016/j.cosrev.2023.100556_b174) 2019; 73
Bringmann (10.1016/j.cosrev.2023.100556_b170) 2016; 82
Grüttemeier (10.1016/j.cosrev.2023.100556_b297) 2021; 23
Fernau (10.1016/j.cosrev.2023.100556_b141) 2014; 19
Meesum (10.1016/j.cosrev.2023.100556_b129) 2018; 80
Wernicke (10.1016/j.cosrev.2023.100556_b101) 2003
Drange (10.1016/j.cosrev.2023.100556_b119) 2015; vol. 43
Marx (10.1016/j.cosrev.2023.100556_b208) 2015; 11
Liu (10.1016/j.cosrev.2023.100556_b58) 2012; 461
Pilipczuk (10.1016/j.cosrev.2023.100556_b103) 2019; 81
Boesch (10.1016/j.cosrev.2023.100556_b243) 1977; 1
Kawarabayashi (10.1016/j.cosrev.2023.100556_b26) 2007
Li (10.1016/j.cosrev.2023.100556_b69) 2021; vol. 187
Demaine (10.1016/j.cosrev.2023.100556_b109) 2005; 52
Robertson (10.1016/j.cosrev.2023.100556_b271) 1995; 63
Barefoot (10.1016/j.cosrev.2023.100556_b197) 1987; 1
Dabrowski (10.1016/j.cosrev.2023.100556_b247) 2016; 82
Demaine (10.1016/j.cosrev.2023.100556_b259) 2019; 105
Robertson (10.1016/j.cosrev.2023.100556_b97) 1994; 60
Golovach (10.1016/j.cosrev.2023.100556_b12) 2013; 476
Bodlaender (10.1016/j.cosrev.2023.100556_b22) 2009; 75
Gramm (10.1016/j.cosrev.2023.100556_b64) 2005; 38
Fomin (10.1016/j.cosrev.2023.100556_b181) 2013; vol. 8087
Nastos (10.1016/j.cosrev.2023.100556_b73) 2013; 35
Bulteau (10.1016/j.cosrev.2023.100556_b296) 2021; 120
Dom (10.1016/j.cosrev.2023.100556_b90) 2005; vol. 3787
van ’t Hof (10.1016/j.
References_xml – volume: 108
  start-page: 23
  year: 2001
  end-page: 52
  ident: b94
  article-title: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
  publication-title: Discrete Appl. Math.
– volume: 83
  start-page: 1
  year: 2021
  end-page: 44
  ident: b220
  article-title: Parameterized dynamic cluster editing
  publication-title: Algorithmica
– volume: 55
  year: 2008
  ident: b157
  article-title: A fixed-parameter algorithm for the directed feedback vertex set problem
  publication-title: J. ACM
– volume: 32
  start-page: 299
  year: 2004
  end-page: 301
  ident: b100
  article-title: Finding odd cycle transversals
  publication-title: Oper. Res. Lett.
– volume: vol. 5555
  start-page: 49
  year: 2009
  end-page: 58
  ident: b111
  article-title: Fast FAST
  publication-title: Proceedings of the 36th International Colloquium of Automata, Languages and Programming
– year: 2013
  ident: b81
  article-title: An efficient branching algorithm for interval completion
– start-page: 1711
  year: 2019
  end-page: 1730
  ident: b84
  article-title: Interval vertex deletion admits a polynomial kernel
  publication-title: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms
– volume: 49
  start-page: 17
  year: 2015
  end-page: 23
  ident: b284
  article-title: Flip distance between two triangulations of a point set is NP-complete
  publication-title: Comput. Geom.
– volume: 82
  start-page: 1100
  year: 2016
  end-page: 1111
  ident: b233
  article-title: Win-win kernelization for degree sequence completion problems
  publication-title: J. Comput. System Sci.
– volume: 9
  start-page: 129
  year: 1970
  end-page: 135
  ident: b61
  article-title: Characterizations of derived graphs
  publication-title: J. Combin. Theory
– volume: 9
  start-page: 205
  year: 2005
  end-page: 238
  ident: b140
  article-title: Two-layer planarization: Improving on parameterized algorithmics
  publication-title: J. Graph Algorithms Appl.
– volume: vol. 7391
  start-page: 569
  year: 2012
  end-page: 580
  ident: b153
  article-title: Solving planar
  publication-title: Proceedings of the 39th International Colloquium of Automata, Languages and Programming
– volume: 112
  start-page: 5
  year: 2012
  end-page: 9
  ident: b160
  article-title: An FPT algorithm for edge subset feedback edge set
  publication-title: Inform. Process. Lett.
– start-page: 1466
  year: 2014
  end-page: 1475
  ident: b293
  article-title: Using strong triadic closure to characterize ties in social networks
  publication-title: Proceedings of the 20th International Conference on Knowledge Discovery and Data Mining (KDD)
– year: 2008
  ident: b4
  article-title: Graph modification problems related to graph classes
– volume: 105
  start-page: 199
  year: 2019
  end-page: 241
  ident: b259
  article-title: Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs
  publication-title: J. Comput. System Sci.
– volume: 160
  start-page: 1224
  year: 2012
  end-page: 1231
  ident: b70
  article-title: Kernelization for cycle transversal problems
  publication-title: Discrete Appl. Math.
– year: 2015
  ident: b10
  article-title: Parameterized Algorithms
– volume: vol. 6478
  start-page: 72
  year: 2010
  end-page: 83
  ident: b251
  article-title: Computing the deficiency of housing markets with duplicate houses
  publication-title: Proceedings of the 5th International Symposium on Parameterized and Exact Computation
– year: 2013
  ident: b60
  article-title: Open problems from Workshop on Kernels. Worker
– volume: 72
  start-page: 778
  year: 2015
  end-page: 790
  ident: b142
  article-title: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
  publication-title: Algorithmica
– volume: 126
  start-page: 349
  year: 1994
  end-page: 357
  ident: b226
  article-title: Deciding whether a planar graph has a cubic subgraph is NP-complete
  publication-title: Discrete Math.
– volume: 7
  start-page: 181
  year: 2009
  end-page: 190
  ident: b223
  article-title: Parameterized complexity of finding regular induced subgraphs
  publication-title: J. Discrete Algorithms
– volume: 891
  start-page: 1
  year: 2021
  end-page: 12
  ident: b47
  article-title: Polynomial kernels for paw-free edge modification problems
  publication-title: Theoret. Comput. Sci.
– volume: 120
  start-page: 75
  year: 2021
  end-page: 96
  ident: b296
  article-title: Your rugby mates don’t need to know your colleagues: Triadic closure with edge colors
  publication-title: J. Comput. System Sci.
– volume: 80
  start-page: 2757
  year: 2018
  end-page: 2776
  ident: b129
  article-title: Rank reduction of oriented graphs by vertex and edge deletions
  publication-title: Algorithmica
– volume: 65
  start-page: 845
  year: 2013
  end-page: 867
  ident: b106
  article-title: Proper interval vertex deletion
  publication-title: Algorithmica
– volume: 677
  start-page: 56
  year: 2017
  end-page: 68
  ident: b241
  article-title: Graph editing problems with extended regularity constraints
  publication-title: Theoret. Comput. Sci.
– volume: 89
  start-page: 315
  year: 2017
  end-page: 327
  ident: b273
  article-title: A polynomial-time algorithm for outerplanar diameter improvement
  publication-title: J. Comput. System Sci.
– volume: 58
  start-page: 313
  year: 2017
  end-page: 344
  ident: b290
  article-title: Computing the flip distance between triangulations
  publication-title: Discrete Comput. Geom.
– volume: 80
  start-page: 1430
  year: 2014
  end-page: 1447
  ident: b123
  article-title: Tight bounds for parameterized complexity of cluster editing with a small number of clusters
  publication-title: J. Comput. System Sci.
– volume: 8
  start-page: 72
  year: 2011
  end-page: 86
  ident: b171
  article-title: Paths of bounded length and their cuts: Parameterized complexity and algorithms
  publication-title: Discrete Optim.
– volume: vol. 162
  start-page: 25:1
  year: 2020
  end-page: 25:22
  ident: b179
  article-title: Generalized metric repair on graphs
  publication-title: Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory
– volume: 78
  start-page: 211
  year: 2012
  end-page: 220
  ident: b44
  article-title: A
  publication-title: J. Comput. System Sci.
– volume: 127
  start-page: 415
  year: 2003
  end-page: 429
  ident: b16
  article-title: Parameterized complexity of vertex colouring
  publication-title: Discrete Appl. Math.
– volume: 46
  start-page: 723
  year: 2010
  end-page: 736
  ident: b151
  article-title: Simple and improved parameterized algorithms for multiterminal cuts
  publication-title: Theory Comput. Syst.
– volume: vol. 115
  start-page: 17:1
  year: 2019
  end-page: 19:17
  ident: b218
  article-title: Clustering to given connectivities
  publication-title: Proceedings of the 14th International Symposium on Parameterized and Exact Computation
– volume: 243
  start-page: 249
  year: 2015
  end-page: 262
  ident: b260
  article-title: A refined complexity analysis of degree anonymization in graphs
  publication-title: Inform. and Comput.
– year: 2018
  ident: b178
  article-title: Metric violation distance: Revisited and extended
– volume: vol. 6986
  start-page: 307
  year: 2011
  end-page: 318
  ident: b254
  article-title: From few components to an Eulerian graph by adding arcs
  publication-title: Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science
– volume: 38
  start-page: 1058
  year: 2008
  end-page: 1079
  ident: b117
  article-title: Exact algorithms for treewidth and minimum fill-in
  publication-title: SIAM J. Comput.
– year: 2019
  ident: b11
  article-title: Kernelization. Theory of Parameterized Preprocessing
– volume: 19
  start-page: 374
  year: 2014
  end-page: 386
  ident: b141
  article-title: Social choice meets graph drawing: how to get subexponential time algorithms for ranking and drawing problems
  publication-title: Tsinghua Sci. Technol.
– volume: 2
  start-page: 77
  year: 1981
  end-page: 79
  ident: b6
  article-title: Computing the minimum fill-in is NP-complete
  publication-title: SIAM J. Algebr. Discrete Methods
– volume: 607
  start-page: 60
  year: 2015
  end-page: 67
  ident: b14
  article-title: Obtaining split graphs by edge contraction
  publication-title: Theoret. Comput. Sci.
– volume: 10
  start-page: 193
  year: 2013
  end-page: 199
  ident: b56
  article-title: Two edge modification problems without polynomial kernels
  publication-title: Discrete Optim.
– volume: 68
  start-page: 223
  year: 1996
  end-page: 235
  ident: b227
  article-title: Finding regular subgraphs in both arbitrary and planar graphs
  publication-title: Discrete Appl. Math.
– volume: vol. 5018
  start-page: 141
  year: 2008
  end-page: 147
  ident: b27
  article-title: Wheel-free deletion is W[2]-hard
  publication-title: Proceedings of the 3rd International Workshop on Parameterized and Exact Computation
– year: 1993
  ident: b270
  article-title: Improving the diameter of a planar graph
  publication-title: Manuscript
– start-page: 277
  year: 2011
  end-page: 306
  ident: b256
  article-title: Social network data analytics
  publication-title: Social Network Data Analytics
– volume: vol. 4639
  start-page: 312
  year: 2007
  end-page: 321
  ident: b55
  article-title: Efficient parameterized preprocessing for cluster editing
  publication-title: Proceedings of the International Symposium on Fundamentals of Computation Theory
– volume: 79
  start-page: 654
  year: 2017
  end-page: 666
  ident: b62
  article-title: On polynomial kernelization of
  publication-title: Algorithmica
– volume: 113
  start-page: 109
  year: 2001
  end-page: 128
  ident: b5
  article-title: Complexity classification of some edge modification problems
  publication-title: Discrete Appl. Math.
– volume: 35
  start-page: 439
  year: 2013
  end-page: 450
  ident: b73
  article-title: Familial groups in social networks
  publication-title: Social Networks
– volume: 124
  start-page: 3
  year: 1994
  end-page: 12
  ident: b199
  article-title: Edge-integrity: a survey
  publication-title: Discrete Math.
– volume: vol. 202
  start-page: 45:1
  year: 2021
  end-page: 45:14
  ident: b41
  article-title: A cubic vertex-kernel for trivially perfect editing
  publication-title: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science
– volume: vol. 8087
  start-page: 421
  year: 2013
  end-page: 432
  ident: b181
  article-title: On the parameterized complexity of cutting a few vertices from a graph
  publication-title: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science
– volume: 38
  start-page: 2007
  year: 2009
  end-page: 2020
  ident: b80
  article-title: Interval completion is fixed parameter tractable
  publication-title: SIAM J. Comput.
– volume: 32
  start-page: 656
  year: 2018
  end-page: 681
  ident: b172
  article-title: Fractals for kernelization lower bounds
  publication-title: SIAM J. Discrete Math.
– volume: 15
  start-page: 11:1
  year: 2019
  end-page: 11:28
  ident: b76
  article-title: Feedback vertex set inspired kernel for chordal vertex deletion
  publication-title: ACM Trans. Algorithms
– volume: 29
  start-page: 257
  year: 2015
  end-page: 275
  ident: b86
  article-title: An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
  publication-title: J. Comb. Optim.
– volume: 283
  start-page: 44
  year: 2020
  end-page: 58
  ident: b190
  article-title: Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms
  publication-title: Discrete Appl. Math.
– start-page: 470
  year: 2012
  end-page: 479
  ident: b99
  article-title: Planar
  publication-title: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science
– volume: vol. 9472
  start-page: 259
  year: 2015
  end-page: 270
  ident: b279
  article-title: Minimum degree up to local complementation: Bounds, parameterized complexity, and exact algorithms
  publication-title: Proceedings of the 26th International Symposium on Algorithms and Computation
– volume: 461
  start-page: 45
  year: 2012
  end-page: 54
  ident: b58
  article-title: Complexity and parameterized algorithms for cograph editing
  publication-title: Theoret. Comput. Sci.
– volume: vol. 7921
  start-page: 33
  year: 2013
  end-page: 44
  ident: b63
  article-title: Cluster editing
  publication-title: Proceedings of the 9th Conference on Computability in Europe (CiE)
– volume: 72
  start-page: 995
  year: 2015
  end-page: 1010
  ident: b269
  article-title: Augmenting graphs to minimize the diameter
  publication-title: Algorithmica
– volume: 58
  start-page: 171
  year: 1996
  end-page: 176
  ident: b33
  article-title: Fixed-parameter tractability of graph modification problems for hereditary properties
  publication-title: Inform. Process. Lett.
– volume: 45
  start-page: 26
  year: 2017
  end-page: 34
  ident: b214
  article-title: On the complexity of multi-parameterized cluster editing
  publication-title: J. Discrete Algorithms
– volume: 110
  start-page: 481
  year: 2010
  end-page: 484
  ident: b289
  article-title: An improved kernel size for rotation distance in binary trees
  publication-title: Inform. Process. Lett.
– volume: vol. 3787
  start-page: 397
  year: 2005
  end-page: 408
  ident: b90
  article-title: Extending the tractability border for closest leaf powers
  publication-title: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science
– volume: vol. 12911
  start-page: 156
  year: 2021
  end-page: 168
  ident: b93
  article-title: Completion to chordal distance-hereditary graphs: A quartic vertex-kernel
  publication-title: Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science
– volume: vol. 214
  start-page: 13:1
  year: 2021
  end-page: 13:14
  ident: b40
  article-title: Improved kernels for edge modification problems
  publication-title: Proceedings of the 16th International Symposium on Parameterized and Exact Computation
– volume: 11
  start-page: 15
  year: 2014
  ident: b144
  article-title: Faster parameterized algorithms using linear programming
  publication-title: ACM Trans. Algorithms
– volume: 9
  start-page: 231
  year: 2011
  end-page: 240
  ident: b248
  article-title: Parameterized complexity of even/odd subgraph problems
  publication-title: J. Discrete Algorithms
– volume: 13
  start-page: 2.2.2
  year: 2009
  end-page: 2:2.15
  ident: b54
  article-title: Data reduction and exact algorithms for clique cover
  publication-title: ACM J. Exp. Algorithmics
– year: 2010
  ident: b292
  article-title: Networks, Crowds, and Markets: Reasoning About a Highly Connected World
– volume: 9
  start-page: 30:1
  year: 2013
  end-page: 30:35
  ident: b189
  article-title: Finding small separators in linear time via treewidth reduction
  publication-title: ACM Trans. Algorithms
– volume: vol. 43
  start-page: 30
  year: 2015
  end-page: 42
  ident: b274
  article-title: Variants of plane diameter completion
  publication-title: Proceedings of the 10th International Symposium on Parameterized and Exact Computation
– volume: 75
  start-page: 423
  year: 2009
  end-page: 434
  ident: b22
  article-title: On problems without polynomial kernels
  publication-title: J. Comput. System Sci.
– volume: 8
  start-page: 2
  year: 2011
  end-page: 17
  ident: b59
  article-title: Graph-based data clustering with overlaps
  publication-title: Discrete Optim.
– volume: vol. 115
  start-page: 25:1
  year: 2019
  end-page: 25:13
  ident: b272
  article-title: A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
  publication-title: Proceedings of the 13th International Symposium on Parameterized and Exact Computation
– volume: 57
  start-page: 747
  year: 2010
  end-page: 768
  ident: b79
  article-title: Chordal deletion is fixed-parameter tractable
  publication-title: Algorithmica
– volume: 476
  start-page: 38
  year: 2013
  end-page: 46
  ident: b12
  article-title: Obtaining planarity by contracting few edges
  publication-title: Theoret. Comput. Sci.
– volume: vol. 8497
  start-page: 82
  year: 2014
  end-page: 93
  ident: b105
  article-title: Randomized parameterized algorithms for co-path set problem
  publication-title: Proceedings of the Annual International Workshop Frontiers in Algorithmics
– volume: 63
  start-page: 512
  year: 2001
  end-page: 530
  ident: b23
  article-title: Which problems have strongly exponential complexity?
  publication-title: J. Comput. System Sci.
– volume: vol. 7391
  start-page: 750
  year: 2012
  end-page: 761
  ident: b154
  article-title: Parameterized tractability of multiway cut with parity constraints
  publication-title: Proceedings of the 39th International Colloquium of Automata, Languages and Programming
– volume: 19
  start-page: 151
  year: 1989
  end-page: 172
  ident: b202
  article-title: The minimum augmentation of any graph to a
  publication-title: Networks
– volume: 84
  start-page: 2767
  year: 2022
  end-page: 2784
  ident: b198
  article-title: Component order connectivity in directed graphs
  publication-title: Algorithmica
– volume: vol. 43
  start-page: 365
  year: 2015
  end-page: 376
  ident: b49
  article-title: Parameterized lower bound and improved kernel for diamond-free edge deletion
  publication-title: Proceedings of the 10th International Symposium on Parameterized and Exact Computation
– volume: 80
  start-page: 3597
  year: 2018
  end-page: 3617
  ident: b173
  article-title: Parameterized complexity of length-bounded cuts and multicuts
  publication-title: Algorithmica
– volume: 6
  start-page: 23
  year: 1989
  end-page: 32
  ident: b196
  article-title: Forbidden subgraphs and the complexity of network integrity
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 84
  start-page: 3338
  year: 2022
  end-page: 3364
  ident: b39
  article-title: (Sub)linear kernels for edge modification problems toward structured graph classes
  publication-title: Algorithmica
– volume: 68
  start-page: 41
  year: 2014
  end-page: 61
  ident: b249
  article-title: Parameterized complexity of Eulerian deletion problems
  publication-title: Algorithmica
– volume: 34
  start-page: 1385
  year: 2020
  end-page: 1408
  ident: b155
  article-title: Odd multiway cut in directed acyclic graphs
  publication-title: SIAM J. Discrete Math.
– volume: vol. 126
  start-page: 28:1
  year: 2019
  end-page: 28:17
  ident: b282
  article-title: Modification to planarity is fixed parameter tractable
  publication-title: Leibniz International Proceedings in Informatics (LIPIcs)
– volume: 2
  start-page: 179
  year: 1987
  end-page: 191
  ident: b195
  article-title: Computational complexity of integrity
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 281
  year: 2021
  ident: b291
  article-title: An improved FPT algorithm for the flip distance problem
  publication-title: Inform. and Comput.
– volume: 10
  start-page: 297
  year: 1981
  end-page: 309
  ident: b2
  article-title: Edge-deletion problems
  publication-title: SIAM J. Comput.
– volume: 45
  year: 2022
  ident: b143
  article-title: Parameterized analysis and crossing minimization problems
  publication-title: Comp. Sci. Rev.
– volume: 44
  start-page: 363
  year: 2006
  end-page: 381
  ident: b88
  article-title: Error compensation in leaf power problems
  publication-title: Algorithmica
– volume: 47
  start-page: 341
  year: 2017
  end-page: 366
  ident: b257
  article-title: A survey of graph-modification techniques for privacy-preserving on networks
  publication-title: J. Artificial Intelligence Res.
– volume: 796
  start-page: 207
  year: 2019
  end-page: 215
  ident: b146
  article-title: Tractability of Kőnig edge deletion problems
  publication-title: Theoret. Comput. Sci.
– volume: 11
  start-page: 455
  year: 2014
  end-page: 467
  ident: b216
  article-title: Partitioning biological networks into highly connected clusters with maximum edge coverage
  publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform.
– volume: 48
  start-page: 803
  year: 2011
  end-page: 839
  ident: b133
  article-title: Lower bounds for kernelizations and other preprocessing procedures
  publication-title: Theory Comput. Syst.
– year: 1980
  ident: b24
  article-title: Algorithmic Graph Theory and Perfect Graphs
– volume: 114
  start-page: 167
  year: 2014
  end-page: 173
  ident: b152
  article-title: An
  publication-title: Inform. Process. Lett.
– volume: 94
  start-page: 31
  year: 2005
  end-page: 77
  ident: b205
  article-title: Independence free graphs and vertex connectivity augmentation
  publication-title: J. Combin. Theory Ser. B
– volume: 156
  start-page: 3345
  year: 2008
  end-page: 3361
  ident: b91
  article-title: Closest 4-leaf power is fixed-parameter tractable
  publication-title: Discrete Appl. Math.
– volume: vol. 43
  start-page: 402
  year: 2015
  end-page: 413
  ident: b119
  article-title: Fast biclustering by dual parameterization
  publication-title: Proceedings of the 10th International Symposium on Parameterized and Exact Computation
– volume: 35
  start-page: 105
  year: 2021
  end-page: 151
  ident: b298
  article-title: Linear kernels for edge deletion problems to immersion-closed graph classes
  publication-title: SIAM J. Discrete Math.
– volume: 29
  start-page: 1931
  year: 2015
  end-page: 1960
  ident: b264
  article-title: NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs
  publication-title: SIAM J. Discrete Math.
– volume: 20
  start-page: 219
  year: 1980
  end-page: 230
  ident: b1
  article-title: The node-deletion problem for hereditary properties is NP-complete
  publication-title: J. Comput. System Sci.
– volume: 47
  start-page: 166
  year: 2018
  end-page: 207
  ident: b165
  article-title: Multicut is FPT
  publication-title: SIAM J. Comput.
– volume: 113
  start-page: 906
  year: 2013
  end-page: 912
  ident: b13
  article-title: A faster FPT algorithm for bipartite contraction
  publication-title: Inform. Process. Lett.
– volume: 42
  start-page: 2197
  year: 2013
  end-page: 2216
  ident: b30
  article-title: Subexponential parameterized algorithm for minimum fill-in
  publication-title: SIAM J. Comput.
– year: 2006
  ident: b18
  article-title: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series
– volume: 18
  start-page: 3
  year: 1997
  end-page: 20
  ident: b163
  article-title: Primal–dual approximation algorithms for integral flow and multicut in trees
  publication-title: Algorithmica
– year: 2007
  ident: b20
  article-title: Logic, graphs, and algorithms
  publication-title: Logic and Automata—History and Perspectives
– volume: 109
  start-page: 918
  year: 2009
  end-page: 922
  ident: b287
  article-title: Rotation distance is fixed-parameter tractable
  publication-title: Inform. Process. Lett.
– volume: 60
  start-page: 72
  year: 1994
  end-page: 106
  ident: b97
  article-title: Graph minors. XI. Circuits on a surface
  publication-title: J. Combin. Theory Ser. B
– volume: vol. 83
  start-page: 6:1
  year: 2017
  end-page: 6:14
  ident: b217
  article-title: Parameterized algorithms for partitioning graphs into highly connected clusters
  publication-title: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science
– volume: 168
  year: 2021
  ident: b139
  article-title: Faster parameterized algorithm for bicluster editing
  publication-title: Inform. Process. Lett.
– volume: 82
  start-page: 2135
  year: 2020
  end-page: 2155
  ident: b161
  article-title: Multi-budgeted directed cuts
  publication-title: Algorithmica
– volume: 81
  start-page: 917
  year: 2019
  end-page: 966
  ident: b103
  article-title: Edge bipartization faster than
  publication-title: Algorithmica
– volume: 76
  start-page: 1181
  year: 2016
  end-page: 1202
  ident: b193
  article-title: On the computational complexity of vertex integrity and component order connectivity
  publication-title: Algorithmica
– volume: 27
  start-page: 2143
  year: 2013
  end-page: 2156
  ident: b15
  article-title: Obtaining a bipartite graph by contracting few edges
  publication-title: SIAM J. Discrete Math.
– volume: 75
  start-page: 118
  year: 2016
  end-page: 137
  ident: b78
  article-title: Chordal editing is fixed-parameter tractable
  publication-title: Algorithmica
– volume: 92
  start-page: 325
  year: 2004
  end-page: 357
  ident: b96
  article-title: Graph minors. XX. Wagner’s conjecture
  publication-title: J. Combin. Theory Ser. B
– volume: 29
  start-page: 1961
  year: 2015
  end-page: 1987
  ident: b124
  article-title: A subexponential parameterized algorithm for proper interval completion
  publication-title: SIAM J. Discrete Math.
– volume: 4
  start-page: 38
  year: 2014
  end-page: 59
  ident: b125
  article-title: Graph modification problems (Dagstuhl Seminar 14071)
  publication-title: Dagstuhl Rep.
– start-page: 219
  year: 1968
  end-page: 230
  ident: b277
  article-title: Eulerian lines in finite
  publication-title: Proceedings of the Tihany Theory of Graphs Colloquium
– start-page: 382
  year: 2007
  end-page: 390
  ident: b26
  article-title: Computing crossing number in linear time
  publication-title: Proceedings of the 39th Annual ACM Symposium on Theory of Computing
– start-page: 160
  year: 2011
  end-page: 169
  ident: b188
  article-title: The minimum
  publication-title: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science
– volume: 11
  start-page: 21:1
  year: 2015
  end-page: 21:35
  ident: b85
  article-title: Interval deletion is fixed-parameter tractable
  publication-title: ACM Trans. Algorithms
– volume: 84
  start-page: 1441
  year: 2022
  end-page: 1465
  ident: b177
  article-title: Metric violation distance: Hardness and approximation
  publication-title: Algorithmica
– volume: 12
  start-page: 895
  year: 2013
  end-page: 910
  ident: b194
  article-title: A survey of component order connectivity models of graph theoretic networks
  publication-title: WSEAS Trans. Math.
– volume: vol. 13270
  start-page: 214
  year: 2022
  end-page: 227
  ident: b222
  article-title: A new temporal interpretation of cluster editing
  publication-title: Proceedings of the 33rd International Workshop on Combinatorial Algorithms
– volume: 82
  start-page: 1020
  year: 2016
  end-page: 1043
  ident: b170
  article-title: Parameterized complexity dichotomy for Steiner Multicut
  publication-title: J. Comput. System Sci.
– volume: 82
  start-page: 853
  year: 2020
  end-page: 880
  ident: b295
  article-title: On the relation of strong triadic closure and cluster deletion
  publication-title: Algorithmica
– volume: 1
  start-page: 13
  year: 1987
  end-page: 22
  ident: b197
  article-title: Vulnerability in graphs — a comparative survey
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 4
  year: 2012
  ident: b57
  article-title: Bounded search tree algorithms for parametrized cograph deletion: Efficient branching rules by exploiting structures of special graph classes
  publication-title: Discrete Math. Algorithms Appl.
– volume: 7
  start-page: 14:1
  year: 2015
  end-page: 14:38
  ident: b31
  article-title: Exploring the subexponential complexity of completion problems
  publication-title: ACM Trans. Comput. Theory
– volume: 77
  start-page: 259
  year: 1997
  end-page: 270
  ident: b200
  article-title: Measuring the vulnerability for classes of intersection graphs
  publication-title: Discrete Appl. Math.
– volume: 154
  start-page: 1824
  year: 2006
  end-page: 1844
  ident: b3
  article-title: NP-completeness results for edge modification problems
  publication-title: Discrete Appl. Math.
– volume: 72
  start-page: 1386
  year: 2006
  end-page: 1396
  ident: b102
  article-title: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
  publication-title: J. Comput. System Sci.
– volume: 83
  start-page: 1677
  year: 2021
  end-page: 1706
  ident: b191
  article-title: Finding cuts of bounded degree: Complexity, FPT and exact algorithms, and kernelization
  publication-title: Algorithmica
– volume: 32
  start-page: 2258
  year: 2018
  end-page: 2301
  ident: b77
  article-title: Approximation and kernelization for chordal vertex deletion
  publication-title: SIAM J. Discrete Math.
– volume: 5
  start-page: 25
  year: 1992
  end-page: 53
  ident: b203
  article-title: Augmenting graphs to meet edge-connectivity requirements
  publication-title: SIAM J. Discrete Math.
– year: 1999
  ident: b25
  article-title: Graph classes. A survey
  publication-title: SIAM Monographs on Discrete Mathematics and Applications
– volume: 160
  start-page: 2259
  year: 2012
  end-page: 2270
  ident: b118
  article-title: Cluster editing with locally bounded modifications
  publication-title: Discrete Appl. Math.
– volume: vol. 101
  start-page: 21:1
  year: 2018
  end-page: 21:13
  ident: b280
  article-title: Partial complementation of graphs
  publication-title: Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory
– volume: 222
  start-page: 278
  year: 2013
  end-page: 292
  ident: b180
  article-title: Clustering with local restrictions
  publication-title: Inform. and Comput.
– volume: vol. 7285
  start-page: 235
  year: 2012
  end-page: 246
  ident: b213
  article-title: On editing graphs into
  publication-title: Proceedings of Joint International Conference Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW-AAIM)
– volume: 33
  start-page: 795
  year: 2019
  end-page: 836
  ident: b238
  article-title: Editing to connected
  publication-title: SIAM J. Discrete Math.
– volume: 23
  year: 2021
  ident: b297
  article-title: Destroying bicolored
  publication-title: Discrete Math. Theor. Comput. Sci.
– volume: 64
  start-page: 251
  year: 2020
  end-page: 271
  ident: b299
  article-title: On the parameterized complexity of graph modification to first-order logic properties
  publication-title: Theory Comput. Syst.
– volume: 15
  start-page: 295
  year: 2012
  end-page: 309
  ident: b253
  article-title: On Eulerian extensions and their application to no-wait flowshop scheduling
  publication-title: J. Sched.
– volume: 163
  start-page: 319
  year: 1997
  end-page: 324
  ident: b228
  article-title: On locating cubic subgraphs in bounded-degree connected bipartite graphs
  publication-title: Discrete Math.
– volume: 97
  start-page: 1
  year: 2018
  end-page: 13
  ident: b250
  article-title: Finding even subgraphs even faster
  publication-title: J. Comput. System Sci.
– volume: 167
  year: 2021
  ident: b51
  article-title: Kernel for
  publication-title: Inform. Process. Lett.
– volume: 84
  start-page: 197
  year: 2022
  end-page: 215
  ident: b50
  article-title: A polynomial kernel for diamond-free editing
  publication-title: Algorithmica
– volume: 18
  start-page: 557
  year: 2014
  end-page: 576
  ident: b121
  article-title: Editing simple graphs
  publication-title: J. Graph Algorithms Appl.
– volume: vol. 180
  start-page: 10:1
  year: 2020
  end-page: 10:15
  ident: b48
  article-title: A polynomial kernel for paw-free editing
  publication-title: Proceedings of the 15th International Symposium on Parameterized and Exact Computation
– volume: 11
  start-page: 28
  year: 2015
  ident: b159
  article-title: Directed subset feedback vertex set is fixed-parameter tractable
  publication-title: ACM Trans. Algorithms
– reference: Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström, Directed flow-augmentation, in: Proceedings of the 54th Annual ACM Symposium on Theory of Computing (STOC), 2022, pp. 938–947.
– volume: 1
  start-page: 79
  year: 1977
  end-page: 84
  ident: b243
  article-title: The spanning subgraphs of Eulerian graphs
  publication-title: J. Graph Theory
– volume: 10
  start-page: 1
  year: 2018
  end-page: 18
  ident: b167
  article-title: Directed multicut is W[1]-hard, even for four terminal pairs
  publication-title: ACM Trans. Comput. Theory
– volume: 24
  start-page: 1662
  year: 2010
  end-page: 1683
  ident: b36
  article-title: A more relaxed model for graph-based data clustering:
  publication-title: SIAM J. Discrete Math.
– volume: 11
  start-page: 27
  year: 2015
  ident: b208
  article-title: Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation
  publication-title: ACM Trans. Algorithms
– volume: 63
  start-page: 44:1
  year: 2016
  end-page: 44:69
  ident: b242
  article-title: (Meta) kernelization
  publication-title: J. ACM
– volume: vol. 4835
  start-page: 915
  year: 2007
  end-page: 926
  ident: b53
  article-title: Problem kernels for NP-complete edge deletion problems: Split and related graphs
  publication-title: Proceedings of the 18th International Symposium on Algorithms and Computation
– volume: 16
  start-page: 79
  year: 2012
  end-page: 89
  ident: b67
  article-title: A golden ratio parameterized algorithm for cluster editing
  publication-title: J. Discrete Algorithms
– volume: 607
  start-page: 16
  year: 2015
  end-page: 34
  ident: b261
  article-title: The complexity of degree anonymization by vertex addition
  publication-title: Theoret. Comput. Sci.
– volume: vol. 187
  start-page: 49:1
  year: 2021
  end-page: 49:16
  ident: b69
  article-title: Cluster editing parameterized above modification-disjoint
  publication-title: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science
– volume: 13
  start-page: 19
  year: 2011
  end-page: 44
  ident: b276
  article-title: Parameterized problems related to Seidel’s switching
  publication-title: Discrete Math. Theor. Comput. Sci.
– volume: 60
  start-page: 615
  year: 2017
  end-page: 636
  ident: b42
  article-title: Polynomial kernelization for removing induced claws and diamonds
  publication-title: Theory Comput. Syst.
– volume: 113
  start-page: 150
  year: 2020
  end-page: 162
  ident: b215
  article-title: Subexponential algorithm for
  publication-title: J. Comput. System Sci.
– volume: vol. 8635
  start-page: 469
  year: 2014
  end-page: 480
  ident: b127
  article-title: On the clique editing problem
  publication-title: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science
– year: 1979
  ident: b225
  publication-title: Computers and Intractability: A Guide To the Theory of NP-Completeness
– volume: 3
  start-page: 165
  year: 2006
  end-page: 173
  ident: b135
  article-title: Minimum-flip supertrees: Complexity and algorithms
  publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform.
– volume: 71
  start-page: 989
  year: 2015
  end-page: 1006
  ident: b72
  article-title: Faster parameterized algorithms for deletion to split graphs
  publication-title: Algorithmica
– volume: 231
  start-page: 89
  year: 2013
  end-page: 108
  ident: b37
  article-title: Polynomial kernels for proper interval completion and related problems
  publication-title: Inform. and Comput.
– volume: vol. 123
  start-page: 24:1
  year: 2018
  end-page: 24:13
  ident: b221
  article-title: Cluster editing in multi-layer and temporal graphs
  publication-title: Proceedings of the 29th International Symposium on Algorithms and Computation
– volume: 8
  start-page: 399
  year: 1956
  end-page: 404
  ident: b148
  article-title: Maximal flow through a network
  publication-title: Canad. J. Math.
– volume: 77
  start-page: 1071
  year: 2011
  end-page: 1078
  ident: b113
  article-title: Kernels for feedback arc set in tournaments
  publication-title: J. Comput. System Sci.
– volume: 86
  start-page: 191
  year: 2017
  end-page: 206
  ident: b184
  article-title: Parameterized algorithms for min–max multiway cut and list digraph homomorphism
  publication-title: J. Comput. System Sci.
– volume: 573
  start-page: 63
  year: 2015
  end-page: 70
  ident: b71
  article-title: Edge deletion problems: Branching facilitated by modular decomposition
  publication-title: Theoret. Comput. Sci.
– volume: 76
  start-page: 401
  year: 2016
  end-page: 425
  ident: b211
  article-title: Planar disjoint-paths completion
  publication-title: Algorithmica
– volume: vol. 8165
  start-page: 76
  year: 2013
  end-page: 87
  ident: b183
  article-title: On the parameterized complexity of computing graph bisections
  publication-title: Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science
– volume: 25
  start-page: 695
  year: 2011
  end-page: 718
  ident: b204
  article-title: Augmenting undirected node-connectivity by one
  publication-title: SIAM J. Discrete Math.
– start-page: 1096
  year: 2016
  end-page: 1115
  ident: b82
  article-title: Linear recognition of almost interval graphs
  publication-title: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms
– volume: 126
  start-page: 83
  year: 2003
  end-page: 113
  ident: b206
  article-title: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
  publication-title: Discrete Appl. Math.
– volume: 71
  start-page: 731
  year: 2015
  end-page: 757
  ident: b52
  article-title: Incompressibility of
  publication-title: Algorithmica
– volume: 622
  start-page: 90
  year: 2016
  end-page: 110
  ident: b258
  article-title: Finding large degree-anonymous subgraphs is hard
  publication-title: Theoret. Comput. Sci.
– volume: vol. 8572
  start-page: 800
  year: 2014
  end-page: 811
  ident: b209
  article-title: Parameterized algorithms to preserve connectivity
  publication-title: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming
– volume: 11
  start-page: 303
  year: 1992
  end-page: 308
  ident: b267
  article-title: On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems
  publication-title: Oper. Res. Lett.
– volume: 22
  start-page: 177
  year: 2018
  end-page: 191
  ident: b176
  article-title: On algorithms employing treewidth for
  publication-title: J. Graph Algorithms Appl.
– volume: vol. 8939
  start-page: 254
  year: 2015
  end-page: 265
  ident: b210
  article-title: Finding highly connected subgraphs
  publication-title: Proceedings of the Conference on Current Trends in Theory and Practice of Computer Science
– year: 2019
  ident: b239
  article-title: Complexity of edge editing to a connected graph of bounded degrees
– volume: vol. 173
  year: 2012
  ident: b246
  article-title: Graph theory
  publication-title: Graduate Texts in Mathematics
– volume: 64
  start-page: 152
  year: 2012
  end-page: 169
  ident: b45
  article-title: Cluster editing: Kernelization based on edge cuts
  publication-title: Algorithmica
– volume: 79
  start-page: 139
  year: 2017
  end-page: 158
  ident: b231
  article-title: Fixed-parameter tractable distances to sparse graph classes
  publication-title: Algorithmica
– volume: 35
  start-page: 96
  year: 1987
  end-page: 144
  ident: b201
  article-title: Edge-connectivity augmentation problems
  publication-title: J. Comput. System Sci.
– volume: 410
  start-page: 5467
  year: 2009
  end-page: 5480
  ident: b219
  article-title: Going weighted: Parameterized algorithms for cluster editing
  publication-title: Theoret. Comput. Sci.
– volume: 82
  start-page: 2006
  year: 2020
  end-page: 2038
  ident: b294
  article-title: Parameterized aspects of strong subgraph closure
  publication-title: Algorithmica
– volume: 31
  start-page: 212
  year: 2001
  end-page: 232
  ident: b115
  article-title: Treewidth and minimum fill-in: Grouping the minimal separators
  publication-title: SIAM J. Comput.
– volume: 78
  start-page: 179
  year: 2012
  end-page: 191
  ident: b224
  article-title: Editing graphs to satisfy degree constraints: A parameterized approach
  publication-title: J. Comput. System Sci.
– volume: 2–17
  start-page: 369
  year: 1978
  end-page: 374
  ident: b162
  article-title: A minimax theorem for directed graphs
  publication-title: J. Lond. Math. Soc.
– volume: 84
  start-page: 179
  year: 1991
  end-page: 197
  ident: b237
  article-title: Optimal covering of cacti by vertex-disjoint paths
  publication-title: Theoret. Comput. Sci.
– volume: 124
  start-page: 1
  year: 2022
  end-page: 25
  ident: b38
  article-title: On the threshold of intractability
  publication-title: J. Comput. System Sci.
– volume: 21
  start-page: 375
  year: 2000
  end-page: 395
  ident: b126
  article-title: Models of core/periphery structures
  publication-title: Social Networks
– volume: 43
  start-page: 355
  year: 2014
  end-page: 388
  ident: b166
  article-title: Fixed-parameter tractability of multicut parameterized by the size of the cutset
  publication-title: SIAM J. Comput.
– volume: vol. 4978
  start-page: 445
  year: 2008
  end-page: 456
  ident: b138
  article-title: Improved algorithms for bicluster editing
  publication-title: Proceedings of Theory and Applications of Models of Computation
– volume: 158
  start-page: 1732
  year: 2010
  end-page: 1744
  ident: b89
  article-title: Polynomial kernels for
  publication-title: Discrete Appl. Math.
– volume: 10
  start-page: 20
  year: 2014
  ident: b104
  article-title: Compression via matroids: A randomized polynomial kernel for odd cycle transversal
  publication-title: ACM Trans. Algorithms
– volume: 126
  start-page: 21
  year: 2022
  end-page: 43
  ident: b175
  article-title: Length-bounded cuts: Proper interval graphs and structural parameters
  publication-title: J. Comput. System Sci.
– year: 2012
  ident: b29
  article-title: Polynomial kernelisation of
– volume: 42
  start-page: 60
  year: 2009
  end-page: 80
  ident: b283
  article-title: Flips in planar graphs
  publication-title: Comput. Geom.
– start-page: 641
  year: 2008
  end-page: 650
  ident: b98
  article-title: Computing excluded minors
  publication-title: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms
– volume: 68
  start-page: 81
  year: 2014
  end-page: 108
  ident: b137
  article-title: A cubic-vertex kernel for flip consensus tree
  publication-title: Algorithmica
– volume: 38
  start-page: 373
  year: 2005
  end-page: 392
  ident: b64
  article-title: Graph-modeled data clustering: Exact algorithms for clique generation
  publication-title: Theory Comput. Syst.
– volume: 78
  start-page: 110
  year: 2017
  end-page: 146
  ident: b185
  article-title: List
  publication-title: Algorithmica
– volume: 52
  start-page: 866
  year: 2005
  end-page: 893
  ident: b109
  article-title: Subexponential parameterized algorithms on bounded-genus graphs and
  publication-title: J. ACM
– volume: 10
  start-page: 9:1
  year: 2018
  end-page: 9:32
  ident: b132
  article-title: Hardness of approximation for
  publication-title: ACM Trans. Comput. Theory
– volume: 30
  start-page: 1067
  year: 2000
  end-page: 1079
  ident: b75
  article-title: A polynomial approximation algorithm for the minimum fill-in problem
  publication-title: SIAM J. Comput.
– volume: 28
  start-page: 1906
  year: 1999
  end-page: 1922
  ident: b74
  article-title: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs
  publication-title: SIAM J. Comput.
– year: 2008
  ident: b110
  article-title: Open problems in parameterized and exact computation from IWPEC 2008
– volume: 511
  start-page: 172
  year: 2013
  end-page: 180
  ident: b107
  article-title: Parameterized complexity of vertex deletion into perfect graph classes
  publication-title: Theoret. Comput. Sci.
– volume: vol. 10846
  start-page: 78
  year: 2018
  end-page: 89
  ident: b266
  article-title: Can we create large
  publication-title: Proceedings of the 13th International Computer Science Symposium in Russia (CSR)
– volume: 276
  start-page: 17
  year: 2002
  end-page: 32
  ident: b116
  article-title: Listing all potential maximal cliques of a graph
  publication-title: Theoret. Comput. Sci.
– volume: 20
  start-page: 151
  year: 1998
  end-page: 174
  ident: b158
  article-title: Approximating minimum feedback sets and multicuts in directed graphs
  publication-title: Algorithmica
– volume: 101
  start-page: 1
  year: 2019
  end-page: 20
  ident: b212
  article-title: Path-contractions, edge deletions and connectivity preservation
  publication-title: J. Comput. System Sci.
– volume: 42
  start-page: 1674
  year: 2013
  end-page: 1696
  ident: b156
  article-title: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
  publication-title: SIAM J. Comput.
– volume: 46
  start-page: 124
  year: 2005
  end-page: 135
  ident: b164
  article-title: Fixed-parameter tractability and data reduction for multicut in trees
  publication-title: Networks
– volume: 16
  start-page: 65
  year: 1994
  end-page: 73
  ident: b192
  article-title: Computational complexity of weighted integrity
  publication-title: J. Combin. Math. Combin. Comput.
– year: 2009
  ident: b229
  article-title: The Parameterized Complexity of Degree Constrained Editing Problems
– volume: 82
  start-page: 213
  year: 2016
  end-page: 228
  ident: b247
  article-title: Editing to Eulerian graphs
  publication-title: J. Comput. System Sci.
– volume: 76
  start-page: 524
  year: 2010
  end-page: 531
  ident: b35
  article-title: A kernelization algorithm for
  publication-title: J. Comput. System Sci.
– volume: vol. 87
  start-page: 161
  year: 1992
  end-page: 178
  ident: b17
  article-title: Fixed-parameter tractability and completeness
  publication-title: Proceedings of the 21st Manitoba Conference on Numerical Mathematics and Computing
– volume: 410
  start-page: 718
  year: 2009
  end-page: 726
  ident: b65
  article-title: A more effective linear kernelization for cluster editing
  publication-title: Theoret. Comput. Sci.
– year: 2003
  ident: b101
  article-title: On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems
  publication-title: Diplomarbeit
– volume: 111
  start-page: 717
  year: 2011
  end-page: 721
  ident: b66
  article-title: Even faster parameterized cluster deletion and cluster editing
  publication-title: Inform. Process. Lett.
– volume: 61
  start-page: 817
  year: 2011
  end-page: 838
  ident: b114
  article-title: Faster parameterized algorithms for minimum fill-in
  publication-title: Algorithmica
– volume: 48
  start-page: 1184
  year: 2001
  end-page: 1206
  ident: b230
  article-title: Deciding first-order properties of locally tree-decomposable structures
  publication-title: J. ACM
– volume: 29
  start-page: 122
  year: 2015
  end-page: 144
  ident: b168
  article-title: Fixed-parameter tractability of multicut in directed acyclic graphs
  publication-title: SIAM J. Discrete Math.
– volume: 81
  start-page: 1584
  year: 2019
  end-page: 1614
  ident: b240
  article-title: A parameterized algorithmics framework for degree sequence completion problems in directed graphs
  publication-title: Algorithmica
– volume: 16
  start-page: 12
  year: 2012
  end-page: 33
  ident: b255
  article-title: A new view on rural postman based on Eulerian extension and matching
  publication-title: J. Discrete Algorithms
– volume: 154
  start-page: 173
  year: 2015
  end-page: 196
  ident: b147
  article-title: Finding small stabilizers for unstable graphs
  publication-title: Math. Program.
– volume: 56
  start-page: 131
  year: 2010
  end-page: 142
  ident: b207
  article-title: Kernelization and complexity results for connectivity augmentation problems
  publication-title: Networks
– volume: 253
  start-page: 109
  year: 2017
  end-page: 126
  ident: b131
  article-title: Unit interval editing is fixed-parameter tractable
  publication-title: Inform. and Comput.
– volume: 112
  start-page: 249
  year: 2012
  end-page: 251
  ident: b252
  article-title: Parameterized Eulerian strong component arc deletion problem on tournaments
  publication-title: Inform. Process. Lett.
– volume: 8
  start-page: 76
  year: 2010
  end-page: 86
  ident: b112
  article-title: Fixed-parameter tractability results for feedback set problems in tournaments
  publication-title: J. Discrete Algorithms
– volume: 5
  start-page: 269
  year: 1983
  end-page: 287
  ident: b265
  article-title: Network structure and minimum degree
  publication-title: Social Networks
– volume: 65
  start-page: 900
  year: 2013
  end-page: 926
  ident: b28
  article-title: On the (non-)existence of polynomial kernels for
  publication-title: Algorithmica
– volume: vol. 148
  start-page: 8:1
  year: 2019
  end-page: 8:20
  ident: b169
  article-title: FPT inapproximability of directed cut and connectivity problems
  publication-title: Proceedings of the 14th International Symposium on Parameterized and Exact Computation
– volume: 5
  start-page: 653
  year: 1976
  end-page: 665
  ident: b7
  article-title: Augmentation problems
  publication-title: SIAM J. Comput.
– volume: 32
  start-page: 2612
  year: 2018
  end-page: 2635
  ident: b281
  article-title: Structured connectivity augmentation
  publication-title: SIAM J. Discrete Math.
– volume: 83
  start-page: 2096
  year: 2021
  end-page: 2141
  ident: b95
  article-title: A polynomial kernel for distance-hereditary vertex deletion
  publication-title: Algorithmica
– volume: 8
  year: 2012
  ident: b136
  article-title: Improved fixed-parameter algorithms for minimum-flip consensus trees
  publication-title: ACM Trans. Algorithms
– volume: 23
  start-page: 864
  year: 1994
  end-page: 894
  ident: b149
  article-title: The complexity of multiterminal cuts
  publication-title: SIAM J. Comput.
– volume: vol. 31
  year: 2006
  ident: b21
  article-title: Invitation to fixed-parameter algorithms
  publication-title: Oxford Lecture Series in Mathematics and Its Applications
– year: 2013
  ident: b19
  article-title: Fundamentals of Parameterized Complexity. Texts in Computer Science
– volume: 47
  start-page: 589
  year: 2014
  end-page: 604
  ident: b285
  article-title: Flip distance between triangulations of a planar point set is APX-hard
  publication-title: Comput. Geom.
– volume: 62
  start-page: 739
  year: 2018
  end-page: 770
  ident: b68
  article-title: Parameterizing edge modification problems above lower bounds
  publication-title: Theory Comput. Syst.
– volume: 95
  start-page: 79
  year: 2005
  end-page: 100
  ident: b278
  article-title: Rank-width and vertex-minors
  publication-title: J. Combin. Theory Ser. B
– volume: 1
  start-page: 647
  year: 1988
  end-page: 681
  ident: b288
  article-title: Rotation distance, triangulations, and hyperbolic geometry
  publication-title: AMS J. Am. Math. Soc.
– volume: 42
  start-page: 69
  year: 2002
  end-page: 108
  ident: b87
  article-title: On graph powers for leaf-labeled trees
  publication-title: J. Algorithms
– volume: 271
  year: 2020
  ident: b130
  article-title: Minimum fill-in: Inapproximability and almost tight lower bounds
  publication-title: Inform. and Comput.
– volume: 2
  start-page: 570
  year: 1996
  end-page: 579
  ident: b286
  article-title: The edge-flipping distance of triangulations
  publication-title: J. UCS
– volume: vol. 7370
  start-page: 469
  year: 2012
  end-page: 496
  ident: b108
  article-title: What’s next? Future directions in parameterized complexity
  publication-title: The Multivariate Algorithmic Revolution and beyond — Essays Dedicated To Michael R. Fellows on the Occasion of His 60th Birthday
– volume: 591
  start-page: 72
  year: 2015
  end-page: 84
  ident: b232
  article-title: Editing to a graph of given degrees
  publication-title: Theoret. Comput. Sci.
– year: 2013
  ident: b145
  article-title: Open problems from Update Meeting on Graph Separation Problems. Graph Cuts
– volume: 63
  start-page: 65
  year: 1995
  end-page: 110
  ident: b271
  article-title: Graph minors. XIII. The disjoint paths problem
  publication-title: J. Combin. Theory Ser. B
– volume: 44
  start-page: 193
  year: 2002
  end-page: 204
  ident: b236
  article-title: Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
  publication-title: ANZIAM J.
– volume: 85
  start-page: 168
  year: 2017
  end-page: 182
  ident: b234
  article-title: Editing to a planar graph of given degrees
  publication-title: J. Comput. System Sci.
– volume: 256
  start-page: 212
  year: 2017
  end-page: 225
  ident: b262
  article-title: The complexity of degree anonymization by graph contractions
  publication-title: Inform. and Comput.
– volume: 78
  start-page: 209
  year: 2003
  end-page: 222
  ident: b187
  article-title: Cutting up is hard to do: the parameterised complexity of
  publication-title: Electron. Notes Theor. Comput. Sci.
– volume: 32
  start-page: 51
  year: 2009
  end-page: 58
  ident: b46
  article-title: On generating triangle-free graphs
  publication-title: Electron. Notes Discrete Math.
– volume: 351
  start-page: 394
  year: 2006
  end-page: 406
  ident: b150
  article-title: Parameterized graph separation problems
  publication-title: Theoret. Comput. Sci.
– volume: 256
  start-page: 131
  year: 2017
  end-page: 147
  ident: b235
  article-title: Editing to a connected graph of given degrees
  publication-title: Inform. and Comput.
– volume: 10
  start-page: 277
  year: 1986
  end-page: 297
  ident: b244
  article-title: An Eulerian exposition
  publication-title: J. Graph Theory
– year: 2015
  ident: b43
  article-title: Parameterized Graph Modification Algorithms
– volume: 665
  start-page: 1
  year: 2017
  end-page: 12
  ident: b263
  article-title: Graph editing to a given degree sequence
  publication-title: Theoret. Comput. Sci.
– volume: vol. 214
  start-page: 17:1
  year: 2021
  end-page: 17:16
  ident: b92
  article-title: Polynomial kernels for strictly chordal edge modification problems
  publication-title: Proceedings of the 16th International Symposium on Parameterized and Exact Computation
– volume: 14
  start-page: 35:1
  year: 2018
  end-page: 35:62
  ident: b83
  article-title: Subexponential parameterized algorithm for interval completion
  publication-title: ACM Trans. Algorithms
– volume: 654
  start-page: 70
  year: 2016
  end-page: 79
  ident: b128
  article-title: Reducing rank of the adjacency matrix by graph modification
  publication-title: Theoret. Comput. Sci.
– volume: 48
  start-page: 417
  year: 2019
  end-page: 450
  ident: b182
  article-title: Minimum bisection is fixed-parameter tractable
  publication-title: SIAM J. Comput.
– volume: 144
  start-page: 173
  year: 2004
  end-page: 182
  ident: b8
  article-title: Cluster graph modification problems
  publication-title: Discrete Appl. Math.
– volume: 80
  start-page: 3481
  year: 2018
  end-page: 3524
  ident: b32
  article-title: A polynomial kernel for trivially perfect editing
  publication-title: Algorithmica
– volume: 31
  start-page: 542
  year: 2017
  end-page: 561
  ident: b122
  article-title: Dichotomy results on the hardness of
  publication-title: SIAM J. Discrete Math.
– volume: 27
  start-page: 75
  year: 2013
  end-page: 94
  ident: b245
  article-title: Efficient algorithms for Eulerian extension and rural postman
  publication-title: SIAM J. Discrete Math.
– volume: 19
  start-page: 346
  year: 2014
  end-page: 357
  ident: b34
  article-title: An overview of kernelization algorithms for graph modification problems
  publication-title: Tsinghua Sci. Technol.
– volume: 73
  start-page: 23
  year: 2019
  end-page: 37
  ident: b174
  article-title: A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
  publication-title: Networks
– volume: 9
  start-page: 1
  year: 2020
  end-page: 24
  ident: b134
  article-title: Diminishable parameterized problems and strict polynomial kernelization
  publication-title: Computability
– volume: 16
  start-page: 1
  year: 2020
  end-page: 31
  ident: b120
  article-title: Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
  publication-title: ACM Trans. Algorithms
– volume: 161
  start-page: 1626
  year: 2013
  end-page: 1631
  ident: b268
  article-title: The parametric complexity of graph diameter augmentation
  publication-title: Discrete Appl. Math.
– volume: vol. 51
  start-page: 161
  year: 1992
  end-page: 166
  ident: b275
  article-title: On the computational complexity of seidel’s switching
  publication-title: Proceedings of the 4th Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
– start-page: 275
  year: 1981
  end-page: 284
  ident: b9
  article-title: The splittance of a graph
  publication-title: Combinatorica
– volume: 114
  start-page: 167
  issue: 4
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b152
  article-title: An O∗(1.84k) parameterized algorithm for the multiterminal cut problem
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2013.12.001
– volume: vol. 8939
  start-page: 254
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b210
  article-title: Finding highly connected subgraphs
– volume: 222
  start-page: 278
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b180
  article-title: Clustering with local restrictions
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2012.10.016
– volume: 11
  start-page: 455
  issue: 3
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b216
  article-title: Partitioning biological networks into highly connected clusters with maximum edge coverage
  publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform.
  doi: 10.1109/TCBB.2013.177
– volume: vol. 43
  start-page: 365
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b49
  article-title: Parameterized lower bound and improved kernel for diamond-free edge deletion
– volume: vol. 9472
  start-page: 259
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b279
  article-title: Minimum degree up to local complementation: Bounds, parameterized complexity, and exact algorithms
– volume: 75
  start-page: 118
  issue: 1
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b78
  article-title: Chordal editing is fixed-parameter tractable
  publication-title: Algorithmica
  doi: 10.1007/s00453-015-0014-x
– volume: 167
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b51
  article-title: Kernel for Kt-free edge deletion
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2020.106082
– volume: 84
  start-page: 179
  issue: 2
  year: 1991
  ident: 10.1016/j.cosrev.2023.100556_b237
  article-title: Optimal covering of cacti by vertex-disjoint paths
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(91)90159-Y
– volume: 48
  start-page: 803
  issue: 4
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b133
  article-title: Lower bounds for kernelizations and other preprocessing procedures
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-010-9270-y
– volume: 161
  start-page: 1626
  issue: 10–11
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b268
  article-title: The parametric complexity of graph diameter augmentation
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2013.01.016
– volume: 84
  start-page: 197
  issue: 1
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b50
  article-title: A polynomial kernel for diamond-free editing
  publication-title: Algorithmica
  doi: 10.1007/s00453-021-00891-y
– volume: 58
  start-page: 171
  issue: 4
  year: 1996
  ident: 10.1016/j.cosrev.2023.100556_b33
  article-title: Fixed-parameter tractability of graph modification problems for hereditary properties
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(96)00050-6
– volume: 33
  start-page: 795
  issue: 2
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b238
  article-title: Editing to connected F-degree graph
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/17M1129428
– volume: 92
  start-page: 325
  issue: 2
  year: 2004
  ident: 10.1016/j.cosrev.2023.100556_b96
  article-title: Graph minors. XX. Wagner’s conjecture
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/j.jctb.2004.08.001
– volume: 351
  start-page: 394
  issue: 3
  year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b150
  article-title: Parameterized graph separation problems
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2005.10.007
– volume: 84
  start-page: 1441
  issue: 5
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b177
  article-title: Metric violation distance: Hardness and approximation
  publication-title: Algorithmica
  doi: 10.1007/s00453-022-00940-0
– volume: 95
  start-page: 79
  issue: 1
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b278
  article-title: Rank-width and vertex-minors
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/j.jctb.2005.03.003
– volume: 11
  start-page: 15
  issue: 2
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b144
  article-title: Faster parameterized algorithms using linear programming
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2566616
– volume: 410
  start-page: 718
  issue: 8–10
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b65
  article-title: A more effective linear kernelization for cluster editing
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2008.10.021
– volume: vol. 4639
  start-page: 312
  year: 2007
  ident: 10.1016/j.cosrev.2023.100556_b55
  article-title: Efficient parameterized preprocessing for cluster editing
– volume: 276
  start-page: 17
  issue: 1–2
  year: 2002
  ident: 10.1016/j.cosrev.2023.100556_b116
  article-title: Listing all potential maximal cliques of a graph
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00007-X
– volume: 45
  start-page: 26
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b214
  article-title: On the complexity of multi-parameterized cluster editing
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2017.07.003
– volume: 35
  start-page: 439
  issue: 3
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b73
  article-title: Familial groups in social networks
  publication-title: Social Networks
  doi: 10.1016/j.socnet.2013.05.001
– volume: 76
  start-page: 401
  issue: 2
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b211
  article-title: Planar disjoint-paths completion
  publication-title: Algorithmica
  doi: 10.1007/s00453-015-0046-2
– volume: 82
  start-page: 853
  issue: 4
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b295
  article-title: On the relation of strong triadic closure and cluster deletion
  publication-title: Algorithmica
  doi: 10.1007/s00453-019-00617-1
– volume: vol. 5555
  start-page: 49
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b111
  article-title: Fast FAST
– volume: 796
  start-page: 207
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b146
  article-title: Tractability of Kőnig edge deletion problems
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2019.09.011
– volume: 4
  start-page: 38
  issue: 2
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b125
  article-title: Graph modification problems (Dagstuhl Seminar 14071)
  publication-title: Dagstuhl Rep.
– volume: 8
  issue: 1
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b136
  article-title: Improved fixed-parameter algorithms for minimum-flip consensus trees
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2071379.2071386
– volume: 111
  start-page: 717
  issue: 14
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b66
  article-title: Even faster parameterized cluster deletion and cluster editing
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2011.05.003
– volume: 108
  start-page: 23
  issue: 1–2
  year: 2001
  ident: 10.1016/j.cosrev.2023.100556_b94
  article-title: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(00)00221-3
– volume: 84
  start-page: 3338
  issue: 11
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b39
  article-title: (Sub)linear kernels for edge modification problems toward structured graph classes
  publication-title: Algorithmica
  doi: 10.1007/s00453-022-00969-1
– volume: 79
  start-page: 139
  issue: 1
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b231
  article-title: Fixed-parameter tractable distances to sparse graph classes
  publication-title: Algorithmica
  doi: 10.1007/s00453-016-0235-7
– volume: 23
  issue: 1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b297
  article-title: Destroying bicolored P3s by deleting few edges
  publication-title: Discrete Math. Theor. Comput. Sci.
– volume: vol. 115
  start-page: 25:1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b272
  article-title: A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
– year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b60
– volume: 16
  start-page: 1
  issue: 2
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b120
  article-title: Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/3381426
– volume: 76
  start-page: 1181
  issue: 4
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b193
  article-title: On the computational complexity of vertex integrity and component order connectivity
  publication-title: Algorithmica
  doi: 10.1007/s00453-016-0127-x
– volume: 127
  start-page: 415
  issue: 3
  year: 2003
  ident: 10.1016/j.cosrev.2023.100556_b16
  article-title: Parameterized complexity of vertex colouring
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(02)00242-1
– volume: vol. 7921
  start-page: 33
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b63
  article-title: Cluster editing
– volume: 16
  start-page: 79
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b67
  article-title: A golden ratio parameterized algorithm for cluster editing
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2012.04.005
– volume: 283
  start-page: 44
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b190
  article-title: Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2019.12.010
– volume: 410
  start-page: 5467
  issue: 52
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b219
  article-title: Going weighted: Parameterized algorithms for cluster editing
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2009.05.006
– volume: 9
  start-page: 1
  issue: 1
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b134
  article-title: Diminishable parameterized problems and strict polynomial kernelization
  publication-title: Computability
  doi: 10.3233/COM-180220
– volume: 49
  start-page: 17
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b284
  article-title: Flip distance between two triangulations of a point set is NP-complete
  publication-title: Comput. Geom.
  doi: 10.1016/j.comgeo.2014.11.001
– volume: 29
  start-page: 1931
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b264
  article-title: NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/130935756
– volume: 89
  start-page: 315
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b273
  article-title: A polynomial-time algorithm for outerplanar diameter improvement
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2017.05.016
– volume: 64
  start-page: 251
  issue: 2
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b299
  article-title: On the parameterized complexity of graph modification to first-order logic properties
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-019-09938-8
– volume: 607
  start-page: 16
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b261
  article-title: The complexity of degree anonymization by vertex addition
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2015.07.004
– volume: 63
  start-page: 65
  issue: 1
  year: 1995
  ident: 10.1016/j.cosrev.2023.100556_b271
  article-title: Graph minors. XIII. The disjoint paths problem
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.1995.1006
– volume: 44
  start-page: 193
  issue: 2
  year: 2002
  ident: 10.1016/j.cosrev.2023.100556_b236
  article-title: Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
  publication-title: ANZIAM J.
  doi: 10.1017/S1446181100013894
– volume: 27
  start-page: 75
  issue: 1
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b245
  article-title: Efficient algorithms for Eulerian extension and rural postman
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/110834810
– volume: vol. 51
  start-page: 161
  year: 1992
  ident: 10.1016/j.cosrev.2023.100556_b275
  article-title: On the computational complexity of seidel’s switching
– volume: 38
  start-page: 1058
  issue: 3
  year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b117
  article-title: Exact algorithms for treewidth and minimum fill-in
  publication-title: SIAM J. Comput.
  doi: 10.1137/050643350
– volume: 78
  start-page: 179
  issue: 1
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b224
  article-title: Editing graphs to satisfy degree constraints: A parameterized approach
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2011.02.001
– volume: 13
  start-page: 2.2.2
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b54
  article-title: Data reduction and exact algorithms for clique cover
  publication-title: ACM J. Exp. Algorithmics
  doi: 10.1145/1412228.1412236
– start-page: 1096
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b82
  article-title: Linear recognition of almost interval graphs
– volume: 3
  start-page: 165
  issue: 2
  year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b135
  article-title: Minimum-flip supertrees: Complexity and algorithms
  publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform.
  doi: 10.1109/TCBB.2006.26
– year: 1993
  ident: 10.1016/j.cosrev.2023.100556_b270
  article-title: Improving the diameter of a planar graph
  publication-title: Manuscript
– volume: vol. 187
  start-page: 49:1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b69
  article-title: Cluster editing parameterized above modification-disjoint P3-packings
– volume: 34
  start-page: 1385
  issue: 2
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b155
  article-title: Odd multiway cut in directed acyclic graphs
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/18M1176087
– volume: 48
  start-page: 1184
  issue: 6
  year: 2001
  ident: 10.1016/j.cosrev.2023.100556_b230
  article-title: Deciding first-order properties of locally tree-decomposable structures
  publication-title: J. ACM
  doi: 10.1145/504794.504798
– volume: vol. 202
  start-page: 45:1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b41
  article-title: A cubic vertex-kernel for trivially perfect editing
– volume: 44
  start-page: 363
  issue: 4
  year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b88
  article-title: Error compensation in leaf power problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-005-1180-z
– volume: 156
  start-page: 3345
  issue: 18
  year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b91
  article-title: Closest 4-leaf power is fixed-parameter tractable
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2008.01.007
– volume: 47
  start-page: 166
  issue: 1
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b165
  article-title: Multicut is FPT
  publication-title: SIAM J. Comput.
  doi: 10.1137/140961808
– volume: 15
  start-page: 11:1
  issue: 1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b76
  article-title: Feedback vertex set inspired kernel for chordal vertex deletion
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/3284356
– volume: 18
  start-page: 3
  issue: 1
  year: 1997
  ident: 10.1016/j.cosrev.2023.100556_b163
  article-title: Primal–dual approximation algorithms for integral flow and multicut in trees
  publication-title: Algorithmica
  doi: 10.1007/BF02523685
– volume: 82
  start-page: 1100
  issue: 6
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b233
  article-title: Win-win kernelization for degree sequence completion problems
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2016.03.009
– start-page: 641
  year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b98
  article-title: Computing excluded minors
– volume: 126
  start-page: 21
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b175
  article-title: Length-bounded cuts: Proper interval graphs and structural parameters
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2021.12.002
– volume: 58
  start-page: 313
  issue: 2
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b290
  article-title: Computing the flip distance between triangulations
  publication-title: Discrete Comput. Geom.
  doi: 10.1007/s00454-017-9867-x
– volume: 80
  start-page: 1430
  issue: 7
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b123
  article-title: Tight bounds for parameterized complexity of cluster editing with a small number of clusters
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2014.04.015
– volume: vol. 43
  start-page: 30
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b274
  article-title: Variants of plane diameter completion
– volume: 591
  start-page: 72
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b232
  article-title: Editing to a graph of given degrees
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2015.04.034
– volume: 6
  start-page: 23
  year: 1989
  ident: 10.1016/j.cosrev.2023.100556_b196
  article-title: Forbidden subgraphs and the complexity of network integrity
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 10
  start-page: 9:1
  issue: 2
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b132
  article-title: Hardness of approximation for H-free edge modification problems
  publication-title: ACM Trans. Comput. Theory
  doi: 10.1145/3196834
– volume: 101
  start-page: 1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b212
  article-title: Path-contractions, edge deletions and connectivity preservation
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2018.10.001
– volume: 31
  start-page: 542
  issue: 1
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b122
  article-title: Dichotomy results on the hardness of H-free edge modification problems
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/16M1055797
– year: 1980
  ident: 10.1016/j.cosrev.2023.100556_b24
– volume: 7
  start-page: 181
  issue: 2
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b223
  article-title: Parameterized complexity of finding regular induced subgraphs
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2008.09.005
– volume: vol. 123
  start-page: 24:1
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b221
  article-title: Cluster editing in multi-layer and temporal graphs
– volume: 4
  issue: 01
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b57
  article-title: Bounded search tree algorithms for parametrized cograph deletion: Efficient branching rules by exploiting structures of special graph classes
  publication-title: Discrete Math. Algorithms Appl.
  doi: 10.1142/S1793830912500085
– volume: 32
  start-page: 2612
  issue: 4
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b281
  article-title: Structured connectivity augmentation
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/17M1146233
– volume: 16
  start-page: 65
  year: 1994
  ident: 10.1016/j.cosrev.2023.100556_b192
  article-title: Computational complexity of weighted integrity
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 158
  start-page: 1732
  issue: 16
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b89
  article-title: Polynomial kernels for 3-leaf power graph modification problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2010.07.002
– volume: 35
  start-page: 105
  issue: 1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b298
  article-title: Linear kernels for edge deletion problems to immersion-closed graph classes
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/18M1228839
– year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b43
– volume: 83
  start-page: 1
  issue: 1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b220
  article-title: Parameterized dynamic cluster editing
  publication-title: Algorithmica
  doi: 10.1007/s00453-020-00746-y
– volume: 243
  start-page: 249
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b260
  article-title: A refined complexity analysis of degree anonymization in graphs
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2014.12.017
– year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b178
– volume: 78
  start-page: 110
  issue: 1
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b185
  article-title: List H-coloring a graph by removing few vertices
  publication-title: Algorithmica
  doi: 10.1007/s00453-016-0139-6
– volume: 28
  start-page: 1906
  issue: 5
  year: 1999
  ident: 10.1016/j.cosrev.2023.100556_b74
  article-title: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539796303044
– volume: 78
  start-page: 211
  issue: 1
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b44
  article-title: A 2k kernel for the cluster editing problem
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2011.04.001
– volume: 10
  start-page: 193
  issue: 3
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b56
  article-title: Two edge modification problems without polynomial kernels
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2013.02.001
– volume: 97
  start-page: 1
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b250
  article-title: Finding even subgraphs even faster
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2018.03.001
– volume: 622
  start-page: 90
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b258
  article-title: Finding large degree-anonymous subgraphs is hard
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2016.02.004
– start-page: 219
  year: 1968
  ident: 10.1016/j.cosrev.2023.100556_b277
  article-title: Eulerian lines in finite 4-valent graphs and their transformations
– volume: 461
  start-page: 45
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b58
  article-title: Complexity and parameterized algorithms for cograph editing
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2011.11.040
– volume: 82
  start-page: 2006
  issue: 7
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b294
  article-title: Parameterized aspects of strong subgraph closure
  publication-title: Algorithmica
  doi: 10.1007/s00453-020-00684-9
– volume: 253
  start-page: 109
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b131
  article-title: Unit interval editing is fixed-parameter tractable
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2017.01.008
– volume: 82
  start-page: 2135
  issue: 8
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b161
  article-title: Multi-budgeted directed cuts
  publication-title: Algorithmica
  doi: 10.1007/s00453-019-00609-1
– volume: 65
  start-page: 845
  issue: 4
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b106
  article-title: Proper interval vertex deletion
  publication-title: Algorithmica
  doi: 10.1007/s00453-012-9661-3
– volume: 24
  start-page: 1662
  issue: 4
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b36
  article-title: A more relaxed model for graph-based data clustering: s-plex cluster editing
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/090767285
– volume: 271
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b130
  article-title: Minimum fill-in: Inapproximability and almost tight lower bounds
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2020.104514
– volume: 76
  start-page: 524
  issue: 7
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b35
  article-title: A kernelization algorithm for d-hitting set
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2009.09.002
– volume: 55
  issue: 5
  year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b157
  article-title: A fixed-parameter algorithm for the directed feedback vertex set problem
  publication-title: J. ACM
  doi: 10.1145/1411509.1411511
– volume: 124
  start-page: 3
  issue: 1–3
  year: 1994
  ident: 10.1016/j.cosrev.2023.100556_b199
  article-title: Edge-integrity: a survey
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(94)90084-1
– volume: 16
  start-page: 12
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b255
  article-title: A new view on rural postman based on Eulerian extension and matching
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2012.04.007
– volume: 5
  start-page: 269
  issue: 3
  year: 1983
  ident: 10.1016/j.cosrev.2023.100556_b265
  article-title: Network structure and minimum degree
  publication-title: Social Networks
  doi: 10.1016/0378-8733(83)90028-X
– volume: vol. 214
  start-page: 17:1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b92
  article-title: Polynomial kernels for strictly chordal edge modification problems
– volume: 57
  start-page: 747
  issue: 4
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b79
  article-title: Chordal deletion is fixed-parameter tractable
  publication-title: Algorithmica
  doi: 10.1007/s00453-008-9233-8
– start-page: 1711
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b84
  article-title: Interval vertex deletion admits a polynomial kernel
– volume: 63
  start-page: 44:1
  issue: 5
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b242
  article-title: (Meta) kernelization
  publication-title: J. ACM
  doi: 10.1145/2973749
– volume: 11
  start-page: 28
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b159
  article-title: Directed subset feedback vertex set is fixed-parameter tractable
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2700209
– volume: vol. 6986
  start-page: 307
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b254
  article-title: From few components to an Eulerian graph by adding arcs
– volume: 72
  start-page: 778
  issue: 3
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b142
  article-title: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
  publication-title: Algorithmica
  doi: 10.1007/s00453-014-9872-x
– volume: 23
  start-page: 864
  issue: 4
  year: 1994
  ident: 10.1016/j.cosrev.2023.100556_b149
  article-title: The complexity of multiterminal cuts
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539792225297
– volume: vol. 83
  start-page: 6:1
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b217
  article-title: Parameterized algorithms for partitioning graphs into highly connected clusters
– volume: vol. 173
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b246
  article-title: Graph theory
– volume: 8
  start-page: 399
  year: 1956
  ident: 10.1016/j.cosrev.2023.100556_b148
  article-title: Maximal flow through a network
  publication-title: Canad. J. Math.
  doi: 10.4153/CJM-1956-045-5
– volume: 5
  start-page: 653
  issue: 4
  year: 1976
  ident: 10.1016/j.cosrev.2023.100556_b7
  article-title: Augmentation problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/0205044
– volume: 83
  start-page: 1677
  issue: 6
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b191
  article-title: Finding cuts of bounded degree: Complexity, FPT and exact algorithms, and kernelization
  publication-title: Algorithmica
  doi: 10.1007/s00453-021-00798-8
– volume: 68
  start-page: 41
  issue: 1
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b249
  article-title: Parameterized complexity of Eulerian deletion problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-012-9667-x
– volume: vol. 8165
  start-page: 76
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b183
  article-title: On the parameterized complexity of computing graph bisections
– volume: 81
  start-page: 917
  issue: 3
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b103
  article-title: Edge bipartization faster than 2k
  publication-title: Algorithmica
  doi: 10.1007/s00453-017-0319-z
– volume: 20
  start-page: 219
  issue: 2
  year: 1980
  ident: 10.1016/j.cosrev.2023.100556_b1
  article-title: The node-deletion problem for hereditary properties is NP-complete
  publication-title: J. Comput. System Sci.
  doi: 10.1016/0022-0000(80)90060-4
– year: 2007
  ident: 10.1016/j.cosrev.2023.100556_b20
  article-title: Logic, graphs, and algorithms
– volume: 72
  start-page: 995
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b269
  article-title: Augmenting graphs to minimize the diameter
  publication-title: Algorithmica
  doi: 10.1007/s00453-014-9886-4
– volume: 9
  start-page: 30:1
  issue: 4
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b189
  article-title: Finding small separators in linear time via treewidth reduction
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2500119
– start-page: 470
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b99
  article-title: Planar F-deletion: Approximation, kernelization and optimal FPT algorithms
– volume: 11
  start-page: 303
  issue: 5
  year: 1992
  ident: 10.1016/j.cosrev.2023.100556_b267
  article-title: On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(92)90007-P
– volume: 77
  start-page: 1071
  issue: 6
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b113
  article-title: Kernels for feedback arc set in tournaments
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2010.10.001
– start-page: 277
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b256
  article-title: Social network data analytics
– year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b145
– volume: 27
  start-page: 2143
  issue: 4
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b15
  article-title: Obtaining a bipartite graph by contracting few edges
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/130907392
– volume: 47
  start-page: 589
  issue: 5
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b285
  article-title: Flip distance between triangulations of a planar point set is APX-hard
  publication-title: Comput. Geom.
  doi: 10.1016/j.comgeo.2014.01.001
– volume: 29
  start-page: 1961
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b124
  article-title: A subexponential parameterized algorithm for proper interval completion
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/140988565
– volume: 112
  start-page: 249
  issue: 6
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b252
  article-title: Parameterized Eulerian strong component arc deletion problem on tournaments
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2011.11.014
– volume: vol. 126
  start-page: 28:1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b282
  article-title: Modification to planarity is fixed parameter tractable
– volume: 32
  start-page: 656
  issue: 1
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b172
  article-title: Fractals for kernelization lower bounds
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/16M1088740
– volume: 160
  start-page: 1224
  issue: 7–8
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b70
  article-title: Kernelization for cycle transversal problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2011.12.024
– volume: 30
  start-page: 1067
  issue: 4
  year: 2000
  ident: 10.1016/j.cosrev.2023.100556_b75
  article-title: A polynomial approximation algorithm for the minimum fill-in problem
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539798336073
– year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b11
– volume: 25
  start-page: 695
  issue: 2
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b204
  article-title: Augmenting undirected node-connectivity by one
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/100787507
– volume: 9
  start-page: 129
  year: 1970
  ident: 10.1016/j.cosrev.2023.100556_b61
  article-title: Characterizations of derived graphs
  publication-title: J. Combin. Theory
  doi: 10.1016/S0021-9800(70)80019-9
– year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b29
– volume: 72
  start-page: 1386
  issue: 8
  year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b102
  article-title: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2006.02.001
– volume: 1
  start-page: 13
  issue: 38
  year: 1987
  ident: 10.1016/j.cosrev.2023.100556_b197
  article-title: Vulnerability in graphs — a comparative survey
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 81
  start-page: 1584
  issue: 4
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b240
  article-title: A parameterized algorithmics framework for degree sequence completion problems in directed graphs
  publication-title: Algorithmica
  doi: 10.1007/s00453-018-0494-6
– volume: 32
  start-page: 2258
  issue: 3
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b77
  article-title: Approximation and kernelization for chordal vertex deletion
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/17M112035X
– year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b19
– volume: vol. 4835
  start-page: 915
  year: 2007
  ident: 10.1016/j.cosrev.2023.100556_b53
  article-title: Problem kernels for NP-complete edge deletion problems: Split and related graphs
– volume: 84
  start-page: 2767
  issue: 9
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b198
  article-title: Component order connectivity in directed graphs
  publication-title: Algorithmica
  doi: 10.1007/s00453-022-01004-z
– volume: vol. 180
  start-page: 10:1
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b48
  article-title: A polynomial kernel for paw-free editing
– volume: vol. 3787
  start-page: 397
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b90
  article-title: Extending the tractability border for closest leaf powers
– volume: 64
  start-page: 152
  issue: 1
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b45
  article-title: Cluster editing: Kernelization based on edge cuts
  publication-title: Algorithmica
  doi: 10.1007/s00453-011-9595-1
– volume: vol. 7370
  start-page: 469
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b108
  article-title: What’s next? Future directions in parameterized complexity
– volume: 126
  start-page: 83
  issue: 1
  year: 2003
  ident: 10.1016/j.cosrev.2023.100556_b206
  article-title: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(02)00218-4
– volume: 43
  start-page: 355
  issue: 2
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b166
  article-title: Fixed-parameter tractability of multicut parameterized by the size of the cutset
  publication-title: SIAM J. Comput.
  doi: 10.1137/110855247
– volume: 654
  start-page: 70
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b128
  article-title: Reducing rank of the adjacency matrix by graph modification
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2016.02.020
– volume: vol. 148
  start-page: 8:1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b169
  article-title: FPT inapproximability of directed cut and connectivity problems
– volume: 10
  start-page: 297
  issue: 2
  year: 1981
  ident: 10.1016/j.cosrev.2023.100556_b2
  article-title: Edge-deletion problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/0210021
– volume: 19
  start-page: 374
  issue: 4
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b141
  article-title: Social choice meets graph drawing: how to get subexponential time algorithms for ranking and drawing problems
  publication-title: Tsinghua Sci. Technol.
  doi: 10.1109/TST.2014.6867519
– volume: 112
  start-page: 5
  issue: 1–2
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b160
  article-title: An FPT algorithm for edge subset feedback edge set
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2011.10.007
– volume: vol. 5018
  start-page: 141
  year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b27
  article-title: Wheel-free deletion is W[2]-hard
– volume: 80
  start-page: 2757
  issue: 10
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b129
  article-title: Rank reduction of oriented graphs by vertex and edge deletions
  publication-title: Algorithmica
  doi: 10.1007/s00453-017-0340-2
– volume: 11
  start-page: 21:1
  issue: 3
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b85
  article-title: Interval deletion is fixed-parameter tractable
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2629595
– volume: 154
  start-page: 1824
  issue: 13
  year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b3
  article-title: NP-completeness results for edge modification problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2006.03.031
– volume: 154
  start-page: 173
  issue: 1
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b147
  article-title: Finding small stabilizers for unstable graphs
  publication-title: Math. Program.
  doi: 10.1007/s10107-014-0854-1
– volume: 160
  start-page: 2259
  issue: 15
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b118
  article-title: Cluster editing with locally bounded modifications
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2012.05.019
– volume: 80
  start-page: 3481
  issue: 12
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b32
  article-title: A polynomial kernel for trivially perfect editing
  publication-title: Algorithmica
  doi: 10.1007/s00453-017-0401-6
– year: 1979
  ident: 10.1016/j.cosrev.2023.100556_b225
– volume: 231
  start-page: 89
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b37
  article-title: Polynomial kernels for proper interval completion and related problems
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2013.08.006
– year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b239
– volume: 2
  start-page: 77
  issue: 1
  year: 1981
  ident: 10.1016/j.cosrev.2023.100556_b6
  article-title: Computing the minimum fill-in is NP-complete
  publication-title: SIAM J. Algebr. Discrete Methods
  doi: 10.1137/0602010
– volume: vol. 8635
  start-page: 469
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b127
  article-title: On the clique editing problem
– volume: 42
  start-page: 2197
  issue: 6
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b30
  article-title: Subexponential parameterized algorithm for minimum fill-in
  publication-title: SIAM J. Comput.
  doi: 10.1137/11085390X
– volume: 14
  start-page: 35:1
  issue: 3
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b83
  article-title: Subexponential parameterized algorithm for interval completion
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/3186896
– volume: 15
  start-page: 295
  issue: 3
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b253
  article-title: On Eulerian extensions and their application to no-wait flowshop scheduling
  publication-title: J. Sched.
  doi: 10.1007/s10951-011-0241-1
– year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b18
– volume: 71
  start-page: 989
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b72
  article-title: Faster parameterized algorithms for deletion to split graphs
  publication-title: Algorithmica
  doi: 10.1007/s00453-013-9837-5
– volume: vol. 43
  start-page: 402
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b119
  article-title: Fast biclustering by dual parameterization
– volume: 62
  start-page: 739
  issue: 3
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b68
  article-title: Parameterizing edge modification problems above lower bounds
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-016-9746-5
– volume: 12
  start-page: 895
  issue: 9
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b194
  article-title: A survey of component order connectivity models of graph theoretic networks
  publication-title: WSEAS Trans. Math.
– volume: 163
  start-page: 319
  issue: 1–3
  year: 1997
  ident: 10.1016/j.cosrev.2023.100556_b228
  article-title: On locating cubic subgraphs in bounded-degree connected bipartite graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(95)00324-P
– volume: 42
  start-page: 60
  issue: 1
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b283
  article-title: Flips in planar graphs
  publication-title: Comput. Geom.
  doi: 10.1016/j.comgeo.2008.04.001
– volume: 68
  start-page: 81
  issue: 1
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b137
  article-title: A cubic-vertex kernel for flip consensus tree
  publication-title: Algorithmica
  doi: 10.1007/s00453-012-9663-1
– volume: vol. 31
  year: 2006
  ident: 10.1016/j.cosrev.2023.100556_b21
  article-title: Invitation to fixed-parameter algorithms
– volume: 82
  start-page: 1020
  issue: 6
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b170
  article-title: Parameterized complexity dichotomy for Steiner Multicut
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2016.03.003
– volume: 281
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b291
  article-title: An improved FPT algorithm for the flip distance problem
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2021.104708
– volume: 18
  start-page: 557
  issue: 4
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b121
  article-title: Editing simple graphs
  publication-title: J. Graph Algorithms Appl.
  doi: 10.7155/jgaa.00337
– volume: 46
  start-page: 723
  issue: 4
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b151
  article-title: Simple and improved parameterized algorithms for multiterminal cuts
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-009-9215-5
– year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b229
– volume: 113
  start-page: 906
  issue: 22–24
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b13
  article-title: A faster FPT algorithm for bipartite contraction
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2013.09.004
– volume: 109
  start-page: 918
  issue: 16
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b287
  article-title: Rotation distance is fixed-parameter tractable
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2009.04.023
– start-page: 275
  year: 1981
  ident: 10.1016/j.cosrev.2023.100556_b9
  article-title: The splittance of a graph
  publication-title: Combinatorica
  doi: 10.1007/BF02579333
– volume: 9
  start-page: 231
  issue: 3
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b248
  article-title: Parameterized complexity of even/odd subgraph problems
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2011.03.004
– volume: 79
  start-page: 654
  issue: 3
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b62
  article-title: On polynomial kernelization of H-free edge deletion
  publication-title: Algorithmica
  doi: 10.1007/s00453-016-0215-y
– volume: 5
  start-page: 25
  issue: 1
  year: 1992
  ident: 10.1016/j.cosrev.2023.100556_b203
  article-title: Augmenting graphs to meet edge-connectivity requirements
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/0405003
– volume: 19
  start-page: 346
  issue: 4
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b34
  article-title: An overview of kernelization algorithms for graph modification problems
  publication-title: Tsinghua Sci. Technol.
  doi: 10.1109/TST.2014.6867517
– volume: 32
  start-page: 299
  issue: 4
  year: 2004
  ident: 10.1016/j.cosrev.2023.100556_b100
  article-title: Finding odd cycle transversals
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2003.10.009
– start-page: 160
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b188
  article-title: The minimum k-way cut of bounded size is fixed-parameter tractable
– volume: 46
  start-page: 124
  issue: 3
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b164
  article-title: Fixed-parameter tractability and data reduction for multicut in trees
  publication-title: Networks
  doi: 10.1002/net.20081
– volume: 56
  start-page: 131
  issue: 2
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b207
  article-title: Kernelization and complexity results for connectivity augmentation problems
  publication-title: Networks
– volume: vol. 7391
  start-page: 569
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b153
  article-title: Solving planar k-terminal cut in O(nck) time
– ident: 10.1016/j.cosrev.2023.100556_b186
  doi: 10.1145/3519935.3520018
– volume: 11
  start-page: 27
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b208
  article-title: Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2700210
– volume: 476
  start-page: 38
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b12
  article-title: Obtaining planarity by contracting few edges
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2012.12.041
– volume: 48
  start-page: 417
  issue: 2
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b182
  article-title: Minimum bisection is fixed-parameter tractable
  publication-title: SIAM J. Comput.
  doi: 10.1137/140988553
– volume: 38
  start-page: 2007
  issue: 5
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b80
  article-title: Interval completion is fixed parameter tractable
  publication-title: SIAM J. Comput.
  doi: 10.1137/070710913
– volume: 68
  start-page: 223
  issue: 3
  year: 1996
  ident: 10.1016/j.cosrev.2023.100556_b227
  article-title: Finding regular subgraphs in both arbitrary and planar graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(95)00061-U
– volume: 2
  start-page: 570
  issue: 8
  year: 1996
  ident: 10.1016/j.cosrev.2023.100556_b286
  article-title: The edge-flipping distance of triangulations
  publication-title: J. UCS
– volume: vol. 8497
  start-page: 82
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b105
  article-title: Randomized parameterized algorithms for co-path set problem
– volume: 677
  start-page: 56
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b241
  article-title: Graph editing problems with extended regularity constraints
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2017.03.019
– volume: 13
  start-page: 19
  issue: 2
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b276
  article-title: Parameterized problems related to Seidel’s switching
  publication-title: Discrete Math. Theor. Comput. Sci.
– year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b292
– volume: 63
  start-page: 512
  issue: 4
  year: 2001
  ident: 10.1016/j.cosrev.2023.100556_b23
  article-title: Which problems have strongly exponential complexity?
  publication-title: J. Comput. System Sci.
  doi: 10.1006/jcss.2001.1774
– volume: 124
  start-page: 1
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b38
  article-title: On the threshold of intractability
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2021.09.003
– volume: 42
  start-page: 69
  issue: 1
  year: 2002
  ident: 10.1016/j.cosrev.2023.100556_b87
  article-title: On graph powers for leaf-labeled trees
  publication-title: J. Algorithms
  doi: 10.1006/jagm.2001.1195
– volume: 31
  start-page: 212
  issue: 1
  year: 2001
  ident: 10.1016/j.cosrev.2023.100556_b115
  article-title: Treewidth and minimum fill-in: Grouping the minimal separators
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539799359683
– volume: 10
  start-page: 20
  issue: 4
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b104
  article-title: Compression via matroids: A randomized polynomial kernel for odd cycle transversal
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2635810
– volume: 29
  start-page: 122
  issue: 1
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b168
  article-title: Fixed-parameter tractability of multicut in directed acyclic graphs
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/120904202
– volume: 168
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b139
  article-title: Faster parameterized algorithm for bicluster editing
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2021.106095
– volume: 1
  start-page: 647
  issue: 3
  year: 1988
  ident: 10.1016/j.cosrev.2023.100556_b288
  article-title: Rotation distance, triangulations, and hyperbolic geometry
  publication-title: AMS J. Am. Math. Soc.
  doi: 10.1090/S0894-0347-1988-0928904-4
– volume: 52
  start-page: 866
  issue: 6
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b109
  article-title: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
  publication-title: J. ACM
  doi: 10.1145/1101821.1101823
– volume: 45
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b143
  article-title: Parameterized analysis and crossing minimization problems
  publication-title: Comp. Sci. Rev.
– year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b81
– volume: vol. 101
  start-page: 21:1
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b280
  article-title: Partial complementation of graphs
– volume: 8
  start-page: 76
  issue: 1
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b112
  article-title: Fixed-parameter tractability results for feedback set problems in tournaments
  publication-title: J. Discrete Algorithms
  doi: 10.1016/j.jda.2009.08.001
– volume: 256
  start-page: 212
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b262
  article-title: The complexity of degree anonymization by graph contractions
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2017.07.007
– volume: vol. 7391
  start-page: 750
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b154
  article-title: Parameterized tractability of multiway cut with parity constraints
– volume: 20
  start-page: 151
  issue: 2
  year: 1998
  ident: 10.1016/j.cosrev.2023.100556_b158
  article-title: Approximating minimum feedback sets and multicuts in directed graphs
  publication-title: Algorithmica
  doi: 10.1007/PL00009191
– volume: 665
  start-page: 1
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b263
  article-title: Graph editing to a given degree sequence
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2016.12.007
– volume: vol. 8572
  start-page: 800
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b209
  article-title: Parameterized algorithms to preserve connectivity
– volume: 71
  start-page: 731
  issue: 3
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b52
  article-title: Incompressibility of H-free edge modification problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-014-9937-x
– volume: 73
  start-page: 23
  issue: 1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b174
  article-title: A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
  publication-title: Networks
  doi: 10.1002/net.21832
– volume: vol. 10846
  start-page: 78
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b266
  article-title: Can we create large k-cores by adding few edges?
– volume: vol. 12911
  start-page: 156
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b93
  article-title: Completion to chordal distance-hereditary graphs: A quartic vertex-kernel
– year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b110
– volume: 22
  start-page: 177
  issue: 2
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b176
  article-title: On algorithms employing treewidth for L-bounded cut problems
  publication-title: J. Graph Algorithms Appl.
  doi: 10.7155/jgaa.00462
– volume: vol. 8087
  start-page: 421
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b181
  article-title: On the parameterized complexity of cutting a few vertices from a graph
– volume: 35
  start-page: 96
  issue: 1
  year: 1987
  ident: 10.1016/j.cosrev.2023.100556_b201
  article-title: Edge-connectivity augmentation problems
  publication-title: J. Comput. System Sci.
  doi: 10.1016/0022-0000(87)90038-9
– volume: 47
  start-page: 341
  issue: 3
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b257
  article-title: A survey of graph-modification techniques for privacy-preserving on networks
  publication-title: J. Artificial Intelligence Res.
– year: 1999
  ident: 10.1016/j.cosrev.2023.100556_b25
  article-title: Graph classes. A survey
– volume: 8
  start-page: 2
  issue: 1
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b59
  article-title: Graph-based data clustering with overlaps
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2010.09.006
– volume: 144
  start-page: 173
  issue: 1–2
  year: 2004
  ident: 10.1016/j.cosrev.2023.100556_b8
  article-title: Cluster graph modification problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2004.01.007
– volume: vol. 4978
  start-page: 445
  year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b138
  article-title: Improved algorithms for bicluster editing
– volume: vol. 87
  start-page: 161
  year: 1992
  ident: 10.1016/j.cosrev.2023.100556_b17
  article-title: Fixed-parameter tractability and completeness
– volume: 256
  start-page: 131
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b235
  article-title: Editing to a connected graph of given degrees
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2017.04.013
– volume: 83
  start-page: 2096
  issue: 7
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b95
  article-title: A polynomial kernel for distance-hereditary vertex deletion
  publication-title: Algorithmica
  doi: 10.1007/s00453-021-00820-z
– volume: 61
  start-page: 817
  issue: 4
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b114
  article-title: Faster parameterized algorithms for minimum fill-in
  publication-title: Algorithmica
  doi: 10.1007/s00453-010-9421-1
– volume: 10
  start-page: 1
  issue: 3
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b167
  article-title: Directed multicut is W[1]-hard, even for four terminal pairs
  publication-title: ACM Trans. Comput. Theory
  doi: 10.1145/3201775
– volume: 86
  start-page: 191
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b184
  article-title: Parameterized algorithms for min–max multiway cut and list digraph homomorphism
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2017.01.003
– volume: vol. 13270
  start-page: 214
  year: 2022
  ident: 10.1016/j.cosrev.2023.100556_b222
  article-title: A new temporal interpretation of cluster editing
– volume: 607
  start-page: 60
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b14
  article-title: Obtaining split graphs by edge contraction
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2015.01.056
– volume: 75
  start-page: 423
  issue: 8
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b22
  article-title: On problems without polynomial kernels
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2009.04.001
– volume: 511
  start-page: 172
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b107
  article-title: Parameterized complexity of vertex deletion into perfect graph classes
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2012.03.013
– volume: 2–17
  start-page: 369
  issue: 3
  year: 1978
  ident: 10.1016/j.cosrev.2023.100556_b162
  article-title: A minimax theorem for directed graphs
  publication-title: J. Lond. Math. Soc.
– volume: 126
  start-page: 349
  issue: 1–3
  year: 1994
  ident: 10.1016/j.cosrev.2023.100556_b226
  article-title: Deciding whether a planar graph has a cubic subgraph is NP-complete
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(94)90277-1
– volume: 1
  start-page: 79
  issue: 1
  year: 1977
  ident: 10.1016/j.cosrev.2023.100556_b243
  article-title: The spanning subgraphs of Eulerian graphs
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190010115
– volume: vol. 162
  start-page: 25:1
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b179
  article-title: Generalized metric repair on graphs
– volume: 32
  start-page: 51
  year: 2009
  ident: 10.1016/j.cosrev.2023.100556_b46
  article-title: On generating triangle-free graphs
  publication-title: Electron. Notes Discrete Math.
  doi: 10.1016/j.endm.2009.02.008
– volume: 573
  start-page: 63
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b71
  article-title: Edge deletion problems: Branching facilitated by modular decomposition
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2015.01.049
– volume: 891
  start-page: 1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b47
  article-title: Polynomial kernels for paw-free edge modification problems
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2021.08.015
– volume: 19
  start-page: 151
  issue: 1
  year: 1989
  ident: 10.1016/j.cosrev.2023.100556_b202
  article-title: The minimum augmentation of any graph to a k-edge-connected graph
  publication-title: Networks
  doi: 10.1002/net.3230190112
– volume: 38
  start-page: 373
  issue: 4
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b64
  article-title: Graph-modeled data clustering: Exact algorithms for clique generation
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-004-1178-y
– volume: 2
  start-page: 179
  year: 1987
  ident: 10.1016/j.cosrev.2023.100556_b195
  article-title: Computational complexity of integrity
  publication-title: J. Combin. Math. Combin. Comput.
– volume: vol. 214
  start-page: 13:1
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b40
  article-title: Improved kernels for edge modification problems
– volume: 77
  start-page: 259
  issue: 3
  year: 1997
  ident: 10.1016/j.cosrev.2023.100556_b200
  article-title: Measuring the vulnerability for classes of intersection graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(96)00133-3
– volume: 94
  start-page: 31
  issue: 1
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b205
  article-title: Independence free graphs and vertex connectivity augmentation
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/j.jctb.2004.01.004
– volume: 110
  start-page: 481
  issue: 12–13
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b289
  article-title: An improved kernel size for rotation distance in binary trees
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2010.04.022
– start-page: 1466
  year: 2014
  ident: 10.1016/j.cosrev.2023.100556_b293
  article-title: Using strong triadic closure to characterize ties in social networks
– volume: 113
  start-page: 150
  year: 2020
  ident: 10.1016/j.cosrev.2023.100556_b215
  article-title: Subexponential algorithm for d-cluster edge deletion: Exception or rule?
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2020.05.008
– volume: 42
  start-page: 1674
  issue: 4
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b156
  article-title: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
  publication-title: SIAM J. Comput.
  doi: 10.1137/12086217X
– volume: 10
  start-page: 277
  issue: 3
  year: 1986
  ident: 10.1016/j.cosrev.2023.100556_b244
  article-title: An Eulerian exposition
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190100306
– volume: 60
  start-page: 615
  issue: 4
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b42
  article-title: Polynomial kernelization for removing induced claws and diamonds
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s00224-016-9689-x
– start-page: 382
  year: 2007
  ident: 10.1016/j.cosrev.2023.100556_b26
  article-title: Computing crossing number in linear time
– volume: 120
  start-page: 75
  year: 2021
  ident: 10.1016/j.cosrev.2023.100556_b296
  article-title: Your rugby mates don’t need to know your colleagues: Triadic closure with edge colors
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2021.03.001
– volume: 29
  start-page: 257
  issue: 1
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b86
  article-title: An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-014-9733-1
– volume: vol. 7285
  start-page: 235
  year: 2012
  ident: 10.1016/j.cosrev.2023.100556_b213
  article-title: On editing graphs into 2-club clusters
– volume: vol. 115
  start-page: 17:1
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b218
  article-title: Clustering to given connectivities
– volume: 60
  start-page: 72
  issue: 1
  year: 1994
  ident: 10.1016/j.cosrev.2023.100556_b97
  article-title: Graph minors. XI. Circuits on a surface
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.1994.1007
– year: 2003
  ident: 10.1016/j.cosrev.2023.100556_b101
  article-title: On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems
– volume: 8
  start-page: 72
  issue: 1
  year: 2011
  ident: 10.1016/j.cosrev.2023.100556_b171
  article-title: Paths of bounded length and their cuts: Parameterized complexity and algorithms
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2010.09.009
– volume: 9
  start-page: 205
  issue: 2
  year: 2005
  ident: 10.1016/j.cosrev.2023.100556_b140
  article-title: Two-layer planarization: Improving on parameterized algorithmics
  publication-title: J. Graph Algorithms Appl.
  doi: 10.7155/jgaa.00106
– year: 2008
  ident: 10.1016/j.cosrev.2023.100556_b4
– volume: 85
  start-page: 168
  year: 2017
  ident: 10.1016/j.cosrev.2023.100556_b234
  article-title: Editing to a planar graph of given degrees
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2016.11.009
– volume: 113
  start-page: 109
  issue: 1
  year: 2001
  ident: 10.1016/j.cosrev.2023.100556_b5
  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: 3597
  issue: 12
  year: 2018
  ident: 10.1016/j.cosrev.2023.100556_b173
  article-title: Parameterized complexity of length-bounded cuts and multicuts
  publication-title: Algorithmica
  doi: 10.1007/s00453-018-0408-7
– year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b10
– volume: 7
  start-page: 14:1
  issue: 4
  year: 2015
  ident: 10.1016/j.cosrev.2023.100556_b31
  article-title: Exploring the subexponential complexity of completion problems
  publication-title: ACM Trans. Comput. Theory
  doi: 10.1145/2799640
– volume: 21
  start-page: 375
  issue: 4
  year: 2000
  ident: 10.1016/j.cosrev.2023.100556_b126
  article-title: Models of core/periphery structures
  publication-title: Social Networks
  doi: 10.1016/S0378-8733(99)00019-2
– volume: 82
  start-page: 213
  issue: 2
  year: 2016
  ident: 10.1016/j.cosrev.2023.100556_b247
  article-title: Editing to Eulerian graphs
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2015.10.003
– volume: 65
  start-page: 900
  issue: 4
  year: 2013
  ident: 10.1016/j.cosrev.2023.100556_b28
  article-title: On the (non-)existence of polynomial kernels for Pl-free edge modification problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-012-9619-5
– volume: 78
  start-page: 209
  year: 2003
  ident: 10.1016/j.cosrev.2023.100556_b187
  article-title: Cutting up is hard to do: the parameterised complexity of k-cut and related problems
  publication-title: Electron. Notes Theor. Comput. Sci.
  doi: 10.1016/S1571-0661(04)81014-4
– volume: 105
  start-page: 199
  year: 2019
  ident: 10.1016/j.cosrev.2023.100556_b259
  article-title: Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2019.05.004
– volume: vol. 6478
  start-page: 72
  year: 2010
  ident: 10.1016/j.cosrev.2023.100556_b251
  article-title: Computing the deficiency of housing markets with duplicate houses
SSID ssj0070056
Score 2.4997375
SecondaryResourceType review_article
Snippet The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 100556
SubjectTerms Algorithms
Edge modification
Graph modification
Parameterized graph algorithms
Title A survey of parameterized algorithms and the complexity of edge modification
URI https://dx.doi.org/10.1016/j.cosrev.2023.100556
Volume 48
WOSCitedRecordID wos000989429500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1876-7745
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0070056
  issn: 1574-0137
  databaseCode: AIEXJ
  dateStart: 20070801
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLa6ssMuG_sl2GDyYbcqqEmdOD4WBGzThHZgU2-R49hbUZuitFQV_wH_Ne_FdtIyxMaBSxRZjhv5fXXes7_3PUI-A1AKYwoVFFEhAyaUCXJhkiDhKg-1ERATsbrYBD87S0cj8aPTufG5MMsJL8t0tRKXT2pqaANjY-rsI8zdDAoNcA9GhyuYHa7_Zfhhb35VLXV9co7C3lMkvIyvwbGUk9-zarz4M503vMmaUa5XjpeBe2tYGwfpQ63FvI6Bq__Q85lA1caxwhHE7XiSozclCxpHucIshtpnrc_m40nvtD6lP0xL29AmosymVtjgBMug9H4dNBwhWKiX0tauwkpg6zsW0Ro_0C-yHJkvVuzFr8JWb9MtoyFKgyX3rvB2s-ECDDTHIj04_kHbfVNQ-86HrqEfembbRWZHyXCUzI7yjGxFPBZpl2wNvx6PvvnPOkfR1Fp81728z8OsyYJ_v839fs6a73K-TV66oIMOLVhek44u35BX3qDUre9vyfchtdihM0M3sENb7FDADgXs0BY72B2xQ9ex8478PDk-P_oSuHIbgQIvfBFInqd9xhWXkRSyEEZKCA8wfo8KzIeUTERGKqWYDFOYDBmGSucR4yzJWSKLwXvSLWel3iG0j3tjisfMQHSBDJuiL8NExFpgYbt4sEsGfnIy5bTosSTKJHvINLskaJ66tFos_-jP_bxn7q9h_cQMwPTgkx8e-UsfyYsW6Huku6iu9D55rpaL8bz65JB0C9_4l-E
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=A+survey+of+parameterized+algorithms+and+the+complexity+of+edge+modification&rft.jtitle=Computer+science+review&rft.au=Crespelle%2C+Christophe&rft.au=Drange%2C+P%C3%A5l+Gr%C3%B8n%C3%A5s&rft.au=Fomin%2C+Fedor+V.&rft.au=Golovach%2C+Petr&rft.date=2023-05-01&rft.issn=1574-0137&rft.volume=48&rft.spage=100556&rft_id=info:doi/10.1016%2Fj.cosrev.2023.100556&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cosrev_2023_100556
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1574-0137&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1574-0137&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1574-0137&client=summon