algorithm design

Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms AAAI 2026 Checking Consistency of CP-Theory Preferences in Polynomial Time AAAI 2025 Deviate or Not: Learning Coalition Structures with Multiple-bit Observations in Games AAAI 2025 Efficient and Rigorous Model-Agnostic Explanations IJCAI 2025 Fast Algorithm for Constrained Linear Inverse Problems JMLR 2025 How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs AAAI 2025 Nested-Refinement Metamorphosis: Reflective Evolution for Efficient Optimization of Networking Problems ACL 2025 p-Mean Regret for Stochastic Bandits AAAI 2025 Accelerating ERM for data-driven algorithm design using output-sensitive techniques NeurIPS 2024 Accelerating Matroid Optimization through Fast Imprecise Oracles NeurIPS 2024 Efficient Sequential Decision Making with Large Language Models EMNLP 2024 Fair Secretaries with Unfair Predictions NeurIPS 2024 Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem NeurIPS 2024 On the Complexity of Identification in Linear Structural Causal Models NeurIPS 2024 Optimal Design for Human Preference Elicitation NeurIPS 2024 Optimization Algorithm Design via Electric Circuits NeurIPS 2024 Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover AAAI 2024 ε-fractional core stability in Hedonic Games. NeurIPS 2023 A Bitwise GAC Algorithm for Alldifferent Constraints IJCAI 2023 An Algorithm and Complexity Results for Causal Unit Selection CLeaR 2023 A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment NeurIPS 2023 Group Fairness in Peer Review NeurIPS 2023 Optimal Pricing Schemes for Identical Items with Time-Sensitive Buyers AAAI 2023 Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023 Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual AAAI 2023