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
Conference contribution

Search results

  • 2024

    Fairness in Graph-theoretical Optimization Problems

    Hojny, C., Spieksma, F. & Wessel, S. (Corresponding author), 2024, European Workshop on Algorithmic Fairness: Proceedings of the 3rd European Workshop on Algorithmic Fairness Mainz, Germany, July 1st to 3rd, 2024. Cerrato, M., Vallenas Coronel, A., Ahrweiler, P., Loi, M., Pechenizkiy, M. & Tamò-Larrieux, A. (eds.). CEUR-WS.org, 5 p. (CEUR Workshop Proceedings; vol. 3908).

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

    Open Access
    File
    5 Downloads (Pure)

  • Stable and Dynamic Minimum Cuts

    de Berg, M., López Martínez, A. (Corresponding author) & Spieksma, F., 29 Feb 2024, WALCOM : Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings. Uehara, R., Yamanaka, K. & Yen, H.-C. (eds.). Singapore: Springer, p. 273-287 15 p. (Lecture Notes in Computer Science (LNCS); vol. 14549).

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

    Open Access
    File
    4 Downloads (Pure)
  • 2023

    Finding Diverse Minimum s-t Cuts

    de Berg, M. T., López Martínez, A. & Spieksma, F. C. R., 28 Nov 2023, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Iwata, S. & Kakimura, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 24:1-24:17 17 p. 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 283).

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

    Open Access
    File
    1 Citation (Scopus)
    2 Downloads (Pure)

  • Stable Approximation Algorithms for Dominating Set and Independent Set

    de Berg, M., Sadhukhan, A. & Spieksma, F. C. R., 4 Sept 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 27:1-27:19 19 p. 27. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 275).

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

    Open Access
    File
    1 Citation (Scopus)
    11 Downloads (Pure)
  • 2022

    Integer Programming Formulations for Compact Single Round Robin Tournaments

    van Doornmalen, M. J., Spieksma, F. C. R., Hojny, C. & Lambers, R., 2022, Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2022.

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

    Open Access

  • Package Delivery Using Drones with Restricted Movement Areas

    Erlebach, T., Luo, K. & Spieksma, F. C. R., 14 Dec 2022, 33rd International Symposium on Algorithms and Computation, ISAAC 2022. Bae, S. W. & Park, H. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 49:1-49:16 16 p. 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 248).

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

    Open Access
    File
    2 Citations (Scopus)

  • Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem

    Berg, M. D., Sadhukhan, A. & Spieksma, F. C. R., 22 Jun 2022, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022. Czumaj, A. & Xin, Q. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 15:1-15:21 21 p. 15. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 227).

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

    Open Access
    File
    1 Citation (Scopus)
  • 2021

    A Hybrid Model to Find Schedules for Double Round Robin Tournaments With Side Constraints

    van Doornmalen, M. J., Hojny, C., Lambers, R. & Spieksma, F. C. R., 2021, Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021. de Causmaecker, P., Özcan, E. & Vanden Berghe, G. (eds.). p. 412-419

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

    Open Access

  • Online Bin Packing with Overload Cost

    Luo, K. (Corresponding author) & Spieksma, F. C. R., 28 Jan 2021, Algorithms and Discrete Applied Mathematics: 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings. Mudgal, A. & Subramanian, C. R. (eds.). Cham: Springer, p. 3-15 13 p. (Lecture Notes in Computer Science (LNCS); vol. 12601).

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

    Open Access
    File
    2 Citations (Scopus)
    2 Downloads (Pure)

  • The Traveling Social Golfer Problem: The Case of the Volleyball Nations League

    Lambers, R., Rothuizen, L. & Spieksma, F. C. R. (Corresponding author), 17 Jun 2021, Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 18th International Conference, CPAIOR 2021, Vienna, Austria, July 5–8, 2021, Proceedings. Stuckey, P. J. (ed.). Cham: Springer, p. 149-162 14 p. (Lecture Notes in Computer Science (LNCS); vol. 12735).

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

    Open Access
    File
    4 Citations (Scopus)
    1 Downloads (Pure)
  • 2020

    Approximation Algorithms for Car-Sharing Problems

    Luo, K. & Spieksma, F. C. R., 2020, Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). Springer, p. 262-273 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12273 LNCS).

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

    6 Citations (Scopus)
  • 2018

    Partitioning vectors into quadruples: Worst-case analysis of a matching-based algorithm

    Ficker, A. M. C., Erlebach, T., Mihalák, M. & Spieksma, F. C. R., 1 Dec 2018, Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. Hsu, W.-L., Lee, D.-T. & Liao, C.-S. (eds.). Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12 p. 45. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 123).

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

    Open Access
    File
    68 Downloads (Pure)
  • 2017

    Balanced optimization with vector costs

    Ficker, A. M. C., Spieksma, F. C. R. & Woeginger, G. J., 2017, Approximation and Online Algorithms : 14th International Workshop, WAOA 2016, Revised Selected Papers. Jansen, K. & Mastrolilli, M. (eds.). Cham: Springer, p. 92-102 11 p. (Lecture Notes in Computer Science ; vol. 10138).

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

    1 Citation (Scopus)
  • 2014

    Mathematical programming models for scheduling locks in sequence

    Passchyn, W., Briskorn, D. & Spieksma, F. C. R., 1 Sept 2014, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014 : September 11, 2014, Wroclaw, Poland. Funke, S. & Mihalak, M. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 92-106 15 p. (OpenAccess Series in Informatics (OASIcs); vol. 42).

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

    Open Access
    File
    1 Citation (Scopus)
    21 Downloads (Pure)
  • 2013

    Approximation algorithms for the wafer to wafer integration problem

    Dokka, T., Bougeret, M., Boudet, V., Giroudeau, R. & Spieksma, F. C. R., 2013, Approximation and Online Algorithms : 10th International Workshop, WAOA 2012, Revised Selected Papers. Erlebach, T. & Persiano, G. (eds.). Berlin: Springer, p. 286-297 12 p. (Lecture Notes in Computer Science; vol. 7846).

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

    8 Citations (Scopus)
  • 2012

    Approximating the multi-level bottleneck assignment problem

    Dokka, T., Kouvela, A. & Spieksma, F. C. R., 2012, WALCOM: algorithms and computation - 6th International Workshop, WALCOM 2012, Proceedings. Rahman, M. S. & Nakano, S. (eds.). Berlin: Springer, p. 64-75 12 p. (Lecture Notes in Computer Science; vol. 7157).

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

    1 Citation (Scopus)

  • Fast separation algorithms for three-index assignment problems

    Dokka, T., Mourtos, I. & Spieksma, F. C. R., 2012, Combinatorial Optimization : Second International Symposium, ISCO 2012, Revised Selected Papers. Mahjoub, A. R., Markakis, V., Milis, I. & Paschos, V. T. (eds.). Berlin: Springer, p. 189-200 12 p. (Lecture Notes in Computer Science ; vol. 7422).

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

    1 Citation (Scopus)

  • Solids: a combinatorial auction for a housing corporation

    Goossens, D. R., Onderstal, S. & Spieksma, F. C. R., 2012, Auctions, market mechanisms, and their applications : Second International ICST Conference, AMMA 2011, NewYork, NY, USA, August 22-23, 2011, Revised Selected Papers. Coles, P., Das, S., Lahaie, S. & Szymanski, B. (eds.). Berlin: Springer, p. 76-87 12 p. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; vol. 80 ).

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

  • 2011

    Sports scheduling with generalized breaks

    Goossens, D. R. & Spieksma, F. C. R., 2011, CISched. p. 54-57 4 p.

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

    3 Citations (Scopus)

  • The lockmaster's problem

    Coene, S. & Spieksma, F. C. R., 2011, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2011. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 20. p. 27-37 11 p. (OpenAccess Series in Informatics (OASIcs); vol. 20).

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

    Open Access
    2 Citations (Scopus)
  • 2010

    Between a rock and a hard place: the two-to-one assignment problem

    Goossens, D. R., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J., 2010, Approximation and Online Algorithms (7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers). Bampis, E. & Jansen, K. (eds.). Berlin: Springer, p. 159-169 (Lecture Notes in Computer Science; vol. 5893).

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

    1 Downloads (Pure)

  • Exact algorithms for coloring graphs while avoiding monochromatic cycles

    Talla Nobibon, F., Hurkens, C. A. J., Leus, R. & Spieksma, F. C. R., 2010, Algorithmic Aspects in Information and Management (6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings). Chen, B. (ed.). Berlin: Springer, p. 229-242 (Lecture Notes in Computer Science; vol. 6124).

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

    5 Citations (Scopus)

  • Heuristics for the traveling repairman problem with profits

    Dewilde, T., Cattrysse, D., Coene, S., Spieksma, F. C. R. & Vansteenwegen, P., 2010, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 14. p. 34-44 11 p. (OpenAccess Series in Informatics (OASIcs); vol. 14).

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

    Open Access
    4 Citations (Scopus)

  • The focus of attention problem

    Goossens, D., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J., 2010, Proceedings 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10, Austin TX, USA, January 17-19, 2010). Society for Industrial and Applied Mathematics (SIAM), p. 312-317

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

  • 2009

    Charlemagne's challenge : the periodic latency problem

    Coene, S., Woeginger, G. J. & Spieksma, F. C. R., 2009, Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM'09, Hong Kong, December 8-11, 2009). Institute of Electrical and Electronics Engineers, p. 296-300

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

  • The selection of clients for promotion campaigns by means of mathematical programming

    Talla Nobibon, F., Leus, R. & Spieksma, F. C. R., 2009, IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management. Piscataway: Institute of Electrical and Electronics Engineers, p. 286-290 5 p. 5373361

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

  • 2007

    A latency problem with profits

    Coene, S. & Spieksma, F. C. R., 2007, CTW. p. 29-32 4 p.

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

  • 2000

    An LP-based algorithm for the data association problem in multitarget tracking

    Storms, P. P. A. & Spieksma, F. C. R., 2000, Proceedings of the 3rd International Conference on Information Fusion, FUSION 2000. Piscataway: Institute of Electrical and Electronics Engineers, p. 10-16 7 p. 862699

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

    30 Citations (Scopus)

  • Cache as ca$h can

    Grootjans, W. J., Hochstenbach, M. E., Hurink, J. L., Kern, W., Luczak, M. J., Puite, Q., Resing, J. A. C. & Spieksma, F. C. R., 2000, Proceedings 36th European Study Group with Industry (EGSI36/SWI'99), November 15-19, 1999, Eindhoven,The Netherlands . Molenaar, J. (ed.). Eindhoven: Technische Universiteit Eindhoven, p. 41-53

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

  • Simple algorithms for a weighted interval selection problem

    Erlebach, T. & Spieksma, F. C. R., 2000, Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings. Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D. T. & Teng, S. H. (eds.). Berlin: Springer, p. 228-240 13 p. (Lecture Notes in Computer Science; vol. 1969).

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

    14 Citations (Scopus)
  • 1998

    Approximating an interval scheduling problem

    Spieksma, F. C. R., 1998, Approximation Algorithms for Combinatorial Optimization - International Workshop, APPROX 1998, Proceedings. Berlin: Springer, p. 169-180 12 p. (Lecture Notes in Computer Science ; vol. 1444).

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

    14 Citations (Scopus)
  • 1995

    Scheduling jobs of equal length: complexity, facets and computational results

    Crama, Y. & Spieksma, F. C. R., 1995, Integer Programming and Combinatorial Optimization. IPCO 1995. Balas, E. & Clausen, J. (eds.). Berlin: Springer, p. 277-291 15 p. (Lecture Notes in Computer Science; vol. 920).

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

    6 Citations (Scopus)