For a full list, see my Google Scholar profile.

Technical Companions — For many of my papers I have prepared undergraduate-accessible guides that explain every equation, theorem, and algorithm step by step, with symbol breakdowns and numerical examples. Look for the Technical Companion (PDF) links below.

Bidirectional Search while Ensuring Meet-In-The-Middle via Effective and Efficient-to-Compute Termination Conditions · Technical Companion (PDF) Y. Wang, B. Mu, E. Weiss, O. Salzman — IJCAI 2025 bidirectional search meet-in-the-middle termination conditions

Generalizing Multi-Objective Search via Objective-Aggregation Functions · Technical Companion (PDF) H. Peer, E. Weiss, R. Alterovitz, O. Salzman — arXiv preprint multi-objective search objective aggregation robotics planning

Tightest Admissible Shortest Path · Technical Companion (PDF) E. Weiss, A. Felner, G. A. Kaminka — ICAPS 2024 shortest path admissible heuristics graph search

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates · Technical Companion (PDF) E. Weiss, A. Felner, G. A. Kaminka — ECAI 2023 shortest path multiple edge costs cost uncertainty

AI Planning

PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning · Technical Companion (PDF) D. Gnad, L. Alon, E. Weiss, A. Shleyfman — AAAI 2025 numeric planning pattern databases heuristic search

Planning with Multiple Action-Cost Estimates · Technical Companion (PDF) E. Weiss, G. A. Kaminka — ICAPS 2023 action-cost estimation dynamic models classical planning

Position Paper: Online Modeling for Offline Planning E. Weiss, G. A. Kaminka — RDDPS Workshop, ICAPS 2022 online learning action models planning under uncertainty

Motion Planning & Robotics

To be updated soon 😊

Multi-Agent Systems

From Agent Centric to Obstacle Centric Planning: A Makespan-Optimal Algorithm for the Multi-Agent Warehouse Rearrangement Problem · Technical Companion (PDF) 🏆 Best Paper Award Y. Sherma, E. Weiss, O. Salzman — SoCS 2025 multi-agent planning warehouse rearrangement makespan optimization

Control Theory & Dynamical Systems

A Generalization of Linear Positive Systems with Applications to Nonlinear Systems: Invariant Sets and the Poincaré–Bendixson Property · Technical Companion (PDF) E. Weiss, M. Margaliot — Automatica, 2021 positive systems invariant sets nonlinear systems Poincaré–Bendixson

Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm · Technical Companion (PDF) E. Weiss, M. Margaliot — IEEE Control Systems Letters, 2019 Boolean control networks observer design output selection

A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks · Technical Companion (PDF) E. Weiss, M. Margaliot — IEEE Transactions on Automatic Control, 2019 Boolean networks observability polynomial-time algorithm

Minimal Controllability of Conjunctive Boolean Networks is NP-Complete · Technical Companion (PDF) E. Weiss, M. Margaliot, G. Even — Automatica, 2018 Boolean networks controllability NP-completeness