{"title":"特邀文章前言","authors":"É. Tardos","doi":"10.1145/3371337","DOIUrl":null,"url":null,"abstract":"The Invited Articles section of this issue consists of two articles. The article “The WeisfeilerLeman Dimension of Planar Graphs is at most 3,” by Sandra Kiefer, Ilia Ponomarenko, and Pascal Schweitzer, was invited from the 32nd Annual ACM/ IEEE Symposium on Logic in Computer Science (LICS’17). The article “Computing the Geometric Intersection Number of Curves,” by Vincent Despré and Francis Lazarus, won best paper award at the 33rd International Symposium on Computational Geometry (SoCG 2017). We want to thank the LICS’17 and SoCG’17 Program Committees for their help in selecting these invited articles and editors Nachum Dershowitz and Jean-Daniel Boissonnat for handling the articles.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Invited Articles Foreword\",\"authors\":\"É. Tardos\",\"doi\":\"10.1145/3371337\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Invited Articles section of this issue consists of two articles. The article “The WeisfeilerLeman Dimension of Planar Graphs is at most 3,” by Sandra Kiefer, Ilia Ponomarenko, and Pascal Schweitzer, was invited from the 32nd Annual ACM/ IEEE Symposium on Logic in Computer Science (LICS’17). The article “Computing the Geometric Intersection Number of Curves,” by Vincent Despré and Francis Lazarus, won best paper award at the 33rd International Symposium on Computational Geometry (SoCG 2017). We want to thank the LICS’17 and SoCG’17 Program Committees for their help in selecting these invited articles and editors Nachum Dershowitz and Jean-Daniel Boissonnat for handling the articles.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the ACM (JACM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3371337\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3371337","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本期特邀文章部分由两篇文章组成。由Sandra Kiefer, Ilia Ponomarenko和Pascal Schweitzer撰写的文章“平面图的WeisfeilerLeman维数最多为3”被邀请参加第32届ACM/ IEEE计算机科学逻辑研讨会(LICS ' 17)。Vincent despr和Francis Lazarus的论文《计算曲线的几何相交数》(Computing The Geometric Intersection Number of Curves)在第33届计算几何国际学术研讨会(SoCG 2017)上获得了最佳论文奖。我们要感谢LICS ' 17和SoCG ' 17项目委员会在选择这些受邀文章和编辑Nachum Dershowitz和Jean-Daniel Boissonnat处理这些文章方面的帮助。
The Invited Articles section of this issue consists of two articles. The article “The WeisfeilerLeman Dimension of Planar Graphs is at most 3,” by Sandra Kiefer, Ilia Ponomarenko, and Pascal Schweitzer, was invited from the 32nd Annual ACM/ IEEE Symposium on Logic in Computer Science (LICS’17). The article “Computing the Geometric Intersection Number of Curves,” by Vincent Despré and Francis Lazarus, won best paper award at the 33rd International Symposium on Computational Geometry (SoCG 2017). We want to thank the LICS’17 and SoCG’17 Program Committees for their help in selecting these invited articles and editors Nachum Dershowitz and Jean-Daniel Boissonnat for handling the articles.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
