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

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

1 2 3 ... 6 7 8 next

  1. Chutani, Malayaja; Rao, Nithyanand; Nirmal Thyagu, N.; Gupte, Neelima: Characterizing the complexity of time series networks of dynamical systems: a simplicial approach (2020)
  2. Conte, Alessio; Grossi, Roberto; Marino, Andrea: Large-scale clique cover of real-world networks (2020)
  3. Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca: Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (2020)
  4. Malek, Sabrine; Naanaa, Wady: A new approximate cluster deletion algorithm for diamond-free graphs (2020)
  5. Wang, Dong; Zhao, Yi; Leng, Hui; Small, Michael: A social communication model based on simplicial complexes (2020)
  6. Wu, Jun; Li, Chu-Min; Jiang, Lu; Zhou, Junping; Yin, Minghao: Local search for diversified top-(k) clique search problem (2020)
  7. Bagger, Niels-Christian Fink; Desaulniers, Guy; Desrosiers, Jacques: Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (2019)
  8. Bagger, Niels-Christian F.; Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas R.: Flow formulations for curriculum-based course timetabling (2019)
  9. 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)
  10. Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca: A fast discovery algorithm for large common connected induced subgraphs (2019)
  11. Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca: Listing maximal subgraphs satisfying strongly accessible properties (2019)
  12. Ecker, Grit; Yuan, Di; Koster, Arie M. C. A.; Schmeink, Anke: Accurate optimization models for interference constrained bandwidth allocation in cellular networks (2019)
  13. Godefroy, G.; Caumon, G.; Laurent, G.; Bonneau, F.: Structural interpretation of sparse fault data using graph theory and geological rules. Structural interpretation of sparse fault data using graph theory and geological rules, fault data interpretation (2019)
  14. Höschl, Cyril IV; Flusser, Jan: Close-to-optimal algorithm for rectangular decomposition of 3D shapes. (2019)
  15. Ioannis T. Christou: Popt4jlib: A Parallel/Distributed Optimization Library for Java (2019) arXiv
  16. Ivanov, N. N.: The degree of parallelism in generalized stochastic network (2019)
  17. Manoussakis, George: A new decomposition technique for maximal clique enumeration for sparse graphs (2019)
  18. Marín, A.; Pelegrín, M.: Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (2019)
  19. Pericini, Matheus H. M.; Leite, Lucas G. M.; De Carvalho-Junior, Francisco H.; Machado, Javam C.; Rezende, Cenez A.: \textscMAPSkew: metaheuristic approaches for partitioning skew in MapReduce (2019)
  20. Phillips, Charles A.; Wang, Kai; Baker, Erich J.; Bubier, Jason A.; Chesler, Elissa J.; Langston, Michael A.: On finding and enumerating maximal and maximum ( k)-partite cliques in ( k)-partite graphs (2019)

1 2 3 ... 6 7 8 next