Presidential Young Investigator Award: Combinatorial Issues in Large-Scale Network Design

研究涉及算法的设计和分析， 离散优化问题，以及离散优化问题的研究 一般的结构。 特别关注的两个领域是：（1） 研究某些“障碍物”，称为缠结，小树-或 路径宽度，它在图子式理论中起着至关重要的作用; 以及（2）研究VLSI（超大规模集成电路）中感兴趣的问题 系统集成）芯片和通信网络交换机设计， 涉及在绘制图形时的最小边交叉数 在飞机上。 有几个悬而未决的问题有关过境 数字，其中最重要的是他们的效率 近似（没有已知的结果，无论是积极的， 阴性）。 安排理论的工具将是 就业。

Research concerns the design and analysis of algorithms for discrete optimization problems, and the study of discrete structures in general. Two areas of special interest are: (1) the study of certain "obstructions", called tangles, to small tree- or path-width, which play a crucial role in the Graph Minors theory; and (2) to investigate a problem of interest in VLSI (very large system integration) chip and communication network switch design, involving the minimum number of edge crossings when drawing a graph in the plane. There are several open problems concerning crossing numbers, one of the most important being their efficient approximation (there are no known results, either positive or negative). The tools from the theory of arrangements will be employed.