Author of the publication

Finding and Counting Patterns in Sparse Graphs.

, , , and . STACS, volume 254 of LIPIcs, page 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. You can also use the button next to the name to display some publications already assigned to the person.

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

Other publications of authors with the same name

Rabbits Approximate, Cows Compute Exactly!, , and . MFCS, volume 241 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pebbling, Entropy and Branching Program Size Lower Bounds., and . Electron. Colloquium Comput. Complex., (2013)Pebbling Meets Coloring: Reversible Pebble Game On Trees., , and . CoRR, (2016)On the Complexity of L-reachability., , and . CoRR, (2017)On the complexity of detecting hazards., and . Inf. Process. Lett., (2020)Comparator Circuits over Finite Bounded Posets., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 834-845. Springer, (2015)Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth., , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 336-347. Springer, (2014)Reversible Pebble Game on Trees., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 83-94. Springer, (2015)Graph Homomorphism Polynomials: Algorithms and Complexity., , and . CoRR, (2020)Karchmer-Wigderson Games for Hazard-Free Computation., , and . ITCS, volume 251 of LIPIcs, page 74:1-74:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)