<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/themes/root/assets/xsl/rss.xsl"?>
<rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/">
  <channel>
    <title>Results for "ArXiv cs.DS Recent Papers"</title>
    <description>Showing 1 - 50 results of 80</description>
    <generator>Laminas_Feed_Writer 2 (https://getlaminas.org)</generator>
    <link>https://search.frelip.org/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;lookfor=%22ArXiv+cs.DS+Recent+Papers%22&amp;type=Subject&amp;lng=en</link>
    <opensearch:totalResults>80</opensearch:totalResults>
    <opensearch:startIndex>0</opensearch:startIndex>
    <opensearch:itemsPerPage>50</opensearch:itemsPerPage>
    <opensearch:Query role="request" searchTerms="%22ArXiv%20cs.DS%20Recent%20Papers%22" startIndex="0"/>
    <atom:link rel="first" type="application/rss+xml" title="Go to First Page" href="https://search.frelip.org/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=%22ArXiv+cs.DS+Recent+Papers%22&amp;type=Subject&amp;lng=en"/>
    <atom:link rel="next" type="application/rss+xml" title="Go to Next Page" href="https://search.frelip.org/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=%22ArXiv+cs.DS+Recent+Papers%22&amp;type=Subject&amp;lng=en&amp;page=2"/>
    <atom:link rel="last" type="application/rss+xml" title="Go to Last Page" href="https://search.frelip.org/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=%22ArXiv+cs.DS+Recent+Papers%22&amp;type=Subject&amp;lng=en&amp;page=2"/>
    <atom:link rel="self" type="application/rss+xml" href="https://search.frelip.org/Search/Results?sort=last_indexed+desc&amp;limit=50&amp;view=rss&amp;lookfor=%22ArXiv+cs.DS+Recent+Papers%22&amp;type=Subject&amp;lng=en"/>
    <item>
      <title>Succinct Graph Representations and Algorithmic Applications</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48692</link>
      <guid>https://search.frelip.org/Record/rss_article:48692</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Distributed Santa Claus via Global Rounding</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48693</link>
      <guid>https://search.frelip.org/Record/rss_article:48693</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Simpler and Improved Replacement Path Coverings</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48694</link>
      <guid>https://search.frelip.org/Record/rss_article:48694</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Heisenberg-limited Hamiltonian learning without short-time control</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48695</link>
      <guid>https://search.frelip.org/Record/rss_article:48695</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48696</link>
      <guid>https://search.frelip.org/Record/rss_article:48696</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Variational and Majorization Principles in Lattice Reduction</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48697</link>
      <guid>https://search.frelip.org/Record/rss_article:48697</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Temporal Routing in Static Networks: The Schedule Completion Problem</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48698</link>
      <guid>https://search.frelip.org/Record/rss_article:48698</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48699</link>
      <guid>https://search.frelip.org/Record/rss_article:48699</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Online Coloring for Graphs of Large Odd Girth</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48700</link>
      <guid>https://search.frelip.org/Record/rss_article:48700</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Solving Hypergraph Laplacian Systems in Almost-Linear Time</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48701</link>
      <guid>https://search.frelip.org/Record/rss_article:48701</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>An Exact 56-Addition, Rank-23 Scheme for General 3*3 Matrix Multiplication</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48702</link>
      <guid>https://search.frelip.org/Record/rss_article:48702</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Smallest suffixient set maintenance in near-real-time</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48703</link>
      <guid>https://search.frelip.org/Record/rss_article:48703</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48704</link>
      <guid>https://search.frelip.org/Record/rss_article:48704</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A note on the parameter $ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48705</link>
      <guid>https://search.frelip.org/Record/rss_article:48705</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Designing sparse temporal graphs satisfying connectivity requirements</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48706</link>
      <guid>https://search.frelip.org/Record/rss_article:48706</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>New Diameter Approximations via Distance Oracle Techniques</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48707</link>
      <guid>https://search.frelip.org/Record/rss_article:48707</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Improved Approximation Algorithm for Maximum Balanced Biclique</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48708</link>
      <guid>https://search.frelip.org/Record/rss_article:48708</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Online Monotone Metric Embeddings</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48709</link>
      <guid>https://search.frelip.org/Record/rss_article:48709</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48710</link>
      <guid>https://search.frelip.org/Record/rss_article:48710</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Strict Hierarchy for Quantum Channel Certification to Unitary</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48711</link>
      <guid>https://search.frelip.org/Record/rss_article:48711</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Solving Positive Linear Programs with Differential Privacy</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48712</link>
      <guid>https://search.frelip.org/Record/rss_article:48712</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48713</link>
      <guid>https://search.frelip.org/Record/rss_article:48713</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>On (In)approximability of MaxMin Independent Set Reconfiguration</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48714</link>
      <guid>https://search.frelip.org/Record/rss_article:48714</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Small Independent Sets versus Small Separator in Geometric Intersection Graphs</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:48715</link>
      <guid>https://search.frelip.org/Record/rss_article:48715</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49205</link>
      <guid>https://search.frelip.org/Record/rss_article:49205</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49206</link>
      <guid>https://search.frelip.org/Record/rss_article:49206</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49207</link>
      <guid>https://search.frelip.org/Record/rss_article:49207</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Unlearning Offline Stochastic Multi-Armed Bandits</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49208</link>
      <guid>https://search.frelip.org/Record/rss_article:49208</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Upward-Planar Drawings with Bounded Span</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49209</link>
      <guid>https://search.frelip.org/Record/rss_article:49209</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49210</link>
      <guid>https://search.frelip.org/Record/rss_article:49210</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Set Parameterized Matching via Multi-Layer Hashing</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49211</link>
      <guid>https://search.frelip.org/Record/rss_article:49211</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Brief announcement: A special case of maximum flow over time with network changes</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49212</link>
      <guid>https://search.frelip.org/Record/rss_article:49212</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The Impact of Approximation on Algorithmic Progress</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49213</link>
      <guid>https://search.frelip.org/Record/rss_article:49213</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Matroid Algorithms Under Size-Sensitive Independence Oracles</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49214</link>
      <guid>https://search.frelip.org/Record/rss_article:49214</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Ranking with Partitioning</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49549</link>
      <guid>https://search.frelip.org/Record/rss_article:49549</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49550</link>
      <guid>https://search.frelip.org/Record/rss_article:49550</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>On the power of standard DFS and BFS</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49551</link>
      <guid>https://search.frelip.org/Record/rss_article:49551</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Many Hamiltonians Are Sparsifiable</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49552</link>
      <guid>https://search.frelip.org/Record/rss_article:49552</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Solution independence and self-referential instances</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49553</link>
      <guid>https://search.frelip.org/Record/rss_article:49553</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Undirected Replacement Paths: Dual Fault Reduces to Single Source</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49554</link>
      <guid>https://search.frelip.org/Record/rss_article:49554</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fast Monte-Carlo</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49555</link>
      <guid>https://search.frelip.org/Record/rss_article:49555</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Faster Mixing for Triangulations via Transport Flows</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49556</link>
      <guid>https://search.frelip.org/Record/rss_article:49556</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49557</link>
      <guid>https://search.frelip.org/Record/rss_article:49557</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49558</link>
      <guid>https://search.frelip.org/Record/rss_article:49558</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Randomized $k$-server in polynomial time</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49559</link>
      <guid>https://search.frelip.org/Record/rss_article:49559</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Unified Approach to Minimizing Symmetric Submodular Functions</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49560</link>
      <guid>https://search.frelip.org/Record/rss_article:49560</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>New Bounds for Kernel Sums via Fast Spherical Embeddings</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49561</link>
      <guid>https://search.frelip.org/Record/rss_article:49561</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49857</link>
      <guid>https://search.frelip.org/Record/rss_article:49857</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49858</link>
      <guid>https://search.frelip.org/Record/rss_article:49858</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth</title>
      <pubDate>Thu, 01 Jan 2026 17:16:00 -0500</pubDate>
      <link>https://search.frelip.org/Record/rss_article:49859</link>
      <guid>https://search.frelip.org/Record/rss_article:49859</guid>
      <dc:format>Online Article</dc:format>
      <dc:format>RSS Article</dc:format>
      <dc:date>2026</dc:date>
      <slash:comments>0</slash:comments>
    </item>
  </channel>
</rss>
