Meirav Zehavi
12 papers · 2018–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
π Academic Marathon (7) π§ Keyword Pioneer π Interdisciplinary Bridge π Conference Polyglot (3) π Cross-Pollinator (4)
π
Renaissance Researcher
(5)
πΊοΈ
Taxonomy Completionist
(15)
π
Conference Polyglot
(3)
π
Keyword Champion
(3)
π§¬
Topic Evolution
π
Century Club
(12)
β
The Questioner
(3)
Conferences
IJCAI (7)
AAAI (4)
ICML (1)
Top co-authors
Keywords
parameterized complexity
(5)
graph theory
(4)
combinatorial optimization
(4)
knockout tournament
(3)
parameterized algorithm
(3)
computational complexity
(3)
fixed-parameter tractable
(3)
tournament design
(2)
tournament fixing
(2)
binary tree
(1)
decision tree
(1)
mixed integer programming
(1)
temporal graph
(1)
knapsack problem
(1)
game theory
(1)
approximation algorithm
(1)
strategic bribery
(1)
greedy algorithm
(1)
outcome prediction
(1)
tournament manipulation
(1)
Papers
Adaptive Manipulation for Coalitions in Knockout Tournaments
AAAI 2025
What makes an Ensemble (Un) Interpretable?
ICML 2025
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
IJCAI 2024
How to Make Knockout Tournaments More Popular?
AAAI 2024
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
AAAI 2024
Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT
AAAI 2023
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
IJCAI 2023
Participatory Budgeting with Project Groups
IJCAI 2021
On Succinct Encodings for the Tournament Fixing Problem
IJCAI 2019
The Parameterized Complexity of Motion Planning for Snake-Like Robots
IJCAI 2019
When Rigging a Tournament, Let Greediness Blind You
IJCAI 2018
Winning a Tournament by Any Means Necessary
IJCAI 2018