:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Manurangsi, Pasin
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2604.27141
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back
by: Manurangsi, Pasin
Published: (2024)

Improved Lower Bound for Differentially Private Facility Location
by: Manurangsi, Pasin
Published: (2024)

Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
by: Laekhanukit, Bundit, et al.
Published: (2026)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
by: Harrison, Charlie, et al.
Published: (2025)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
by: Harrison, Charlie, et al.
Published: (2025)

Nearly-Optimal Private Selection via Gaussian Mechanism
by: Leeman, Ethan, et al.
Published: (2025)

Algorithmic Persuasion with Evidence
by: Hoefer, Martin, et al.
Published: (2020)

On the Efficient Discovery of Maximum $k$-Defective Biclique
by: Cui, Donghang, et al.
Published: (2025)

Fine Grained Lower Bounds for Multidimensional Knapsack
by: Doron-Arad, Ilan, et al.
Published: (2024)

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
by: Epasto, Alessandro, et al.
Published: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
by: S., Karthik C., et al.
Published: (2024)

The Price of Privacy For Approximating Max-CSP
by: Dharangutte, Prathamesh, et al.
Published: (2026)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
by: Krithika, R., et al.
Published: (2023)

Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
by: Chua, Lynn, et al.
Published: (2026)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
by: Zhao, Jingyang, et al.
Published: (2025)

Biclique Reconfiguration in Bipartite Graphs
by: Otachi, Yota, et al.
Published: (2026)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
by: Ghazi, Badih, et al.
Published: (2024)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
by: Guruswami, Venkatesan, et al.
Published: (2023)

On Computing Pairwise Statistics with Local Differential Privacy
by: Ghazi, Badih, et al.
Published: (2024)

Linear-Time User-Level DP-SCO via Robust Statistics
by: Ghazi, Badih, et al.
Published: (2025)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
by: Goldmann, Lito, et al.
Published: (2023)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
by: Regehr, Matthew, et al.
Published: (2026)

Private Hyperparameter Tuning with Ex-Post Guarantee
by: Ghazi, Badih, et al.
Published: (2025)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
by: Ghosal, Angikar, et al.
Published: (2025)

Hardness and Approximation Algorithms for Balanced Districting Problems
by: Dharangutte, Prathamesh, et al.
Published: (2025)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
by: Zheng, Da Wei, et al.
Published: (2023)

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
by: de Montgolfier, Fabien, et al.
Published: (2025)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
by: Wang, Kaixin, et al.
Published: (2026)

Differential Privacy on Trust Graphs
by: Ghazi, Badih, et al.
Published: (2024)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
by: Ye, Xiaowei, et al.
Published: (2024)

Improved Additive Approximation Algorithms for APSP
by: Jin, Ce, et al.
Published: (2025)

Computational Hardness of Private Coreset
by: Ghazi, Badih, et al.
Published: (2026)

On Convex Optimization with Semi-Sensitive Features
by: Ghazi, Badih, et al.
Published: (2024)

Improved Approximation Algorithms for Three-Dimensional Knapsack
by: Jansen, Klaus, et al.
Published: (2025)

An Improved Approximation Algorithm for Metric Triangle Packing
by: Zhao, Jingyang, et al.
Published: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
by: Kolmogorov, Vladimir, et al.
Published: (2026)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
by: Chaplick, Steven, et al.
Published: (2024)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
by: Dempsey, Jordan, et al.
Published: (2024)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
by: Armbruster, Alexander, et al.
Published: (2026)