{ "labelLang" : "hun", "responseDate" : "2024-03-29 09:21", "content" : { "otype" : "Citation", "mtid" : 27790447, "status" : "APPROVED", "published" : true, "comment" : "A4 IBM Research; ILOG; BiCi; IASI-CNR; Universita di Bologna\nTörölt Idézésrekord:22901604 megjegyzés: INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION", "unhandledTickets" : 0, "deleted" : false, "lastRefresh" : "2024-02-29T16:54:32.308+0000", "lastModified" : "2021-08-06T10:36:01.941+0000", "created" : "2019-01-09T09:20:57.032+0000", "creator" : { "otype" : "Admin", "mtid" : 10060777, "link" : "/api/admin/10060777", "label" : "Földes Szilvia (ELTE TTK admin 5 - INAKTÍV)", "familyName" : "Földes", "givenName" : "Szilvia", "published" : true, "oldId" : 10060777, "snippet" : true }, "lastDuplumOK" : "2019-07-09T20:58:53.912+0000", "lastDuplumSearch" : "2019-07-09T20:58:53.912+0000", "publication" : { "otype" : "JournalArticle", "mtid" : 1045345, "link" : "/api/publication/1045345", "label" : "Frank A et al. Minimal edge-coverings of pairs of sets. (1995) JOURNAL OF COMBINATORIAL THEORY SERIES B 0095-8956 1096-0902 65 1 73-110", "core" : true, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "Minimal edge-coverings of pairs of sets", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 126978, "link" : "/api/publicationidentifier/126978", "label" : "DOI: 10.1006/jctb.1995.1044", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "10.1006/jctb.1995.1044", "realUrl" : "https://doi.org/10.1006/jctb.1995.1044", "published" : false, "oldId" : 54914, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 126976, "link" : "/api/publicationidentifier/126976", "label" : "WoS: A1995RT86500005", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "A1995RT86500005", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/A1995RT86500005", "published" : false, "oldId" : 54915, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 126977, "link" : "/api/publicationidentifier/126977", "label" : "Scopus: 0003017893", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "0003017893", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-0003017893", "published" : false, "oldId" : 54916, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 14968208, "link" : "/api/publicationidentifier/14968208", "label" : "Teljes dokumentum: http://www.sciencedirect.com/science/article/pii/S0095895685710441", "source" : { "otype" : "PlainSource", "mtid" : 39, "link" : "/api/publicationsource/39", "label" : "Teljes dokumentum", "type" : { "otype" : "PublicationSourceType", "mtid" : 10006, "link" : "/api/publicationsourcetype/10006", "label" : "Link", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "Teljes dokumentum", "nameEng" : "Teljes dokumentum", "linkPattern" : "@@@", "publiclyVisible" : true, "published" : true, "oldId" : 39, "snippet" : true }, "validState" : "NO", "idValue" : "http://www.sciencedirect.com/science/article/pii/S0095895685710441", "realUrl" : "http://www.sciencedirect.com/science/article/pii/S0095895685710441", "published" : false, "oldId" : 2461331, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 126979, "link" : "/api/publicationidentifier/126979", "label" : "Mathematical Reviews: MR1347341", "source" : { "otype" : "PlainSource", "mtid" : 7, "link" : "/api/publicationsource/7", "label" : "Mathematical Reviews", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Mathematical Reviews", "nameEng" : "Mathematical Reviews", "linkPattern" : "https://mathscinet.ams.org/mathscinet-getitem?mr=@@@", "publiclyVisible" : true, "published" : true, "oldId" : 7, "snippet" : true }, "oaFree" : false, "validState" : "NO", "idValue" : "MR1347341", "realUrl" : "https://mathscinet.ams.org/mathscinet-getitem?mr=MR1347341", "published" : false, "oldId" : 613853, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 2387, "link" : "/api/journal/2387", "label" : "JOURNAL OF COMBINATORIAL THEORY SERIES B 0095-8956 1096-0902", "pIssn" : "0095-8956", "eIssn" : "1096-0902", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 2387, "snippet" : true }, "volume" : "65", "issue" : "1", "publishedAt" : [ ], "pageLength" : 38, "publishedYear" : 1995, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : true, "published" : true, "oldId" : 1045345, "snippet" : true }, "publicationMtid" : 1045345, "related" : { "otype" : "BookChapter", "mtid" : 21198340, "link" : "/api/publication/21198340", "label" : "Takazawa Kenjiro. A Weighted Ktt-Free t-Factor Algorithm for Bipartite Graphs: Integer Programming and Combinatorial Optimization. (2008) Megjelent: Integer Programming and Combinatorial Optimization pp. 62-76", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "A Weighted Ktt-Free t-Factor Algorithm for Bipartite Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 3162969, "link" : "/api/publicationidentifier/3162969", "label" : "DOI: 10.1007/978-3-540-68891-4_5", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "10.1007/978-3-540-68891-4_5", "realUrl" : "https://doi.org/10.1007/978-3-540-68891-4_5", "published" : false, "oldId" : 954953, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 8022426, "link" : "/api/publicationidentifier/8022426", "label" : "WoS: 000255984100005", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "000255984100005", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000255984100005", "published" : false, "oldId" : 7125959, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 8022427, "link" : "/api/publicationidentifier/8022427", "label" : "Scopus: 45749094625", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "45749094625", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-45749094625", "published" : false, "oldId" : 17309714, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 15, "publishedYear" : 2008, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "oldId" : 11198340, "snippet" : true }, "relatedMtid" : 21198340, "source" : "Scopus", "externalCitation" : true, "externalCitationOK" : null, "mentionCount" : 1, "link" : "/api/citation/27790447", "label" : "Takazawa Kenjiro. A Weighted Ktt-Free t-Factor Algorithm for Bipartite Graphs: Integer Programming and Combinatorial Optimization. (2008) Megjelent: Integer Programming and Combinatorial Optimization pp. 62-76", "template" : "