clot-buster
发表于 2025-3-21 19:26:52
书目名称Algorithms and Discrete Applied Mathematics影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0153169<br><br> <br><br>书目名称Algorithms and Discrete Applied Mathematics读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0153169<br><br> <br><br>
弓箭
发表于 2025-3-21 22:20:14
https://doi.org/10.1007/978-3-662-34430-9e comparison graph is from a special class of graphs like chordal or comparability graphs. Finally, we make some remarks regarding the complexity of sorting with forbidden comparisons when the elements form a total order.
哑剧
发表于 2025-3-22 03:05:51
http://reply.papertrans.cn/16/1532/153169/153169_3.png
Allergic
发表于 2025-3-22 06:14:19
http://reply.papertrans.cn/16/1532/153169/153169_4.png
碎片
发表于 2025-3-22 12:34:31
http://reply.papertrans.cn/16/1532/153169/153169_5.png
ascetic
发表于 2025-3-22 15:30:48
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function, of the nearest-site Voronoi diagram of . convex polygonal sites, each having at most . sides, is .. Finally, we show that the corresponding farthest-site Voronoi diagram is a tree-like structure with the same combinatorial complexity.
平淡而无味
发表于 2025-3-22 19:05:14
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime,e comparison graph is from a special class of graphs like chordal or comparability graphs. Finally, we make some remarks regarding the complexity of sorting with forbidden comparisons when the elements form a total order.
prostatitis
发表于 2025-3-22 23:27:00
http://reply.papertrans.cn/16/1532/153169/153169_8.png
使厌恶
发表于 2025-3-23 05:15:36
On Structural Parameterizations of Graph Motif and Chromatic Number,split graphs, and para-.-hard when parameterized by the distance to co-graphs (which are the class of .-free graphs). On the other hand, it is known to be . when parameterized by the distance to a clique or the distance to an independent set (or equivalently, vertex cover). Towards finding the bound
Accommodation
发表于 2025-3-23 07:41:12
On Chromatic Number of Colored Mixed Graphs,lored mixed chromatic number is at most .. In particular, the last result directly improves the upper bound . of oriented chromatic number of graphs with maximum degree ., obtained by Kostochka et al. (1997, J. Graph Theory 24, 331–340) to .. We also show that there exists a connected graph with max