References in zbMATH (referenced in 153 articles , 1 standard article )

Showing results 1 to 20 of 153.
Sorted by year (citations)

1 2 3 ... 6 7 8 next

  1. Fleszar, Krzysztof: A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (2022)
  2. Korhonen, Tuukka: Finding optimal triangulations parameterized by edge clique cover (2022)
  3. Marzo, Ruslán G.; Melo, Rafael A.; Ribeiro, Celso C.; Santos, Marcio C.: New formulations and branch-and-cut procedures for the longest induced path problem (2022)
  4. Bacciu, Davide; Conte, Alessio; Grossi, Roberto; Landolfi, Francesco; Marino, Andrea: K-plex cover pooling for graph neural networks (2021)
  5. Brito, Samuel Souza; Santos, Haroldo Gambini: Preprocessing and cutting planes with conflict graphs (2021)
  6. Conte, Alessio; Kanté, Mamadou Moustapha; Uno, Takeaki; Wasa, Kunihiro: Maximal strongly connected cliques in directed graphs: algorithms and bounds (2021)
  7. Jones, Matthew; Goldstein, Michael; Randell, David; Jonathan, Philip: Bayes linear analysis for ordinary differential equations (2021)
  8. Olivier, Philippe; Lodi, Andrea; Pesant, Gilles: The quadratic multiknapsack problem with conflicts and balance constraints (2021)
  9. Algeri, Sara; van Dyk, David A.: Testing one hypothesis multiple times: the multidimensional case (2020)
  10. Chutani, Malayaja; Rao, Nithyanand; Nirmal Thyagu, N.; Gupte, Neelima: Characterizing the complexity of time series networks of dynamical systems: a simplicial approach (2020)
  11. Conte, Alessio; Grossi, Roberto; Marino, Andrea: Large-scale clique cover of real-world networks (2020)
  12. Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca: Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (2020)
  13. Malek, Sabrine; Naanaa, Wady: A new approximate cluster deletion algorithm for diamond-free graphs (2020)
  14. Wang, Dong; Zhao, Yi; Leng, Hui; Small, Michael: A social communication model based on simplicial complexes (2020)
  15. Wu, Jun; Li, Chu-Min; Jiang, Lu; Zhou, Junping; Yin, Minghao: Local search for diversified top-(k) clique search problem (2020)
  16. Zok, Tomasz; Badura, Jan; Swat, Sylwester; Figurski, Kacper; Popenda, Mariusz; Antczak, Maciej: New models and algorithms for RNA pseudoknot order assignment (2020)
  17. Bagger, Niels-Christian Fink; Desaulniers, Guy; Desrosiers, Jacques: Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (2019)
  18. Bagger, Niels-Christian F.; Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas R.: Flow formulations for curriculum-based course timetabling (2019)
  19. Bagger, Niels-Christian F.; Sørensen, Matias; Stidsen, Thomas R.: Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (2019)
  20. Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca: A fast discovery algorithm for large common connected induced subgraphs (2019)

1 2 3 ... 6 7 8 next