Systematic vs. Non-systematic Algorithms for Solving the MPE Task. - Radu Marinescu 002; Kalev Kask; Rina Dechter (UAI, 2003)

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. - Radu Marinescu 002; Rina Dechter (CP, 2005)

AND/OR Branch-and-Bound for Graphical Models. - Radu Marinescu 002; Rina Dechter (IJCAI, 2005)

Memory Intensive Branch-and-Bound Search for Graphical Models. - Radu Marinescu 002; Rina Dechter (AAAI, 2006)

AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. - Radu Marinescu 002; Rina Dechter (CPAIOR, 2006)

Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. - Radu Marinescu 002; Rina Dechter (ECAI, 2006)

Best-First AND/OR Search for Graphical Models. - Radu Marinescu 002; Rina Dechter (AAAI, 2007)

AND/OR Multi-valued Decision Diagrams for Constraint Optimization. - Robert Mateescu; Radu Marinescu 002; Rina Dechter (CP, 2007)

Best-First AND/OR Search for 0/1 Integer Programming. - Radu Marinescu 002; Rina Dechter (CPAIOR, 2007)

Best-First AND/OR Search for Most Probable Explanations. - Radu Marinescu 002; Rina Dechter (UAI, 2007)

On the Practical Significance of Hypertree vs. TreeWidth. - Rina Dechter; Lars Otten; Radu Marinescu 002 (ECAI, 2008)

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. - Robert Mateescu; Rina Dechter; Radu Marinescu 002 (J. Artif. Intell. Res., 2008)

Exploiting Problem Decomposition in Multi-objective Constraint Optimization. - Radu Marinescu 002 (CP, 2009)

Towards a novel early warning service for state agencies: A feasibility study. - Ioannis M. Dokas; Richard J. Wallace; Radu Marinescu 002; Syed Imran; Franclin S. Foping (ITEE, 2009)

A New Approach to Influence Diagrams Evaluation. - Radu Marinescu 002 (SGAI Conf., 2009)

AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. - Radu Marinescu 002; Rina Dechter (Artif. Intell., 2009)

Memory intensive AND/OR search for combinatorial optimization in graphical models. - Radu Marinescu 002; Rina Dechter (Artif. Intell., 2009)

Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization. - Radu Marinescu 002 (ICTAI (1), 2010)

Evaluating the impact of AND/OR search on 0-1 integer linear programming. - Radu Marinescu 002; Rina Dechter (Constraints An Int. J., 2010)

Efficient Approximation Algorithms for Multi-objective Constraint Optimization. - Radu Marinescu 002 (ADT, 2011)

Order-of-Magnitude Influence Diagrams. - Radu Marinescu 002; Nic Wilson (UAI, 2011)

Search Algorithms for m Best Solutions for Graphical Models. - Rina Dechter; Natalia Flerova; Radu Marinescu 002 (AAAI, 2012)

An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities. - Nic Wilson; Radu Marinescu 002 (KR, 2012)

Multi-objective Influence Diagrams. - Radu Marinescu 002; Abdul Razak; Nic Wilson (UAI, 2012)

Multi-Objective Constraint Optimization with Tradeoffs. - Radu Marinescu 002; Abdul Razak; Nic Wilson (CP, 2013)

Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (StarAI@AAAI, 2014)

Weighted Best First Search for Graphical Models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (ISAIM, 2014)

Multi-criteria journey aware housing recommender system. - Elizabeth M. Daly; Adi Botea; Akihiro Kishimoto; Radu Marinescu 002 (RecSys, 2014)

Evaluating Weighted DFS Branch and Bound over Graphical Models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (SOCS, 2014)

AND/OR Search for Marginal MAP. - Radu Marinescu 002; Rina Dechter; Alexander Ihler (UAI, 2014)

Recursive Best-First AND/OR Search for Optimization in Graphical Models. - Akihiro Kishimoto; Radu Marinescu 002 (UAI, 2014)

Unified framework and toolkit for commerce optimization under uncertainty. - Ban Kawas; Ali Koc; Marco Laumanns; Chungmok Lee; Radu Marinescu 002; Martin Mevissen; Nicole Taheri; Susara Van den Heever; Rudi Verago (IBM J. Res. Dev., 2014)

Pushing Forward Marginal MAP with Best-First Search. - Radu Marinescu 002; Rina Dechter; Alexander Ihler (IJCAI, 2015)

Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs. - Nic Wilson; Abdul Razak; Radu Marinescu 002 (IJCAI, 2015)

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models. - Akihiro Kishimoto; Radu Marinescu 002; Adi Botea (NIPS, 2015)

From Exact to Anytime Solutions for Marginal MAP. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter; Alexander Ihler (AAAI, 2016)

Scalable Exact MAP Inference in Graphical Models. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea (ECAI, 2016)

Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (ISAIM, 2016)

Service Bundle Recommendation for Person-Centered Care Planning in Cities. - Spyros Kotoulas; Elizabeth Daly; Pierpaolo Tommasi; Akihiro Kishimoto; Vanessa López; Martin Stephenson; Adi Botea; Marco Luca Sbodio; Radu Marinescu 002; Ronan Rooney (MIE, 2016)

Searching for the M Best Solutions in Graphical Models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (J. Artif. Intell. Res., 2016)

Anytime Best+Depth-First Search for Bounding Marginal MAP. - Radu Marinescu 002; Junkyu Lee 001; Alexander Ihler; Rina Dechter (AAAI, 2017)

Multi-Objective Influence Diagrams with Possibly Optimal Policies. - Radu Marinescu 002; Abdul Razak; Nic Wilson (AAAI, 2017)

Efficient Optimal Search under Expensive Edge Cost Computation. - Masataro Asai; Akihiro Kishimoto; Adi Botea; Radu Marinescu 002; Elizabeth M. Daly; Spyros Kotoulas (IJCAI, 2017)

Weighted heuristic anytime search: new schemes for optimization over graphical models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (Ann. Math. Artif. Intell., 2017)

Stochastic Anytime Search for Bounding Marginal MAP. - Radu Marinescu 002; Rina Dechter; Alexander Ihler (IJCAI, 2018)

From Stochastic Planning to Marginal MAP. - Hao Cui 003; Radu Marinescu 002; Roni Khardon (NeurIPS, 2018)

On the Complexity of Quantum Circuit Compilation. - Adi Botea; Akihiro Kishimoto; Radu Marinescu 002 (SOCS, 2018)

AND/OR Search for Marginal MAP. - Radu Marinescu 002; Junkyu Lee 001; Rina Dechter; Alexander Ihler (J. Artif. Intell. Res., 2018)

Anytime Recursive Best-First Search for Bounding Marginal MAP. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea; Rina Dechter; Alexander Ihler (AAAI, 2019)

Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. - Akihiro Kishimoto; Adi Botea; Radu Marinescu 002 (IJCAI, 2019)

Counting the Optimal Solutions in Graphical Models. - Radu Marinescu 002; Rina Dechter (NeurIPS, 2019)

A Weighted Mini-Bucket Bound for Solving Influence Diagram. - Junkyu Lee 001; Radu Marinescu 002; Alexander Ihler; Rina Dechter (UAI, 2019)

Generating Dialogue Agents via Automated Planning. - Adi Botea; Christian Muise; Shubham Agarwal 002; Oznur Alkan; Ondrej Bajgar; Elizabeth Daly; Akihiro Kishimoto; Luis A. Lastras; Radu Marinescu 002; Josef Ondrej; Pablo Pedemonte; Miroslav Vodolán (CoRR, 2019)

Parallel AND/OR Search for Marginal MAP. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea (AAAI, 2020)

The Challenge of Optimal Paths in Graphs with Item Sets. - Adi Botea; Akihiro Kishimoto; Radu Marinescu 002; Elizabeth M. Daly; Oznur Alkan (ECAI, 2020)

Heuristic AND/OR Search for Solving Influence Diagram. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (SOCS, 2020)

An axiomatic framework for influence diagram computation with partially ordered preferences. - Nic Wilson; Radu Marinescu 002 (Int. J. Approx. Reason., 2020)

Submodel Decomposition Bounds for Influence Diagrams. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (AAAI, 2021)

A New Bounding Scheme for Influence Diagrams. - Radu Marinescu 002; Junkyu Lee 001; Rina Dechter (AAAI, 2021)

Searching for Machine Learning Pipelines Using a Context-Free Grammar. - Radu Marinescu 002; Akihiro Kishimoto; Parikshit Ram; Ambrish Rawat; Martin Wistuba; Paulito P. Palmes; Adi Botea (AAAI, 2021)

Learning the Parameters of Bayesian Networks from Uncertain Data. - Segev Wasserkrug; Radu Marinescu 002; Sergey Zeltyn; Evgeny Shindin; Yishai A. Feldman (AAAI, 2021)

Counting Vertex-Disjoint Shortest Paths in Graphs. - Adi Botea; Massimiliano Mattetti; Akihiro Kishimoto; Radu Marinescu 002; Elizabeth Daly (SOCS, 2021)

Designing Machine Learning Pipeline Toolkit for AutoML Surrogate Modeling Optimization. - Paulito P. Palmes; Akihiro Kishimoto; Radu Marinescu 002; Parikshit Ram; Elizabeth Daly (CoRR, 2021)

Contrastive Explanations for Comparing Preferences of Reinforcement Learning Agents. - Jasmina Gajcin; Rahul Nair; Tejaswini Pedapati; Radu Marinescu 002; Elizabeth Daly; Ivana Dusparic (CoRR, 2021)

Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization. - Akihiro Kishimoto; Djallel Bouneffouf 001; Radu Marinescu 002; Parikshit Ram; Ambrish Rawat; Martin Wistuba; Paulito P. Palmes; Adi Botea (AAAI, 2022)

Logical Credal Networks. - Radu Marinescu 002; Haifeng Qian; Alexander G. Gray; Debarun Bhattacharjya; Francisco Barahona; Tian Gao; Ryan Riegel; Pravinda Sahu (NeurIPS, 2022)

Hedging as Reward Augmentation in Probabilistic Graphical Models. - Debarun Bhattacharjya; Radu Marinescu 002 (NeurIPS, 2022)

AND/OR branch-and-bound for computational protein design optimizing K. - Bobak Pezeshki; Radu Marinescu 002; Alexander Ihler; Rina Dechter (UAI, 2022)

Boolean Decision Rules for Reinforcement Learning Policy Summarisation. - James McCarthy; Rahul Nair; Elizabeth Daly; Radu Marinescu 002; Ivana Dusparic (CoRR, 2022)

Iterative Reward Shaping Using Human Feedback for Correcting Reward Misspecification. - Jasmina Gajcin; James McCarthy; Rahul Nair; Radu Marinescu 002; Elizabeth Daly; Ivana Dusparic (ECAI, 2023)

Approximate Inference in Logical Credal Networks. - Radu Marinescu 002; Haifeng Qian; Alexander G. Gray; Debarun Bhattacharjya; Francisco Barahona; Tian Gao; Ryan Riegel (IJCAI, 2023)

An Ensemble Approach for Automated Theorem Proving Based on Efficient Name Invariant Graph Neural Representations. - Achille Fokoue; Ibrahim Abdelaziz; Maxwell Crouse; Shajith Ikbal; Akihiro Kishimoto; Guilherme Lima; Ndivhuwo Makondo; Radu Marinescu 002 (IJCAI, 2023)

AutoDOViz: Human-Centered Automation for Decision Optimization. - Daniel Karl I. Weidele; Shazia Afzal; Abel N. Valente; Cole Makuch; Owen Cornec; Long Vu; Dharmashankar Subramanian; Werner Geyer; Rahul Nair; Inge Vejsbjerg; Radu Marinescu 002; Paulito P. Palmes; et al. (IUI, 2023)

Credal Marginal MAP. - Radu Marinescu 002; Debarun Bhattacharjya; Junkyu Lee 001; Fábio G. Cozman; Alexander G. Gray (NeurIPS, 2023)

Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. - Bobak Pezeshki; Radu Marinescu 002; Alexander Ihler; Rina Dechter (UAI, 2023)

WikiContradict: A Benchmark for Evaluating LLMs on Real-World Knowledge Conflicts from Wikipedia. - Yufang Hou 001; Alessandra Pascale; Javier Carnerero-Cano; Tigran T. Tchrakian; Radu Marinescu 002; Elizabeth Daly; Inkit Padhi; Prasanna Sattigeri (NeurIPS, 2024)

Abductive Reasoning in Logical Credal Networks. - Radu Marinescu 002; Junkyu Lee 001; Debarun Bhattacharjya; Fábio G. Cozman; Alexander G. Gray (NeurIPS, 2024)

Foundation Model Sherpas: Guiding Foundation Models through Knowledge and Reasoning. - Debarun Bhattacharjya; Junkyu Lee 001; Don Joven Agravante; Balaji Ganesan; Radu Marinescu 002 (CoRR, 2024)

Markov conditions and factorization in logical credal networks. - Fábio G. Cozman; Radu Marinescu 002; Junkyu Lee 001; Alexander G. Gray; Ryan Riegel; Debarun Bhattacharjya (Int. J. Approx. Reason., 2024)

Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks. - Fábio G. Cozman; Radu Marinescu 002; Junkyu Lee 001; Alexander Gray 001; Denis Deratani Mauá (ISIPTA, 2025)

The Consistency Hypothesis in Uncertainty Quantification for Large Language Models. - Quan Xiao; Debarun Bhattacharjya; Balaji Ganesan; Radu Marinescu 002; Katsiaryna Mirylenka; Nhan H. Pham; Michael R. Glass; Junkyu Lee 001 (UAI, 2025)

FactReasoner: A Probabilistic Approach to Long-Form Factuality Assessment for Large Language Models. - Radu Marinescu 002; Debarun Bhattacharjya; Junkyu Lee 001; Tigran T. Tchrakian; Javier Carnerero-Cano; Yufang Hou 001; Elizabeth Daly; Alessandra Pascale (CoRR, 2025)

Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning. - James McCarthy; Radu Marinescu 002; Elizabeth Daly; Ivana Dusparic (CoRR, 2025)