{"id":"https://openalex.org/W2926426864","doi":"https://doi.org/10.1007/s00453-019-00568-7","title":"Optimality Program in Segment and String Graphs","display_name":"Optimality Program in Segment and String Graphs","publication_year":2019,"publication_date":"2019-04-06","ids":{"openalex":"https://openalex.org/W2926426864","doi":"https://doi.org/10.1007/s00453-019-00568-7","mag":"2926426864"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00568-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00568-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00568-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00568-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083806838","display_name":"\u00c9douard Bonnet","orcid":"https://orcid.org/0000-0002-1653-5822"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"\u00c9douard Bonnet","raw_affiliation_strings":["LIP, ENS Lyon, Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047941027","display_name":"Pawe\u0142 Rz\u0105\u017cewski","orcid":"https://orcid.org/0000-0001-7696-3848"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Pawe\u0142 Rz\u0105\u017cewski","raw_affiliation_strings":["Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-7696-3848","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047941027"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":1.0659,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78747037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"81","issue":"7","first_page":"3047","last_page":"3073"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/T12288","display_name":"Optimization and Search Problems","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.8106861114501953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6308177709579468},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5508242249488831},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5474473237991333},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5174753665924072},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5044139623641968},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5035647749900818},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4560354948043823},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4509323835372925},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4457825720310211},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.43832987546920776},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4308810830116272},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.42935600876808167},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4251402020454407},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4129409193992615},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.359543114900589},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3229091167449951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23552486300468445},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12921759486198425}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8106861114501953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6308177709579468},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5508242249488831},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5474473237991333},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5174753665924072},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5044139623641968},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5035647749900818},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4560354948043823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4509323835372925},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4457825720310211},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.43832987546920776},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4308810830116272},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.42935600876808167},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4251402020454407},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4129409193992615},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.359543114900589},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3229091167449951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23552486300468445},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12921759486198425},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-019-00568-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00568-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00568-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00568-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00568-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00568-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322637","display_name":"Politechnika Warszawska","ror":"https://ror.org/00y0xnp53"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2926426864.pdf"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W196429902","https://openalex.org/W1487872891","https://openalex.org/W1558933415","https://openalex.org/W1575166720","https://openalex.org/W1576169274","https://openalex.org/W1683343043","https://openalex.org/W1791386552","https://openalex.org/W1924557110","https://openalex.org/W1930019869","https://openalex.org/W1934698557","https://openalex.org/W1964330956","https://openalex.org/W1968281628","https://openalex.org/W1974970215","https://openalex.org/W1976463682","https://openalex.org/W1979682819","https://openalex.org/W1982180670","https://openalex.org/W1985572324","https://openalex.org/W1985758609","https://openalex.org/W1995725694","https://openalex.org/W2003979824","https://openalex.org/W2006753964","https://openalex.org/W2014608127","https://openalex.org/W2031042330","https://openalex.org/W2039079162","https://openalex.org/W2047724597","https://openalex.org/W2069367490","https://openalex.org/W2084266654","https://openalex.org/W2085348754","https://openalex.org/W2102167981","https://openalex.org/W2109298068","https://openalex.org/W2111526090","https://openalex.org/W2121655825","https://openalex.org/W2127485201","https://openalex.org/W2156760067","https://openalex.org/W2158584754","https://openalex.org/W2301555989","https://openalex.org/W2519804096","https://openalex.org/W2739959547","https://openalex.org/W2902378521","https://openalex.org/W2918931394","https://openalex.org/W2940485869","https://openalex.org/W2951450485","https://openalex.org/W2963680532","https://openalex.org/W2963755366","https://openalex.org/W2963838695","https://openalex.org/W3198160809","https://openalex.org/W4213071722","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2380525562","https://openalex.org/W4291316360","https://openalex.org/W2163432100","https://openalex.org/W3169197204","https://openalex.org/W4229747356","https://openalex.org/W1542397451","https://openalex.org/W4311345810","https://openalex.org/W3187209459","https://openalex.org/W2152008865","https://openalex.org/W4296859768"],"abstract_inverted_index":{"Planar":[0],"graphs":[1,62,104],"are":[2],"known":[3],"to":[4,31,157,164],"allow":[5],"subexponential":[6,57,151],"algorithms":[7,58,78],"running":[8,108,152],"in":[9,44,98,109],"time":[10,25,99,110,153],"$$2^{O(\\sqrt{n})}$$":[11],"or":[12,67],"$$2^{O(\\sqrt{n}":[13],"\\log":[14],"n)}$$":[15,46],"for":[16,112],"most":[17],"of":[18,63,127],"the":[19,23,60,80,123,141,146],"paradigmatic":[20],"problems,":[21],"while":[22,105],"brute-force":[24],"$$2^{\\varTheta":[26],"(n)}$$":[27],"is":[28],"very":[29],"likely":[30],"be":[32,96],"asymptotically":[33],"best":[34],"on":[35,59,102,115],"general":[36],"graphs.":[37],"Intrigued":[38],"by":[39,47],"an":[40,106],"algorithm":[41,107,139],"packing":[42],"curves":[43,64],"$$2^{O(n^{2/3}\\log":[45,100],"Fox":[48],"and":[49,72,168],"Pach":[50],"(SODA\u201911),":[51],"we":[52,88,130],"investigate":[53],"which":[54,73],"problems":[55,74],"have":[56,75],"intersection":[61,70],"(string":[65],"graphs)":[66,71],"segments":[68,117],"(segment":[69],"no":[76],"such":[77],"under":[79],"Exponential":[81],"Time":[82],"Hypothesis":[83],"(ETH).":[84],"Among":[85],"our":[86],"results,":[87],"show":[89,131],"that,":[90],"quite":[91],"surprisingly,":[92],"3-Coloring":[93],"can":[94],"also":[95,154],"solved":[97],"^{O(1)}n)}$$":[101],"string":[103],"$$2^{o(n)}$$":[111],"4-Coloring":[113,126],"even":[114],"axis-parallel":[116],"(of":[118],"unbounded":[119],"length)":[120],"would":[121],"disprove":[122],"ETH.":[124],"For":[125],"unit":[128],"segments,":[129],"a":[132,137],"weaker":[133],"lower":[134],"bound,":[135],"excluding":[136],"$$2^{o(n^{2/3})}$$":[138],"(under":[140],"ETH).":[142],"The":[143,150],"construction":[144],"exploits":[145],"celebrated":[147],"Erd\u0151s\u2013Szekeres":[148],"theorem.":[149],"carries":[155],"over":[156],"Min":[158,165,169],"Feedback":[159],"Vertex":[160],"Set,":[161],"but":[162],"not":[163],"Dominating":[166,171],"Set":[167],"Independent":[170],"Set.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-10-10T00:00:00"}
