{ "labelLang" : "hun", "responseDate" : "2024-03-28 12:47", "content" : { "otype" : "Book", "mtid" : 31582450, "status" : "ADMIN_APPROVED", "published" : true, "unhandledTickets" : 0, "deleted" : false, "lastRefresh" : "2024-03-25T04:42:29.297+0000", "lastModified" : "2021-09-22T09:07:40.367+0000", "created" : "2020-09-05T09:12:46.767+0000", "creator" : { "otype" : "Admin", "mtid" : 565, "link" : "/api/admin/565", "label" : "WoS import (admin)", "familyName" : "WoS", "givenName" : "import", "published" : true, "snippet" : true }, "lastDuplumOK" : "2024-03-20T12:36:38.308+0000", "lastDuplumSearch" : "2024-03-20T12:36:38.308+0000", "adminApproved" : "2021-09-22T09:07:40.372+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10073918, "link" : "/api/admin/10073918", "label" : "Kovács Marcell (MTMT Közp., admin)", "familyName" : "Kovács", "givenName" : "Marcell", "published" : true, "snippet" : true }, "core" : false, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000144, "link" : "/api/subtype/10000144", "label" : "Konferenciakötet (Könyv)", "name" : "Konferenciakötet", "nameEng" : "Conference proceedings", "docType" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "listPosition" : 345, "published" : true, "oldId" : 10000144, "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 } ], "firstAuthor" : "Sau, Ignasi", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 93495856, "link" : "/api/authorship/93495856", "label" : "Sau, Ignasi [szerk.]", "listPosition" : 1, "share" : 0.0, "first" : false, "last" : false, "corresponding" : false, "familyName" : "Sau", "givenName" : "Ignasi", "authorTyped" : false, "editorTyped" : true, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 2, "link" : "/api/authorshiptype/2", "label" : "Szerkesztő", "code" : -1, "published" : true, "oldId" : -1, "snippet" : true }, "published" : false, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 93495857, "link" : "/api/authorship/93495857", "label" : "Thilikos, Dimitrios M [szerk.]", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "corresponding" : false, "familyName" : "Thilikos", "givenName" : "Dimitrios M", "authorTyped" : false, "editorTyped" : true, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 2, "link" : "/api/authorshiptype/2", "label" : "Szerkesztő", "code" : -1, "published" : true, "oldId" : -1, "snippet" : true }, "published" : false, "snippet" : true } ], "title" : "Graph-Theoretic Concepts in Computer Science", "subTitle" : "45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 19358279, "link" : "/api/publicationidentifier/19358279", "label" : "DOI: 10.1007/978-3-030-30786-8", "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 }, "oaType" : "PAY", "validState" : "IDENTICAL", "idValue" : "10.1007/978-3-030-30786-8", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15986635, "link" : "/api/publicationidentifier/15986635", "label" : "ISBN: 9783030307851", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "9783030307851", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030307851", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 19358278, "link" : "/api/publicationidentifier/19358278", "label" : "ISBN: 9783030307868", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "9783030307868", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030307868", "published" : false, "snippet" : true } ], "volumeNumber" : "11789", "seriesMembers" : [ { "otype" : "SeriesVolume", "mtid" : 179477, "link" : "/api/seriesvolume/179477", "label" : "Lecture Notes in Computer Science - Theoretical Computer Science and General Issues 0302-9743 1611-3349, 11789", "publication" : { "otype" : "Book", "mtid" : 31582450, "link" : "/api/publication/31582450", "label" : "Sau Ignasi. Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers. (2019) ISBN:9783030307851; 9783030307868", "core" : false, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000144, "link" : "/api/subtype/10000144", "label" : "Konferenciakötet (Könyv)", "name" : "Konferenciakötet", "nameEng" : "Conference proceedings", "docType" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "listPosition" : 345, "published" : true, "oldId" : 10000144, "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" : "Graph-Theoretic Concepts in Computer Science", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 19358279, "link" : "/api/publicationidentifier/19358279", "label" : "DOI: 10.1007/978-3-030-30786-8", "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 }, "oaType" : "PAY", "validState" : "IDENTICAL", "idValue" : "10.1007/978-3-030-30786-8", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15986635, "link" : "/api/publicationidentifier/15986635", "label" : "ISBN: 9783030307851", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "9783030307851", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030307851", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 19358278, "link" : "/api/publicationidentifier/19358278", "label" : "ISBN: 9783030307868", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "9783030307868", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030307868", "published" : false, "snippet" : true } ], "publishedAt" : [ { "otype" : "City", "mtid" : 15258, "link" : "/api/city/15258", "label" : "Cham, Svájc", "partOf" : { "otype" : "Country", "mtid" : 10022, "link" : "/api/country/10022", "label" : "Svájc", "published" : true, "oldId" : 18, "snippet" : true }, "published" : true, "oldId" : 10006686, "snippet" : true } ], "pageLength" : 415, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "nationalOrigin" : false, "published" : true, "snippet" : true }, "series" : { "otype" : "BookSeries", "mtid" : 20021223, "link" : "/api/bookseries/20021223", "label" : "Lecture Notes in Computer Science - Theoretical Computer Science and General Issues 0302-9743 1611-3349", "pIssn" : "0302-9743", "eIssn" : "1611-3349", "noIF" : false, "sciIndexed" : false, "scopusIndexed" : false, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "snippet" : true }, "published" : false, "snippet" : true } ], "editionNumber" : 1, "publishers" : [ { "otype" : "Publisher", "mtid" : 50952, "link" : "/api/publisher/50952", "label" : "Springer Netherlands", "name" : "Springer Netherlands", "published" : true, "snippet" : true } ], "publishedAt" : [ { "otype" : "City", "mtid" : 15258, "link" : "/api/city/15258", "label" : "Cham, Svájc", "partOf" : { "otype" : "Country", "mtid" : 10022, "link" : "/api/country/10022", "label" : "Svájc", "published" : true, "oldId" : 18, "snippet" : true }, "published" : true, "oldId" : 10006686, "snippet" : true } ], "firstPageOrInternalIdForSort" : "", "pageLength" : 415, "publishedYear" : 2019, "conference" : { "otype" : "Conference", "mtid" : 239278, "link" : "/api/conference/239278", "label" : "45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 2019-06-19", "location" : [ ], "published" : true, "snippet" : true }, "abstractText" : "This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019.\n\nThe 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.", "digital" : true, "printed" : true, "sourceYear" : 2020, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "nationalOrigin" : false, "missingAuthor" : false, "oaType" : "PAY", "oaCheckDate" : "2024-03-25", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 0, "citedCount" : 0, "hasCitationDuplums" : false, "userChangeableUntil" : "2020-12-12T22:06:14.171+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 18, "ownerInstituteCount" : 66, "directInstituteCount" : 0, "authorCount" : 0, "contributorCount" : 2, "chapterCount" : 20, "chapters" : [ { "otype" : "BookChapter", "mtid" : 31570638, "link" : "/api/publication/31570638", "label" : "Aichholzer Oswin et al. Flip Distances Between Graph Orientations. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 120-134", "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" : "Flip Distances Between Graph Orientations", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17666970, "link" : "/api/publicationidentifier/17666970", "label" : "DOI: 10.1007/978-3-030-30786-8_10", "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 }, "idValue" : "10.1007/978-3-030-30786-8_10", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_10", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17666969, "link" : "/api/publicationidentifier/17666969", "label" : "WoS: 000557920500010", "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 }, "idValue" : "000557920500010", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500010", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17666972, "link" : "/api/publicationidentifier/17666972", "label" : "Scopus: 85072869793", "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 }, "idValue" : "85072869793", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072869793", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 15, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31569185, "link" : "/api/publication/31569185", "label" : "Alecu Bogdan et al. Graph Functionality. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 135-147", "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" : "Graph Functionality", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17662894, "link" : "/api/publicationidentifier/17662894", "label" : "DOI: 10.1007/978-3-030-30786-8_11", "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 }, "idValue" : "10.1007/978-3-030-30786-8_11", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_11", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17662893, "link" : "/api/publicationidentifier/17662893", "label" : "WoS: 000557920500011", "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 }, "idValue" : "000557920500011", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500011", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17662896, "link" : "/api/publicationidentifier/17662896", "label" : "Scopus: 85072853315", "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 }, "idValue" : "85072853315", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072853315", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 34747683, "link" : "/api/publication/34747683", "label" : "Bamas É. et al. Local Approximation of the Maximum Cut in Regular Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 66-78", "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" : "Local Approximation of the Maximum Cut in Regular Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 25890502, "link" : "/api/publicationidentifier/25890502", "label" : "DOI: 10.1007/978-3-030-30786-8_6", "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 }, "idValue" : "10.1007/978-3-030-30786-8_6", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_6", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 25890503, "link" : "/api/publicationidentifier/25890503", "label" : "WoS: 000557920500006", "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 }, "idValue" : "000557920500006", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500006", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 25890501, "link" : "/api/publicationidentifier/25890501", "label" : "Scopus: 85072871382", "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 }, "idValue" : "85072871382", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072871382", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 34747600, "link" : "/api/publication/34747600", "label" : "Bamas É. et al. Local Approximation of the Maximum Cut in Regular Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 66-78", "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" : "Local Approximation of the Maximum Cut in Regular Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 25890293, "link" : "/api/publicationidentifier/25890293", "label" : "DOI: 10.1007/978-3-030-30786-8_6", "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 }, "idValue" : "10.1007/978-3-030-30786-8_6", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_6", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 25890294, "link" : "/api/publicationidentifier/25890294", "label" : "WoS: 000557920500006", "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 }, "idValue" : "000557920500006", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500006", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 25890292, "link" : "/api/publicationidentifier/25890292", "label" : "Scopus: 85072871382", "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 }, "idValue" : "85072871382", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072871382", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : false, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30852940, "link" : "/api/publication/30852940", "label" : "Bamas É. et al. Local Approximation of the Maximum Cut in Regular Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 66-78", "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" : "Local Approximation of the Maximum Cut in Regular Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15986637, "link" : "/api/publicationidentifier/15986637", "label" : "DOI: 10.1007/978-3-030-30786-8_6", "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-030-30786-8_6", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_6", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17707306, "link" : "/api/publicationidentifier/17707306", "label" : "WoS: 000557920500006", "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" : "000557920500006", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500006", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15986636, "link" : "/api/publicationidentifier/15986636", "label" : "Scopus: 85072871382", "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" : "85072871382", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072871382", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33214218, "link" : "/api/publication/33214218", "label" : "Bamas É. et al. Local Approximation of the Maximum Cut in Regular Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 66-78", "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" : "Local Approximation of the Maximum Cut in Regular Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22000860, "link" : "/api/publicationidentifier/22000860", "label" : "DOI: 10.1007/978-3-030-30786-8_6", "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 }, "idValue" : "10.1007/978-3-030-30786-8_6", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_6", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22000861, "link" : "/api/publicationidentifier/22000861", "label" : "WoS: 000557920500006", "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 }, "idValue" : "000557920500006", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500006", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22000859, "link" : "/api/publicationidentifier/22000859", "label" : "Scopus: 85072871382", "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 }, "idValue" : "85072871382", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072871382", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 34137628, "link" : "/api/publication/34137628", "label" : "Bamas É. et al. Local Approximation of the Maximum Cut in Regular Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 66-78", "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" : "Local Approximation of the Maximum Cut in Regular Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 24367128, "link" : "/api/publicationidentifier/24367128", "label" : "DOI: 10.1007/978-3-030-30786-8_6", "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 }, "idValue" : "10.1007/978-3-030-30786-8_6", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_6", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 24367129, "link" : "/api/publicationidentifier/24367129", "label" : "WoS: 000557920500006", "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 }, "idValue" : "000557920500006", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500006", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 24367127, "link" : "/api/publicationidentifier/24367127", "label" : "Scopus: 85072871382", "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 }, "idValue" : "85072871382", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072871382", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : false, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31575472, "link" : "/api/publication/31575472", "label" : "Berge Pierre et al. Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 79-92", "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" : "Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17681347, "link" : "/api/publicationidentifier/17681347", "label" : "DOI: 10.1007/978-3-030-30786-8_7", "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-030-30786-8_7", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_7", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17681346, "link" : "/api/publicationidentifier/17681346", "label" : "WoS: 000557920500007", "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" : "000557920500007", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500007", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17681351, "link" : "/api/publicationidentifier/17681351", "label" : "Scopus: 85072858616", "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 }, "idValue" : "85072858616", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072858616", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 14, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31551783, "link" : "/api/publication/31551783", "label" : "Boeker Jan. Color Refinement, Homomorphisms, and Hypergraphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 338-350", "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" : "Color Refinement, Homomorphisms, and Hypergraphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17606496, "link" : "/api/publicationidentifier/17606496", "label" : "DOI: 10.1007/978-3-030-30786-8_26", "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-030-30786-8_26", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_26", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17606495, "link" : "/api/publicationidentifier/17606495", "label" : "WoS: 000557920500026", "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" : "000557920500026", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500026", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17606498, "link" : "/api/publicationidentifier/17606498", "label" : "Scopus: 85072874252", "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" : "85072874252", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072874252", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31582449, "link" : "/api/publication/31582449", "label" : "Chakraborty Dibyayan et al. Approximating Minimum Dominating Set on String Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 232-243", "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" : "Approximating Minimum Dominating Set on String Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17702290, "link" : "/api/publicationidentifier/17702290", "label" : "DOI: 10.1007/978-3-030-30786-8_18", "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 }, "idValue" : "10.1007/978-3-030-30786-8_18", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_18", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17702289, "link" : "/api/publicationidentifier/17702289", "label" : "WoS: 000557920500018", "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 }, "idValue" : "000557920500018", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500018", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17702292, "link" : "/api/publicationidentifier/17702292", "label" : "Scopus: 85072863690", "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 }, "idValue" : "85072863690", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072863690", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 12, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31551779, "link" : "/api/publication/31551779", "label" : "Chen Hubie et al. The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 364-378", "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" : "The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17606488, "link" : "/api/publicationidentifier/17606488", "label" : "DOI: 10.1007/978-3-030-30786-8_28", "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-030-30786-8_28", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_28", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17606487, "link" : "/api/publicationidentifier/17606487", "label" : "WoS: 000557920500028", "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" : "000557920500028", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500028", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17606490, "link" : "/api/publicationidentifier/17606490", "label" : "Scopus: 85072855542", "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" : "85072855542", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072855542", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 15, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31573904, "link" : "/api/publication/31573904", "label" : "Disser Yann et al. Travelling on Graphs with Small Highway Dimension. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 175-189", "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" : "Travelling on Graphs with Small Highway Dimension", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17676486, "link" : "/api/publicationidentifier/17676486", "label" : "DOI: 10.1007/978-3-030-30786-8_14", "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-030-30786-8_14", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_14", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17676485, "link" : "/api/publicationidentifier/17676485", "label" : "WoS: 000557920500014", "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" : "000557920500014", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500014", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17676489, "link" : "/api/publicationidentifier/17676489", "label" : "Scopus: 85072860511", "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 }, "idValue" : "85072860511", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072860511", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 15, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31576407, "link" : "/api/publication/31576407", "label" : "Ganian Robert et al. The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 190-204", "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" : "The Power of Cut-Based Parameters for Computing Edge Disjoint Paths", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17683845, "link" : "/api/publicationidentifier/17683845", "label" : "DOI: 10.1007/978-3-030-30786-8_15", "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 }, "idValue" : "10.1007/978-3-030-30786-8_15", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_15", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17683844, "link" : "/api/publicationidentifier/17683844", "label" : "WoS: 000557920500015", "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 }, "idValue" : "000557920500015", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500015", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17683847, "link" : "/api/publicationidentifier/17683847", "label" : "Scopus: 85072861022", "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 }, "idValue" : "85072861022", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072861022", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 15, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30853209, "link" : "/api/publication/30853209", "label" : "Gonçalves D.. 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 351-363", "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" : "3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15987182, "link" : "/api/publicationidentifier/15987182", "label" : "DOI: 10.1007/978-3-030-30786-8_27", "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-030-30786-8_27", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_27", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17664782, "link" : "/api/publicationidentifier/17664782", "label" : "WoS: 000557920500027", "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" : "000557920500027", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500027", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15987181, "link" : "/api/publicationidentifier/15987181", "label" : "Scopus: 85072865142", "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" : "85072865142", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072865142", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31570896, "link" : "/api/publication/31570896", "label" : "Hatzel Meike et al. Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 53-65", "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" : "Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17667748, "link" : "/api/publicationidentifier/17667748", "label" : "DOI: 10.1007/978-3-030-30786-8_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-030-30786-8_5", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_5", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17667747, "link" : "/api/publicationidentifier/17667747", "label" : "WoS: 000557920500005", "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" : "000557920500005", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500005", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17667750, "link" : "/api/publicationidentifier/17667750", "label" : "Scopus: 85072855900", "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" : "85072855900", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072855900", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33250720, "link" : "/api/publication/33250720", "label" : "Husić E. et al. A Polynomial-Time Algorithm for the Independent Set Problem in {P10, C4, C6}-Free Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 271-284", "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 Polynomial-Time Algorithm for the Independent Set Problem in {P10, C4, C6}-Free Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22104013, "link" : "/api/publicationidentifier/22104013", "label" : "DOI: 10.1007/978-3-030-30786-8_21", "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 }, "idValue" : "10.1007/978-3-030-30786-8_21", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_21", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22104014, "link" : "/api/publicationidentifier/22104014", "label" : "WoS: 000557920500021", "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 }, "idValue" : "000557920500021", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500021", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22104012, "link" : "/api/publicationidentifier/22104012", "label" : "Scopus: 85072868066", "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 }, "idValue" : "85072868066", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072868066", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 14, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31566937, "link" : "/api/publication/31566937", "label" : "Jansen Bart M. et al. Hamiltonicity Below Dirac's Condition. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 27-39", "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" : "Hamiltonicity Below Dirac's Condition", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17655676, "link" : "/api/publicationidentifier/17655676", "label" : "DOI: 10.1007/978-3-030-30786-8_3", "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 }, "idValue" : "10.1007/978-3-030-30786-8_3", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_3", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17655675, "link" : "/api/publicationidentifier/17655675", "label" : "WoS: 000557920500003", "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 }, "idValue" : "000557920500003", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500003", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17655678, "link" : "/api/publicationidentifier/17655678", "label" : "Scopus: 85072862182", "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 }, "idValue" : "85072862182", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072862182", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31134258, "link" : "/api/publication/31134258", "label" : "Milanič M. et al. Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 379-391", "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" : "Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 16539430, "link" : "/api/publicationidentifier/16539430", "label" : "DOI: 10.1007/978-3-030-30786-8_29", "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 }, "idValue" : "10.1007/978-3-030-30786-8_29", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_29", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22384277, "link" : "/api/publicationidentifier/22384277", "label" : "WoS: 000557920500029", "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" : "000557920500029", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500029", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 16539429, "link" : "/api/publicationidentifier/16539429", "label" : "Scopus: 85072860848", "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 }, "idValue" : "85072860848", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072860848", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31780159, "link" : "/api/publication/31780159", "label" : "Nasre Meghana et al. Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 244-257", "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" : "Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 18234546, "link" : "/api/publicationidentifier/18234546", "label" : "DOI: 10.1007/978-3-030-30786-8_19", "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-030-30786-8_19", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_19", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 18234548, "link" : "/api/publicationidentifier/18234548", "label" : "WoS: 000557920500019", "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" : "000557920500019", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500019", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 24037037, "link" : "/api/publicationidentifier/24037037", "label" : "Scopus: 85072859302", "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" : "85072859302", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072859302", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 18234547, "link" : "/api/publicationidentifier/18234547", "label" : "Egyéb URL: http://link.springer.com/10.1007/978-3-030-30786-8_19", "source" : { "otype" : "PlainSource", "mtid" : 40, "link" : "/api/publicationsource/40", "label" : "Egyéb URL", "type" : { "otype" : "PublicationSourceType", "mtid" : 10006, "link" : "/api/publicationsourcetype/10006", "label" : "Link", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "Egyéb URL", "nameEng" : "Other URL", "linkPattern" : "@@@", "publiclyVisible" : true, "published" : true, "oldId" : 40, "snippet" : true }, "idValue" : "http://link.springer.com/10.1007/978-3-030-30786-8_19", "realUrl" : "http://link.springer.com/10.1007/978-3-030-30786-8_19", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 14, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30853141, "link" : "/api/publication/30853141", "label" : "Okrasa K. et al. Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. (2019) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 1-13", "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" : "Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15986999, "link" : "/api/publicationidentifier/15986999", "label" : "DOI: 10.1007/978-3-030-30786-8_1", "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-030-30786-8_1", "realUrl" : "https://doi.org/10.1007/978-3-030-30786-8_1", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 19423017, "link" : "/api/publicationidentifier/19423017", "label" : "ISBN: 9783030307868; 9783030307851", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "9783030307868; 9783030307851", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030307868; 9783030307851", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 17684785, "link" : "/api/publicationidentifier/17684785", "label" : "WoS: 000557920500001", "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" : "000557920500001", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000557920500001", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15986998, "link" : "/api/publicationidentifier/15986998", "label" : "Scopus: 85072873657", "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" : "85072873657", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85072873657", "published" : false, "snippet" : true } ], "volume" : "11789 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true } ], "fromCitation" : false, "hasQualityFactor" : false, "link" : "/api/publication/31582450", "label" : "Sau Ignasi. Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers. (2019) ISBN:9783030307851; 9783030307868", "template" : "