default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman van der Krogt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j4]Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. J. Artif. Intell. Res. 43: 353-388 (2012)- 2010
- [j3]Roman van der Krogt, John Geraghty
, Mustafa Ramzi Salman, James Little:
On supporting Lean methodologies using constraint-based scheduling. J. Sched. 13(4): 301-314 (2010) - 2009
- [j2]Roman van der Krogt:
Quantifying privacy in multiagent planning. Multiagent Grid Syst. 5(4): 451-469 (2009) - 2003
- [j1]Roman van der Krogt, Mathijs de Weerdt, Cees Witteveen:
A resource based framework for planning and replanning. Web Intell. Agent Syst. 1(3-4): 173-186 (2003)
Conference and Workshop Papers
- 2011
- [c15]Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. ICAPS 2011 - 2010
- [c14]Roman van der Krogt, Jacob Feldman, James Little, David Stynes:
An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management. CP 2010: 568-582 - 2008
- [c13]Léon Planken, Mathijs de Weerdt, Roman van der Krogt:
P3C: A New Algorithm for the Simple Temporal Problem. ICAPS 2008: 256-263 - [c12]Roman van der Krogt, Mathijs de Weerdt, Yingqian Zhang:
Of Mechanism Design Multiagent Planning. ECAI 2008: 423-427 - 2007
- [c11]Roman van der Krogt, James Little, Kenneth Pulliam, Sue Hanhilammi, Yue Jin:
Scheduling for Cellular Manufacturing. CP 2007: 105-117 - [c10]Roman van der Krogt:
Privacy Loss in Classical Multiagent Planning. IAT 2007: 168-174 - 2006
- [c9]Roman van der Krogt, James Little:
The PDES Workbench. CE 2006: 619-626 - 2005
- [c8]Roman van der Krogt, Mathijs de Weerdt:
Plan Repair as an Extension of Planning. ICAPS 2005: 161-170 - [c7]Cees Witteveen, Nico Roos, Roman van der Krogt, Mathijs de Weerdt:
Diagnosis of single and multi-agent plans. AAMAS 2005: 805-812 - [c6]Roman van der Krogt, Nico Roos, Mathijs de Weerdt, Cees Witteveen:
Multiagent planning through plan repair. AAMAS 2005: 1337-1338 - [c5]Roman van der Krogt, Mathijs de Weerdt:
Plan Repair using a Plan Library. BNAIC 2005: 284-259 - [c4]Roman van der Krogt, Mathijs de Weerdt:
Coordination through Plan Repair. EUMAS 2005: 509-510 - [c3]Roman van der Krogt, Mathijs de Weerdt:
Coordination Through Plan Repair. MICAI 2005: 264-274 - 2003
- [c2]Roman van der Krogt, Mathijs de Weerdt, Cees Witteveen:
A Resource Based Framework for Planning and Replanning. IAT 2003: 247-253 - 2001
- [c1]Roman van der Krogt, André Bos, Cees Witteveen:
Replanning in a Resource-Based Framework. Multi-Agent-Systems and Applications 2001: 148-158
Informal and Other Publications
- 2014
- [i1]Léon Planken, Mathijs Michiel de Weerdt, Roman van der Krogt:
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. CoRR abs/1401.4609 (2014)
Coauthor Index
aka: Mathijs Michiel de Weerdt
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-04-25 05:45 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:
