{"id":"https://openalex.org/W3125391957","doi":"https://doi.org/10.1007/s00454-008-9114-6","title":"Minimizing the Stabbing Number of Matchings, Trees, and Triangulations","display_name":"Minimizing the Stabbing Number of Matchings, Trees, and Triangulations","publication_year":2008,"publication_date":"2008-10-14","ids":{"openalex":"https://openalex.org/W3125391957","doi":"https://doi.org/10.1007/s00454-008-9114-6","mag":"3125391957"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-008-9114-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9114-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9114-6.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9114-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"S\u00e1ndor P. Fekete","orcid":null},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":["Algorithms Group, Department of Computer Science, Braunschweig University of Technology, M\u00fchlenpfordtstr. 23, 38106, Braunschweig, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithms Group, Department of Computer Science, Braunschweig University of Technology, M\u00fchlenpfordtstr. 23, 38106, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Marco E. L\u00fcbbecke","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marco E. L\u00fcbbecke","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Sekr. MA 5-1, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Sekr. MA 5-1, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":null,"display_name":"Henk Meijer","orcid":null},"institutions":[{"id":"https://openalex.org/I2800036650","display_name":"Roosevelt Institute for American Studies","ror":"https://ror.org/05ck1h211","country_code":"NL","type":"facility","lineage":["https://openalex.org/I2800036650"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Henk Meijer","raw_affiliation_strings":["Department of Science, Roosevelt Academy, Middelburg (ZL), The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Science, Roosevelt Academy, Middelburg (ZL), The Netherlands","institution_ids":["https://openalex.org/I2800036650"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94509681"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7507,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85012723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"40","issue":"4","first_page":"595","last_page":"621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9648000001907349,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9648000001907349,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.0071000000461936,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.005100000184029341,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6452000141143799},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6323000192642212},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5909000039100647},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5539000034332275},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5188999772071838},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5091000199317932},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4819999933242798},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43220001459121704},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.42480000853538513}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7134000062942505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.678600013256073},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6452000141143799},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6323000192642212},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5909000039100647},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5539000034332275},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5188999772071838},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5091000199317932},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4819999933242798},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44929999113082886},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4185999929904938},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3375000059604645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00454-008-9114-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9114-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9114-6.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0310034","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0310034","pdf_url":"https://arxiv.org/pdf/cs/0310034","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/s00454-008-9114-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-008-9114-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-008-9114-6.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3125391957.pdf","grobid_xml":"https://content.openalex.org/works/W3125391957.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1558071713","https://openalex.org/W1591764237","https://openalex.org/W1994072278","https://openalex.org/W2000889179","https://openalex.org/W2057537033","https://openalex.org/W2060314446","https://openalex.org/W2080207623","https://openalex.org/W2082804915","https://openalex.org/W2083494307","https://openalex.org/W2093890557","https://openalex.org/W2100440346","https://openalex.org/W2123805664","https://openalex.org/W2172955861","https://openalex.org/W2327315803","https://openalex.org/W2609210027","https://openalex.org/W4245219328"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-02-01T00:00:00"}