TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Enrico Iurlano

Univ.Ass. Dipl.-Ing. / BSc

Enrico Iurlano

Role

Contact

2026W

 

  • SAT-Based Search for Minwise Independent Families / Iurlano, E., & Raidl, G. R. (2026). SAT-Based Search for Minwise Independent Families. In G. Iacca, G. Nadizar, A. Yaman, D. Bucur, A. Della Cioppa, T. Hu, E. Medvet, & S. L. Thomson (Eds.), Parallel Problem Solving from Nature – PPSN XIX : 19th International Conference, PPSN 2026, Trento, Italy, August 29 – September 2, 2026, Proceedings, Part I (pp. 433–449). Springer Cham. https://doi.org/10.1007/978-3-032-36214-8_27
  • A Beam Search for Linearly Covering all Subsets of a Finite Set / Iurlano, E., Raidl, G., & Weissenfels, A. (2026, July 16). A Beam Search for Linearly Covering all Subsets of a Finite Set [Conference Presentation]. The 24th Conference of the International Federation of Operational Research Societies (IFORS2026), Wien, Austria.
  • Putting Tutte’s counterexample to Tait’s conjecture in perspective to Hamiltonicity and non-Hamiltonicity in certain planar cubic graphs / Fleischner, H., Iurlano, E., & Raidl, G. R. (2026). Putting Tutte’s counterexample to Tait’s conjecture in perspective to Hamiltonicity and non-Hamiltonicity in certain planar cubic graphs. In B. Fortz (Ed.), Proceedings of the 12th International Network Optimization Conference (INOC), Liège, Belgium, April 22-24, 2026 (pp. 17–20). OpenProceedings.org. https://doi.org/10.48786/inoc.2026.04
  • A Denoising Diffusion Adaptive Search for the α-Domination Problem on Social Graphs / Wustinger, M., Iurlano, E., & Raidl, G. (2026). A Denoising Diffusion Adaptive Search for the α-Domination Problem on Social Graphs. In M. Krejca & N. Pillay (Eds.), Evolutionary Computation in Combinatorial Optimization : 26th European Conference, EvoCOP 2026, Held as Part of EvoStar 2026, Toulouse, France, April 8–10, 2026, Proceedings (pp. 133–149). Springer Cham. https://doi.org/10.1007/978-3-032-20537-7_9
  • The Graph Burning Problem under Constrained Diffusion / Iurlano, E., Raidl, G. R., & Djukanović, M. (2026). The Graph Burning Problem under Constrained Diffusion. In F. Alvelos, I. Martins, & A. M. A. C. Rocha (Eds.), Advances in Optimization and Wildfire - Proceedings of the First Optimization and Wildfire Conference, October 1-4 2024, Luso, Portugal (pp. 139–154). Springer. https://doi.org/10.1007/978-3-032-03108-2_9
  • Towards Heuristics for Short Universal Cycle Coverings / Iurlano, E. (2025, November 6). Towards Heuristics for Short Universal Cycle Coverings [Presentation]. Austrian Workshop on Metaheuristics and Machine Learning 2025 (AWMHML 2025), Wien, Austria. http://hdl.handle.net/20.500.12708/225761
  • Complexity of Positive Influence Domination on Partial Grids / Iurlano, E., & Raidl, G. R. (2025). Complexity of Positive Influence Domination on Partial Grids. In A. Jeż & J. Otop (Eds.), Fundamentals of Computation Theory : 25th International Symposium, FCT 2025, Wrocław, Poland, September 15–17, 2025, Proceedings (pp. 267–280). Springer. https://doi.org/10.1007/978-3-032-04700-7_20
  • Tackling the α-Domination Problem Heuristically / Iurlano, E., Varga, J., & Raidl, G. R. (2025). Tackling the α-Domination Problem Heuristically. In A. Quesada-Arencibia, M. Affenzeller, & R. Moreno-Díaz (Eds.), Computer Aided Systems Theory : EUROCAST 2024 : 19th International Conference, Revised Selected Papers, Part I (pp. 148–156). Springer. https://doi.org/10.1007/978-3-031-82949-9_14
  • 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)