( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding and Counting Patterns in Sparse Graphs.

, , , и . STACS, том 254 из LIPIcs, стр. 40:1-40:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

No persons found for author name Komarath, Balagopal
add a person with the name Komarath, Balagopal
 

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

Rabbits Approximate, Cows Compute Exactly!, , и . MFCS, том 241 из LIPIcs, стр. 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pebbling, Entropy and Branching Program Size Lower Bounds., и . STACS, том 20 из LIPIcs, стр. 622-633. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)On the complexity of detecting hazards., и . Inf. Process. Lett., (2020)Pebbling Meets Coloring: Reversible Pebble Game On Trees., , и . CoRR, (2016)On the Complexity of L-reachability., , и . CoRR, (2017)Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth., , , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 336-347. Springer, (2014)Reversible Pebble Game on Trees., , и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2015)Comparator Circuits over Finite Bounded Posets., , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 834-845. Springer, (2015)Graph Homomorphism Polynomials: Algorithms and Complexity., , и . CoRR, (2020)On the Complexity of L-reachability., , и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2014)