2024W

• Algorithmics / 186.814 / VU
• Heuristic Optimization Techniques / 192.137 / VU

• A Simulated Annealing Based Approach for the Roman Domination Problem / Greilhuber, J., Schober, S., Iurlano, E., & Raidl, G. R. (2024). A Simulated Annealing Based Approach for the Roman Domination Problem. In B. Dorronsoro, R. Ellaia, & E.-G. Talbi (Eds.), Metaheuristics and Nature Inspired Computing (pp. 28–43). Springer. https://doi.org/10.1007/978-3-031-69257-4_3
• Designing Heuristics for Generalizations of Graph Burning / Iurlano, E. (2024, September 6). Designing Heuristics for Generalizations of Graph Burning [Presentation]. Invited talk at the Faculty of Natural Sciences and Mathematics, Banja Luka, Bosnia and Herzegovina.
• Signed double Roman domination on cubic graphs / Iurlano, E., Zec, T., Djukanovic, M., & Raidl, G. R. (2024). Signed double Roman domination on cubic graphs. Applied Mathematics and Computation, 471, Article 128612. https://doi.org/10.1016/j.amc.2024.128612
  Download: Signed double Roman domination on cubic graphs (912 KB)
• Combinatorial Search for Structures from Balanced Sequential Testing / Iurlano, E. (2024, May 31). Combinatorial Search for Structures from Balanced Sequential Testing [Presentation]. Invited talk at the Vienna Graduate School on Computational Optimization, Reichenau an der Rax, Austria.
• Growth of the perfect sequence covering array number / Iurlano, E. (2023). Growth of the perfect sequence covering array number. Designs, Codes and Cryptography, 91(4), 1487–1494. https://doi.org/10.1007/s10623-022-01168-3
  Download: PDF (257 KB)