Meirav Zehavi
12 papers · 2018–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Bronze π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (16)
π§¬
Topic Evolution
π
Keyword Champion
(3)
π
Century Club Β· Bronze
β
The Questioner
(3)
Top co-authors
Research topics
Keywords
parameterized complexity
(5)
computational complexity
(4)
fixed-parameter tractable
(4)
combinatorial optimization
(4)
graph theory
(4)
parameterized algorithm
(3)
knockout tournament
(3)
decision tree
(2)
tournament design
(2)
fixed-parameter tractability
(2)
tournament fixing
(2)
mixed integer programming
(1)
approximation algorithm
(1)
temporal graph
(1)
game theory
(1)
greedy algorithm
(1)
tournament manipulation
(1)
feedback vertex set
(1)
polynomial kernel
(1)
decision tree learning
(1)
Papers
Adaptive Manipulation for Coalitions in Knockout Tournaments
AAAI 2025
What makes an Ensemble (Un) Interpretable?
ICML 2025
How to Make Knockout Tournaments More Popular?
AAAI 2024
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
AAAI 2024
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
IJCAI 2024
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
IJCAI 2023
Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT
AAAI 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