<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Enrico Iurlano | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/enrico-iurlano/</link><atom:link href="https://ac.tuwien.ac.at/team/enrico-iurlano/index.xml" rel="self" type="application/rss+xml"/><description>Enrico Iurlano</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/team/enrico-iurlano/avatar_hu8006422790235750548.jpg</url><title>Enrico Iurlano</title><link>https://ac.tuwien.ac.at/team/enrico-iurlano/</link></image><item><title>A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization</title><link>https://ac.tuwien.ac.at/publication/a-construct-merge-solve-and-adapt-heuristic-for-least-cost-influence-maximization/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-construct-merge-solve-and-adapt-heuristic-for-least-cost-influence-maximization/</guid><description/></item><item><title>A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs</title><link>https://ac.tuwien.ac.at/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/</guid><description/></item><item><title>Pairwise Reflection Symmetry in Generalized Latin Rectangles</title><link>https://ac.tuwien.ac.at/publication/pairwise-reflection-symmetry-in-generalized-latin-rectangles/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pairwise-reflection-symmetry-in-generalized-latin-rectangles/</guid><description/></item><item><title>Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs</title><link>https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</guid><description/></item><item><title>SAT-Based Search for Minwise Independent Families</title><link>https://ac.tuwien.ac.at/publication/sat-based-search-for-minwise-independent-families/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sat-based-search-for-minwise-independent-families/</guid><description/></item><item><title>Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem</title><link>https://ac.tuwien.ac.at/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/</guid><description/></item><item><title>The Graph Burning Problem under Constrained Diffusion</title><link>https://ac.tuwien.ac.at/publication/the-graph-burning-problem-under-constrained-diffusion/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-graph-burning-problem-under-constrained-diffusion/</guid><description/></item><item><title>Complexity of Positive Influence Domination on Partial Grids</title><link>https://ac.tuwien.ac.at/publication/complexity-of-positive-influence-domination-on-partial-grids/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/complexity-of-positive-influence-domination-on-partial-grids/</guid><description/></item><item><title>Tackling the Alpha-Domination Problem Heuristically</title><link>https://ac.tuwien.ac.at/publication/tackling-the-alpha-domination-problem-heuristically/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/tackling-the-alpha-domination-problem-heuristically/</guid><description/></item><item><title>A Simulated Annealing Based Approach for the Roman Domination Problem</title><link>https://ac.tuwien.ac.at/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/</guid><description/></item><item><title>Signed Double Roman Domination on Cubic Graphs</title><link>https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/</guid><description/></item><item><title>Growth of the Perfect Sequence Covering Array Number</title><link>https://ac.tuwien.ac.at/publication/growth-of-the-perfect-sequence-covering-array-number/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/growth-of-the-perfect-sequence-covering-array-number/</guid><description/></item><item><title>Scrambling Permutations and Related Structures: Asymptotics and Constructions</title><link>https://ac.tuwien.ac.at/publication/scrambling-permutations-and-related-structures-asymptotics-and-constructions/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/scrambling-permutations-and-related-structures-asymptotics-and-constructions/</guid><description/></item></channel></rss>