| 2026 | AAAI | AutoTuneX: Interactive Automated Fine-Tuning for Large Language Models. | Daniel Karl I. Weidele, Priyanshu Rai, Frederico Araujo, Teryl Taylor, Radu Marinescu |
| 2026 | ACL | FactCorrector: A Graph-Inspired Approach to Long-Form Factuality Correction of Large Language Models. | Javier Carnerero-Cano, Massimiliano Pronesti, Radu Marinescu, Tigran T. Tchrakian, James Barry, Jasmina Gajcin, Yufang Hou, Alessandra Pascale, Elizabeth M. Daly |
| 2025 | ECAI | Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning. | James McCarthy, Radu Marinescu, Elizabeth Daly, Ivana Dusparic |
| 2025 | EMNLP | SIMBA UQ: Similarity-Based Aggregation for Uncertainty Quantification in Large Language Models. | Debarun Bhattacharjya, Balaji Ganesan, Junkyu Lee, Radu Marinescu, Katsiaryna Mirylenka, Michael R. Glass, Xiao Shou |
| 2025 | EMNLP | FactReasoner: A Probabilistic Approach to Long-Form Factuality Assessment for Large Language Models. | Radu Marinescu, Debarun Bhattacharjya, Junkyu Lee, Tigran T. Tchrakian, Javier Carnerero-Cano, Yufang Hou, Elizabeth M. Daly, Alessandra Pascale |
| 2025 | UAI | The Consistency Hypothesis in Uncertainty Quantification for Large Language Models. | Quan Xiao, Debarun Bhattacharjya, Balaji Ganesan, Radu Marinescu, Katsiaryna Mirylenka, Nhan H. Pham, Michael R. Glass, Junkyu Lee |
| 2023 | ECAI | Iterative Reward Shaping Using Human Feedback for Correcting Reward Misspecification. | Jasmina Gajcin, James McCarthy, Rahul Nair, Radu Marinescu, Elizabeth Daly, Ivana Dusparic |
| 2023 | IJCAI | Approximate Inference in Logical Credal Networks. | Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel |
| 2023 | IJCAI | 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 |
| 2023 | IUI | 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, Paulito P. Palmes, Elizabeth M. Daly, Loraine Franke, Daniel Haehn |
| 2023 | UAI | Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. | Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter |
| 2022 | AAAI | Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization. | Akihiro Kishimoto, Djallel Bouneffouf, Radu Marinescu, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito P. Palmes, Adi Botea |
| 2022 | UAI | AND/OR branch-and-bound for computational protein design optimizing K. | Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter |
| 2021 | AAAI | Submodel Decomposition Bounds for Influence Diagrams. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2021 | AAAI | A New Bounding Scheme for Influence Diagrams. | Radu Marinescu, Junkyu Lee, Rina Dechter |
| 2021 | AAAI | Searching for Machine Learning Pipelines Using a Context-Free Grammar. | Radu Marinescu, Akihiro Kishimoto, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito P. Palmes, Adi Botea |
| 2021 | AAAI | Learning the Parameters of Bayesian Networks from Uncertain Data. | Segev Wasserkrug, Radu Marinescu, Sergey Zeltyn, Evgeny Shindin, Yishai A. Feldman |
| 2021 | SoCS | Counting Vertex-Disjoint Shortest Paths in Graphs. | Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly |
| 2020 | AAAI | Parallel AND/OR Search for Marginal MAP. | Radu Marinescu, Akihiro Kishimoto, Adi Botea |
| 2020 | ECAI | The Challenge of Optimal Paths in Graphs with Item Sets. | Adi Botea, Akihiro Kishimoto, Radu Marinescu, Elizabeth M. Daly, Oznur Alkan |
| 2020 | SoCS | Heuristic AND/OR Search for Solving Influence Diagram. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2019 | AAAI | Anytime Recursive Best-First Search for Bounding Marginal MAP. | Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler |
| 2019 | IJCAI | Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. | Akihiro Kishimoto, Adi Botea, Radu Marinescu |
| 2019 | UAI | A Weighted Mini-Bucket Bound for Solving Influence Diagram. | Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter |
| 2018 | IJCAI | Stochastic Anytime Search for Bounding Marginal MAP. | Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2018 | SoCS | On the Complexity of Quantum Circuit Compilation. | Adi Botea, Akihiro Kishimoto, Radu Marinescu |
| 2017 | AAAI | Anytime Best+Depth-First Search for Bounding Marginal MAP. | Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter |
| 2017 | AAAI | Multi-Objective Influence Diagrams with Possibly Optimal Policies. | Radu Marinescu, Abdul Razak, Nic Wilson |
| 2017 | IJCAI | Efficient Optimal Search under Expensive Edge Cost Computation. | Masataro Asai, Akihiro Kishimoto, Adi Botea, Radu Marinescu, Elizabeth M. Daly, Spyros Kotoulas |
| 2016 | AAAI | From Exact to Anytime Solutions for Marginal MAP. | Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2016 | ECAI | Scalable Exact MAP Inference in Graphical Models. | Radu Marinescu, Akihiro Kishimoto, Adi Botea |
| 2016 | ISAIM | Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2015 | IJCAI | Pushing Forward Marginal MAP with Best-First Search. | Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2015 | IJCAI | Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs. | Nic Wilson, Abdul Razak, Radu Marinescu |
| 2015 | MSR | Confessions of a Worldly Software Miner. | Radu Marinescu |
| 2015 | SYNASC | Modeling Design Flaw Evolution Using Complex Systems. | George Ganea, Radu Marinescu |
| 2014 | AAAI | Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2014 | ISAIM | Weighted Best First Search for Graphical Models. | Natalia Flerova, Radu Marinescu, Rina Dechter |
| 2014 | RecSys | Multi-criteria journey aware housing recommender system. | Elizabeth M. Daly, Adi Botea, Akihiro Kishimoto, Radu Marinescu |
| 2014 | UAI | AND/OR Search for Marginal MAP. | Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2014 | UAI | Recursive Best-First AND/OR Search for Optimization in Graphical Models. | Akihiro Kishimoto, Radu Marinescu |
| 2014 | SoCS | Evaluating Weighted DFS Branch and Bound over Graphical Models. | Natalia Flerova, Radu Marinescu, Rina Dechter |
| 2013 | CP | Multi-Objective Constraint Optimization with Tradeoffs. | Radu Marinescu, Abdul Razak, Nic Wilson |
| 2012 | AAAI | Search Algorithms for m Best Solutions for Graphical Models. | Rina Dechter, Natalia Flerova, Radu Marinescu |
| 2012 | KR | An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities. | Nic Wilson, Radu Marinescu |
| 2012 | UAI | Multi-objective Influence Diagrams. | Radu Marinescu, Abdul Razak, Nic Wilson |
| 2011 | UAI | Order-of-Magnitude Influence Diagrams. | Radu Marinescu, Nic Wilson |
| 2011 | SCAM | Are the Clients of Flawed Classes (Also) Defect Prone? | Radu Marinescu, Cristina Marinescu |
| 2010 | ICTAI | Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization. | Radu Marinescu |
| 2009 | CP | Exploiting Problem Decomposition in Multi-objective Constraint Optimization. | Radu Marinescu |
| 2009 | SGAI | A New Approach to Influence Diagrams Evaluation. | Radu Marinescu |
| 2008 | ECAI | On the Practical Significance of Hypertree vs. TreeWidth. | Rina Dechter, Lars Otten, Radu Marinescu |
| 2007 | AAAI | Best-First AND/OR Search for Graphical Models. | Radu Marinescu, Rina Dechter |
| 2007 | CP | AND/OR Multi-valued Decision Diagrams for Constraint Optimization. | Robert Mateescu, Radu Marinescu, Rina Dechter |
| 2007 | CPAIOR | Best-First AND/OR Search for 0/1 Integer Programming. | Radu Marinescu, Rina Dechter |
| 2007 | UAI | Best-First AND/OR Search for Most Probable Explanations. | Radu Marinescu, Rina Dechter |
| 2007 | SYNASC | McC and Mc#: Unified C++ and C# Design Facts Extractors Tools. | Petru Florin Mihancea, George Ganea, Ioana Verebi, Cristina Marinescu, Radu Marinescu |
| 2007 | VISSOFT | Distributable Features View: Visualizing the Structural Characteristics of Distributed Software Systems. | Dan C. Cosma, Radu Marinescu |
| 2006 | AAAI | Memory Intensive Branch-and-Bound Search for Graphical Models. | Radu Marinescu, Rina Dechter |
| 2006 | CPAIOR | AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. | Radu Marinescu, Rina Dechter |
| 2006 | ECAI | Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. | Radu Marinescu, Rina Dechter |
| 2005 | CP | AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. | Radu Marinescu, Rina Dechter |
| 2005 | IJCAI | AND/OR Branch-and-Bound for Graphical Models. | Radu Marinescu, Rina Dechter |
| 2005 | SYNASC | Archeology of Code Duplication: Recovering Duplication Chains from Small Duplication Fragments. | Richard Wettel, Radu Marinescu |
| 2003 | UAI | Systematic vs. Non-systematic Algorithms for Solving the MPE Task. | Radu Marinescu, Kalev Kask, Rina Dechter |