Parameterized analysis and crossing minimization problems

作     者：Zehavi, Meirav 

作者机构：Ben Gurion Univ Negev Beer Sheva Israel 

出 版 物：《COMPUTER SCIENCE REVIEW》 (计算机科学评论)

年 卷 期：2022年第45卷第0期

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Israel Science Foundation (ISF) [1176/18] European Research Council (ERC) United States - Israel Binational Science Foundation (BSF) 

主　　题：Crossing minimization Parameterized Complexity Parameterized algorithms Graph Drawing Kernelization 

摘      要：In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject. Afterwards, we survey some central questions in Graph Drawing that concern the analysis of crossing minimization problems from the viewpoint of parameterized analysis, as well as put forward some of the remaining challenges. This article originated from an invited talk given at the 29th International Symposium on Graph Drawing and Network Visualization. (C) 2022 Elsevier Inc. All rights reserved.