{"id":"https://openalex.org/W7095832869","doi":null,"title":"Approximation algorithms for Euler genus and related problems. Electronic preprint arxiv:1304.2416","display_name":"Approximation algorithms for Euler genus and related problems. Electronic preprint arxiv:1304.2416","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095832869"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.770.4376","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.770.4376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1304.2416.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095832869"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5144651345","display_name":"Ra Chekuri Anastasios Sidiropoulos","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Ra Chekuri Anastasios Sidiropoulos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5144651345"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9750999808311462,"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.9750999808311462,"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.024299999698996544,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/euler-genus","display_name":"Euler genus","score":0.9779999852180481},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8149999976158142},{"id":"https://openalex.org/keywords/bounded-degree-graphs","display_name":"bounded degree graphs","score":0.9179999828338623},{"id":"https://openalex.org/keywords/orientable-genus","display_name":"orientable genus","score":0.8560000061988831},{"id":"https://openalex.org/keywords/crossing-number","display_name":"crossing number","score":0.9900000095367432},{"id":"https://openalex.org/keywords/network-embedding","display_name":"graph embedding","score":0.37599998712539673},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.5600000023841858}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7373999953269958},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.580299973487854},{"id":"https://openalex.org/C62884695","wikidata":"https://www.wikidata.org/wiki/Q184871","display_name":"Euler's formula","level":2,"score":0.5572999715805054},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5437999963760376},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5436000227928162},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C196433757","wikidata":"https://www.wikidata.org/wiki/Q852973","display_name":"Euler characteristic","level":2,"score":0.4964999854564667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47380000352859497},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4514999985694885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42829999327659607},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.414900004863739},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4101000130176544},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3785000145435333},{"id":"https://openalex.org/C157369684","wikidata":"https://www.wikidata.org/wiki/Q34740","display_name":"Genus","level":2,"score":0.3637000024318695},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.36309999227523804},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.35089999437332153},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3174999952316284},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.31119999289512634},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C43169469","wikidata":"https://www.wikidata.org/wiki/Q580922","display_name":"Preprint","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.26820001006126404},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2612000107765198},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C157406716","wikidata":"https://www.wikidata.org/wiki/Q4115842","display_name":"Topological graph theory","level":5,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.770.4376","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.770.4376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1304.2416.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2886408974","https://openalex.org/W2951965670","https://openalex.org/W2953115480","https://openalex.org/W2101941945","https://openalex.org/W2007932281","https://openalex.org/W1989827489","https://openalex.org/W2006428587","https://openalex.org/W3128925059","https://openalex.org/W2149954650","https://openalex.org/W7097744037"],"abstract_inverted_index":{"The":[0],"Euler":[1,42,84,94,124],"genus":[2,43,85,95,125],"of":[3,40,50,83,93,139,158,174,220,231,237,251,258,283],"a":[4,7,74,80,88,91,111,127,132,200,218,249],"graph":[5,13,82,253],"is":[6,31,44,53,62,181,254,278],"fundamental":[8],"and":[9,15,29,163,166,172,187,207],"well-studied":[10],"parameter":[11],"in":[12,65,131,190,234,265,287],"theory":[14],"topology.":[16],"Computing":[17],"it":[18,30],"has":[19],"been":[20],"shown":[21],"to":[22,33,184,216,296],"be":[23,34],"NP-hard":[24],"by":[25,194],"Thomassen":[26],"[Tho89,":[27],"Tho93],":[28],"known":[32,63],"fixed-parameter":[35],"tractable.":[36],"However,":[37],"the":[38,41,48,102,123,140,156,177,185,191,214,235,252,259,276,297],"approximability":[39],"wide":[45],"open.":[46],"While":[47],"existence":[49],"an":[51,58],"O(1)-approximation":[52],"not":[54],"ruled":[55],"out,":[56],"only":[57],"O(":[59],"n)-approximation":[60],"[CKK97]":[61],"even":[64,274],"bounded":[66,151],"degree":[67,152],"graphs.":[68,153],"In":[69],"this":[70,284],"paper":[71,285],"we":[72,129,269],"give":[73],"polynomial-time":[75],"algorithm":[76,120,171],"which":[77],"on":[78,150],"input":[79],"bounded-degree":[81],"g,":[86],"computes":[87],"drawing":[89,250,277],"into":[90],"surface":[92],"gO(1)":[96],"\u00b7":[97,143],"logO(1)":[98,144],"n.":[99],"Combined":[100],"with":[101,136,241],"upper":[103],"bound":[104,219],"from":[105],"[CKK97],":[106],"our":[107,119,211,232],"result":[108],"also":[109,226],"implies":[110],"O(n1/2\u2212\u03b1)-approximation,":[112],"for":[113,121,146,176,239],"some":[114,228,293],"constant":[115],"\u03b1>":[116],"0.":[117],"Using":[118],"approximating":[122],"as":[126,256],"subroutine,":[128],"obtain,":[130],"unified":[133],"fashion,":[134],"algorithms":[135,238,246,273],"approximation":[137],"ratios":[138],"form":[141,221],"OPTO(1)":[142],"n":[145],"several":[147,266],"related":[148],"problems":[149,157,210],"These":[154],"include":[155],"orientable":[159],"genus,":[160],"crossing":[161,178],"number,":[162],"planar":[164,205],"edge":[165,206],"vertex":[167,208],"deletion":[168,209],"problems.":[169],"Our":[170,261],"proof":[173,189],"correctness":[175],"number":[179],"problem":[180],"simpler":[182],"compared":[183],"long":[186],"difficult":[188],"recent":[192],"breakthrough":[193],"Chuzhoy":[195],"[Chu11],":[196],"while":[197],"essentially":[198],"obtaining":[199],"qualitatively":[201],"similar":[202],"result.":[203],"For":[204],"results":[212,233,262],"are":[213],"first":[215],"obtain":[217],"poly(OPT,":[222],"log":[223],"n).":[224],"We":[225],"highlight":[227],"further":[229],"applications":[230],"design":[236],"graphs":[240],"small":[242],"genus.":[243],"Many":[244],"such":[245,272],"require":[247],"that":[248,264],"given":[255],"part":[257],"input.":[260],"imply":[263],"interesting":[267],"cases,":[268],"can":[270],"implement":[271],"when":[275],"unknown.":[279],"\u2217An":[280],"extended":[281],"abstract":[282],"appeared":[286],"FOCS":[288],"2013.":[289],"This":[290],"version":[291],"contains":[292],"minor":[294],"fixes":[295],"previous":[298],"one.":[299]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095832869","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2026-08-07T00:00:00"}
