CYNIC 发表于 2025-3-21 18:44:07

书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0388038<br><br>        <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0388038<br><br>        <br><br>

DECRY 发表于 2025-3-21 20:26:06

On Fair Covering and Hitting Problems,t number of colors. Next, for the . problem, we design an . time exact algorithm, via a chain of reductions to a matching problem. For all intermediate problems in this chain of reductions, we design polynomial time algorithms, which might be of independent interest.

锯齿状 发表于 2025-3-22 03:55:10

http://reply.papertrans.cn/39/3881/388038/388038_3.png

演讲 发表于 2025-3-22 06:13:07

Biophysics for the Life Sciencest function of . and the maximum size of a minor obstruction of .. This implies that the problem of deciding whether . is . fixed parameter tractable, when parameterized by .. Our results are based on a structural characterization of the obstructions of ., relatively to the obstructions of .. Finally

誓言 发表于 2025-3-22 08:52:23

http://reply.papertrans.cn/39/3881/388038/388038_5.png

gait-cycle 发表于 2025-3-22 14:40:56

Developments in Molecular Virologys. Chordal distance-hereditary graphs are a natural generalization of trivially perfect graphs and have been extensively studied from the structural viewpoint. However, to the best of our knowledge, completion to chordal distance-hereditary graphs has not received attention so far. We thus initiate

gait-cycle 发表于 2025-3-22 17:59:22

http://reply.papertrans.cn/39/3881/388038/388038_7.png

Toxoid-Vaccines 发表于 2025-3-22 23:19:33

Parameterized Complexity of , of Caterpillars and ,roblem, we introduce the . problem: given a vertex-weighted path . and integer ., decide if there exists a mapping of the vertices of . to a path ., such that adjacent vertices are mapped to adjacent or equal vertices, and such that the total weight of the pre-image of a vertex from . equals an inte

MOT 发表于 2025-3-23 05:07:33

http://reply.papertrans.cn/39/3881/388038/388038_9.png

粗俗人 发表于 2025-3-23 09:02:43

http://reply.papertrans.cn/39/3881/388038/388038_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: ;