<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Research</title><description>Notes from papers I am reading, and mini-surveys of themes I&apos;m learning about.</description><link>https://research.neeldhara.blog/</link><item><title>Quantum Computing Meets Classical Algorithms</title><link>https://research.neeldhara.blog/quantum-algorithms/</link><guid isPermaLink="true">https://research.neeldhara.blog/quantum-algorithms/</guid><description>Exploring the intersection of quantum and classical algorithmic techniques from recent conferences.</description><pubDate>Sun, 10 Mar 2024 00:00:00 GMT</pubDate></item><item><title>Distributed Computing: Recent Advances</title><link>https://research.neeldhara.blog/distributed-algorithms/</link><guid isPermaLink="true">https://research.neeldhara.blog/distributed-algorithms/</guid><description>Survey of recent developments in distributed algorithms from major conferences.</description><pubDate>Tue, 20 Feb 2024 00:00:00 GMT</pubDate></item><item><title>Understanding the Latest Approximation Algorithm for Set Cover</title><link>https://research.neeldhara.blog/paper-review-approximation/</link><guid isPermaLink="true">https://research.neeldhara.blog/paper-review-approximation/</guid><description>A detailed walkthrough of a breakthrough approximation algorithm with practical implications.</description><pubDate>Thu, 15 Feb 2024 00:00:00 GMT</pubDate></item><item><title>Academic Writing with Obsidian and Pandoc</title><link>https://research.neeldhara.blog/obsidian-academic/</link><guid isPermaLink="true">https://research.neeldhara.blog/obsidian-academic/</guid><description>A complete workflow for academic papers - from notes to publication-ready PDFs.</description><pubDate>Mon, 12 Feb 2024 00:00:00 GMT</pubDate></item><item><title>Git Workflows That Save My Sanity</title><link>https://research.neeldhara.blog/git-automation/</link><guid isPermaLink="true">https://research.neeldhara.blog/git-automation/</guid><description>Automation scripts and Git hooks that eliminate repetitive tasks and prevent common mistakes.</description><pubDate>Mon, 22 Jan 2024 00:00:00 GMT</pubDate></item><item><title>Deep Dive: A New Approach to Graph Decomposition</title><link>https://research.neeldhara.blog/paper-review-graph-decomposition/</link><guid isPermaLink="true">https://research.neeldhara.blog/paper-review-graph-decomposition/</guid><description>An in-depth analysis of a recent paper on hierarchical graph decomposition and its implications.</description><pubDate>Sat, 20 Jan 2024 00:00:00 GMT</pubDate></item><item><title>SODA 2024: Algorithmic Breakthroughs</title><link>https://research.neeldhara.blog/conference-highlights-2024/</link><guid isPermaLink="true">https://research.neeldhara.blog/conference-highlights-2024/</guid><description>A roundup of fascinating algorithmic results from SODA 2024, focusing on graph algorithms and optimization techniques.</description><pubDate>Mon, 15 Jan 2024 00:00:00 GMT</pubDate></item></channel></rss>