1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.CC2026
The blue pebbling cost and the space in tree-like and negative Resolution
Lisa-Marie Jaser, Jacobo Torán
The red-blue pebble game is a well known two-player game on graphs that has been used in the past as a tool to analyze complexity measures in several computation models as well as…
cs.LO2025
Pebble Games and Algebraic Proof Systems
Lisa-Marie Jaser, Jacobo Toran
Analyzing refutations of the well known 0pebbling formulas Peb we prove some new strong connections between pebble games and algebraic proof system, showing that there is a pa…
cs.CC2017★ 1 cited
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
V. Arvind, Johannes Köbler, Sebastian Kuhnert +1
Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these,…