@article{Furini2012J01,
  author  = {F. Furini and E. Malaguti},
  title   = {Exact Weighted Vertex Coloring via Branch-and-Price},
  journal = {Discrete Optimization},
  year    = {2012},
  doi     = {10.1016/j.disopt.2012.03.002},
  url     = {https://doi.org/10.1016/j.disopt.2012.03.002},
}

@article{Furini2012J02,
  author  = {F. Furini and E. Malaguti and R. Medina Durán and A. Persiani and P. Toth},
  title   = {A Column Generation Heuristic for the Two-Dimensional Two-Staged Guillotine Cutting Stock Problem with Multiple Stock Size},
  journal = {European Journal of Operational Research},
  year    = {2012},
  doi     = {10.1016/j.ejor.2011.10.018},
  url     = {https://doi.org/10.1016/j.ejor.2011.10.018},
}

@article{Caprara2013J03,
  author  = {A. Caprara and F. Furini and E. Malaguti},
  title   = {Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem},
  journal = {INFORMS Journal on Computing},
  year    = {2013},
  doi     = {10.1287/ijoc.1120.0521},
  url     = {https://doi.org/10.1287/ijoc.1120.0521},
}

@article{Furini2013J04,
  author  = {F. Furini and E. Malaguti},
  title   = {Models for the Two-Dimensional Two-Stage Cutting Stock Problem with Multiple Stock Size},
  journal = {Computer \& Operations Research},
  year    = {2013},
  doi     = {10.1016/j.cor.2013.02.026},
  url     = {https://doi.org/10.1016/j.cor.2013.02.026},
}

@article{Caprara2014J05,
  author  = {A. Caprara and F. Furini and A. Lodi and M. Mangia and R. Rovatti and G. Setti},
  title   = {Generation of antipodal random vectors with prescribed non-stationary second-order statistics},
  journal = {IEEE Transactions on Signal Processing},
  year    = {2014},
  doi     = {10.1109/tsp.2014.2302737},
  url     = {https://doi.org/10.1109/tsp.2014.2302737},
}

@article{Bergner2015J06,
  author  = {M. Bergner and A. Caprara and A. Ceselli and F. Furini and M. E. Lübbecke and E. Malaguti and E. Traversi},
  title   = {Automatic Dantzig-Wolfe Reformulation of Mixed Integer Programs},
  journal = {Mathematical Programming},
  year    = {2015},
  doi     = {10.1007/s10107-014-0761-5},
  url     = {https://doi.org/10.1007/s10107-014-0761-5},
}

@article{Furini2015J07,
  author  = {F. Furini and M. P. Kidd and C. Persiani and P. Toth},
  title   = {Improved rolling horizon approaches to the aircraft sequencing problem},
  journal = {Journal of Scheduling},
  year    = {2015},
  doi     = {10.1007/s10951-014-0415-8},
  url     = {https://doi.org/10.1007/s10951-014-0415-8},
}

@article{Furini2015J08,
  author  = {F. Furini and M. Iori and S. Martello and M. Yagiura},
  title   = {Heuristic and exact algorithms for the interval min-max regret knapsack problem},
  journal = {INFORMS Journal on Computing},
  year    = {2015},
  doi     = {10.1287/ijoc.2014.0632},
  url     = {https://doi.org/10.1287/ijoc.2014.0632},
}

@article{Cacchiani2016J09,
  author  = {V. Cacchiani and F. Furini and M. P. Kidd},
  title   = {Approaches to a real-world train timetabling problem in a railway node},
  journal = {Omega},
  year    = {2016},
  doi     = {10.1016/j.omega.2015.04.006},
  url     = {https://doi.org/10.1016/j.omega.2015.04.006},
}

@article{Caprara2016J10,
  author  = {A. Caprara and F. Furini and E. Malaguti and E. Traversi},
  title   = {Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation},
  journal = {Information Processing Letters},
  year    = {2016},
  doi     = {10.1016/j.ipl.2016.01.008},
  url     = {https://doi.org/10.1016/j.ipl.2016.01.008},
}

@article{Frangioni2016J11,
  author  = {A. Frangioni and F. Furini and C. Gentile},
  title   = {Approximated perspective relaxations: a project and lift approach},
  journal = {Computational Optimization and Applications},
  year    = {2016},
  doi     = {10.1007/s10589-015-9787-8},
  url     = {https://doi.org/10.1007/s10589-015-9787-8},
}

@article{Furini2016J12,
  author  = {F. Furini and E. Malaguti and D. Thomopulos},
  title   = {Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming},
  journal = {INFORMS Journal on Computing},
  year    = {2016},
  doi     = {10.1287/ijoc.2016.0710},
  url     = {https://doi.org/10.1287/ijoc.2016.0710},
}

@article{Furini2016J13,
  author  = {F. Furini and C.A. Persiani and P. Toth},
  title   = {The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace},
  journal = {Transportation Research Part B},
  year    = {2016},
  doi     = {10.1016/j.trb.2016.04.009},
  url     = {https://doi.org/10.1016/j.trb.2016.04.009},
}

@article{Cornaz2017J14,
  author  = {D. Cornaz and F. Furini and E. Malaguti},
  title   = {Solving Vertex Coloring Problems as Maximum Weight Stable Set Problems},
  journal = {Discrete Applied Mathematics},
  year    = {2017},
  doi     = {10.1016/j.dam.2016.09.018},
  url     = {https://doi.org/10.1016/j.dam.2016.09.018},
}

@article{Furini2017J15,
  author  = {F. Furini and V. Gabrel and I. C. Ternier},
  title   = {An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem},
  journal = {Networks},
  year    = {2017},
  doi     = {10.1002/net.21716},
  url     = {https://doi.org/10.1002/net.21716},
}

@article{Furini2017J16,
  author  = {F. Furini and I. Ljubić and M. Sinnl},
  title   = {An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem},
  journal = {European Journal of Operational Research},
  year    = {2017},
  doi     = {10.1016/j.ejor.2017.03.061},
  url     = {https://doi.org/10.1016/j.ejor.2017.03.061},
}

@article{Frangioni2017J17,
  author  = {A. Frangioni and F. Furini and C. Gentile},
  title   = {Improving the Approximated Projected Perspective Reformulation by Dual Information},
  journal = {Operations Research Letters},
  year    = {2017},
  doi     = {10.1016/j.orl.2017.08.001},
  url     = {https://doi.org/10.1016/j.orl.2017.08.001},
}

@article{Furini2018J18,
  author  = {F. Furini and M. Monaci and E. Traversi},
  title   = {Exact Approaches for the Knapsack Problem with Setups},
  journal = {Computer \& Operations Research},
  year    = {2018},
  doi     = {10.1016/j.cor.2017.09.019},
  url     = {https://doi.org/10.1016/j.cor.2017.09.019},
}

@article{Alfandari2019J19,
  author  = {L. Alfandari and T. Davidovic and F. Furini and I. Ljubic and V. Maras and S. Martin},
  title   = {Tighter MIP models for Barge Container Ship Routing},
  journal = {Omega},
  year    = {2019},
  doi     = {10.1016/j.omega.2017.12.002},
  url     = {https://doi.org/10.1016/j.omega.2017.12.002},
}

@article{D'Ambrosio2018J20,
  author  = {C. D'Ambrosio and F. Furini and M. Monaci and E. Traversi},
  title   = {On the Product Knapsack Problem},
  journal = {Optimization Letters},
  year    = {2018},
  doi     = {10.1007/s11590-017-1227-5},
  url     = {https://doi.org/10.1007/s11590-017-1227-5},
}

@article{Furini2018J21,
  author  = {F. Furini and E. Malaguti and A. Santini},
  title   = {An Exact Algorithm for the Partition Coloring Problem},
  journal = {Computer \& Operations Research},
  year    = {2018},
  doi     = {10.1016/j.cor.2017.12.019},
  url     = {https://doi.org/10.1016/j.cor.2017.12.019},
}

@article{Cornaz2019J22,
  author  = {D. Cornaz and F. Furini and M. Lacroix and E. Malaguti and A. R. Mahjoub and S. Martin},
  title   = {The Vertex k-cut Problem},
  journal = {Discrete Optimization},
  year    = {2019},
  doi     = {10.1016/j.disopt.2018.07.003},
  url     = {https://doi.org/10.1016/j.disopt.2018.07.003},
}

@article{Furini2019J23,
  author  = {F. Furini and E. Traversi and P. Belotti and A. Frangioni and A. Gleixner and N. Gould and L. Liberti and A. Lodi and R. Misener and H. Mittelmann and N. Sahinidis and S. Vigerske and A. Wiegele},
  title   = {QPLIB: A Library of Quadratic Programming Instances},
  journal = {Mathematical Programming Computation},
  year    = {2019},
  doi     = {10.1007/s12532-018-0147-4},
  url     = {https://doi.org/10.1007/s12532-018-0147-4},
}

@article{Furini2019J24,
  author  = {F. Furini and E. Traversi},
  title   = {Theoretical and computational study of several linearisation techniques for Binary Quadratic Problems},
  journal = {Annals of Operations Research},
  year    = {2019},
  doi     = {10.1007/s10479-018-3118-2},
  url     = {https://doi.org/10.1007/s10479-018-3118-2},
}

@article{Cordeau2019J25,
  author  = {J.F. Cordeau and F. Furini and I. Ljubic},
  title   = {Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems},
  journal = {European Journal of Operational Research},
  year    = {2019},
  doi     = {10.1016/j.ejor.2018.12.021},
  url     = {https://doi.org/10.1016/j.ejor.2018.12.021},
}

@article{Furini2019J26,
  author  = {F. Furini and I. Ljubic and S. Martin and P. San Segundo},
  title   = {The Maximum Clique Interdiction Problem},
  journal = {European Journal of Operational Research},
  year    = {2019},
  doi     = {10.1016/j.ejor.2019.02.028},
  url     = {https://doi.org/10.1016/j.ejor.2019.02.028},
}

@article{Segundo2019J27,
  author  = {P. San Segundo and S. Coniglio and F. Furini and I. Ljubic},
  title   = {A new branch-and-bound algorithm for the maximum edge-weighted clique problem},
  journal = {European Journal of Operational Research},
  year    = {2019},
  doi     = {10.1016/j.ejor.2019.03.047},
  url     = {https://doi.org/10.1016/j.ejor.2019.03.047},
}

@article{Segundo2019J28,
  author  = {P. San Segundo and F. Furini and J. Artieda},
  title   = {A new branch-and-bound algorithm for the Maximum Weighted Clique Problem},
  journal = {Computer \& Operations Research},
  year    = {2019},
  doi     = {10.1016/j.cor.2019.05.017},
  url     = {https://doi.org/10.1016/j.cor.2019.05.017},
}

@article{Furini2020J29,
  author  = {F. Furini and I. Ljubic and E. Malaguti and P. Paronuzzi},
  title   = {On Integer and Bilevel Formulations for the k-Vertex Cut Problem},
  journal = {Mathematical Programming Computation},
  year    = {2020},
  doi     = {10.1007/s12532-019-00167-1},
  url     = {https://doi.org/10.1007/s12532-019-00167-1},
}

@article{Cornaz2019J30,
  author  = {D. Cornaz and F. Furini and E. Malaguti and A. Santini},
  title   = {A note on selective line-graphs and partition colorings},
  journal = {Operations Research Letters},
  year    = {2019},
  doi     = {10.1016/j.orl.2019.08.005},
  url     = {https://doi.org/10.1016/j.orl.2019.08.005},
}

@article{Coniglio2019J31,
  author  = {S. Coniglio and F. D'Andreagiovanni and F. Furini},
  title   = {A lexicographic pricer for the fractional bin packing problem},
  journal = {Operations Research Letters},
  year    = {2019},
  doi     = {10.1016/j.orl.2019.10.011},
  url     = {https://doi.org/10.1016/j.orl.2019.10.011},
}

@article{Dell'Amico2020J32,
  author  = {M. Dell'Amico and F. Furini and M. Iori},
  title   = {A branch-and-price algorithm for the temporal bin packing problem},
  journal = {Computer \& Operations Research},
  year    = {2020},
  doi     = {10.1016/j.cor.2019.104825},
  url     = {https://doi.org/10.1016/j.cor.2019.104825},
}

@article{Gschwind2021J33,
  author  = {T. Gschwind and S. Irnich and F. Furini and R. Wolfler Calvo},
  title   = {A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques},
  journal = {INFORMS Journal on Computing},
  year    = {2021},
  doi     = {10.1287/ijoc.2020.0984},
  url     = {https://doi.org/10.1287/ijoc.2020.0984},
}

@article{Coniglio2021J34,
  author  = {S. Coniglio and F. Furini and P. San Segundo},
  title   = {A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts},
  journal = {European Journal of Operational Research},
  year    = {2021},
  doi     = {10.1016/j.ejor.2020.07.023},
  url     = {https://doi.org/10.1016/j.ejor.2020.07.023},
}

@article{Donne2021J35,
  author  = {D. Delle Donne and F. Furini and E. Malaguti and R. Wolfler Calvo},
  title   = {A Branch-and-Price Algorithm for the Minimum Sum Coloring Problem},
  journal = {Discrete Applied Mathematics},
  year    = {2021},
  doi     = {10.1016/j.dam.2020.08.031},
  url     = {https://doi.org/10.1016/j.dam.2020.08.031},
}

@article{Furini2022J36,
  author  = {F. Furini and I. Ljubić and E. Malaguti and P. Paronuzzi},
  title   = {Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem},
  journal = {Operations Research},
  year    = {2022},
  doi     = {10.1287/opre.2021.2110},
  url     = {https://doi.org/10.1287/opre.2021.2110},
}

@article{Furini2021J37,
  author  = {F. Furini and I. Ljubic and P. San Segundo and Y. Zhao},
  title   = {A branch-and-cut algorithm for the Edge Interdiction Clique Problem},
  journal = {European Journal of Operational Research},
  year    = {2021},
  doi     = {10.1016/j.ejor.2021.01.030},
  url     = {https://doi.org/10.1016/j.ejor.2021.01.030},
}

@article{Catanzaro2022J38,
  author  = {D. Catanzaro and S. Coniglio and F. Furini},
  title   = {On the exact separation of cover inequalities of maximum-depth},
  journal = {Optimization Letters},
  year    = {2022},
  doi     = {10.1007/s11590-021-01741-0},
  url     = {https://doi.org/10.1007/s11590-021-01741-0},
}

@article{Segundo2022J39,
  author  = {P. San Segundo and F. Furini and R. León},
  title   = {A new branch-and-filter exact algorithm for binary constraint satisfaction problems},
  journal = {European Journal of Operational Research},
  year    = {2022},
  doi     = {10.1016/j.ejor.2021.09.014},
  url     = {https://doi.org/10.1016/j.ejor.2021.09.014},
}

@article{Martinovic2022J40,
  author  = {J. Martinovic and N. Strasdat and J. Valerio de Carvalho and F. Furini},
  title   = {Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups},
  journal = {Optimization Letters},
  year    = {2022},
  doi     = {10.1007/s11590-021-01825-x},
  url     = {https://doi.org/10.1007/s11590-021-01825-x},
}

@article{Coniglio2022J41,
  author  = {S. Coniglio and F. Furini and I. Ljubic},
  title   = {Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems},
  journal = {Mathematical Programming},
  year    = {2022},
  doi     = {10.1007/s10107-022-01884-7},
  url     = {https://doi.org/10.1007/s10107-022-01884-7},
}

@article{Martinovic2023J42,
  author  = {J. Martinovic and N. Strasdat and J. Valério de Carvalho and F. Furini},
  title   = {A Combinatorial Flow-based Formulation for Temporal Bin Packing Problems},
  journal = {European Journal of Operational Research},
  year    = {2023},
  doi     = {10.1016/j.ejor.2022.10.012},
  url     = {https://doi.org/10.1016/j.ejor.2022.10.012},
}

@article{Segundo2023J43,
  author  = {P. San Segundo and F. Furini and D. Alvarez and P. Pardalos},
  title   = {CliSAT: a new exact algorithm for hard maximum clique problems},
  journal = {European Journal of Operational Research},
  year    = {2023},
  doi     = {10.1016/j.ejor.2022.10.028},
  url     = {https://doi.org/10.1016/j.ejor.2022.10.028},
}

@article{Baldacci2024J44,
  author  = {R. Baldacci and S. Coniglio and F. Furini},
  title   = {A Numerically Exact Algorithm for the Bin-Packing Problem},
  journal = {INFORMS Journal on Computing},
  year    = {2024},
  doi     = {10.1287/ijoc.2022.0257},
  url     = {https://doi.org/10.1287/ijoc.2022.0257},
}

@article{Bentoumi2025J45,
  author  = {I. Bentoumi and F. Furini and A.R. Mahjoub and S. Martin},
  title   = {Integer linear programming formulations for the maximum flow blocker problem},
  journal = {European Journal of Operational Research},
  year    = {2025},
  doi     = {10.1016/j.ejor.2025.02.013},
  url     = {https://doi.org/10.1016/j.ejor.2025.02.013},
}

@article{Wang2026J46,
  author  = {S. Wang and R. Baldacci and F. Furini and L. Wei and Q. Liu},
  title   = {Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark Results},
  journal = {INFORMS Journal on Computing},
  year    = {2026},
}

@article{Croella2026J47,
  author  = {A.L. Croella and F. Furini and I. Ljubic and B. Pascariu and P. Pellegrini and P. San Segundo},
  title   = {An Exact Approach for the Train Single-Routing Selection Problem},
  journal = {European Journal of Operational Research},
  year    = {2026},
  doi     = {10.1016/j.ejor.2026.08.028},
  url     = {https://doi.org/10.1016/j.ejor.2026.08.028},
}

@article{Ciccarelli2026J48,
  author  = {F. Ciccarelli and V. Dose and F. Furini and M. Monaci},
  title   = {Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem},
  journal = {Discrete Applied Mathematics},
  year    = {2026},
  doi     = {10.1016/j.dam.2026.09.019},
  url     = {https://doi.org/10.1016/j.dam.2026.09.019},
}

@inproceedings{Bergner2011C01,
  author  = {M. Bergner and A. Caprara and F. Furini and M.E. Lübbecke and E. Malaguti and E. Traversi},
  title   = {Partial convexification of general MIPs by Dantzig-Wolfe reformulation},
  booktitle = {15th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2011), New York, USA, June 2011 (12 pages)},
  year    = {2011},
  doi     = {10.1007/978-3-642-20807-2_4},
  url     = {https://doi.org/10.1007/978-3-642-20807-2_4},
}

@inproceedings{Furini2012C02,
  author  = {F. Furini and C. Persiani and P. Toth},
  title   = {Aircraft Sequencing Problems via a Rolling Horizon Algorithm},
  booktitle = {3rd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece, April 2012 (12 pages)},
  year    = {2012},
  doi     = {10.1007/978-3-642-32147-4_25},
  url     = {https://doi.org/10.1007/978-3-642-32147-4_25},
}

@inproceedings{Furini2013C03,
  author  = {F. Furini and E. Traversi},
  title   = {Hybrid SDP Bounding Procedure},
  booktitle = {12th International Symposium on Experimental Algorithms (SEA 2013), Rome, Italy, June 2013 (12 pages)},
  year    = {2013},
  doi     = {10.1007/978-3-642-38527-8_23},
  url     = {https://doi.org/10.1007/978-3-642-38527-8_23},
}

@inproceedings{Furini2013C04,
  author  = {F. Furini and M. P. Kidd},
  title   = {A fast heuristic approach for train timetabling in a railway node},
  booktitle = {6th International Network Optimization Conference (INOC 2013), Tenerife, Spain, May 2013 (8 pages)},
  year    = {2013},
  doi     = {10.1016/j.endm.2013.05.094},
  url     = {https://doi.org/10.1016/j.endm.2013.05.094},
}

@inproceedings{Furini2014C05,
  author  = {F. Furini and M. P. Kidd and A. Persiani and P. Toth},
  title   = {State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting},
  booktitle = {4th International Symposium on Combinatorial Optimization (ISCO 2014), Lisbon, Portugal, March 2014 (12 pages)},
  year    = {2014},
  doi     = {10.1007/978-3-319-09174-7_23},
  url     = {https://doi.org/10.1007/978-3-319-09174-7_23},
}

@inproceedings{Cornaz2014C06,
  author  = {D. Cornaz and F. Furini and M. Lacroix and E. Malaguti and A. R. Mahjoub and S. Martin},
  title   = {Mathematical Formulations for the Balanced Vertex k -Separator Problem},
  booktitle = {International Conference on Control, Decision and Information Technologies (CoDIT 2014), Metz, France, November 2014 (8 pages)},
  year    = {2014},
  doi     = {10.1109/codit.2014.6996889},
  url     = {https://doi.org/10.1109/codit.2014.6996889},
}

@inproceedings{Ljubic2015C07,
  author  = {I. Ljubic and F. Furini and M. Sinnl},
  title   = {ILP and CP Formulations for the Lazy Bureaucrat Problem},
  booktitle = {12th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2015), Barcelona, Spain, May 2015 (15 pages)},
  year    = {2015},
  doi     = {10.1007/978-3-319-18008-3_18},
  url     = {https://doi.org/10.1007/978-3-319-18008-3_18},
}

@inproceedings{Furini2015C08,
  author  = {F. Furini and V. Gabrel and I. C. Ternier},
  title   = {Lower Bounding Techniques for DSATUR-based Branch and Bound},
  booktitle = {7th International Network Optimization Conference (INOC 2015), Warsaw, Poland, June 2015 (8 pages)},
  year    = {2015},
  doi     = {10.1016/j.endm.2016.03.020},
  url     = {https://doi.org/10.1016/j.endm.2016.03.020},
}

@inproceedings{Shen2015C09,
  author  = {F. Furini and X. Shen},
  title   = {Matheuristics for the Temporal Bin Packing Problem},
  booktitle = {11th Metaheuristics International Conference (MIC 2015), Agadir, Morocco, June 2015 (13 pages)},
  year    = {2015},
  doi     = {10.1007/978-3-319-58253-5_19},
  url     = {https://doi.org/10.1007/978-3-319-58253-5_19},
}

@inproceedings{Focacci2016C10,
  author  = {F. Focacci and F. Furini and V. Gabrel and D. Godard and X. Shen},
  title   = {MIP Formulations for a Rich Real-world Lot-sizing Problem with Setup Carryover},
  booktitle = {5th International Symposium on Combinatorial Optimization (ISCO 2016), Vietri sul Mare, Italy, May 2016 (12 pages)},
  year    = {2016},
  doi     = {10.1007/978-3-319-45587-7_11},
  url     = {https://doi.org/10.1007/978-3-319-45587-7_11},
}

@inproceedings{Furini2017C11,
  author  = {F. Furini and E. Malaguti and S. Martin and I.-C. Ternier},
  title   = {ILP Models and Column Generation for the Minimum Sum Coloring Problem},
  booktitle = {8th International Network Optimization Conference (INOC 2017), Lisbon, Portugal, February 2017 (10 pages)},
  year    = {2017},
  doi     = {10.1016/j.endm.2018.01.023},
  url     = {https://doi.org/10.1016/j.endm.2018.01.023},
}

@inproceedings{Bentoumi2023C12,
  author  = {I. Bentoumi and F. Furini and A.R. Mahjoub and S. Martin},
  title   = {A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem},
  booktitle = {9th International Conference on Control, Decision and Information Technologies (CoDIT 2023), Rome, Italy, July 2023 (4 pages)},
  year    = {2023},
  doi     = {10.1109/codit58514.2023.10284073},
  url     = {https://doi.org/10.1109/codit58514.2023.10284073},
}