{ "labelLang" : "hun", "responseDate" : "2024-03-29 08:14", "content" : { "otype" : "Book", "mtid" : 30436055, "status" : "APPROVED", "published" : true, "unhandledTickets" : 0, "deleted" : false, "lastRefresh" : "2024-03-25T06:08:07.448+0000", "lastModified" : "2023-04-24T12:37:26.074+0000", "created" : "2019-02-15T10:04:53.611+0000", "creator" : { "otype" : "Admin", "mtid" : 10060893, "link" : "/api/admin/10060893", "label" : "Csordás Dániel (MTA KRTK KTI admin 5)", "familyName" : "Csordás", "givenName" : "Dániel", "published" : true, "oldId" : 10060893, "snippet" : true }, "lastDuplumOK" : "2024-01-25T09:19:23.653+0000", "lastDuplumSearch" : "2024-01-25T09:19:23.653+0000", "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" : "Brandstädt, Andreas", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 85302967, "link" : "/api/authorship/85302967", "label" : "Brandstädt, Andreas [szerk.]", "listPosition" : 1, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Brandstädt", "givenName" : "Andreas", "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" : 85302968, "link" : "/api/authorship/85302968", "label" : "Köhler, Ekkehard [szerk.]", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Köhler", "givenName" : "Ekkehard", "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" : 85302969, "link" : "/api/authorship/85302969", "label" : "Meer, Klaus [szerk.]", "listPosition" : 3, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Meer", "givenName" : "Klaus", "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" : "44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15193442, "link" : "/api/publicationidentifier/15193442", "label" : "DOI: 10.1007/978-3-030-00256-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 }, "oaType" : "PAY", "validState" : "IDENTICAL", "idValue" : "10.1007/978-3-030-00256-5", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15193444, "link" : "/api/publicationidentifier/15193444", "label" : "ISBN: 9783030002565", "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" : "9783030002565", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030002565", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15193443, "link" : "/api/publicationidentifier/15193443", "label" : "ISBN: 9783030002558", "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" : "9783030002558", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030002558", "published" : false, "snippet" : true } ], "volumeNumber" : "11159", "seriesMembers" : [ { "otype" : "SeriesVolume", "mtid" : 157925, "link" : "/api/seriesvolume/157925", "label" : "Lecture Notes in Computer Science 0302-9743 1611-3349, 11159", "publication" : { "otype" : "Book", "mtid" : 30436055, "link" : "/api/publication/30436055", "label" : "Brandstädt Andreas. Graph-Theoretic Concepts in Computer Science: 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings. (2018) ISBN:9783030002565; 9783030002558", "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" : 15193442, "link" : "/api/publicationidentifier/15193442", "label" : "DOI: 10.1007/978-3-030-00256-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 }, "oaType" : "PAY", "validState" : "IDENTICAL", "idValue" : "10.1007/978-3-030-00256-5", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15193444, "link" : "/api/publicationidentifier/15193444", "label" : "ISBN: 9783030002565", "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" : "9783030002565", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030002565", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15193443, "link" : "/api/publicationidentifier/15193443", "label" : "ISBN: 9783030002558", "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" : "9783030002558", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9783030002558", "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 } ], "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "nationalOrigin" : false, "published" : true, "snippet" : true }, "series" : { "otype" : "BookSeries", "mtid" : 20000018, "link" : "/api/bookseries/20000018", "label" : "Lecture Notes in Computer Science 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" : "", "publishedYear" : 2018, "conference" : { "otype" : "Conference", "mtid" : 265096, "link" : "/api/conference/265096", "label" : "44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018 2018-06-27 [Cottbus, Németország]", "location" : [ { "otype" : "City", "mtid" : 11975, "link" : "/api/city/11975", "label" : "Cottbus, Németország", "partOf" : { "otype" : "Country", "mtid" : 10011, "link" : "/api/country/10011", "label" : "Németország", "published" : true, "oldId" : 5, "snippet" : true }, "published" : true, "oldId" : 10001354, "snippet" : true } ], "published" : true, "snippet" : true }, "digital" : true, "printed" : true, "sourceYear" : 2019, "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" : "2019-05-16T09:07:07.971+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 15, "ownerInstituteCount" : 53, "directInstituteCount" : 0, "authorCount" : 0, "contributorCount" : 3, "chapterCount" : 14, "chapters" : [ { "otype" : "BookChapter", "mtid" : 30853294, "link" : "/api/publication/30853294", "label" : "Alam J.M. et al. On dispersable book embeddings. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 1-14", "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" : "On dispersable book embeddings", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15987354, "link" : "/api/publicationidentifier/15987354", "label" : "DOI: 10.1007/978-3-030-00256-5_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 }, "idValue" : "10.1007/978-3-030-00256-5_1", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_1", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15987353, "link" : "/api/publicationidentifier/15987353", "label" : "Scopus: 85053456898", "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" : "85053456898", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053456898", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 14, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33711890, "link" : "/api/publication/33711890", "label" : "Bekos Michael A. et al. Edge partitions of optimal 2-plane and 3-plane graphs. (2018) 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" : "Edge partitions of optimal 2-plane and 3-plane graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 23268692, "link" : "/api/publicationidentifier/23268692", "label" : "DOI: 10.1007/978-3-030-00256-5_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-00256-5_3", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_3", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 23268691, "link" : "/api/publicationidentifier/23268691", "label" : "Scopus: 85053471671", "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" : "85053471671", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053471671", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33220762, "link" : "/api/publication/33220762", "label" : "Bodewes J.M. et al. Recognizing hyperelliptic graphs in polynomial time. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 52-64", "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" : "Recognizing hyperelliptic graphs in polynomial time", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22022122, "link" : "/api/publicationidentifier/22022122", "label" : "DOI: 10.1007/978-3-030-00256-5_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 }, "idValue" : "10.1007/978-3-030-00256-5_5", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_5", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22022121, "link" : "/api/publicationidentifier/22022121", "label" : "Scopus: 85053475695", "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" : "85053475695", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053475695", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30385358, "link" : "/api/publication/30385358", "label" : "Bonamy M. et al. On directed feedback vertex set parameterized by treewidth. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 65-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" : "On directed feedback vertex set parameterized by treewidth", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15117485, "link" : "/api/publicationidentifier/15117485", "label" : "DOI: 10.1007/978-3-030-00256-5_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-00256-5_6", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_6", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15117484, "link" : "/api/publicationidentifier/15117484", "label" : "Scopus: 85053449223", "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" : "85053449223", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053449223", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 14, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30853144, "link" : "/api/publication/30853144", "label" : "Bonnet É. et al. Optimality program in segment and string graphs. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 79-90", "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" : "Optimality program in segment and string graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15987005, "link" : "/api/publicationidentifier/15987005", "label" : "DOI: 10.1007/978-3-030-00256-5_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-00256-5_7", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_7", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15987004, "link" : "/api/publicationidentifier/15987004", "label" : "Scopus: 85053452779", "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" : "85053452779", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053452779", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 19407192, "link" : "/api/publicationidentifier/19407192", "label" : "Mathematical Reviews: MR3948280", "source" : { "otype" : "PlainSource", "mtid" : 7, "link" : "/api/publicationsource/7", "label" : "Mathematical Reviews", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Mathematical Reviews", "nameEng" : "Mathematical Reviews", "linkPattern" : "https://mathscinet.ams.org/mathscinet-getitem?mr=@@@", "publiclyVisible" : true, "published" : true, "oldId" : 7, "snippet" : true }, "idValue" : "MR3948280", "realUrl" : "https://mathscinet.ams.org/mathscinet-getitem?mr=MR3948280", "published" : true, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 12, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31181254, "link" : "/api/publication/31181254", "label" : "Conte A. et al. Tight lower bounds for the number of inclusion-minimal st-cuts. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 100-110", "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" : "Tight lower bounds for the number of inclusion-minimal st-cuts", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 16637253, "link" : "/api/publicationidentifier/16637253", "label" : "DOI: 10.1007/978-3-030-00256-5_9", "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-00256-5_9", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_9", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 16637252, "link" : "/api/publicationidentifier/16637252", "label" : "Scopus: 85053453681", "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" : "85053453681", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053453681", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 11, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 32899639, "link" : "/api/publication/32899639", "label" : "de Oliveira Oliveira. Graph amalgamation under logical constraints. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 152-163", "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 amalgamation under logical constraints", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 21197080, "link" : "/api/publicationidentifier/21197080", "label" : "DOI: 10.1007/978-3-030-00256-5_13", "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-00256-5_13", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_13", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 21197079, "link" : "/api/publicationidentifier/21197079", "label" : "Scopus: 85053441914", "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" : "85053441914", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053441914", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 12, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30436054, "link" : "/api/publication/30436054", "label" : "Dudycz Szymon et al. Optimal General Matchings. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 176-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" : "Optimal General Matchings", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15193445, "link" : "/api/publicationidentifier/15193445", "label" : "DOI: 10.1007/978-3-030-00256-5_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 }, "oaType" : "PAY", "validState" : "IDENTICAL", "idValue" : "10.1007/978-3-030-00256-5_15", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_15", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 18963117, "link" : "/api/publicationidentifier/18963117", "label" : "Scopus: 85053457119", "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" : "85053457119", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053457119", "published" : true, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 14, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : false, "duplumRole" : "DUPLUM", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33227266, "link" : "/api/publication/33227266", "label" : "Gómez R. et al. Covering a graph with nontrivial vertex-disjoint paths: Existence and optimization. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 228-238", "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" : "Covering a graph with nontrivial vertex-disjoint paths: Existence and optimization", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22043926, "link" : "/api/publicationidentifier/22043926", "label" : "DOI: 10.1007/978-3-030-00256-5_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-00256-5_19", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_19", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22043925, "link" : "/api/publicationidentifier/22043925", "label" : "Scopus: 85053436748", "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" : "85053436748", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053436748", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 11, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30832378, "link" : "/api/publication/30832378", "label" : "Jaffke L. et al. On weak isomorphism of rooted vertex-colored graphs. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 266-278", "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" : "On weak isomorphism of rooted vertex-colored graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15950692, "link" : "/api/publicationidentifier/15950692", "label" : "DOI: 10.1007/978-3-030-00256-5_22", "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-00256-5_22", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_22", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15950691, "link" : "/api/publicationidentifier/15950691", "label" : "Scopus: 85053455294", "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" : "85053455294", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053455294", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31135693, "link" : "/api/publication/31135693", "label" : "Johnson Matthew et al. Connected Vertex Cover for (sP_1+P_5)(sP1+P5)-Free Graphs. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 279-291", "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" : "Connected Vertex Cover for (sP_1+P_5)(sP1+P5)-Free Graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 16541743, "link" : "/api/publicationidentifier/16541743", "label" : "DOI: 10.1007/978-3-030-00256-5_23", "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-00256-5_23", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_23", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 16541742, "link" : "/api/publicationidentifier/16541742", "label" : "Scopus: 85053456343", "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" : "85053456343", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053456343", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 30791383, "link" : "/api/publication/30791383", "label" : "Kavitha Telikepalli. Popular Matchings of Desired Size. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 306-317", "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" : "Popular Matchings of Desired Size", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15874792, "link" : "/api/publicationidentifier/15874792", "label" : "DOI: 10.1007/978-3-030-00256-5_25", "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-00256-5_25", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_25", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15874793, "link" : "/api/publicationidentifier/15874793", "label" : "Scopus: 85053468381", "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" : "85053468381", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053468381", "published" : false, "snippet" : true } ], "publishedAt" : [ ], "pageLength" : 12, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : false, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33579652, "link" : "/api/publication/33579652", "label" : "Kleist Linda et al. Convexity-increasing morphs of planar graphs. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 318-330", "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" : "Convexity-increasing morphs of planar graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22884663, "link" : "/api/publicationidentifier/22884663", "label" : "DOI: 10.1007/978-3-030-00256-5_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 }, "idValue" : "10.1007/978-3-030-00256-5_26", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_26", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22884662, "link" : "/api/publicationidentifier/22884662", "label" : "Scopus: 85053475043", "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" : "85053475043", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053475043", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 31134347, "link" : "/api/publication/31134347", "label" : "Kun J. et al. Treedepth bounds in linear colorings. (2018) Megjelent: Graph-Theoretic Concepts in Computer Science pp. 331-343", "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" : "Treedepth bounds in linear colorings", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 16539600, "link" : "/api/publicationidentifier/16539600", "label" : "DOI: 10.1007/978-3-030-00256-5_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 }, "idValue" : "10.1007/978-3-030-00256-5_27", "realUrl" : "https://doi.org/10.1007/978-3-030-00256-5_27", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 16539599, "link" : "/api/publicationidentifier/16539599", "label" : "Scopus: 85053477888", "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" : "85053477888", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053477888", "published" : false, "snippet" : true } ], "volume" : "11159 LNCS", "publishedAt" : [ ], "pageLength" : 13, "publishedYear" : 2018, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "published" : true, "snippet" : true } ], "fromCitation" : false, "hasQualityFactor" : false, "link" : "/api/publication/30436055", "label" : "Brandstädt Andreas. Graph-Theoretic Concepts in Computer Science: 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings. (2018) ISBN:9783030002565; 9783030002558", "template" : "