{"id":"https://openalex.org/W1974308542","doi":"https://doi.org/10.1145/2462356.2480283","title":"A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates","display_name":"A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W1974308542","doi":"https://doi.org/10.1145/2462356.2480283","mag":"1974308542"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2480283","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2480283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","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/A5008241289","display_name":"R. Sharathkumar","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Sharathkumar","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008241289"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.8987,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.67633229,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"16"},"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.9998999834060669,"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.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/bipartite-graph","display_name":"Bipartite graph","score":0.8302239775657654},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7422140836715698},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.734479546546936},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.716040849685669},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6916614770889282},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6518512964248657},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5901131629943848},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.49295759201049805},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.44298285245895386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4386774003505707},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4315505027770996},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4288296699523926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12903231382369995},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10137569904327393},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08481153845787048}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8302239775657654},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7422140836715698},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.734479546546936},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.716040849685669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6916614770889282},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6518512964248657},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5901131629943848},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.49295759201049805},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.44298285245895386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4386774003505707},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4315505027770996},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4288296699523926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12903231382369995},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10137569904327393},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08481153845787048},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2462356.2480283","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2480283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.6501","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.6501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~sharath/s_socg13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1868565867","https://openalex.org/W1969357318","https://openalex.org/W1982180670","https://openalex.org/W1991111385","https://openalex.org/W2007052372","https://openalex.org/W2024331629","https://openalex.org/W2027277859","https://openalex.org/W2047239272","https://openalex.org/W2053913299","https://openalex.org/W2069216960","https://openalex.org/W2110940003"],"related_works":["https://openalex.org/W2352066879","https://openalex.org/W2348257368","https://openalex.org/W2077309407","https://openalex.org/W2054458431","https://openalex.org/W2184969544","https://openalex.org/W2371352078","https://openalex.org/W1592682627","https://openalex.org/W2561454982","https://openalex.org/W4295762832","https://openalex.org/W2080136900"],"abstract_inverted_index":{"Let":[0],"A,":[1],"B":[2],"\u2208":[3],"[\u0394]2,":[4],"|A|=|B|=n,":[5],"be":[6],"point":[7,11,57],"sets":[8,58],"where":[9],"each":[10],"has":[12],"a":[13,34],"positive":[14],"integer":[15,61],"coordinate":[16],"bounded":[17,60],"by":[18],"\u0394.":[19],"For":[20],"an":[21,30],"arbitrary":[22],"small":[23],"constant":[24],"\u03b4":[25],">":[26],"0,":[27],"we":[28],"design":[29],"algorithm":[31],"to":[32],"compute":[33],"minimum-cost":[35],"Euclidean":[36,51],"bipartite":[37,52],"matching":[38],"of":[39],"A,B":[40],"in":[41],"O(n{3/2+\u03b4log":[42],"(n\u0394))":[43],"time;":[44],"all":[45],"previous":[46],"exact":[47],"algorithms":[48],"for":[49],"the":[50,56],"matching,":[53],"even":[54],"when":[55],"have":[59],"coordinates":[62],"take":[63],"\u03a9(n2)":[64],"time.":[65]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}