水土
发表于 2025-3-23 12:38:18
http://reply.papertrans.cn/103/10201/1020043/1020043_11.png
neologism
发表于 2025-3-23 14:46:06
http://reply.papertrans.cn/103/10201/1020043/1020043_12.png
Watemelon
发表于 2025-3-23 21:41:56
The Polygon Burning Problemtype of polygon, the sliceable polygon. A sliceable polygon is a convex polygon that contains no Voronoi vertex from the Voronoi diagram of its vertices. We give a dynamic programming algorithm to solve PB exactly on a sliceable polygon in . time.
Defiance
发表于 2025-3-23 22:12:30
The Polygon Burning Problemtype of polygon, the sliceable polygon. A sliceable polygon is a convex polygon that contains no Voronoi vertex from the Voronoi diagram of its vertices. We give a dynamic programming algorithm to solve PB exactly on a sliceable polygon in . time.
睨视
发表于 2025-3-24 06:09:15
http://reply.papertrans.cn/103/10201/1020043/1020043_15.png
Scleroderma
发表于 2025-3-24 06:46:34
Some Problems Related to the Space of Optimal Tree Reconciliationsbased on their phylogenetic information. Indeed, informally speaking, it reconciles any differences between two phylogenetic trees by means of biological events. Tree reconciliation is usually computed according to the parsimony principle, that is, to each evolutionary event a cost is assigned and t
ungainly
发表于 2025-3-24 11:15:17
http://reply.papertrans.cn/103/10201/1020043/1020043_17.png
Mnemonics
发表于 2025-3-24 18:04:45
http://reply.papertrans.cn/103/10201/1020043/1020043_18.png
cruise
发表于 2025-3-24 20:06:19
http://reply.papertrans.cn/103/10201/1020043/1020043_19.png
Hamper
发表于 2025-3-25 00:58:14
Invitation to Combinatorial Reconfigurationnce of a search problem. Many reconfiguration problems have been shown PSPACE-complete, while several algorithmic techniques have been developed. In this talk, I will give a broad introduction of combinatorial reconfiguration.