Titlebook: Computer Science – Theory and Applications; 17th International C Alexander S. Kulikov,Sofya Raskhodnikova Conference proceedings 2022 Sprin

本义

书目名称Computer Science – Theory and Applications影响因子(影响力)




书目名称Computer Science – Theory and Applications影响因子(影响力)学科排名




书目名称Computer Science – Theory and Applications网络公开度




书目名称Computer Science – Theory and Applications网络公开度学科排名




书目名称Computer Science – Theory and Applications被引频次




书目名称Computer Science – Theory and Applications被引频次学科排名




书目名称Computer Science – Theory and Applications年度引用




书目名称Computer Science – Theory and Applications年度引用学科排名




书目名称Computer Science – Theory and Applications读者反馈




书目名称Computer Science – Theory and Applications读者反馈学科排名

Ophthalmoscope

,Coloring a Dominating Set Without Conflicts: ,-Subset Square Coloring,olors. In this paper, we initiate the study of a related coloring problem called the . of graphs. Broadly, the subset square coloring of a graph studies the square coloring of a dominating set of a graph using . colors. Here the aim is to optimize the number of colors used. This also generalizes the

Obvious

,Parameterized Complexity of List Coloring and Max Coloring,each ., . and for each edge ., .. Fiala et al. (TCS 2011) proved that . is W[1]-hard when parameterized by the vertex cover number of the input graph. Recently, Gutin et al. (STACS 2020, SIDMA 2021) designed an . time randomized algorithm for . where . is the size of the given clique modulator of th

繁忙

,Eternal Vertex Cover on Bipartite Graphs,very move, one player (the attacker) attacks an edge. In response to the attack, the second player (the defender) moves some of the guards along the edges of the graph in such a manner that at least one guard moves along the attacked edge. If such a movement is not possible, then the attacker wins.

跑过

有毒

有毒

Output Sensitive Fault Tolerant Maximum Matching,f a maximum matching of .. A subgraph . of . is an . . . if it has the following property: For any set . of at most . vertices or edges in ., .. Assadi and Bernstein [SOSA 2019] showed that for any ., there exists a .-FTMS of size .. In this paper we initiate a study of (1, .)-FTMS or .-FTMS in shor

序曲

,Bounds for Synchronizing Markov Decision Processes,get states, either once, always, infinitely often, or always from some point on, where . for sure synchronizing, and . for almost-sure and limit-sure synchronizing..We introduce two new qualitative modes of synchronizing, where the probability mass should be either ., or . away from 0. They can be v

Accolade

aerial