Parameterized computational complexity of finding small-diameter subgraphs

Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first parameterized complexity study on the corresponding NP-hard s - Club problem. We consider two parameters: the solution size and its dual.

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization letters Ročník 6; číslo 5; s. 883 - 891
Hlavní autoři: Schäfer, Alexander, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.06.2012
Témata:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Clique relaxation
Branching algorithm
NP-hard problem
Polynomial-time preprocessing
Club
Problem kernel
ISSN:1862-4472, 1862-4480
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 Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first parameterized complexity study on the corresponding NP-hard s - Club problem. We consider two parameters: the solution size and its dual.
AbstractList Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first parameterized complexity study on the corresponding NP-hard s - Club problem. We consider two parameters: the solution size and its dual.
Author Moser, Hannes
Komusiewicz, Christian
Niedermeier, Rolf
Schäfer, Alexander
Author_xml – sequence: 1
  givenname: Alexander
  surname: Schäfer
  fullname: Schäfer, Alexander
  organization: Department of Neurology, Max Planck Institute for Human Cognitive and Brain Sciences
– sequence: 2
  givenname: Christian
  surname: Komusiewicz
  fullname: Komusiewicz, Christian
  email: christian.komusiewicz@tu-berlin.de
  organization: Institut für Softwaretechnik und Theoretische Informatik, Technische Universtität Berlin
– sequence: 3
  givenname: Hannes
  surname: Moser
  fullname: Moser, Hannes
  organization: Institut für Informatik, Friedrich-Schiller-Universität Jena
– sequence: 4
  givenname: Rolf
  surname: Niedermeier
  fullname: Niedermeier, Rolf
  organization: Institut für Softwaretechnik und Theoretische Informatik, Technische Universtität Berlin
BookMark eNp9kE1PwzAMhiM0JLbBD-DWPxCI0zRtj2jiY2gSHOAcuY07MvVjSlqJ8evpKOLAYRfbr-THsp4Fm7VdS4xdg7gBIdLbAJDkggsALuKxJGdsDpmWXKlMzP7mVF6wRQg7ITRAns_Z8yt6bKgn777IRmXX7Icee9e1WP-kmj5df4i6Kqpca127jUKDdc2tm7AoDMXW4_4jXLLzCutAV799yd4f7t9WT3zz8rhe3W14GSeq54CZBaXyKi8LJAQsoJA6k1JSJqhQsRbWpkoKi9pWgKStpoKyJE1kqmIbL1k63S19F4KnypRuern36GoDwhyVmEmJGZWYoxKTjCT8I_feNegPJxk5MWHcbbfkza4b_GgnnIC-AUqDd1I
CitedBy_id crossref_primary_10_1016_j_tcs_2017_10_018
crossref_primary_10_1287_opre_2016_1500
crossref_primary_10_1016_j_ejor_2025_08_031
crossref_primary_10_1016_j_ipl_2021_106105
crossref_primary_10_1007_s00453_022_01090_z
crossref_primary_10_1016_j_tcs_2024_114625
crossref_primary_10_1016_j_tcs_2019_03_045
crossref_primary_10_1007_s13278_016_0326_0
crossref_primary_10_1016_j_jcss_2016_10_008
crossref_primary_10_1016_j_ic_2025_105355
crossref_primary_10_1287_ijoc_2022_1231
crossref_primary_10_3233_COM_180220
crossref_primary_10_1145_3196276
crossref_primary_10_1016_j_tcs_2021_12_017
crossref_primary_10_3390_a9010021
crossref_primary_10_1016_j_jcss_2020_05_008
crossref_primary_10_1007_s00453_019_00614_4
crossref_primary_10_1016_j_ejor_2018_12_006
crossref_primary_10_1002_net_22246
crossref_primary_10_1007_s00453_022_01062_3
crossref_primary_10_1007_s00453_017_0344_y
crossref_primary_10_1007_s10878_024_01204_z
crossref_primary_10_1007_s00224_023_10135_x
crossref_primary_10_1007_s11590_015_0971_7
crossref_primary_10_1007_s00607_012_0263_3
crossref_primary_10_1007_s10479_016_2212_6
Cites_doi 10.1016/j.jcss.2010.06.007
10.1080/0022250X.1978.9989883
10.1016/S0305-0548(99)00047-7
10.1080/0022250X.1973.9989826
10.1145/1233481.1233493
10.1007/978-1-4612-0515-9
10.1007/s10878-005-1857-x
10.1016/j.jcss.2009.04.001
10.1016/S0377-2217(01)00133-3
10.1016/S0012-365X(01)00091-7
10.1016/0304-3975(94)00097-3
10.1007/978-3-642-12200-2_53
10.1080/0022250X.1973.9989821
10.1007/978-3-540-78757-0_14
10.1093/acprof:oso/9780198566076.003.0001
10.1109/ARES.2007.70
10.1007/978-3-642-11269-0_2
ContentType Journal Article
Copyright Springer-Verlag 2011
Copyright_xml – notice: Springer-Verlag 2011
DBID AAYXX
CITATION
DOI 10.1007/s11590-011-0311-5
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1862-4480
EndPage 891
ExternalDocumentID 10_1007_s11590_011_0311_5
GroupedDBID -5D
-5G
-BR
-EM
-Y2
-~C
.VR
06D
0R~
0VY
123
1N0
203
2J2
2JN
2JY
2KG
2KM
2LR
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBXA
ABDZT
ABECU
ABFTV
ABHQN
ABJNI
ABJOX
ABKCH
ABMNI
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
AXYYD
AYJHY
B-.
BA0
BAPOH
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HLICF
HMJXF
HQYDN
HRMNR
HZ~
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
J9A
JBSCW
JCJTX
JZLTJ
KDC
KOV
LLZTM
M4Y
MA-
N9A
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
P2P
P9M
PF0
PT4
QOS
R89
R9I
ROL
RPX
RSV
S16
S1Z
S27
S3B
SAP
SDH
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7R
Z7Y
Z83
Z88
ZMTXR
~A9
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
AEZWR
AFDZB
AFHIU
AFOHR
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
ID FETCH-LOGICAL-c354t-1a8d1449f9cbaea1ab1b268222e80eb4360dd7420da6df1ae6d6ebe85752743d3
IEDL.DBID RSV
ISICitedReferencesCount 52
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000304624700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1862-4472
IngestDate Tue Nov 18 21:55:04 EST 2025
Sat Nov 29 02:44:05 EST 2025
Fri Feb 21 02:42:30 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Clique relaxation
Branching algorithm
NP-hard problem
Polynomial-time preprocessing
Club
Problem kernel
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c354t-1a8d1449f9cbaea1ab1b268222e80eb4360dd7420da6df1ae6d6ebe85752743d3
PageCount 9
ParticipantIDs crossref_citationtrail_10_1007_s11590_011_0311_5
crossref_primary_10_1007_s11590_011_0311_5
springer_journals_10_1007_s11590_011_0311_5
PublicationCentury 2000
PublicationDate 2012-06-01
PublicationDateYYYYMMDD 2012-06-01
PublicationDate_xml – month: 06
  year: 2012
  text: 2012-06-01
  day: 01
PublicationDecade 2010
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
PublicationTitle Optimization letters
PublicationTitleAbbrev Optim Lett
PublicationYear 2012
Publisher Springer-Verlag
Publisher_xml – name: Springer-Verlag
References Marincek, Mohar (CR16) 2002; 244
CR2
Bourjolly, Laporte, Pesant (CR6) 2000; 27
CR4
Flum, Grohe (CR12) 2006
CR8
CR19
CR18
CR17
CR15
Bourjolly, Laporte, Pesant (CR7) 2002; 138
Guo, Niedermeier (CR14) 2007; 38
Downey, Fellows (CR9) 1995; 141
CR11
CR20
Balasundaram, Butenko, Trukhanov (CR3) 2005; 10
Fortnow, Santhanam (CR13) 2011; 77
Seidman, Foster (CR21) 1978; 6
Bodlaender, Downey, Fellows, Hermelin (CR5) 2009; 75
Alba (CR1) 1973; 3
Downey, Fellows (CR10) 1999
311_CR4
B. Balasundaram (311_CR3) 2005; 10
311_CR8
311_CR17
311_CR19
311_CR18
H.L. Bodlaender (311_CR5) 2009; 75
J. Marincek (311_CR16) 2002; 244
J. Bourjolly (311_CR7) 2002; 138
311_CR2
R.D. Alba (311_CR1) 1973; 3
R.G. Downey (311_CR10) 1999
L. Fortnow (311_CR13) 2011; 77
R.G. Downey (311_CR9) 1995; 141
J. Flum (311_CR12) 2006
J. Guo (311_CR14) 2007; 38
311_CR15
311_CR20
J. Bourjolly (311_CR6) 2000; 27
S.B. Seidman (311_CR21) 1978; 6
311_CR11
References_xml – volume: 77
  start-page: 91
  issue: 1
  year: 2011
  end-page: 106
  ident: CR13
  article-title: Infeasibility of instance compression and succinct pcps for np
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2010.06.007
– ident: CR19
– year: 2006
  ident: CR12
  publication-title: Parameterized Complexity Theory
– ident: CR18
– volume: 6
  start-page: 139
  year: 1978
  end-page: 154
  ident: CR21
  article-title: A graph-theoretic generalization of the clique concept
  publication-title: J. Math. Sociol.
  doi: 10.1080/0022250X.1978.9989883
– volume: 27
  start-page: 559
  issue: 6
  year: 2000
  end-page: 569
  ident: CR6
  article-title: Heuristics for finding -clubs in an undirected graph
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(99)00047-7
– ident: CR4
– ident: CR15
– ident: CR2
– volume: 3
  start-page: 3
  year: 1973
  end-page: 113
  ident: CR1
  article-title: A graph-theoretic definition of a sociometric clique
  publication-title: J. Math. Sociol.
  doi: 10.1080/0022250X.1973.9989826
– ident: CR17
– ident: CR11
– volume: 38
  start-page: 31
  issue: 1
  year: 2007
  end-page: 45
  ident: CR14
  article-title: Invitation to data reduction and problem kernelization
  publication-title: ACM SIGACT News
  doi: 10.1145/1233481.1233493
– year: 1999
  ident: CR10
  publication-title: Parameterized Complexity
  doi: 10.1007/978-1-4612-0515-9
– ident: CR8
– volume: 10
  start-page: 23
  issue: 1
  year: 2005
  end-page: 39
  ident: CR3
  article-title: Novel approaches for analyzing biological networks
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-005-1857-x
– volume: 75
  start-page: 423
  issue: 8
  year: 2009
  end-page: 434
  ident: CR5
  article-title: On problems without polynomial kernels
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2009.04.001
– volume: 138
  start-page: 21
  issue: 1
  year: 2002
  end-page: 28
  ident: CR7
  article-title: An exact algorithm for the maximum -club problem in an undirected graph
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(01)00133-3
– volume: 244
  start-page: 323
  issue: 1–3
  year: 2002
  end-page: 330
  ident: CR16
  article-title: On approximating the maximum diameter ratio of graphs
  publication-title: Discret. Math.
  doi: 10.1016/S0012-365X(01)00091-7
– ident: CR20
– volume: 141
  start-page: 109
  issue: 1&2
  year: 1995
  end-page: 131
  ident: CR9
  article-title: Fixed-parameter tractability and completeness II: on completeness for W[1]
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)00097-3
– ident: 311_CR2
  doi: 10.1007/978-3-642-12200-2_53
– ident: 311_CR20
– volume: 3
  start-page: 3
  year: 1973
  ident: 311_CR1
  publication-title: J. Math. Sociol.
  doi: 10.1080/0022250X.1973.9989821
– ident: 311_CR8
– ident: 311_CR15
– ident: 311_CR19
  doi: 10.1007/978-3-540-78757-0_14
– volume: 138
  start-page: 21
  issue: 1
  year: 2002
  ident: 311_CR7
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(01)00133-3
– volume: 244
  start-page: 323
  issue: 1–3
  year: 2002
  ident: 311_CR16
  publication-title: Discret. Math.
  doi: 10.1016/S0012-365X(01)00091-7
– volume: 38
  start-page: 31
  issue: 1
  year: 2007
  ident: 311_CR14
  publication-title: ACM SIGACT News
  doi: 10.1145/1233481.1233493
– volume: 141
  start-page: 109
  issue: 1&2
  year: 1995
  ident: 311_CR9
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)00097-3
– volume: 77
  start-page: 91
  issue: 1
  year: 2011
  ident: 311_CR13
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2010.06.007
– ident: 311_CR18
  doi: 10.1093/acprof:oso/9780198566076.003.0001
– volume-title: Parameterized Complexity Theory
  year: 2006
  ident: 311_CR12
– ident: 311_CR17
  doi: 10.1109/ARES.2007.70
– volume: 75
  start-page: 423
  issue: 8
  year: 2009
  ident: 311_CR5
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2009.04.001
– volume: 10
  start-page: 23
  issue: 1
  year: 2005
  ident: 311_CR3
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-005-1857-x
– volume: 27
  start-page: 559
  issue: 6
  year: 2000
  ident: 311_CR6
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(99)00047-7
– ident: 311_CR11
– ident: 311_CR4
  doi: 10.1007/978-3-642-11269-0_2
– volume: 6
  start-page: 139
  year: 1978
  ident: 311_CR21
  publication-title: J. Math. Sociol.
  doi: 10.1080/0022250X.1978.9989883
– volume-title: Parameterized Complexity
  year: 1999
  ident: 311_CR10
  doi: 10.1007/978-1-4612-0515-9
SSID ssj0061199
Score 2.211852
Snippet Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first...
SourceID crossref
springer
SourceType Enrichment Source
Index Database
Publisher
StartPage 883
SubjectTerms Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Title Parameterized computational complexity of finding small-diameter subgraphs
URI https://link.springer.com/article/10.1007/s11590-011-0311-5
Volume 6
WOSCitedRecordID wos000304624700006&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: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1862-4480
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0061199
  issn: 1862-4472
  databaseCode: RSV
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90-qAPfovziz74pBSaNknbRxGHiI7hx9hbSZqrCLOTtRP0rzdJ282BCvpSCCSlXC65u97d7wdwom1O6GVMuplk6FIf0ZXoSX3wotiw2xJuG2n7N2G3Gw0Gca_u4y6aavcmJWlv6lmzm7a8pojKlADpB1uEJW3tIsPXcHffb65fTirSSBKZdiAa-k0q87tXzBuj-UyoNTCd9X992gas1f6kc14pwCYsYL4Fq19QBvXodgrNWmzDdU-YeiwD0fyBykktq0P9R9CODEJm-e6MMsfms_Mnp3gRw6GrFckuc4qJtDDXxQ48di4fLq7cmlDBTQNGS5eISOkAKs7iVAoUREgifW5cBIw8lDTgnlI6VvaU4CojArniepMNiacOXgMV7EIrH-W4Bw5V2lMjNEw9ySlRTPgyQMWyNMaIUozb4DWSTdIabdyQXgyTGU6yEVqihZYYoSWsDafTJa8V1MZvk8-arUjqU1f8PHv_T7MPYEW7RX5VEHYIrXI8wSNYTt_K52J8bLXtE9V2zpI
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90CuqD3-L87INPSqFp07R9FHFM3cbQOfYWkiYVYXaydoL-9SZpuzlQQV8KgaSUyyV317v7_QDOlM0JnMTndsJ9aWNXSptLh6uDF0aa3RYR00jbbwWdTjgYRN2yjzurqt2rlKS5qWfNbsry6iIqXQKkHv4iLGFlsDRg_v1Dv7p-CSpII1Go24Fw4FapzO9eMW-M5jOhxsA0Nv71aZuwXvqT1mWhAFuwINNtWPuCMqhG7Sk0a7YDt12m67E0RPOHFFZsWB3KP4JmpBEy83drlFgmn50-WdkLGw5tpUhmmZVNuIG5znbhsXHdu2raJaGCHXs-zm3EQqECqCiJYs4kQ4wj7hLtIsjQkRx7xBFCxcqOYEQkiEkiiNpkTeKpgldPeHtQS0ep3AcLC-WpIRzEDicYCZ-53JPCT-JIhhjLqA5OJVkal2jjmvRiSGc4yVpoVAmNaqFRvw7n0yWvBdTGb5Mvqq2g5anLfp598KfZp7DS7LVbtHXTuTuEVeUiuUVx2BHU8vFEHsNy_JY_Z-MTo3mfjjXRdg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD3-L87INPSlnSpmn7KOrwY46BOvZWkiYVYXZj7QT9603SdnOggvhSCCSlXC65u97d7wdwomyOjxKP2wn3pE0cKW0uEVcHLwg1uy2mppG22_Lb7aDXCzslz2lWVbtXKcmip0GjNKV5YyiSxrTxTVlhXVCly4HUw5uHBaLr6HW4_tCtrmKKCwJJHOjWIOI7VVrzu1fMGqbZrKgxNs21f3_mOqyWfqZ1XijGBszJdBNWvqAPqtH9BLI124LbDtN1Whq6-UMKKzZsD-WfQjPSyJn5uzVILJPnTp-t7JX1-7ZSMLPMysbcwF9n2_DUvHq8uLZLogU7dj2S25gFQgVWYRLGnEmGGcfcodp1kAGSnLgUCaFiaCQYFQlmkgqqNl-Te6qg1hXuDtTSQSp3wSJCeXCY-DHilGDhMYe7UnhJHMqAEBnWAVVSjuIShVyTYfSjKX6yFlqkhBZpoUVeHU4nS4YFBMdvk8-qbYnK05j9PHvvT7OPYalz2YxaN-27fVhWnpNT1IwdQC0fjeUhLMZv-Us2OjJK-Alg9Npa
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=Parameterized+computational+complexity+of+finding+small-diameter+subgraphs&rft.jtitle=Optimization+letters&rft.au=Sch%C3%A4fer%2C+Alexander&rft.au=Komusiewicz%2C+Christian&rft.au=Moser%2C+Hannes&rft.au=Niedermeier%2C+Rolf&rft.date=2012-06-01&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=6&rft.issue=5&rft.spage=883&rft.epage=891&rft_id=info:doi/10.1007%2Fs11590-011-0311-5&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11590_011_0311_5
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-4472&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-4472&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-4472&client=summon