activity
20002004
most citedGenerating All Maximal Induced Subgraphs for Hereditary, Connected-Hereditary and Rooted-Hereditary Properties

3 citations · 3 across the 2 of their papers we have counts for

collaborators

5 papers

cs.DS20043 cited

Generating All Maximal Induced Subgraphs for Hereditary, Connected-Hereditary and Rooted-Hereditary Properties

Sara Cohen, Yehoshua Sagiv

The problem of computing all maximal induced subgraphs of a graph G that have a graph property P, also called the maximal P-subgraphs problem, is considered. This problem is studie…

cs.DB2002

Equivalences Among Aggregate Queries with Negation

Sara Cohen, Werner Nutt, Yehoshua Sagiv

Query equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full characterization of equivalence is given for the aggreg…

cs.DB2001

EquiX--A Search and Query Language for XML

Sara Cohen, Yaron Kanza, Yakov Kogan +3

EquiX is a search language for XML that combines the power of querying with the simplicity of searching. Requirements for such languages are discussed and it is shown that EquiX me…

cs.DB2000

EquiX---A Search and Query Language for XML

Sara Cohen, Yaron Kanza, Yakov Kogan +3

EquiX is a search language for XML that combines the power of querying with the simplicity of searching. Requirements for such languages are discussed and it is shown that EquiX me…

cs.PL2000

Automatic Termination Analysis of Programs Containing Arithmetic Predicates

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv +1

For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in the…