Workshop on Algorithms, Combinatorics and Geometry
算法、组合学和几何研讨会
基本信息
- 批准号:0741406
- 负责人:
- 金额:$ 0.9万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2007
- 资助国家:美国
- 起止时间:2007-09-01 至 2009-08-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
ALGORITHMS, COMBINATORICS AND GEOMETRYKnowledge of mathematics and combinatorics is crucial to the design of combinatorial algo-rithms. Conversely, questions or concepts arising in the applications sometimes give rise tointeresting mathematical problems, or can be used to solve mathematical problems. Hence,any type of interaction between the discrete mathematics and the computer science commu-nities is beneficial to both groups and must be encouraged.The University of North Texas in Denton will host a workshop focusing on algorithms, com-binatorics and geometry. The workshop would focus on the mathematical and algorithmicproblems arising from combinatorial and geometric structures.It is anticipated that the talks would introduce a broad range of fundamental and recent re-sults which would be of interest to the advanced and beginning researchers in combinatorics,combinatorial and computational geometry, computational biology, geometric graph theory,topology, theoretical computer science and graph drawing. It is further anticipated that theworkshop would bring together advanced researchers, as well as graduate students in manyareas of discrete mathematics and computer science and engineering, and hence foster andfacilitate collaboration and joint research among different communities. To disseminate theknowledge presented at the workshop and to assess its impact, a special issue of a journalwill be selected for possible publication of a collection of the papers that relate to the maintheme of the workshop.
算法、组合学和几何数学和组合学的知识对于设计组合算法是至关重要的。反之,在应用中产生的问题或概念有时会引起有趣的数学问题,或者可以用来解决数学问题。因此,任何形式的离散数学和计算机科学社区之间的互动是有益的两个群体,必须鼓励。北德克萨斯大学丹顿将主办一个研讨会,重点是算法,组合和几何。研讨会将集中讨论由组合和几何结构引起的数学和算法问题,预计讲座将介绍广泛的基本和最新结果,这些结果将对组合学、组合和计算几何、计算生物学、几何图论、拓扑学、理论计算机科学和图形绘制等领域的高级和初级研究人员感兴趣。进一步预计,讲习班将汇集先进的研究人员,以及离散数学和计算机科学与工程的许多领域的研究生,从而促进和促进不同社区之间的合作和联合研究。为了传播讲习班上介绍的知识并评估其影响,将选择一份期刊特刊,以便可能出版与讲习班主题有关的论文集。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Farhad Shahrokhi其他文献
Crossing Numbers of Graphs , Lower Bound Techniques and Algorithms : A Survey
交叉图数,下界技术和算法:一项调查
- DOI:
- 发表时间:
2005 - 期刊:
- 影响因子:0
- 作者:
Farhad Shahrokhi - 通讯作者:
Farhad Shahrokhi
Guest Editor’s Foreword: Algorithms, Combinatorics, & Geometry
- DOI:
10.1007/s00453-011-9493-6 - 发表时间:
2011-02-04 - 期刊:
- 影响因子:0.700
- 作者:
Farhad Shahrokhi - 通讯作者:
Farhad Shahrokhi
Farhad Shahrokhi的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Farhad Shahrokhi', 18)}}的其他基金
NSF/CBMS Regional Research Conference in Mathematical Sciences on Geometric Graph Theory, May 28 2002-June 1 2002, UNT
NSF/CBMS 几何图论数学科学区域研究会议,2002 年 5 月 28 日-2002 年 6 月 1 日,UNT
- 批准号:
0121729 - 财政年份:2001
- 资助金额:
$ 0.9万 - 项目类别:
Standard Grant
Solving Crossing Number Problems With Applications
使用应用程序解决交叉号码问题
- 批准号:
9988525 - 财政年份:2000
- 资助金额:
$ 0.9万 - 项目类别:
Standard Grant
Crossing Number Problems in Geometric Drawings of Graphs
图形几何绘图中的交叉数问题
- 批准号:
9528228 - 财政年份:1996
- 资助金额:
$ 0.9万 - 项目类别:
Standard Grant
相似海外基金
Statistical Physics Methods in Combinatorics, Algorithms, and Geometry
组合学、算法和几何中的统计物理方法
- 批准号:
MR/W007320/2 - 财政年份:2023
- 资助金额:
$ 0.9万 - 项目类别:
Fellowship
Travel: NSF Student Travel Grant for 2023 PROTRAC:Probabilistic Trajectories in Algorithms and Combinatorics
旅行:2023 年 NSF 学生旅行补助金 PROTRAC:算法和组合学中的概率轨迹
- 批准号:
2340325 - 财政年份:2023
- 资助金额:
$ 0.9万 - 项目类别:
Standard Grant
CAREER: Developing a unified theory of descriptive combinatorics and local algorithms
职业:发展描述性组合学和局部算法的统一理论
- 批准号:
2239187 - 财政年份:2023
- 资助金额:
$ 0.9万 - 项目类别:
Continuing Grant
Designing Faster Algorithms by Connecting Structural Combinatorics and Convex Optimization
通过连接结构组合学和凸优化来设计更快的算法
- 批准号:
557770-2021 - 财政年份:2022
- 资助金额:
$ 0.9万 - 项目类别:
Postgraduate Scholarships - Doctoral
Statistical Physics Methods in Combinatorics, Algorithms, and Geometry
组合学、算法和几何中的统计物理方法
- 批准号:
MR/W007320/1 - 财政年份:2022
- 资助金额:
$ 0.9万 - 项目类别:
Fellowship
REU Site: CAAR: Combinatorics, Algorithms, and AI Applied to Real Problems
REU 网站:CAAR:组合学、算法和人工智能应用于实际问题
- 批准号:
2150382 - 财政年份:2022
- 资助金额:
$ 0.9万 - 项目类别:
Standard Grant
Designing Faster Algorithms by Connecting Structural Combinatorics and Convex Optimization
通过连接结构组合学和凸优化来设计更快的算法
- 批准号:
557770-2021 - 财政年份:2021
- 资助金额:
$ 0.9万 - 项目类别:
Postgraduate Scholarships - Doctoral
Efficient algorithms for optimization problems and their interplay with polyhedral combinatorics
优化问题的有效算法及其与多面体组合的相互作用
- 批准号:
RGPAS-2019-00073 - 财政年份:2020
- 资助金额:
$ 0.9万 - 项目类别:
Discovery Grants Program - Accelerator Supplements
Efficient algorithms for optimization problems and their interplay with polyhedral combinatorics
优化问题的有效算法及其与多面体组合的相互作用
- 批准号:
RGPIN-2019-04413 - 财政年份:2020
- 资助金额:
$ 0.9万 - 项目类别:
Discovery Grants Program - Individual
Efficient algorithms for optimization problems and their interplay with polyhedral combinatorics
优化问题的有效算法及其与多面体组合的相互作用
- 批准号:
RGPAS-2019-00073 - 财政年份:2019
- 资助金额:
$ 0.9万 - 项目类别:
Discovery Grants Program - Accelerator Supplements