Grievance
发表于 2025-3-25 06:15:14
http://reply.papertrans.cn/39/3880/387917/387917_21.png
induct
发表于 2025-3-25 11:16:55
http://reply.papertrans.cn/39/3880/387917/387917_22.png
HAUNT
发表于 2025-3-25 13:03:53
http://reply.papertrans.cn/39/3880/387917/387917_23.png
GROG
发表于 2025-3-25 18:10:27
https://doi.org/10.1007/978-3-030-75239-2f a hypergraph ., each vertex . is associated with a point . and each hyperedge . is associated with a connected set . such that . for all .. We say that a given hypergraph . is . by some (infinite) family . of sets in ., if there exist . and . such that (., .) is a geometric representation of .. Fo
Eosinophils
发表于 2025-3-25 23:07:51
https://doi.org/10.1007/978-3-319-78117-4ertices have perfect angular resolution, i.e., all angles incident to a vertex . have size .. We prove that it is .-complete to determine whether a given graph admits a Lombardi drawing respecting a fixed cyclic ordering of the incident edges around each vertex. In particular, this implies .-hardnes
Ingest
发表于 2025-3-26 00:18:39
https://doi.org/10.1007/978-3-030-97359-9ecifically, we extend upward drawings of unordered rooted trees where vertices have assigned heights by mapping each vertex to a column. Under an orthogonal drawing style and with every subtree within a column drawn planar, we consider different natural variants concerning the arrangement of subtree
合唱团
发表于 2025-3-26 05:41:38
http://reply.papertrans.cn/39/3880/387917/387917_27.png
注入
发表于 2025-3-26 10:15:30
http://reply.papertrans.cn/39/3880/387917/387917_28.png
联想记忆
发表于 2025-3-26 14:27:09
http://reply.papertrans.cn/39/3880/387917/387917_29.png
胰脏
发表于 2025-3-26 17:28:05
String Graphs with Precise Number of Intersections intersects in at most . points. We introduce the class of .-string graphs as a further restriction of .-string graphs by requiring that every two curves intersect in either zero or precisely . points. We study the hierarchy of these graphs, showing that for any ., .-string graphs are a subclass of