Meirav Zehavi
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Abhishek Rathodonce
- Ulrich Baueronce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On computing homological hitting sets | ITCS 2023 | 2023-01-10 |
Defines the minimum homological hitting set problem and gives three concrete results: a polynomial‑time algorithm on triangulated closed surfaces that finds an… | ||
| The Copy Number Transformation Problem | Computational Cancer Biology 2016 | 2016-02-01 |
Defines copy-number profiles as integer vectors and operations as unit ±1 operations on contiguous intervals; proves each position needs at most max copy… | ||
| Color Coding-Related Techniques | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Gives a concise comparison of three concrete algorithmic tools: color coding (randomized k-colorings plus 2^k dynamic programming entries), divide and color… | ||
| nothing matches | ||