default search action
Maurits de Graaf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Ate Penders, Max van der Horst
, Alex van der Linden, Maurits de Graaf, Thomas B. Quillinan, Gregor Pavlin:
A Secure Information Management and Interoperability Framework: Enabling Distributed Fusion Engines for Military IoT Applications. ICMCIS 2024: 1-10 - 2022
- [j15]Baver Ozceylan
Minimizing the Maximum Processor Temperature by Temperature-Aware Scheduling of Real-Time Tasks. IEEE Trans. Very Large Scale Integr. Syst. 30(8): 1084-1097 (2022)
2010 – 2019
- 2019
- [j14]Maurits de Graaf, Richard J. Boucherie
An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random Struct. Algorithms 55(1): 89-103 (2019) - 2018
- [c10]Chera Bekker, Maurits de Graaf, Gerard Hoekstra, Thomas B. Quillinan:
Enabling Civil/Military Cooperation in Crisis Management. MILS@DSN 2018 - 2017
- [j13]Mihaela Mitici, Jasper Goseling, Jan-Kees C. W. van Ommeren
On a tandem queue with batch service and its applications in wireless sensor networks. Queueing Syst. Theory Appl. 87(1-2): 81-93 (2017) - [j12]Maurits de Graaf, Bodo Manthey:
Probabilistic analysis of power assignments. Random Struct. Algorithms 51(3): 483-505 (2017) - 2016
- [j11]Mihaela Mitici, Jasper Goseling, Maurits de Graaf, Richard J. Boucherie
Data retrieval time for energy-harvesting wireless sensor networks. Ad Hoc Networks 53: 32-40 (2016) - [j10]Maurits de Graaf, Richard J. Boucherie
Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases. EAI Endorsed Trans. Energy Web 3(10): e5 (2016) - [j9]Mihaela Mitici, Jasper Goseling, Maurits de Graaf, Richard J. Boucherie
Energy-efficient data collection in wireless sensor networks with time constraints. Perform. Evaluation 102: 34-52 (2016) - 2015
- [i3]Mihaela Mitici, Jasper Goseling, Maurits de Graaf, Richard J. Boucherie:
Data retrieval time for energy harvesting wireless sensor networks. CoRR abs/1510.06336 (2015) - 2014
- [j8]Mihaela Mitici, Jasper Goseling, Maurits de Graaf, Richard J. Boucherie
Deployment Versus Data Retrieval Costs for Caches in the Plane. IEEE Wirel. Commun. Lett. 3(4): 385-388 (2014) - [c9]Mihaela Mitici, Jasper Goseling, Maurits de Graaf, Richard J. Boucherie
Decentralized vs. centralized scheduling in wireless sensor networks for data fusion. ICASSP 2014: 5070-5074 - [c8]Maurits de Graaf, Bodo Manthey:
Probabilistic Analysis of Power Assignments. MFCS (2) 2014: 201-212 - [i2]Maurits de Graaf, Bodo Manthey:
Probabilistic Analysis of Power Assignments. CoRR abs/1403.5882 (2014) - 2013
- [j7]Maurits de Graaf:
Energy efficient networking via dynamic relay node selection in wireless networks. Ad Hoc Networks 11(3): 1193-1201 (2013) - [c7]Mihaela Mitici, Jasper Goseling, Maurits de Graaf, Richard J. Boucherie
Optimal deployment of caches in the plane. GlobalSIP 2013: 863-866 - 2012
- [i1]Mihaela Mitici, Martijn Onderwater, Maurits de Graaf, Jan-Kees C. W. van Ommeren, Nico M. van Dijk, Jasper Goseling:
An Optimal Query Assignment for Wireless Sensor Networks. CoRR abs/1212.5378 (2012) - 2011
- [c6]Maurits de Graaf, Michel Varkevisser, Masja Kempen, Nicolas Jourden:
Cognitive Adaptive Man Machine Interfaces for the Firefighter Commander: Design Framework and Research Methodology. HCI (20) 2011: 588-597 - 2010
- [j6]Jan-Maarten Verbree, Maurits de Graaf, Johann L. Hurink
An analysis of the lifetime of OLSR networks. Ad Hoc Networks 8(4): 391-399 (2010) - [c5]Damien Miliche, Maurits de Graaf, Gerard Hoekstra, Marijn R. Jongerden, Boudewijn R. Haverkort:
A First Experimental Investigation of the Practical Efficiency of Battery Scheduling. ARCS Workshops 2010: 241-246 - [c4]Tom Coenen, Jan-Kees C. W. van Ommeren, Maurits de Graaf:
Routing versus energy optimization in a linear network. ARCS Workshops 2010: 253-258
2000 – 2009
- 2009
- [c3]Folkert van Vliet, Richard J. Boucherie
Content-Based Routing in Networks with Time-Fluctuating Request Rates. NET-COOP 2009: 75-90 - 2008
- [c2]T. J. M. Coenen, Maurits de Graaf, Richard J. Boucherie
An upper bound on multi-hop multi-channel wireless network performance. Mobility Conference 2008: 94 - 2007
- [c1]Tom Coenen, Maurits de Graaf, Richard J. Boucherie
An Upper Bound on Multi-hop Wireless Network Performance. ITC 2007: 335-347 - 2004
- [j5]Maurits de Graaf:
Directed triangles in directed graphs. Discret. Math. 280(1-3): 219-223 (2004)
1990 – 1999
- 1997
- [j4]Maurits de Graaf, Alexander Schrijver:
Making Curves Minimally Crossing by Reidemeister Moves. J. Comb. Theory B 70(1): 134-156 (1997) - [j3]Maurits de Graaf, Alexander Schrijver:
Decomposition of Graphs on Surfaces. J. Comb. Theory B 70(1): 157-165 (1997) - 1994
- [j2]Maurits de Graaf, Alexander Schrijver:
Grid Minors of Graphs on the Torus. J. Comb. Theory B 61(1): 57-62 (1994) - 1992
- [j1]Maurits de Graaf, Alexander Schrijver, Paul D. Seymour
Directed triangles in directed graphs. Discret. Math. 110(1-3): 279-282 (1992)
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-07 22:16 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: