Meirav Zehavi

12 papers · 2018–2025 · 3 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🏃 Academic Marathon (7) 🐝 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

Hendrik Molter (4) Juhi Chaudhary (3) Saket Saurabh (3) Sushmita Gupta (3) Sanjukta Roy (2) Guy Katz (1) Siddharth Gupta (1) Guy Amir (1) Guy Sa'ar (1) Shahaf Bassan (1)

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