Frits C.R. Spieksma

View Scopus Profile

Frits C.R. Spieksma

prof.dr.

 https://orcid.org/0000-0002-2547-3782
  • 3099
    Citations - based on content available in repository [source: Scopus]
1990 …2025

Content available in repository

Filter
Chapter

Search results

  • 2016

    Round-Robin tournaments generated by the Circle Method have maximum carry-over

    Lambrechts, E., Ficker, A. M. C., Goossens, D. R. & Spieksma, F. C. R., 2016, Integer Programming and Combinatorial Optimization : 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016. Proceedings. Louveaux, Q. & Skutella, M. (eds.). Cham: Springer, p. 178-189 12 p. (Lecture Notes in Computer Science; vol. 9682).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    3 Citations (Scopus)
  • 2010

    A framework for a highly constrained sports scheduling problem

    Nurmi, K., Goossens, D., Bartsch, T., Bonomo, F., Briskorn, D., Duran, G., Kyngas, J., Marenco, J., Ribeiro, C. C., Spieksma, F. C. R., Urrutia, S. & Wolf, R., 2010, Proceedings of the International MultiConference of Engineers and Computer Scientists 2010 (IMECS 2010), volume III . Newswood Limited, p. 1991-1997

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    11 Citations (Scopus)

  • A framework for scheduling professional sports leagues

    Nurmi, K., Goossens, D. R., Bartsch, T., Bonomo, F., Briskorn, D., Duran, G., Kyngas, J. R., Marenco, J. L., Ribeiro, C. C., Spieksma, F. C. R., Urrutia, S. & Wolf-Yadlin, R., 2010, IAENG Transactions on Engineering Technologies Volume 5: Special Edition of the International MultiConference of Engineers and Computer Scientists 2009. Ao, S.-I., Katagir, H., Xu, L. & Chan, A.-S. (eds.). American Institute of Physics, p. 14-28 (AIP Conference Proceedings; vol. 1285, no. 1).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    6 Citations (Scopus)
  • 2009

    Multi-index Transportation Problems.

    Queyranne, M. & Spieksma, F. C. R., 2009, Encyclopedia of Optimization. p. 2413-2419 7 p.

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 2007

    A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem.

    Spieksma, F. C. R. & Kovaleva, S., 2007, Handbook of Approximation Algorithms and Metaheuristics.

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Exact algorithms for the matrix bid auction

    Goossens, D. R. & Spieksma, F. C. R., 2007, Experimental algorithms : 6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings. Demetrescu, C. (ed.). Berlin: Springer, p. 433-445 (Lecture Notes in Computer Science; vol. 4525).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 2006

    Robustness of the internet at the topology and routing level

    Erlebach, T., Hall, A. R., Moonen, L. S., Panconesi, A., Spieksma, F. C. R. & Vukadinovic, D., 2006, Dependable systems: software, computing, networks: research results of the DICS program. Kohlas, J., Meyer, B. & Schiper, A. (eds.). Berlin: Springer, p. 260-274 15 p. (Lecture Notes in Computer Science (LNCS); vol. 4028).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    4 Citations (Scopus)
  • 2004

    Approximation of rectangle stabbing and interval stabbing problems

    Kovaleva, S. & Spieksma, F. C. R., 2004, Algorithms – ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings. Albers, S. & Radzik, T. (eds.). Berlin: Springer, p. 426-435 (Lecture Notes in Computer Science ; vol. 3221).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    4 Citations (Scopus)
  • 2003

    Approximation of a retrieval problem for parallel disks

    Aerts, J., Korst, J. & Spieksma, F. C. R., 2003, Algorithms and complexity: 5th Italian Conference, CIAC 2003, Rome, Italy, May 28–30, 2003. Proceedings. Petresch, R., Persiano, G. & Silvestri, R. (eds.). Berlin: Springer, p. 178-188 (Lecture Notes in Computer Science; vol. 2653).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    4 Citations (Scopus)
  • 2001

    Approximation of a geometric set covering problem

    Kovaleva, S. & Spieksma, F. C. R., 2001, Algorithms and Computation: 12th International Symposium, ISAAC 2001 Christchurch, New Zealand, December 19–21, 2001 Proceedings. Eades, P. & Takaoka, T. (eds.). Berlin: Springer, p. 493-501 (Lecture Notes in Computer Science; vol. 2223).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    4 Citations (Scopus)
  • 1997

    Polynomial algorithms for multiprocessor scheduling with a small number of job lengths

    McCormick, S. T., Smallwood, S. R. & Spieksma, F. C. R., 1997, Proceeding SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. Association for Computing Machinery, Inc., p. 509-517

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

    9 Citations (Scopus)