Emir Demirovic

Orcid: 0000-0003-1587-5582

Affiliations:
  • Delft University of Technology, The Netherlands
  • University of Melbourne, School of Computing and Information Systems, Australia (former)


According to our database1, Emir Demirovic authored at least 41 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Optimal Survival Trees: A Dynamic Programming Approach.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Algorithms for partially robust team formation.
Auton. Agents Multi Agent Syst., October, 2023

Optimal Decision Trees for Separable Objectives: Pushing the Limits of Dynamic Programming.
CoRR, 2023

Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Safety Verification of Decision-Tree Policies in Continuous Time.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Blossom: an Anytime Algorithm for Computing Optimal Decision Trees.
Proceedings of the International Conference on Machine Learning, 2023

Solving the Multi-Choice Two Dimensional Shelf Strip Packing Problem with Time Windows.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Parallel Batch Processing for the Coating Problem.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
MurTree: Optimal Decision Trees via Dynamic Programming and Search.
J. Mach. Learn. Res., 2022

Modelling Zeros in Blockmodelling.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2022

Fair and Optimal Decision Trees: A Dynamic Programming Approach.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing Logistics.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

A Divide and Conquer Algorithm for Predict+Optimize with Non-convex Problems.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Learning Variable Activity Initialisation for Lazy Clause Generation Solvers.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Optimal Decision Trees for Nonlinear Metrics.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning".
Dataset, September, 2020

Divide and Learn: A Divide and Conquer Approach for Predict+Optimize.
CoRR, 2020

MurTree: Optimal Classification Trees via Dynamic Programming and Search.
CoRR, 2020

Improving Single and Multi-View Blockmodelling by Algebraic Simplification.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

Core-Guided and Core-Boosted Search for CP.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Dynamic Programming for Predict+Optimise.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Representative Solutions for Bi-Objective Optimisation.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Modeling and solving staff scheduling with partial weighted maxSAT.
Ann. Oper. Res., 2019

Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An Investigation into Prediction + Optimisation for the Knapsack Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Core-Boosted Linear Search for Incomplete MaxSAT.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Solution Approaches for an Automotive Paint Shop Scheduling Problem.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Robust Coalition Structure Generation.
Proceedings of the PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, Tokyo, Japan, October 29, 2018

Constraint Programming for High School Timetabling: A Scheduling-Based Model with Hot Starts.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2018

Recoverable Team Formation: Building Teams Resilient to Change.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
MaxSAT-based large neighborhood search for high school timetabling.
Comput. Oper. Res., 2017

Modeling high school timetabling with bitvectors.
Ann. Oper. Res., 2017

SAT-Based Approaches for the General High School Timetabling Problem.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2012
Variable Neighborhood Search for Google Machine Reassignment problem.
Electron. Notes Discret. Math., 2012

An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012


  Loading...