default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan H. M. Korst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Jan H. M. Korst, Verus Pronk, Jarke J. van Wijk:
Family metro maps. J. Vis. 25(2): 325-341 (2022)- 2020
- [j28]Sergio Consoli
, Jan H. M. Korst, Steffen Pauws, Gijs Geleijnse:
Improved metaheuristics for the quartet method of hierarchical clustering. J. Glob. Optim. 78(2): 241-270 (2020) - [c31]Jan H. M. Korst, Verus Pronk, Jarke J. van Wijk:
A visualization of family relations inspired by the London metro map. VINCI 2020: 8:1-8:8
2010 – 2019
- 2019
- [j27]Sergio Consoli, Jan H. M. Korst, Gijs Geleijnse, Steffen Pauws:
An exact algorithm for the minimum quartet tree cost problem. 4OR 17(4): 401-425 (2019) - [p2]Jan H. M. Korst, Verus Pronk, Mauro Barbieri, Sergio Consoli:
Introduction to Classification Algorithms and Their Performance Analysis Using Medical Examples. Data Science for Healthcare 2019: 39-73 - 2018
- [c30]Sergio Consoli, Jan H. M. Korst, Steffen Pauws, Gijs Geleijnse:
Improved Variable Neighbourhood Search Heuristic for Quartet Clustering. ICVNS 2018: 1-12 - [r2]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst:
Theory of Local Search. Handbook of Heuristics 2018: 299-339 - [i1]Sergio Consoli, Jan H. M. Korst, Gijs Geleijnse, Steffen Pauws:
On the minimum quartet tree cost problem. CoRR abs/1807.00566 (2018) - 2012
- [j26]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma:
Computer-assisted proof of performance ratios for the Differencing Method. Discret. Optim. 9(1): 1-16 (2012) - [c29]Natasa Jovanovic, Jan H. M. Korst, Zharko Aleksovski, Wil Michiels, Johan Lukkien, Emile H. L. Aarts:
Finding Shadows among Disks. CCCG 2012: 89-94 - [c28]Cataldo Musto, Fedelucio Narducci, Pasquale Lops, Giovanni Semeraro, Marco de Gemmis, Mauro Barbieri, Jan H. M. Korst, Verus Pronk, Ramon Clout:
TV-Show Retrieval and Classification. IIR 2012: 179-182 - [c27]Cataldo Musto, Fedelucio Narducci, Pasquale Lops, Giovanni Semeraro, Marco de Gemmis, Mauro Barbieri, Jan H. M. Korst, Verus Pronk, Ramon Clout:
Enhanced Semantic TV-Show Representation for Personalized Electronic Program Guides. UMAP 2012: 188-199 - 2010
- [j25]Sergio Consoli, Kenneth Darby-Dowman, Gijs Geleijnse, Jan H. M. Korst, Steffen Pauws:
Heuristic Approaches for the Quartet Method of Hierarchical Clustering. IEEE Trans. Knowl. Data Eng. 22(10): 1428-1443 (2010) - [c26]Verus Pronk, Mauro Barbieri, Jan H. M. Korst, Adolf Proidl:
Integrating broadcast and web video content into personal tv channels. RecSys 2010: 355-356 - [c25]Suzana Kordumova, Ivana Kostadinovska, Mauro Barbieri, Verus Pronk, Jan H. M. Korst:
Personalized Implicit Learning in a Music Recommender System. UMAP 2010: 351-362
2000 – 2009
- 2009
- [c24]Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen:
Candle in the woods: asymptotic bounds on minimum blocking sets. SCG 2009: 148-152 - 2008
- [c23]Gijs Geleijnse, Dragan Sekulovski, Jan H. M. Korst, Steffen Pauws, Bram Kater, Fabio Vignoli:
Enriching music with synchronized lyrics, images and colored lights. AMBI-SYS 2008: 1 - [c22]Pieter Horn, Bart Bakker, Gijs Geleijnse, Jan H. M. Korst, Sergei Kurkin:
Determining causal and non-causal relationships in biomedical text by classifying verbs using a Naive Bayesian Classifier. BioNLP 2008: 112-113 - [c21]Natasa Jovanovic, Jan H. M. Korst, Augustus J. E. M. Janssen:
Minimum blocking sets of circles for a set of lines in the plane. CCCG 2008 - 2007
- [b2]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst:
Theoretical aspects of local search. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-35853-4, pp. I-VIII, 1-235 - [j24]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance ratios of the Karmarkar-Karp differencing method. J. Comb. Optim. 13(1): 19-32 (2007) - [j23]Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst:
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Softw. 33(1): 7 (2007) - [c20]Gijs Geleijnse, Jan H. M. Korst:
Tool Play Live: Dealing with Ambiguity in Artist Similarity Mining from the Web. ISMIR 2007: 119-120 - [c19]Gijs Geleijnse, Jan H. M. Korst:
Creating a Dead Poets Society: Extracting a Social Network of Historical Persons from the Web. ISWC/ASWC 2007: 156-168 - [c18]Sriram Subramanian, David Pinelle, Jan H. M. Korst, Vincent Buil:
Tabletop Collaboration through Tangible Interactions. WETICE 2007: 412-417 - [r1]Jan H. M. Korst, Emile H. L. Aarts, Wil Michiels:
Simulated Annealing. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [c17]Gijs Geleijnse, Jan H. M. Korst:
Web-Based Artist Categorization. ISMIR 2006: 266-271 - [c16]Gijs Geleijnse, Jan H. M. Korst:
Efficient Lyrics Extraction from the Web. ISMIR 2006: 371-372 - 2005
- [j22]Edgar den Boef, Jan H. M. Korst, Silvano Martello, David Pisinger, Daniele Vigo:
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems. Oper. Res. 53(4): 735-736 (2005) - [c15]Gijs Geleijnse, Jan H. M. Korst:
Automatic Ontology Population by Googling. BNAIC 2005: 120-126 - [p1]Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh:
Algorithms in Ambient Intelligence. Ambient Intelligence 2005: 349-373 - 2004
- [j21]Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst:
Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig-Wolfe Decomposition. J. Sched. 7(2): 119-131 (2004) - [c14]Wim F. J. Verhaegh, Aukje E. M. van Duijnhoven, Pim Tuyls, Jan H. M. Korst:
Privacy Protection in Memory-Based Collaborative Filtering. EUSAI 2004: 61-71 - [c13]Edgar den Boef, Jan H. M. Korst, Wim F. J. Verhaegh:
Optimal Bus and Buffer Allocation for a Set of Leaky-Bucket-Controlled Streams. ICT 2004: 1337-1346 - 2003
- [j20]Peter Sanders, Sebastian Egner, Jan H. M. Korst:
Fast Concurrent Access to Parallel Disks. Algorithmica 35(1): 21-55 (2003) - [j19]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance Ratios for the Karmarkar-Karp Differencing Method. Electron. Notes Discret. Math. 13: 71-75 (2003) - [j18]Wil Michiels, Jan H. M. Korst:
Complexity of min-max subsequence problems. Inf. Process. Lett. 87(4): 213-217 (2003) - [j17]Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger:
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems. IEEE Trans. Computers 52(9): 1210-1214 (2003) - [j16]Wil Michiels, Jan H. M. Korst, Joep Aerts:
On the Guaranteed Throughput of Multizone Disks. IEEE Trans. Computers 52(11): 1407-1420 (2003) - [j15]Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst:
Smoothing Streams in an In-Home Digital Network: Optimization of Bus and Buffer Usage. Telecommun. Syst. 23(3-4): 273-295 (2003) - [c12]Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma:
Approximation of a Retrieval Problem for Parallel Disks. CIAC 2003: 178-188 - [c11]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. STACS 2003: 583-595 - 2002
- [c10]Joep Aerts, Jan H. M. Korst, Wim F. J. Verhaegh:
Improving Disk Efficiency in Video Servers by Random Redundant Storage. IMSA 2002: 354-359 - 2001
- [j14]Verus Pronk, Jan H. M. Korst:
Comments on "carry-over round robin: a simple cell scheduling mechanism for ATM network". IEEE/ACM Trans. Netw. 9(3): 373 (2001) - 2000
- [j13]Joep Aerts, Jan H. M. Korst, Sebastian Egner:
Random duplicate storage strategies for load balancing in multimedia servers. Inf. Process. Lett. 76(1-2): 51-59 (2000) - [c9]Peter Sanders, Sebastian Egner, Jan H. M. Korst:
Fast concurrent access to parallel disks. SODA 2000: 849-858
1990 – 1999
- 1998
- [j12]Jan H. M. Korst, Verus Pronk, Pascal Coumans, Giel van Doren, Emile H. L. Aarts:
Comparing disk scheduling algorithms for VBR data streams. Comput. Commun. 21(15): 1328-1343 (1998) - 1997
- [j11]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
Scheduling Periodic Tasks with Slack. INFORMS J. Comput. 9(4): 351-362 (1997) - [c8]Jan H. M. Korst, Verus Pronk, Pascal Coumans:
Disk Scheduling for Variable-Rate Data Streams. IDMS 1997: 119-132 - [c7]Jan H. M. Korst:
Random Duplicated Assignment: An Alternative to Striping in Video Servers. ACM Multimedia 1997: 219-226 - 1996
- [j10]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
Scheduling Periodic Tasks. INFORMS J. Comput. 8(4): 428-435 (1996) - [j9]Jan H. M. Korst, Verus Pronk:
Storing Continuous-Media Data on a Compact Disc. Multim. Syst. 4(4): 187-196 (1996) - [j8]Babette van Antwerpen-de Fluiter, Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh, Albert van der Werf:
The complexity of generalized retiming problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(11): 1340-1353 (1996) - 1995
- [j7]Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Jef L. van Meerbergen, Albert van der Werf:
Improved force-directed scheduling in high-throughput digital signal processing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(8): 945-960 (1995) - 1994
- [j6]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
Periodic Assignment and Graph Colouring. Discret. Appl. Math. 51(3): 291-305 (1994) - [j5]Jan H. M. Korst:
Compact Disc Standards: An Introductory Overview. Multim. Syst. 2(4): 157-171 (1994) - 1992
- [c6]Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Albert van der Werf, Jef L. van Meerbergen:
Efficiency improvements for force-directed scheduling. ICCAD 1992: 286-291 - 1991
- [j4]Emile H. L. Aarts, Jan H. M. Korst:
Boltzmann Machines as a Model for Parallel Annealing. Algorithmica 6(3): 437-465 (1991) - [j3]Emile H. L. Aarts, F. M. J. de Bont, Jan H. M. Korst, J. M. J. Rongen:
An efficient macro-cell placement algorithm. Integr. 10(3): 299-317 (1991) - [c5]Wim F. J. Verhaegh, Emile H. L. Aarts, Jan H. M. Korst, Paul E. R. Lippens:
Improved force-directed scheduling. EURO-DAC 1991: 430-435 - [c4]Gerben Essink, Emile H. L. Aarts, R. van Dongen, Piet J. van Gerwen, Jan H. M. Korst, Kees A. Vissers:
Scheduling in Programmable Video Signal Processors. ICCAD 1991: 284-287 - [c3]Gerben Essink, Emile H. L. Aarts, R. van Dongen, Piet J. van Gerwen, Jan H. M. Korst, Kees A. Vissers:
Architecture and Programming of a VLIW Style Programmable Video Signal Processor. MICRO 1991: 181-188 - [c2]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
Periodic Multiprocessor Scheduling. PARLE (1) 1991: 166-178 - 1990
- [b1]Emile H. L. Aarts, Jan H. M. Korst:
Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1990, ISBN 978-0-471-92146-2, pp. I-XII, 1-272
1980 – 1989
- 1989
- [j2]Jan H. M. Korst, Emile H. L. Aarts:
Combinatorial Optimization on a Boltzmann Machine. J. Parallel Distributed Comput. 6(2): 331-357 (1989) - [j1]Emile H. L. Aarts, Jan H. M. Korst:
Computations in massively parallel networks based on the Boltzmann machine: a review. Parallel Comput. 9(2): 129-145 (1989) - 1987
- [c1]Emile H. L. Aarts, Jan H. M. Korst:
Boltzmann Machines and their Applications. PARLE (1) 1987: 34-50
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-08-05 21:12 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:
