paper_id stringlengths 5 42 | title stringlengths 18 153 | authors stringclasses 65
values | year int64 2.02k 2.03k | venue stringclasses 4
values | doi stringclasses 65
values | dblp_key stringclasses 65
values | dblp_url stringclasses 65
values | pdf_path stringclasses 65
values | dag stringlengths 13.8k 236k | num_nodes int64 11 72 | num_edges int64 14 236 |
|---|---|---|---|---|---|---|---|---|---|---|---|
subexp_makespan_unit_jobs | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Subexponential Time Algorithm for Makespan Scheduling", "summary": "The paper presents the first subexponential time algorithm ... | 21 | 28 |
subgraph_counting_dichotomy | A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Dichotomy Hierarchy for Subgraph Counting", "summary": "This paper establishes an infinite hierarchy of dichotom... | 27 | 56 |
submodular_santa_claus | The Submodular Santa Claus Problem | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "The Submodular Santa Claus Problem", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Generalizing from Additive to Submodular Valuations", "summary": "Previous work achieved $O(n^\\epsilon)$ and polylogarithmic approximations for additive valuations, but the best known fo... | 21 | 31 |
sumsets_real | Sumsets, 3SUM, Subset Sum: Now for Real! | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Sumsets, 3SUM, Subset Sum: Now for Real!", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Real Sumsets and Additive Problems", "summary": "This paper provides near-linear time algorithms for computing sumsets of real numbers, closing a long-standing gap between integer and... | 27 | 30 |
topological_hell_nesetril | A topological proof of the Hell–Nešetřil dichotomy | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "A topological proof of the Hell–Nešetřil dichotomy", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview", "summary": "This paper provides a new, conceptually simpler proof of the Hell-Nešetřil dichotomy theorem for the graph homomorphism problem. The proof combines to... | 31 | 52 |
tree_indep_evenholefree | Tree Independence Number IV. Even-hole-free Graphs | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Tree Independence Number IV. Even-hole-free Graphs", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Algorithmic Complexity on Even-Hole-Free Graphs", "summary": "Even-hole-free graphs share structural similarities with perfect graphs, but the complexity of MAXIMUM WEIGHT... | 25 | 29 |
triply_efficient_shadow | Triply efficient shadow tomography | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Triply efficient shadow tomography", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Triply Efficient Shadow Tomography", "summary": "This paper introduces 'triply efficient' shadow tomography protocols—methods that are sample-efficient, time-efficient, and require joint me... | 27 | 38 |
tsp_bridge_lemma | Approximating Traveling Salesman Problems Using a Bridge Lemma | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Approximating Traveling Salesman Problems Using a Bridge Lemma", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper Overview", "summary": "The paper presents improved approximation algorithms for two metric Traveling Salesman Problem variants: Ordered TSP (OTSP) and k-Pe... | 21 | 30 |
tutte_barycentric_surfaces | A Discrete Analog of Tutte’s Barycentric Embeddings on Surfaces | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "A Discrete Analog of Tutte’s Barycentric Embeddings on Surfaces", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Discrete Tutte Embeddings", "summary": "This paper introduces a purely discrete analog of Tutte's barycentric embedding theorem for surfaces of nonp... | 17 | 26 |
unique_neighbor_expanders | Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Unique-neighbor Expanders for Polynomial-sized Sets", "summary": "This paper provides three strongly explicit constructions of unique-neig... | 18 | 29 |
universal_perfect_samplers | Universal Perfect Samplers for Incremental Streams | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Universal Perfect Samplers for Incremental Streams", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Universal Perfect Samplers for Incremental Streams", "summary": "This paper introduces truly perfect $G$-samplers for incremental data streams. It shows that for a broad cla... | 19 | 25 |
unrelated_machine_completion | Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "The unrelated machine weighted completion time problem is a classic sch... | 12 | 14 |
vc_dim_clustering | A Tight VC-Dimension Analysis of Clustering Coresets with Applications | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "A Tight VC-Dimension Analysis of Clustering Coresets with Applications", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Tight VC-Dimension Analysis of Clustering Coresets", "summary": "This paper provides a sharp, VC-dimension-based analysis for constructing coresets for k... | 23 | 26 |
weak_coloring_minor | WEAK COLORING NUMBERS OF MINOR-CLOSED GRAPH CLASSES | null | 2,025 | SODA 2025 | null | null | null | null | {"paper_title": "WEAK COLORING NUMBERS OF MINOR-CLOSED GRAPH CLASSES", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Weak Coloring Numbers in Minor-Closed Classes", "summary": "The paper determines the growth rate of the $r$-th weak coloring number of graphs excluding a fixed ... | 22 | 35 |
-approximation_algorithm_general | A $(2 + \epsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A $(2 + \\epsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of $(2+\\epsilon)$-approximation for GSP", "summary": "The paper presents a quasi-polynomial time $(2+\\epsilon)... | 15 | 33 |
algebraic_closure_matrix | Algebraic Closure of Matrix Sets Recognized by 1-VASS | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Algebraic Closure of Matrix Sets Recognized by 1-VASS", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Algebraic Closure of Matrix Sets Recognized by 1-VASS", "summary": "This paper investigates the computability of the Zariski closure of matrix sets defined by formal lang... | 21 | 26 |
algorithmic_improvements_list | Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Algorithmic Improvements for FRS Codes", "summary": "This paper presents improved deterministic and randomized algorithms for list decoding F... | 26 | 35 |
algorithms_lower_bounds | Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Polygon Overlap Algorithms and Lower Bounds", "summary": "This paper presents an $O((nm)^{3/2} \\log(nm))$-time algorithm for ... | 30 | 63 |
almost_perfect_discrete | (Almost) Perfect Discrete Iterative Load Balancing | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "(Almost) Perfect Discrete Iterative Load Balancing", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "(Almost) Perfect Discrete Iterative Load Balancing", "summary": "The paper proves that discrete iterative load balancing on arbitrary graphs achieves a discrepancy of 3 in a... | 19 | 38 |
approaching_optimality_solving | Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper presents new randomized algorithms for solving linear systems and regression problems that are we... | 16 | 21 |
approximate_counting_permutation | Approximate Counting of Permutation Patterns | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Approximate Counting of Permutation Patterns", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Approximate Counting of Permutation Patterns", "summary": "This paper presents a deterministic, near-linear time algorithm for approximating the number of copies of any permutatio... | 19 | 26 |
approximate_light_spanners | Approximate Light Spanners in Planar Graphs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Approximate Light Spanners in Planar Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Approximate Light Spanners in Planar Graphs", "summary": "This paper presents a polynomial-time bicriteria approximation algorithm for constructing light spanners in we... | 21 | 25 |
approximately_dominating_sets | Approximately Dominating Sets in Elections | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Approximately Dominating Sets in Elections", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation: Relaxing Condorcet Winners", "summary": "Condorcet winners do not always exist, and exact dominating sets can require logarithmic size. While Condorcet winning sets (w... | 14 | 23 |
approximating_matroid_basis | Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Difficulty of MBT on Partition Matroids", "summary": "While MBT on uniform matroids is well-understood and has an optimal adaptive stra... | 15 | 19 |
balls_bins_infinite | Balls and Bins and the Infinite Process with Random Deletions | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Balls and Bins and the Infinite Process with Random Deletions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Balls and Bins with Random Deletions", "summary": "This paper analyzes an infinite balls-into-bins process where balls are inserted using the GREEDY[2] strategy a... | 18 | 30 |
better-than-2_approximation_directed | A Better-Than-2 Approximation for the Directed Tree Augmentation Problem | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Better-Than-2 Approximation for the Directed Tree Augmentation Problem", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Related Work", "summary": "While the undirected Tree Augmentation Problem (TAP) has seen significant progress breaking the approximati... | 18 | 30 |
block_size_matter | Does block size matter in randomized block Krylov low-rank approximation? | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Does block size matter in randomized block Krylov low-rank approximation?", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper proves that randomized block Krylov iteration (RBKI) achieves a near-optimal $(1+\\varepsilon)$-factor l... | 31 | 63 |
braiding_vineyards | Braiding Vineyards | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Braiding Vineyards", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Braiding Vineyards Overview", "summary": "This paper establishes a novel connection between topological data analysis (TDA) and knot theory by demonstrating that any knot or link can be realized as a close... | 18 | 21 |
broader_view_clustering | A Broader View on Clustering under Cluster-Aware Norm Objectives | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Broader View on Clustering under Cluster-Aware Norm Objectives", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of (f, g)-Clustering Approximations", "summary": "The paper studies the (f, g)-Clustering problem, where cluster costs are measured by an inner norm f... | 17 | 24 |
burling_graphs_graphs | BURLING GRAPHS IN GRAPHS WITH LARGE CHROMATIC NUMBER | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "BURLING GRAPHS IN GRAPHS WITH LARGE CHROMATIC NUMBER", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Burling-controlled graph classes", "summary": "The paper proves that in several broad classes of graphs that are not $\\chi$-bounded (such as string graphs, re... | 19 | 46 |
catching_rats_h-minor-free | Catching Rats in $H$-minor-free Graphs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Catching Rats in $H$-minor-free Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper proves that any graph excluding a fixed graph $H$ and a $(k \\times k)$-grid as minors has its treewidth and branchwidth bounded by a func... | 12 | 25 |
cell-probe_lower_bounds | Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper improves static data structure lower bounds and range avoidance algorithms for simpl... | 23 | 35 |
centered_colorings_minor-closed | CENTERED COLORINGS IN MINOR-CLOSED GRAPH CLASSES | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "CENTERED COLORINGS IN MINOR-CLOSED GRAPH CLASSES", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "Centered colorings are a key tool for designing parameterized algorithms in sparse graph classes, as they encapsulate bounded expansi... | 15 | 25 |
cfg_dnnf_admit | #CFG and #DNNF admit FPRAS | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "#CFG and #DNNF admit FPRAS", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "FPRAS for #CFG and #DNNF", "summary": "This paper presents the first fully polynomial-time randomized approximation scheme (FPRAS) for two fundamental counting problems: counting the number of word... | 21 | 48 |
classification_long-refinement_graphs | A Classification of Long-Refinement Graphs for Colour Refinement | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Classification of Long-Refinement Graphs for Colour Refinement", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Long-Refinement Graph Classification", "summary": "This paper provides a complete characterization of long-refinement graphs (graphs that take the ... | 20 | 26 |
coloring_3-colorable_graphs | Coloring 3-Colorable Graphs with Low Threshold Rank | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Coloring 3-Colorable Graphs with Low Threshold Rank", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper presents a new algorithm for finding large independent sets and proper 3-colorings in 3-colorable graphs with small 1-sided th... | 16 | 23 |
combinatorial_philosopher_inequalities | Combinatorial Philosopher Inequalities | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Combinatorial Philosopher Inequalities", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Combinatorial Philosopher Inequalities", "summary": "This paper studies the online combinatorial allocation problem, comparing algorithm performance against the optimal online algorithm... | 24 | 31 |
communication_complexity_combinatorial | The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Combinatorial Auctions with Succinct Bidders", "summary": "This paper investigates the communication complexity of welfare m... | 27 | 46 |
comparison_theorems_mixing | Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Comparison Theorems for Gibbs Samplers", "summary": "This paper establishes tight worst-case comparisons between the mixing times of... | 18 | 22 |
compatibility_fairness_nash | Compatibility of Fairness and Nash Welfare under Subadditive Valuations | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Compatibility of Fairness and Nash Welfare under Subadditive Valuations", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Compatibility of Fairness and Nash Welfare under Subadditive Valuations", "summary": "This paper establishes that for subadditive valuations, fairness (... | 25 | 35 |
complexity_skolem_problem | On the Complexity of the Skolem Problem at Low Orders | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "On the Complexity of the Skolem Problem at Low Orders", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation for the Bounded Skolem Problem", "summary": "The Skolem Problem is a famous open problem in theoretical computer science. While decidable for order up to 4, ... | 20 | 30 |
computation_schrijver_kernels | On the Computation of Schrijver’s Kernels | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "On the Computation of Schrijver’s Kernels", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation for Computing Minor Kernels", "summary": "Kernels were introduced by Schrijver to study the $\\mu$-spectrum of embedded graphs. Computing minor kernels efficiently is de... | 19 | 33 |
computational_complexity_property | Computational Complexity in Property Testing | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Computational Complexity in Property Testing", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Computational Complexity in Property Testing", "summary": "This paper systematically studies the relationship between query and time complexity in property testing. It... | 19 | 30 |
contract_design_sequential | Contract Design for Sequential Actions | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Contract Design for Sequential Actions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sequential Contract Design", "summary": "This paper introduces a novel principal-agent contract design model where the agent takes combinatorial actions sequentially and ada... | 20 | 21 |
covering_euclidean_plane | Covering the Euclidean Plane by a Pair of Trees | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Covering the Euclidean Plane by a Pair of Trees", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Covering the Euclidean Plane by a Pair of Trees", "summary": "The paper presents a constant-stretch tree cover using only two trees for any set of points in the Euclidean plane... | 24 | 30 |
csp_approach_graph | A CSP approach to Graph Sandwich Problems | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A CSP approach to Graph Sandwich Problems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview and Motivation of the CSP Approach to Graph Sandwich Problems", "summary": "This paper establishes a formal connection between Graph Sandwich Problems (SPs) and infinite-dom... | 19 | 25 |
derandomizing_pseudopolynomial_algorithms | Derandomizing Pseudopolynomial Algorithms for Subset Sum | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Derandomizing Pseudopolynomial Algorithms for Subset Sum", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Derandomizing Subset Sum Algorithms", "summary": "The paper presents the first deterministic algorithm for the subset sum problem that runs in $\\tilde{O}(t)$ time, ma... | 22 | 34 |
deterministic_dynamic_edge | Deterministic Dynamic Edge Colouring | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Deterministic Dynamic Edge Colouring", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Deterministic Dynamic Edge Colouring", "summary": "This paper presents a deterministic, fully dynamic algorithm for maintaining a $(1 + \\epsilon)\\Delta$-edge-colouring of a graph in sub... | 24 | 35 |
deterministic_polylogarithmic_competitive | A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays", "paper_url": null, "nodes": [{"id": "overview", "type": "overview", "title": "Overview of the Paper", "summary": "The paper presents a deterministic online algorithm for the Min-cost Perfect Matching with Delays (MPMD) pro... | 23 | 27 |
deterministically_finding_element | ON DETERMINISTICALLY FINDING AN ELEMENT OF HIGH ORDER MODULO A COMPOSITE | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "ON DETERMINISTICALLY FINDING AN ELEMENT OF HIGH ORDER MODULO A COMPOSITE", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation: Deterministic Integer Factorization", "summary": "Finding an element of large multiplicative order modulo $N$ is a crucial subroutine in ... | 21 | 32 |
dichotomy_orderings | Dichotomy for orderings? | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Dichotomy for orderings?", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper investigates the computational complexity of ordering and coloring problems defined by forbidden subgraphs. It proves that ordering problems defined by f... | 17 | 25 |
differentially_private_algorithms | Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Private Graph Cuts", "summary": "This paper introduces edge-differentially private algorithms for several classical graph c... | 25 | 37 |
differentially_private_quasi-concave | Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Differentially Private Quasi-Concave Optimization", "summary": "This paper studies the sample com... | 21 | 26 |
directed_disjoint_paths | The Directed Disjoint Paths Problem with Congestion | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "The Directed Disjoint Paths Problem with Congestion", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Directed Disjoint Paths with Congestion", "summary": "The paper investigates the directed disjoint paths problem with congestion. It proves that the problem is ... | 25 | 34 |
disjoint_paths_expanders | Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Disjoint Paths in Expanders via Hypergraph Matching", "summary": "This paper presents deterministic algorithms for finding short... | 22 | 32 |
distributed_interactive_proofs | Distributed Interactive Proofs for Planarity with Log-Star Communication | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Distributed Interactive Proofs for Planarity with Log-Star Communication", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Distributed Interactive Proofs for Planarity", "summary": "This paper presents highly efficient Distributed Interactive Proofs (DIPs) for verifying gra... | 18 | 23 |
downward_self-reducibility_total | Downward self-reducibility in the total function polynomial hierarchy | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Downward self-reducibility in the total function polynomial hierarchy", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Downward self-reducibility in the total function polynomial hierarchy", "summary": "This paper generalizes the concept of downward self-reducibility to se... | 23 | 27 |
dynamic_3d_convex | Dynamic 3D Convex Hulls Revisited and Applications | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Dynamic 3D Convex Hulls Revisited and Applications", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Dynamic 3D Convex Hulls Revisited", "summary": "The paper proposes a modification to Chan's dynamic data structure for 3D convex hulls and lower envelopes, aimin... | 16 | 20 |
dynamic_connectivity_expected | Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "While amortized polylogarithmic update time algorithms for dynamic connectivity have been known since the 90... | 25 | 37 |
edge_expansion_random | ON THE EDGE EXPANSION OF RANDOM POLYTOPES | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "ON THE EDGE EXPANSION OF RANDOM POLYTOPES", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Edge Expansion of Random Polytopes", "summary": "This paper studies the edge expansion of the graph of random 0/1-polytopes generated by selecting vertices of the hypercube independe... | 24 | 26 |
efficient_online_random | Efficient Online Random Sampling via Randomness Recycling | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Efficient Online Random Sampling via Randomness Recycling", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Efficient Online Random Sampling via Randomness Recycling", "summary": "The paper presents a novel online random sampling algorithm that generates discrete random var... | 20 | 30 |
efficiently_constructing_sparse | Efficiently Constructing Sparse Navigable Graphs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Efficiently Constructing Sparse Navigable Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Sparse Navigable Graph Construction", "summary": "This paper presents a nearly-quadratic time algorithm for constructing an optimally sparse navigable graph for a ... | 21 | 28 |
erd_s-p_sa | The Erdős-Pósa property for circle graphs as vertex-minors | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "The Erdős-Pósa property for circle graphs as vertex-minors", "paper_url": null, "nodes": [{"id": "node_03", "type": "definition", "title": "Vertex-minors and Local Complementation", "summary": "A graph $H$ is a vertex-minor of $G$ if it can be obtained by a sequence of local complementations and vertex... | 23 | 30 |
evasive_sets_twisted | Evasive sets, twisted varieties, and container-clique trees | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Evasive sets, twisted varieties, and container-clique trees", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Evasive sets, twisted varieties, and container-clique trees", "summary": "This paper studies evasive sets over finite fields and twisted varieties in projective spa... | 24 | 45 |
excluding_line_minor | Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Generalizing Modularity Bounds to Real Matrices", "summary": "While integer matrices with bounded subdeterminants ($\\De... | 22 | 28 |
existence_fair_efficient | Existence of Fair and Efficient Allocation of Indivisible Chores | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Existence of Fair and Efficient Allocation of Indivisible Chores", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Fair and Efficient Allocation of Indivisible Chores", "summary": "This paper resolves a major open question in fair division by proving that there ... | 29 | 57 |
expander_pruning_polylogarithmic | Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Need for Worst-Case Recourse and Update Time", "summary": "Previous expander pruning algorithms achieved either low amortized recourse or subpolynom... | 16 | 18 |
explicit_min-wise_hash | Explicit Min-wise Hash Families with Optimal Size | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Explicit Min-wise Hash Families with Optimal Size", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Explicit Min-wise Hash Families", "summary": "This paper presents the first explicit constructions of min-wise and $k$-min-wise hash families that achieve both an... | 23 | 28 |
extended_vc-dimension_radon | Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Extended VC-dimension and Radon/Tverberg Theorems for Unions of Convex Sets", "summary": "This paper resolves a long-standing open problem... | 16 | 41 |
faster_algorithms_packing | Faster algorithms for packing forests in graphs and related problems | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Faster algorithms for packing forests in graphs and related problems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "This paper presents a near-linear time algorithm for the Bounded Indegree k-Forest problem, which asks for k edge-disjo... | 32 | 56 |
faster_estimation_average | Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Average Degree Estimation", "summary": "This paper investigates sublinear algorithms for estimating the average degree ... | 25 | 38 |
faster_negative-weight_shortest | Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Faster LDD and Negative-Weight SSSP", "summary": "This paper presents a faster algorithm for directed low-diameter decomposition (LDD... | 23 | 25 |
faster_negative_length | Faster negative length shortest paths by bootstrapping hop reducers | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Faster negative length shortest paths by bootstrapping hop reducers", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Historical Context of Real-Weighted SSSP", "summary": "The textbook dynamic programming algorithm for real-weighted SSSP takes O(mn) time. Recent breakthr... | 26 | 39 |
feature_selection_junta | Feature Selection and Junta Testing are Statistically Equivalent | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Feature Selection and Junta Testing are Statistically Equivalent", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Testing vs. Learning and the Obvious Algorithm", "summary": "In standard PAC learning, the obvious algorithm (outputting any consistent hypothesis) is sample... | 17 | 17 |
few_good_choices | A FEW GOOD CHOICES | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A FEW GOOD CHOICES", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation for generalized Condorcet sets", "summary": "Traditional Condorcet winning sets and $\\alpha$-undominated sets require an outside candidate to be compared against a single member of the select... | 25 | 32 |
finding_sparse_induced | Finding sparse induced subgraphs on graphs of bounded induced matching treewidth | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Finding sparse induced subgraphs on graphs of bounded induced matching treewidth", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "While treewidth is a standard parameter, induced matching treewidth (tree-mu) is a powerful generaliz... | 20 | 21 |
finite_pinwheel_scheduling | Finite Pinwheel Scheduling: the k-Visits Problem | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Finite Pinwheel Scheduling: the k-Visits Problem", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Finite Pinwheel Scheduling", "summary": "This paper introduces the k-VISITS problem, a finite variant of the classic PINWHEEL SCHEDULING problem. The authors prove... | 29 | 50 |
generating_pivot_gray | Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Pivot Gray Codes for Spanning Trees", "summary": "The paper presents the first known algorithm to generate a pivot Gray... | 22 | 28 |
halfspaces_hard_test | Halfspaces are hard to test with relative error | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Halfspaces are hard to test with relative error", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation for Relative-Error Testing and the Halfspace Gap", "summary": "The standard property testing model is ill-suited for sparse Boolean functions because they are triv... | 19 | 31 |
hallucinating_flows_optimal | Hallucinating Flows for Optimal Mechanisms | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Hallucinating Flows for Optimal Mechanisms", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Hallucinating Flows for Optimal Mechanisms", "summary": "This paper extends the known closed-form optimal mechanisms for multi-item, multi-agent auctions in bi-valued se... | 24 | 28 |
hardness_approximation_shortest | Hardness of Approximation for Shortest Path with Vector Costs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Hardness of Approximation for Shortest Path with Vector Costs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Hardness of Approximation for $\\ell_p$-Shortest Path", "summary": "The paper establishes nearly tight hardness of approximation results for the $\\ell_p$-Shortes... | 19 | 26 |
history-independent_load_balancing | History-Independent Load Balancing | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "History-Independent Load Balancing", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Motivation and Prior Work", "summary": "While the two-choice load-balancing problem is well-studied, existing solutions with low overload and low recourse are highly history-dependent. Pr... | 16 | 18 |
improved_additive_approximation | Improved Additive Approximation Algorithms for APSP | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Improved Additive Approximation Algorithms for APSP", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Improved Additive APSP Algorithms", "summary": "This paper presents improved algorithms for computing additive approximations of All-Pairs Shortest Paths (APSP)... | 21 | 28 |
improved_approximation_ranking | Improved Approximation for Ranking on General Graphs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Improved Approximation for Ranking on General Graphs", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Gap in Approximation Ratio for General Graphs", "summary": "While RANKING is well-understood for bipartite graphs (with an approximation ratio between 0.696 and 0.727), ... | 16 | 21 |
improved_online_algorithms | Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper presents improved online... | 19 | 22 |
interaction_between_skew-representability | Interaction between skew-representability, tensor products, extension properties, and rank inequalities | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Interaction between skew-representability, tensor products, extension properties, and rank inequalities", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the Paper", "summary": "The paper introduces a novel approach to studying skew-representability of matroids ... | 27 | 52 |
k-sum_hardness_implies | k-SUM Hardness Implies Treewidth-SETH | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "k-SUM Hardness Implies Treewidth-SETH", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Connecting Orthogonal Fine-Grained Hypotheses", "summary": "The three main fine-grained complexity hypotheses (SETH, 3-SUM, APSP) are currently believed to be orthogonal. This paper ai... | 35 | 61 |
language_generation_limit | Language Generation in the Limit: Noise, Loss, and Feedback | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Language Generation in the Limit: Noise, Loss, and Feedback", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Language Generation in the Limit: Noise, Loss, and Feedback", "summary": "This paper resolves several open questions regarding the formal framework of language gene... | 27 | 37 |
learning_echo_chamber | Learning in an Echo Chamber: Online Learning with Replay Adversary | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Learning in an Echo Chamber: Online Learning with Replay Adversary", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Online Learning in the Replay Setting", "summary": "The paper introduces a learning-theoretic framework where an online learner receives feedback that may be... | 22 | 28 |
likelihood_existence_average | Likelihood of the Existence of Average Justified Representation | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Likelihood of the Existence of Average Justified Representation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Likelihood of Average Justified Representation", "summary": "The paper investigates the likelihood of the existence of a winning committee satisfying Average Ju... | 18 | 22 |
lines_crossing_pairwise | On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "Absence of Standard Helly Theorems for Lines", "summary": "While Helly's theorem and its fractional variants are well established for points and hyper... | 20 | 28 |
listing_faces_polytopes | LISTING FACES OF POLYTOPES | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "LISTING FACES OF POLYTOPES", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Listing Faces of Polytopes", "summary": "This paper investigates the problem of listing all faces of combinatorial polytopes by finding Hamiltonian cycles in the cover graph of their face lattices.... | 20 | 27 |
local_gibbs_sampling | LOCAL GIBBS SAMPLING BEYOND LOCAL UNIFORMITY | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "LOCAL GIBBS SAMPLING BEYOND LOCAL UNIFORMITY", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Local Gibbs Sampling Beyond Local Uniformity", "summary": "This paper presents linear-time local samplers for Gibbs distributions of spin systems, specifically targeting models wi... | 30 | 51 |
low-sensitivity_matching_sampling | Low-Sensitivity Matching via Sampling from Gibbs Distributions | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Low-Sensitivity Matching via Sampling from Gibbs Distributions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Low-Sensitivity Matching", "summary": "This paper studies the maximum matching problem through the lens of sensitivity, which measures how much an al... | 28 | 57 |
lower_bounds_csp | Lower Bounds for CSP Hierarchies Through Ideal Reduction | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Lower Bounds for CSP Hierarchies Through Ideal Reduction", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Lower Bounds for CSP Hierarchies Through Ideal Reduction", "summary": "The paper establishes a generic connection between degree lower bounds for algebraic proof syste... | 22 | 26 |
lower_bounds_universal | LOWER BOUNDS FOR THE UNIVERSAL TSP ON THE PLANE | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "LOWER BOUNDS FOR THE UNIVERSAL TSP ON THE PLANE", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "History and Prior Bounds for Universal TSP", "summary": "The universal TSP heuristic was introduced by Bartholdi and Platzman, who conjectured an $O(1)$ competitive ratio. Be... | 14 | 20 |
matroids_equitable | Matroids are Equitable* | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Matroids are Equitable*", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Matroids are Equitable", "summary": "The paper proves the matroid equitability conjecture, showing that if a matroid's ground set can be partitioned into $k$ bases, any subset can be distributed almos... | 24 | 36 |
max_bisection_harder | MAX BISECTION might be harder to approximate than MAX CUT | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "MAX BISECTION might be harder to approximate than MAX CUT", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of MAX BISECTION Inapproximability", "summary": "The paper demonstrates that MAX BISECTION might be strictly harder to approximate than MAX CUT. It construct... | 23 | 35 |
near-complete_resolution_exponential-time | A Near-Complete Resolution of the Exponential-Time Complexity of $k$-opt for the Traveling Salesman Problem | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "A Near-Complete Resolution of the Exponential-Time Complexity of $k$-opt for the Traveling Salesman Problem", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Near-Complete Resolution of $k$-opt Exponential-Time Complexity", "summary": "This paper resolves the open question ... | 23 | 23 |
near-linear_time_subhypergraph | Near-linear time subhypergraph counting in bounded degeneracy hypergraphs | null | 2,026 | SODA 2026 | null | null | null | null | {"paper_title": "Near-linear time subhypergraph counting in bounded degeneracy hypergraphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of Near-linear Time Subhypergraph Counting", "summary": "This paper provides a complete dichotomy for the problem of counting small pattern h... | 29 | 54 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.