<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Yet Another Blog</title>
	<atom:link href="http://hatemabdelghani.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://hatemabdelghani.wordpress.com</link>
	<description></description>
	<lastBuildDate>Fri, 20 Jan 2012 02:50:41 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='hatemabdelghani.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Yet Another Blog</title>
		<link>http://hatemabdelghani.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://hatemabdelghani.wordpress.com/osd.xml" title="Yet Another Blog" />
	<atom:link rel='hub' href='http://hatemabdelghani.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Superstrings</title>
		<link>http://hatemabdelghani.wordpress.com/2011/06/04/superstrings/</link>
		<comments>http://hatemabdelghani.wordpress.com/2011/06/04/superstrings/#comments</comments>
		<pubDate>Sat, 04 Jun 2011 02:52:22 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Counting]]></category>
		<category><![CDATA[Dynamic Programming]]></category>
		<category><![CDATA[ICPC]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=569</guid>
		<description><![CDATA[Just decided to revive this blog after long hibernation! First of all, congratulations to the team of Ain Shams for ranking 64 in their first participation in the ACM ICPC World Finals this year. AFAIK, this year&#8217;s world finals was supposed to  be in Sharm El-Sheikh in Egypt, but because of the revolution the contest [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=569&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2011/06/04/superstrings/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>Alexandria University ranked 147 worldwide</title>
		<link>http://hatemabdelghani.wordpress.com/2010/09/19/alexandria-university-ranked-147-worldwide/</link>
		<comments>http://hatemabdelghani.wordpress.com/2010/09/19/alexandria-university-ranked-147-worldwide/#comments</comments>
		<pubDate>Sun, 19 Sep 2010 17:46:44 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Academia]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=508</guid>
		<description><![CDATA[This year&#8217;s THE ranking was a surprising boost for the Egyptian academia. Alexandria University from Egypt is ranked 147 worldwide. This is higher than many of the European universities that Egyptians go to do their PhDs in. So probably from now on Egyptians should try to get scholarships in Alexandria University! Times Higher Education (THE) [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=508&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2010/09/19/alexandria-university-ranked-147-worldwide/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>Maximum number of crossed matchings between two sequences</title>
		<link>http://hatemabdelghani.wordpress.com/2010/03/23/maximum-number-of-crossing-matches-between-two-sequences/</link>
		<comments>http://hatemabdelghani.wordpress.com/2010/03/23/maximum-number-of-crossing-matches-between-two-sequences/#comments</comments>
		<pubDate>Tue, 23 Mar 2010 18:15:08 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Dynamic Programming]]></category>
		<category><![CDATA[Online Judge]]></category>
		<category><![CDATA[PKU]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=306</guid>
		<description><![CDATA[Back to OJ problems &#8230; Problem PKU &#8211; 1692 Given two sequences of integers,and, we are allowed to match an integerfrom the first sequence with an integerfrom the second sequence only if.  No integer in either sequence can be matched with more than one integer in the other sequence. Each matching must cross with another [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=306&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2010/03/23/maximum-number-of-crossing-matches-between-two-sequences/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>

		<media:content url="http://hatemabdelghani.files.wordpress.com/2010/03/example2.jpg" medium="image">
			<media:title type="html">example2</media:title>
		</media:content>
	</item>
		<item>
		<title>First publication, to appear in SIGMOD 2010.</title>
		<link>http://hatemabdelghani.wordpress.com/2010/02/11/first-publication-to-appear-in-sigmod-2010/</link>
		<comments>http://hatemabdelghani.wordpress.com/2010/02/11/first-publication-to-appear-in-sigmod-2010/#comments</comments>
		<pubDate>Thu, 11 Feb 2010 04:26:06 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=289</guid>
		<description><![CDATA[I have just gotten my first paper accepted for publishing in SIGMOD 2010. Here are some learned lessons: A paper is evaluated based on originality, significance, quality of presentation, technical depth, quality of experiments and whether the experimental results really support the work. You don&#8217;t have to be perfect in all aspects, do the best [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=289&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2010/02/11/first-publication-to-appear-in-sigmod-2010/feed/</wfw:commentRss>
		<slash:comments>10</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>Two problems from the local ACM ICPC in FCIS Ain Shams</title>
		<link>http://hatemabdelghani.wordpress.com/2009/11/27/two-problems-from-the-local-acm-icpc-in-fcis-ain-shams-oct-2009/</link>
		<comments>http://hatemabdelghani.wordpress.com/2009/11/27/two-problems-from-the-local-acm-icpc-in-fcis-ain-shams-oct-2009/#comments</comments>
		<pubDate>Fri, 27 Nov 2009 12:07:40 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Counting]]></category>
		<category><![CDATA[ICPC]]></category>
		<category><![CDATA[Series]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=262</guid>
		<description><![CDATA[It has been a long time since I last posted here. Since this is the Eid and I have enough time to waste, it seems appropriate to add one more post. This post contains my solutions to the two problems that I wrote for the local ACM ICPC contest of FCIS Ain Shams University that [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=262&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2009/11/27/two-problems-from-the-local-acm-icpc-in-fcis-ain-shams-oct-2009/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>The number of trailing zeros in the factorial of a large integer</title>
		<link>http://hatemabdelghani.wordpress.com/2009/07/28/the-number-of-trailing-zeros-in-the-factorial-of-a-large-integer/</link>
		<comments>http://hatemabdelghani.wordpress.com/2009/07/28/the-number-of-trailing-zeros-in-the-factorial-of-a-large-integer/#comments</comments>
		<pubDate>Tue, 28 Jul 2009 09:22:43 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Number Theory]]></category>
		<category><![CDATA[Online Judge]]></category>
		<category><![CDATA[PKU]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=222</guid>
		<description><![CDATA[Problem PKU &#8211; 1401 Given a (large) integer K, find the number of zeros on the right of the factorial of K. For example, factorial 15 = 1,307,674,368,000, so the number of zeros on right of the factorial (let&#8217;s denote it Z(1,307,674,368,000) ) equals 3. The input integer K can be as large as 1000,000,000. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=222&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2009/07/28/the-number-of-trailing-zeros-in-the-factorial-of-a-large-integer/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>Second shortest path</title>
		<link>http://hatemabdelghani.wordpress.com/2009/07/04/second-shortest-path/</link>
		<comments>http://hatemabdelghani.wordpress.com/2009/07/04/second-shortest-path/#comments</comments>
		<pubDate>Sat, 04 Jul 2009 02:24:24 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Graph Theory]]></category>
		<category><![CDATA[Online Judge]]></category>
		<category><![CDATA[UVa]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=191</guid>
		<description><![CDATA[Problem UVa &#8211; 10342 Given a simple weighted graph (having no loops and no multi-edges), we want to find for every two vertices a path between those vertices whose length is strictly greater than the length of the shortest path between them but still less than or equal to the length of any other path [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=191&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2009/07/04/second-shortest-path/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>Minimum-maximum integral rectangle partitioning</title>
		<link>http://hatemabdelghani.wordpress.com/2009/05/22/minimum-maximum-integral-rectangle-paritioning/</link>
		<comments>http://hatemabdelghani.wordpress.com/2009/05/22/minimum-maximum-integral-rectangle-paritioning/#comments</comments>
		<pubDate>Fri, 22 May 2009 02:06:22 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Dynamic Programming]]></category>
		<category><![CDATA[Online Judge]]></category>
		<category><![CDATA[PKU]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=128</guid>
		<description><![CDATA[Problem: PKU-2951 We are given a rectangle with integral dimensions . We need to partition this rectangle into &#8220;sub-rectangles&#8221; with integral dimensions (not necessarily equal) such that the area of the largest sub-rectangle is minimized. Partitioning into sub-rectangles is achieved by splitting the rectangle either vertically or horizontally to get two smaller rectangles, then splitting [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=128&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2009/05/22/minimum-maximum-integral-rectangle-paritioning/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>Analyzing a random search in a tree</title>
		<link>http://hatemabdelghani.wordpress.com/2009/05/13/analyzing-random-search-in-a-tree/</link>
		<comments>http://hatemabdelghani.wordpress.com/2009/05/13/analyzing-random-search-in-a-tree/#comments</comments>
		<pubDate>Wed, 13 May 2009 22:59:27 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Linear Algebra]]></category>
		<category><![CDATA[Probability]]></category>
		<category><![CDATA[SRM]]></category>
		<category><![CDATA[Top Coder]]></category>

		<guid isPermaLink="false">http://hatemabdelghani.wordpress.com/?p=102</guid>
		<description><![CDATA[Problem: This is a 500-points problem from TC SRM440 Div1. It can be summarized as follows: We are given a matrix. Some cells are marked closed and others are marked open. We can only move from one open cell to an adjacent open cell. The matrix is defined such that there is one and only [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=102&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2009/05/13/analyzing-random-search-in-a-tree/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
		<item>
		<title>The number of the factors of the factors of a number!</title>
		<link>http://hatemabdelghani.wordpress.com/2009/05/07/pku-3604-professor-ben/</link>
		<comments>http://hatemabdelghani.wordpress.com/2009/05/07/pku-3604-professor-ben/#comments</comments>
		<pubDate>Thu, 07 May 2009 06:28:34 +0000</pubDate>
		<dc:creator>Hatem Abdelghani</dc:creator>
				<category><![CDATA[Problem Solving]]></category>
		<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Counting]]></category>
		<category><![CDATA[Dynamic Programming]]></category>
		<category><![CDATA[Number Theory]]></category>
		<category><![CDATA[Online Judge]]></category>
		<category><![CDATA[PKU]]></category>

		<guid isPermaLink="false">http://hatem.wordpress.com/?p=64</guid>
		<description><![CDATA[Problem: PKU &#8211; 3604 Given an integer N, find all the factors of N including the trivial factors (1 and N). For each factor f, find the cube of the number of factors of  f. Then sum all those cubes. For example, if N=4, the set of all possible factors are 1, 2 and 4. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=hatemabdelghani.wordpress.com&amp;blog=7672975&amp;post=64&amp;subd=hatemabdelghani&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://hatemabdelghani.wordpress.com/2009/05/07/pku-3604-professor-ben/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/8ced6d3a5e9304d5678e3a54e26f3edb?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Hatem Abdelghani</media:title>
		</media:content>
	</item>
	</channel>
</rss>
