Enrico Iurlano
Univ.Ass. Dipl.-Ing. / BSc
Role
- PreDoc Researcher
Algorithms and Complexity, E192-01
Contact
- enrico.iurlano@tuwien.ac.at
- +43-1-58801-192149
- 1040 Wien, Favoritenstrasse 9 / Room HA0410
- vCard from TISS
- ac.tuwien.ac.at/team/enrico-iurlano
- orcid.org/0000-0001-7528-0834
- informatics.tuwien.ac.at/people/enrico-iurlano
- tiss.tuwien.ac.at/person/284448
Courses
Publications
- 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. Peer-reviewed.
- 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. Peer-reviewed.
- 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. Peer-reviewed.
- 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. Peer-reviewed.
- 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. Peer-reviewed.
- 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. Peer-reviewed.
- 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. Peer-reviewed.
- Iurlano, E., Zec, T., Djukanovic, M., Raidl, G. R. (2024). Signed double Roman domination on cubic graphs. Applied Mathematics and Computation, 471, Article 128612. Peer-reviewed.DOI: 10.1016/j.amc.2024.128612 / Download: PDF
- Iurlano, E. (2023). Growth of the perfect sequence covering array number. Designs, Codes and Cryptography, 91(4), 1487–1494. Peer-reviewed.DOI: 10.1007/s10623-022-01168-3 / Download: PDF
Presentations
- 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. Invited.HDL: 20.500.12708/230621
- 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. Invited.HDL: 20.500.12708/225761
- 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. Invited.HDL: 20.500.12708/209534
- 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. Invited.HDL: 20.500.12708/209533
Theses
- Weissenfels, A. (2026). Lower bounds and algorithms for covering sequences of subsets of a finite set [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2026.138060 / Download: PDF