{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T14:01:45Z","timestamp":1780149705728,"version":"3.54.0"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116058","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:48:43Z","timestamp":1779428923000},"page":"116058","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Classified rank-maximal matchings and popular matchings: Algorithms and hardness"],"prefix":"10.1016","volume":"1081","author":[{"given":"Meghana","family":"Nasre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7601-9555","authenticated-orcid":false,"given":"Prajakta","family":"Nimbhorkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nada","family":"Pulath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116058_bib0001","series-title":"Technical Report","article-title":"Greedy Matchings","author":"Irving","year":"2003"},{"issue":"4","key":"10.1016\/j.tcs.2026.116058_bib0002","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1137\/06067328X","article-title":"Popular matchings","volume":"37","author":"Abraham","year":"2007","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116058_bib0003","series-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","first-page":"1235","article-title":"Classified stable matching","author":"Huang","year":"2010"},{"key":"10.1016\/j.tcs.2026.116058_bib0004","series-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","first-page":"135","article-title":"A matroid approach to stable matchings with lower quotas","author":"Fleiner","year":"2012"},{"key":"10.1016\/j.tcs.2026.116058_bib0005","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am. Math. Mon."},{"issue":"4","key":"10.1016\/j.tcs.2026.116058_bib0006","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1198513.1198520","article-title":"Rank-maximal matchings","volume":"2","author":"Irving","year":"2006","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.116058_bib0007","series-title":"Proceedings of Eigth International Conference on Algorithms and Complexity, CIAC","first-page":"324","article-title":"Capacitated rank-maximal matchings","author":"Paluch","year":"2013"},{"key":"10.1016\/j.tcs.2026.116058_bib0008","series-title":"European Symposium on Algorithms","first-page":"492","article-title":"Popular matchings in the capacitated house allocation problem","author":"Manlove","year":"2006"},{"key":"10.1016\/j.tcs.2026.116058_bib0009","series-title":"International Colloquium on Automata, Languages, and Programming, ICALP","first-page":"715","article-title":"Weighted popular matchings","author":"Mestre","year":"2006"},{"issue":"3","key":"10.1016\/j.tcs.2026.116058_bib0010","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/s00453-010-9434-9","article-title":"Bounded unpopularity matchings","volume":"61","author":"Huang","year":"2011","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116058_bib0011","doi-asserted-by":"crossref","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","article-title":"Coverings of bipartite graphs","volume":"10","author":"Dulmage","year":"1958","journal-title":"Can. J. Math."},{"key":"10.1016\/j.tcs.2026.116058_bib0012","series-title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021","first-page":"377","article-title":"Matchings with group fairness constraints: online and offline algorithms","author":"Sankar","year":"2021"},{"key":"10.1016\/j.tcs.2026.116058_bib0013","series-title":"Proceedings of the Twenty Sixth European Conference on Artificial Intelligence, ECAI","first-page":"1601","article-title":"Online algorithms for matchings with proportional fairness constraints and diversity constraints","volume":"372","author":"Louis","year":"2023"},{"key":"10.1016\/j.tcs.2026.116058_bib0014","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/j.tcs.2026.116058_bib0015","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/j.tcs.2026.116058_bib0016","unstructured":"G. Cs\u00e1ji, Popularity and perfectness in one-sided matching markets with capacities, (2024). CoRRabs\/2403.00598."},{"key":"10.1016\/j.tcs.2026.116058_bib0017","series-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T13:18:52Z","timestamp":1780147132000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":17,"alternative-id":["S0304397526003087"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116058","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Classified rank-maximal matchings and popular matchings: Algorithms and hardness","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116058","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116058"}}