{"id":"https://openalex.org/W3185451708","doi":"https://doi.org/10.1007/978-3-031-49272-3_10","title":"On Families of Planar DAGs with Constant Stack Number","display_name":"On Families of Planar DAGs with Constant Stack Number","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W3185451708","doi":"https://doi.org/10.1007/978-3-031-49272-3_10","mag":"3185451708"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-49272-3_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-49272-3_10","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":"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/A5071390048","display_name":"Martin N\u00f6llenburg","orcid":"https://orcid.org/0000-0003-0454-3937"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Martin N\u00f6llenburg","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0003-0454-3937","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058217001","display_name":"Sergey Pupyrev","orcid":"https://orcid.org/0000-0003-4089-673X"},"institutions":[{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sergey Pupyrev","raw_affiliation_strings":["Meta, Menlo Park, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4089-673X","affiliations":[{"raw_affiliation_string":"Meta, Menlo Park, CA, USA","institution_ids":["https://openalex.org/I4210099336"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058217001"],"corresponding_institution_ids":["https://openalex.org/I4210099336"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"151"},"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.9984999895095825,"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.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9907000064849854,"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/T11269","display_name":"Algorithms and Data Compression","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7282918691635132},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.7236528396606445},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.673570454120636},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6276742219924927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6270952224731445},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.6085822582244873},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.581515908241272},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5569486618041992},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.544540524482727},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5285193920135498},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5087421536445618},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5063592195510864},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.48767077922821045},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44032400846481323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41091302037239075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36536845564842224},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.23593741655349731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16270408034324646},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11106187105178833},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1044011116027832}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7282918691635132},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.7236528396606445},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.673570454120636},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6276742219924927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6270952224731445},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.6085822582244873},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.581515908241272},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5569486618041992},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.544540524482727},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5285193920135498},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5087421536445618},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5063592195510864},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.48767077922821045},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44032400846481323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41091302037239075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36536845564842224},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.23593741655349731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16270408034324646},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11106187105178833},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1044011116027832},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-49272-3_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-49272-3_10","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1525468606","https://openalex.org/W1538215615","https://openalex.org/W1544587054","https://openalex.org/W1964982423","https://openalex.org/W1999897678","https://openalex.org/W2023293538","https://openalex.org/W2023922327","https://openalex.org/W2068287758","https://openalex.org/W2078050303","https://openalex.org/W2116216196","https://openalex.org/W2119115989","https://openalex.org/W2163569217","https://openalex.org/W2261346621","https://openalex.org/W2399838769","https://openalex.org/W2761532295","https://openalex.org/W2889544735","https://openalex.org/W2938191358","https://openalex.org/W2946959590","https://openalex.org/W2952673825","https://openalex.org/W2963107071","https://openalex.org/W2963634989","https://openalex.org/W2972155844","https://openalex.org/W2982381928","https://openalex.org/W2989563254","https://openalex.org/W3080632939","https://openalex.org/W3090082925","https://openalex.org/W3102042996","https://openalex.org/W3103394879","https://openalex.org/W3135730089","https://openalex.org/W3181610989","https://openalex.org/W4205095953","https://openalex.org/W4220969056","https://openalex.org/W4232763292","https://openalex.org/W4296520321","https://openalex.org/W4312002273","https://openalex.org/W4317393717","https://openalex.org/W4319324280","https://openalex.org/W4390098106"],"related_works":["https://openalex.org/W1491152805","https://openalex.org/W1759199114","https://openalex.org/W2995965358","https://openalex.org/W3002061974","https://openalex.org/W2182049810","https://openalex.org/W2009558719","https://openalex.org/W2002953601","https://openalex.org/W4291736767","https://openalex.org/W4390306783","https://openalex.org/W2182204429"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}