{"id":"https://openalex.org/W2159123527","doi":"https://doi.org/10.1007/978-3-642-11266-9_64","title":"Vertex Ranking with Capacity","display_name":"Vertex Ranking with Capacity","publication_year":2009,"publication_date":"2009-12-07","ids":{"openalex":"https://openalex.org/W2159123527","doi":"https://doi.org/10.1007/978-3-642-11266-9_64","mag":"2159123527"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11266-9_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11266-9_64","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041229131","display_name":"Ruben van der Zwaan","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Ruben van der Zwaan","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041229131"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.18815762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"767","last_page":"778"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7051463723182678},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.6606035828590393},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.4704664647579193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44958803057670593},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.44472891092300415},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4387032389640808},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.43605560064315796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3851596713066101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.378192663192749},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3704974055290222},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3684556484222412},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2807261347770691},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14471358060836792},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12700462341308594},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10940337181091309}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7051463723182678},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6606035828590393},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.4704664647579193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44958803057670593},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.44472891092300415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4387032389640808},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.43605560064315796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3851596713066101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.378192663192749},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3704974055290222},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3684556484222412},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2807261347770691},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14471358060836792},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12700462341308594},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10940337181091309}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-11266-9_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11266-9_64","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/eddbd70a-16fa-4bc3-90ac-68270d286a29","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/eddbd70a-16fa-4bc3-90ac-68270d286a29","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Zwaan, G R J 2010, Vertex Ranking with Capacity. in J V Leeuwen & A V Muscholl (eds), SOFSEM 2010 : Theory and Practice of Computer Science - 36th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer, Berlin/Heidelberg, Lecture Notes in Computer Science, no. 5901, pp. 767-778. https://doi.org/10.1007/978-3-642-11266-9_64","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/4768b878-e467-4bab-b657-2b3796b91433","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/4768b878-e467-4bab-b657-2b3796b91433","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zwaan, van der, G R J 2010, Vertex ranking with capacity. in J Leeuwen, van, A Muscholl, D Peleg, J Pokorn\u00fd & B Rumpe (eds), SOFSEM 2010: Theory and Practice of Computer Science : 36th Conference on Current Trends in Theory and Practice of Computer Science, \u0160pindler\u016fv Ml\u00fdn, Czech Republic, January 23-29, 2010. Proceedings. Lecture Notes in Computer Science, vol. 5901, Springer, Berlin, pp. 767-778. https://doi.org/10.1007/978-3-642-11266-9_64","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/4768b878-e467-4bab-b657-2b3796b91433","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/4768b878-e467-4bab-b657-2b3796b91433","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SOFSEM 2010: Theory and Practice of Computer Science : 36th Conference on Current Trends in Theory and Practice of Computer Science, \u0160pindler\u016fv Ml\u00fdn, Czech Republic, January 23-29, 2010. Proceedings, 767 - 778","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1516991388","https://openalex.org/W1792297605","https://openalex.org/W1968569027","https://openalex.org/W2005655086","https://openalex.org/W2007873061","https://openalex.org/W2009372021","https://openalex.org/W2020964097","https://openalex.org/W2027562075","https://openalex.org/W2039985220","https://openalex.org/W2064883689","https://openalex.org/W2070592419","https://openalex.org/W2074764821","https://openalex.org/W2077309453","https://openalex.org/W2079306236","https://openalex.org/W2082764577","https://openalex.org/W2092864936","https://openalex.org/W2106966575","https://openalex.org/W2116509046","https://openalex.org/W2131735508","https://openalex.org/W2132750992","https://openalex.org/W2157137597","https://openalex.org/W2157163513","https://openalex.org/W2159003936","https://openalex.org/W2169262928","https://openalex.org/W2401216365","https://openalex.org/W2561675875","https://openalex.org/W2913683243","https://openalex.org/W2914617426","https://openalex.org/W4245863089"],"related_works":["https://openalex.org/W2079730540","https://openalex.org/W2079263399","https://openalex.org/W101378340","https://openalex.org/W4221167366","https://openalex.org/W2027513055","https://openalex.org/W4226211922","https://openalex.org/W1560183925","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2125212169"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}