<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Alberto Santini and Hua Jiang | AC Group | TU Wien</title><link>https://ac.notready.eu/author/alberto-santini-and-hua-jiang/</link><atom:link href="https://ac.notready.eu/author/alberto-santini-and-hua-jiang/index.xml" rel="self" type="application/rss+xml"/><description>Alberto Santini and Hua Jiang</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Jan 2020 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Alberto Santini and Hua Jiang</title><link>https://ac.notready.eu/author/alberto-santini-and-hua-jiang/</link></image><item><title>Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem</title><link>https://ac.notready.eu/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/</guid><description/></item></channel></rss>