default search action
Emir Demirovic
Person information
- affiliation: Delft University of Technology, The Netherlands
- affiliation (former): University of Melbourne, School of Computing and Information Systems, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c34]Tim Huisman, Jacobus G. M. van der Linden, Emir Demirovic:
Optimal Survival Trees: A Dynamic Programming Approach. AAAI 2024: 12680-12688 - [c33]Konstantin Sidorov
, Gonçalo Homem De Almeida Correia
Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths. AAAI 2024: 20794-20802 - [c32]Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. CP 2024: 9:1-9:21 - [c31]Maarten Flippo, Konstantin Sidorov
A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers. CP 2024: 11:1-11:20 - [c30]Mim van den Bos, Jacobus G. M. van der Linden, Emir Demirovic:
Piecewise Constant and Linear Regression Trees: An Optimal Dynamic Programming Approach. ICML 2024 - [i8]Tim Huisman, Jacobus G. M. van der Linden, Emir Demirovic:
Optimal Survival Trees: A Dynamic Programming Approach. CoRR abs/2401.04489 (2024) - [i7]Emir Demirovic, Christian Schilling, Anna Lukina:
In Search of Trees: Decision-Tree Policy Synthesis for Black-Box Systems via Search. CoRR abs/2409.03260 (2024) - [i6]Jacobus G. M. van der Linden, Daniël Vos, Mathijs Michiel de Weerdt, Sicco Verwer, Emir Demirovic:
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance. CoRR abs/2409.12788 (2024) - 2023
- [j6]Nicolas Schwind
Algorithms for partially robust team formation. Auton. Agents Multi Agent Syst. 37(2): 22 (2023) - [c29]Matthias Horn, Emir Demirovic, Neil Yorke-Smith:
Parallel Batch Processing for the Coating Problem. ICAPS 2023: 171-179 - [c28]Matthias Horn, Emir Demirovic, Neil Yorke-Smith:
Solving the Multi-Choice Two Dimensional Shelf Strip Packing Problem with Time Windows. ICAPS 2023: 491-499 - [c27]Emir Demirovic, Emmanuel Hebrard, Louis Jean:
Blossom: an Anytime Algorithm for Computing Optimal Decision Trees. ICML 2023: 7533-7562 - [c26]Christian Schilling, Anna Lukina, Emir Demirovic, Kim Guldstrand Larsen:
Safety Verification of Decision-Tree Policies in Continuous Time. NeurIPS 2023 - [c25]Jacobus G. M. van der Linden, Mathijs de Weerdt, Emir Demirovic:
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming. NeurIPS 2023 - [i5]Jacobus G. M. van der Linden, Mathijs Michiel de Weerdt, Emir Demirovic:
Optimal Decision Trees for Separable Objectives: Pushing the Limits of Dynamic Programming. CoRR abs/2305.19706 (2023) - 2022
- [j5]Emir Demirovic, Anna Lukina, Emmanuel Hebrard, Jeffrey Chan, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, Peter J. Stuckey:
MurTree: Optimal Decision Trees via Dynamic Programming and Search. J. Mach. Learn. Res. 23: 26:1-26:47 (2022) - [c24]Ali Ugur Guler, Emir Demirovic, Jeffrey Chan
A Divide and Conquer Algorithm for Predict+Optimize with Non-convex Problems. AAAI 2022: 3749-3757 - [c23]Geert L. J. Pingen, Christian R. van Ommeren, Cornelis J. van Leeuwen, Ruben W. Fransen, Tijmen Elfrink, Yorick C. de Vries, Janarthanan Karunakaran, Emir Demirovic, Neil Yorke-Smith:
Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing Logistics. ICAPS 2022: 480-489 - [c22]Jacobus G. M. van der Linden, Mathijs de Weerdt, Emir Demirovic:
Fair and Optimal Decision Trees: A Dynamic Programming Approach. NeurIPS 2022 - [c21]Laurence A. F. Park, Mohadeseh Ganji, Emir Demirovic, Jeffrey Chan
Modelling Zeros in Blockmodelling. PAKDD (2) 2022: 187-198 - 2021
- [c20]Emir Demirovic, Peter J. Stuckey:
Optimal Decision Trees for Nonlinear Metrics. AAAI 2021: 3733-3741 - [c19]Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey:
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning. AAAI 2021: 3750-3758 - [c18]Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Jean-Marie Lagniez:
Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience. AAMAS 2021: 1154-1162 - [c17]Ronald van Driel, Emir Demirovic
Learning Variable Activity Initialisation for Lazy Clause Generation Solvers. CPAIOR 2021: 62-71 - 2020
- [c16]Emir Demirovic, Nicolas Schwind:
Representative Solutions for Bi-Objective Optimisation. AAAI 2020: 1436-1443 - [c15]Emir Demirovic, Peter J. Stuckey, Tias Guns
Dynamic Programming for Predict+Optimise. AAAI 2020: 1444-1451 - [c14]Jayanta Mandi, Emir Demirovic, Peter J. Stuckey, Tias Guns
Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems. AAAI 2020: 1603-1610 - [c13]Graeme Gange, Jeremias Berg
Core-Guided and Core-Boosted Search for CP. CPAIOR 2020: 205-221 - [c12]Rishabh Ramteke, Peter J. Stuckey, Jeffrey Chan, Kotagiri Ramamohanarao, James Bailey, Christopher Leckie, Emir Demirovic:
Improving Single and Multi-View Blockmodelling by Algebraic Simplification. IJCNN 2020: 1-7 - [d1]Jo Devriendt
Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning". Zenodo, 2020 - [i4]Emir Demirovic, Anna Lukina, Emmanuel Hebrard, Jeffrey Chan, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, Peter J. Stuckey:
MurTree: Optimal Classification Trees via Dynamic Programming and Search. CoRR abs/2007.12652 (2020) - [i3]Emir Demirovic, Peter J. Stuckey:
Optimal Decision Trees for Nonlinear Metrics. CoRR abs/2009.06921 (2020) - [i2]Ali Ugur Guler, Emir Demirovic, Jeffrey Chan, James Bailey, Christopher Leckie, Peter J. Stuckey:
Divide and Learn: A Divide and Conquer Approach for Predict+Optimize. CoRR abs/2012.02342 (2020)
2010 – 2019
- 2019
- [j4]Emir Demirovic, Nysret Musliu
Modeling and solving staff scheduling with partial weighted maxSAT. Ann. Oper. Res. 275(1): 79-99 (2019) - [c11]Felix Winter, Nysret Musliu, Emir Demirovic, Christoph Mrkvicka:
Solution Approaches for an Automotive Paint Shop Scheduling Problem. ICAPS 2019: 573-581 - [c10]Emir Demirovic
Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search. CP 2019: 177-194 - [c9]Jeremias Berg
Core-Boosted Linear Search for Incomplete MaxSAT. CPAIOR 2019: 39-56 - [c8]Emir Demirovic, Peter J. Stuckey, James Bailey, Jeffrey Chan
An Investigation into Prediction + Optimisation for the Knapsack Problem. CPAIOR 2019: 241-257 - [c7]Emir Demirovic, Peter J. Stuckey, James Bailey, Jeffrey Chan, Christopher Leckie, Kotagiri Ramamohanarao, Tias Guns
Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions. IJCAI 2019: 1078-1085 - [i1]Jayanta Mandi
Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems. CoRR abs/1911.10092 (2019) - 2018
- [c6]Emir Demirovic, Nicolas Schwind, Tenda Okimoto, Katsumi Inoue:
Recoverable Team Formation: Building Teams Resilient to Change. AAMAS 2018: 1362-1370 - [c5]Emir Demirovic, Geoffrey Chu, Peter J. Stuckey:
Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers. CP 2018: 99-108 - [c4]Emir Demirovic, Peter J. Stuckey:
Constraint Programming for High School Timetabling: A Scheduling-Based Model with Hot Starts. CPAIOR 2018: 135-152 - [c3]Tenda Okimoto, Nicolas Schwind, Emir Demirovic, Katsumi Inoue
Robust Coalition Structure Generation. PRIMA 2018: 140-157 - 2017
- [j3]Emir Demirovic, Nysret Musliu
Modeling high school timetabling with bitvectors. Ann. Oper. Res. 252(2): 215-238 (2017) - [j2]Emir Demirovic, Nysret Musliu
MaxSAT-based large neighborhood search for high school timetabling. Comput. Oper. Res. 78: 172-180 (2017) - [c2]Emir Demirovic:
SAT-Based Approaches for the General High School Timetabling Problem. IJCAI 2017: 5175-5176 - 2012
- [j1]Haris Gavranovic, Mirsad Buljubasic, Emir Demirovic:
Variable Neighborhood Search for Google Machine Reassignment problem. Electron. Notes Discret. Math. 39: 209-216 (2012) - [c1]Emir Demirovic, Haris Gavranovic:
An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation). SAT 2012: 489-490
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: