default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacobus G. M. van der Linden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Tim Huisman, Jacobus G. M. van der Linden, Emir Demirovic:
Optimal Survival Trees: A Dynamic Programming Approach. AAAI 2024: 12680-12688- [c6]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 - [i6]Tim Huisman, Jacobus G. M. van der Linden, Emir Demirovic:
Optimal Survival Trees: A Dynamic Programming Approach. CoRR abs/2401.04489 (2024) - [i5]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) - [i4]Konstantin Sidorov, Koos van der Linden, Gonçalo Homem De Almeida Correia, Mathijs de Weerdt, Emir Demirovic:
How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization. CoRR abs/2411.07955 (2024) - 2023
- [c5]Jacobus G. M. van der Linden, Mathijs de Weerdt, Emir Demirovic:
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming. NeurIPS 2023 - [i3]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
- [c4]Jacobus G. M. van der Linden, Mathijs de Weerdt, Emir Demirovic:
Fair and Optimal Decision Trees: A Dynamic Programming Approach. NeurIPS 2022 - 2021
- [c3]Jacobus G. M. van der Linden, Jesse Mulderij, Bob Huisman, Joris W. den Ouden, Marjan van den Akker, Han Hoogeveen, Mathijs Michiel de Weerdt:
TORS: A Train Unit Shunting and Servicing Simulator. AAMAS 2021: 1785-1787 - 2020
- [i2]Koos van der Linden, Natalia Romero, Mathijs Michiel de Weerdt:
Benchmarking Flexible Electric Loads Scheduling Algorithms under Market Price Uncertainty. CoRR abs/2002.01246 (2020) - [i1]Jesse Mulderij, Bob Huisman, Denise D. Tönissen, Koos van der Linden, Mathijs de Weerdt:
Train Unit Shunting and Servicing: a Real-Life Application of Multi-Agent Path Finding. CoRR abs/2006.10422 (2020)
2010 – 2019
- 2018
- [c2]Mathijs Michiel de Weerdt, Michael Albert, Vincent Conitzer, Koos van der Linden:
Complexity of Scheduling Charging in the Smart Grid. AAMAS 2018: 1924-1926 - [c1]Mathijs de Weerdt, Michael Albert, Vincent Conitzer, Koos van der Linden
:
Complexity of Scheduling Charging in the Smart Grid. IJCAI 2018: 4736-4742
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 2025-01-21 00:11 CET 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:
