activity
20172026
most citedA Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks

57 citations · 190 across the 12 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.LG2026

Cost-Sensitive Neighborhood Aggregation for Heterophilous Graphs: When Does Per-Edge Routing Help?

Eyal Weiss

Recent work distinguishes two heterophily regimes: adversarial, where cross-class edges dilute class signal and harm classification, and informative, where the heterophilous struct…