Algorithms and complexity of strongly stable non-crossing matchings

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 379; s. 802 - 813
Hlavní autori: Sachin, Panda, B.S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 30.01.2026
ISSN:0166-218X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Author Panda, B.S.
Sachin
Author_xml – sequence: 1
  surname: Sachin
  fullname: Sachin
– sequence: 2
  givenname: B.S.
  orcidid: 0000-0002-0721-5325
  surname: Panda
  fullname: Panda, B.S.
BookMark eNotj81OwzAQhH0oEm3hAbj5BRK8dpv4WkX8SZW4gMTNWv-liZK4snMgb48DnL6ZOczu7MhmCpMj5AFYCQyqx760OJac8WP2ZcaGbHNeFRzk1y3ZpdQzxiC7LWlOQxtiN1_GRHGy1ITxOrjvbl5o8DTNMUztsGSBenA0HypMDCl1U0tHnM0li3RHbjwOyd3_c08-n58-mtfi_P7y1pzOheEHPheIAjlayyvtpBZWCwfGSnOojWTSm6NkNSAyrq1DwSvjawfaa1FZKRwDsSfw1_v7QnReXWM3YlwUMLUuV73Ky9W6fI0yxA8RV1Nb
Cites_doi 10.1016/0166-218X(84)90081-7
10.1086/261272
10.1016/0166-218X(92)00179-P
10.1016/j.tcs.2018.03.015
10.1080/00029890.1962.11989827
10.1007/s00453-009-9326-z
10.1016/S0304-3975(01)00206-7
10.1007/s00453-021-00832-9
10.1145/800157.805047
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1016/j.dam.2025.10.025
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EndPage 813
ExternalDocumentID 10_1016_j_dam_2025_10_025
GroupedDBID -~X
AAYXX
ADEZE
AFTJW
AI.
ALMA_UNASSIGNED_HOLDINGS
CITATION
FA8
FDB
OAUVE
VH1
WUQ
ID FETCH-LOGICAL-c242t-aa3a2add26be8b3db3e1cd8c47c808fc58071aa02bdea326cf7e1bfb36d83e013
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001615000300003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Wed Nov 05 20:47:37 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c242t-aa3a2add26be8b3db3e1cd8c47c808fc58071aa02bdea326cf7e1bfb36d83e013
ORCID 0000-0002-0721-5325
OpenAccessLink https://doi.org/10.1016/j.dam.2025.10.025
PageCount 12
ParticipantIDs crossref_primary_10_1016_j_dam_2025_10_025
PublicationCentury 2000
PublicationDate 2026-01-30
PublicationDateYYYYMMDD 2026-01-30
PublicationDate_xml – month: 01
  year: 2026
  text: 2026-01-30
  day: 30
PublicationDecade 2020
PublicationTitle Discrete Applied Mathematics
PublicationYear 2026
References Gale (10.1016/j.dam.2025.10.025_b6) 1962; 69
Manlove (10.1016/j.dam.2025.10.025_b13) 2002; 276
Adil (10.1016/j.dam.2025.10.025_b2) 2018; 723
Hamada (10.1016/j.dam.2025.10.025_b9) 2021; 83
Irving (10.1016/j.dam.2025.10.025_b10) 1994; 48
Gusfield (10.1016/j.dam.2025.10.025_b7) 1989
Marx (10.1016/j.dam.2025.10.025_b14) 2010; 58
Ruangwises (10.1016/j.dam.2025.10.025_b18) 2019
Hamada (10.1016/j.dam.2025.10.025_b8) 2020
Abraham (10.1016/j.dam.2025.10.025_b1) 2007
Cygan (10.1016/j.dam.2025.10.025_b4) 2015
Roth (10.1016/j.dam.2025.10.025_b17) 1986
Tovey (10.1016/j.dam.2025.10.025_b19) 1984; 8
Karp (10.1016/j.dam.2025.10.025_b11) 2010
10.1016/j.dam.2025.10.025_b3
Manlove (10.1016/j.dam.2025.10.025_b12) 2013
Panda (10.1016/j.dam.2025.10.025_b15) 2023
Downey (10.1016/j.dam.2025.10.025_b5) 2012
Roth (10.1016/j.dam.2025.10.025_b16) 1984; 92
References_xml – volume: 8
  start-page: 85
  issue: 1
  year: 1984
  ident: 10.1016/j.dam.2025.10.025_b19
  article-title: A simplified NP-complete satisfiability problem
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(84)90081-7
– volume: 92
  start-page: 991
  issue: 6
  year: 1984
  ident: 10.1016/j.dam.2025.10.025_b16
  article-title: The evolution of the labor market for medical interns and residents: a case study in game theory
  publication-title: J. Political Econ.
  doi: 10.1086/261272
– volume: 48
  start-page: 261
  issue: 3
  year: 1994
  ident: 10.1016/j.dam.2025.10.025_b10
  article-title: Stable marriage and indifference
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(92)00179-P
– volume: 723
  start-page: 1
  year: 2018
  ident: 10.1016/j.dam.2025.10.025_b2
  article-title: Parameterized algorithms for stable matching with ties and incomplete lists
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2018.03.015
– year: 2015
  ident: 10.1016/j.dam.2025.10.025_b4
– year: 2013
  ident: 10.1016/j.dam.2025.10.025_b12
– start-page: 425
  year: 1986
  ident: 10.1016/j.dam.2025.10.025_b17
  article-title: On the allocation of residents to rural hospitals: a general property of two-sided matching markets
  publication-title: Econ.: J. Econ. Soc.
– volume: 69
  start-page: 9
  issue: 1
  year: 1962
  ident: 10.1016/j.dam.2025.10.025_b6
  article-title: College admissions and the stability of marriage
  publication-title: Am. Math. Mon.
  doi: 10.1080/00029890.1962.11989827
– year: 2010
  ident: 10.1016/j.dam.2025.10.025_b11
– volume: 58
  start-page: 170
  issue: 1
  year: 2010
  ident: 10.1016/j.dam.2025.10.025_b14
  article-title: Parameterized complexity and local search approaches for the stable marriage problem with ties
  publication-title: Algorithmica
  doi: 10.1007/s00453-009-9326-z
– volume: 276
  start-page: 261
  issue: 1–2
  year: 2002
  ident: 10.1016/j.dam.2025.10.025_b13
  article-title: Hard variants of stable marriage
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00206-7
– year: 2012
  ident: 10.1016/j.dam.2025.10.025_b5
– year: 1989
  ident: 10.1016/j.dam.2025.10.025_b7
– start-page: 304
  year: 2020
  ident: 10.1016/j.dam.2025.10.025_b8
  article-title: Strongly stable and maximum weakly stable noncrossing matchings
– volume: 83
  start-page: 2678
  issue: 9
  year: 2021
  ident: 10.1016/j.dam.2025.10.025_b9
  article-title: Strongly stable and maximum weakly stable noncrossing matchings
  publication-title: Algorithmica
  doi: 10.1007/s00453-021-00832-9
– start-page: 363
  year: 2023
  ident: 10.1016/j.dam.2025.10.025_b15
  article-title: Algorithms and complexity of strongly stable non-crossing matchings
– start-page: 405
  year: 2019
  ident: 10.1016/j.dam.2025.10.025_b18
  article-title: Stable noncrossing matchings
– start-page: 431
  year: 2007
  ident: 10.1016/j.dam.2025.10.025_b1
  article-title: The stable roommates problem with globally-ranked pairs
– ident: 10.1016/j.dam.2025.10.025_b3
  doi: 10.1145/800157.805047
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.4373567
SourceID crossref
SourceType Index Database
StartPage 802
Title Algorithms and complexity of strongly stable non-crossing matchings
Volume 379
WOSCitedRecordID wos001615000300003&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
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 20211211
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0001218
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 20220331
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0001218
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8NAEF609VAP4hPf7MGTsKXNo9kcS62oYBFaobewm05qpbalqVL_vbPZPNaKYA9e8iJskv3CzDez8yDkKhJ1ABcGzLcjYI4HnEm0g5hAQRjWPD8CRzeb8Dod3u_7T2nP9jhpJ-BNJny59Gf_CjVeQ7BV6uwacOeD4gU8RtBxi7Dj9k_AN8fDKVr8L29xlrM2U0UvdeRFrDzfw_GnciGonCk0_lmiKJXHAMlrElkZm4z1ZoSCBZl1zlcf80KvOR3vJhGZxWoUmvnJf1PtVk2vgpV4FdIFktTR2GgwVP99U1Lauu9LKut4zTLVpk4p_SGRtXPgFZ-k8v4tt6pi6XSu8_fq1ytaKY8VzMLQXgMcIlBD4HmAu01StjzX5yVSbt63-w9G1TBVEq-S-dmKZSWkV05a7F1_XLbMnQT8rbyhQVQMxtHbJTupqUCbGuI9sgGTfbJtTP8BaRVgU5x1WoBNpxHNwKYabGqCTXOwD8nzbbvXumNpWwwWIp9aMCFsYaFashoSuLQH0oa6qvDgeCGv8Sh0OdJGIWqWHIBAdh5GHtRlJO3GgNuAlP-IlPCBcEwoWs_cAde1BSjL3vG5jFxHWgLluPTAPyHX2RwEM139JPgVj9N1bj4jleK3OyelxfwdLshW-LEYxfPLFNEvgZlR1w
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=Algorithms+and+complexity+of+strongly+stable+non-crossing+matchings&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Sachin&rft.au=Panda%2C+B.S.&rft.date=2026-01-30&rft.issn=0166-218X&rft.volume=379&rft.spage=802&rft.epage=813&rft_id=info:doi/10.1016%2Fj.dam.2025.10.025&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2025_10_025
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon