International Symposium on Computational Geometry (SOCG)

Robustly Guarding Polygons.

稳健地保护多边形。

2024

Saturation Results Around the Erdős-Szekeres Problem.

关于Erdős-Szekeres问题的饱和结果。

2024

Sweeping Arrangements of Non-Piercing Regions in the Plane.

平面中非穿刺区域的扫掠排列。

2024

Stability and Approximations for Decorated Reeb Spaces.

装饰Reeb空间的稳定性与逼近

2024

Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping.

动态时间规整下(k,𝓁)-中位数的快速近似与核心集

2024

GPU Algorithm for Enumerating PL Spheres of Picard Number 4: Application to Toric Topology.

Picard数为4的可剖球面的GPU算法枚举:应用于环面拓扑。

2024

Optimal Algorithm for the Planar Two-Center Problem.

平面双中心问题的最优算法。

2024

Nearly Orthogonal Sets over Finite Fields.

有限域上的近似正交集。

2024

Optimal Euclidean Tree Covers.

最优欧氏树覆盖。

2024

Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs.

单位圆盘图直径+2的真正次二次时间计算。

2024

uMi+K6

Yrq8XY

International Symposium on Computational Geometry

8JkxjF

CCF: B

CORE: A

THCPL:

2QmHnr

Year: 2025

Place: Kanazawa, Japan

Date: June 23-27, 2025

Timeline:

Abstract Deadline: 2024-11-06T23:59:00-12:00

Deadline: 2024-12-03T23:59:00-12:00

Built withby Ivy Science
Copyright © 2020-2024
版权所有:南京青藤格致信息科技有限公司
隐私和监管政策
苏ICP备20040574号-1
ICP许可证: 苏B2-20220377