( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Hardness of Bounding Influence via Graph Modification.

, и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 129-143. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Robert D Haak

Robert D Rowe

Robert D Foster

D Zeppenfeld

D Zumkeller

 

Другие публикации лиц с тем же именем

Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs., и . Graphs Comb., 36 (2): 387-400 (2020)Proper Colorability of Segment Intersection Graphs., и . COCOON, том 13595 из Lecture Notes in Computer Science, стр. 573-584. Springer, (2022)Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs., и . J. Inf. Process., (2020)Counting on Rainbow k-Connections., и . TAMC, том 14637 из Lecture Notes in Computer Science, стр. 272-283. Springer, (2024)Counting Substrate Cycles in Topologically Restricted Metabolic Networks., и . CiE, том 10307 из Lecture Notes in Computer Science, стр. 129-140. Springer, (2017)String Editing Under Pattern Constraints., и . ICS, том 1723 из Communications in Computer and Information Science, стр. 13-24. Springer, (2022)Hardness of Bounding Influence via Graph Modification., и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 129-143. Springer, (2023)Barnette's Conjecture Through the Lens of the ModkP Complexity Classes., и . JCDCGGG, том 13034 из Lecture Notes in Computer Science, стр. 59-73. Springer, (2018)Counting on a Rainbow Connection (text not included)., и . ICTCS, том 3284 из CEUR Workshop Proceedings, CEUR-WS.org, (2022)Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching., и . CCCG, стр. 16-31. (2022)