:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Balasundaram, Haricharan, Krishnashree, J B, Limaye, Girija, Nasre, Meghana
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2506.03638
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized Capacity Planning for the Hospital-Residents Problem
by: Balasundaram, Haricharan, et al.
Published: (2025)

Convex Optimization with Nested Evolving Feasible Sets
by: M., Karthick Krishna, et al.
Published: (2026)

Optimal Capacity Modification for Stable Matchings with Ties
by: Ranjan, Keshav, et al.
Published: (2024)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
by: Nasre, Meghana, et al.
Published: (2023)

Group Fairness and Multi-criteria Optimization in School Assignment
by: A., Santhini K., et al.
Published: (2024)

Refining the Adaptivity Notion in the Huge Object Model
by: Adar, Tomer, et al.
Published: (2023)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Masked Matrix Multiplication for Emergent Sparsity
by: Wheatman, Brian, et al.
Published: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
by: Austrin, Per, et al.
Published: (2024)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
by: Gupta, Swati, et al.
Published: (2023)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
by: Panda, Atasi, et al.
Published: (2022)

On the Smallest Size of Internal Collage Systems
by: Migita, Soichiro, et al.
Published: (2025)

Size-constrained Weighted Ancestors with Applications
by: Bille, Philip, et al.
Published: (2023)

Simple Linear-Size Additive Emulators
by: Hoppenworth, Gary
Published: (2023)

Online Bin Packing with Item Size Estimates
by: Gehnen, Matthias, et al.
Published: (2025)

Streaming Edge Coloring with Subquadratic Palette Size
by: Chechik, Shiri, et al.
Published: (2023)

Almost Linear Size Edit Distance Sketch
by: Koucký, Michal, et al.
Published: (2024)

Faster Linear-Size And-Or Path and Adder Circuits
by: Brenner, Ulrich, et al.
Published: (2024)

String Representation in Suffixient Set Size Space
by: Shibata, Hiroki, et al.
Published: (2026)

Online Matching with Delays and Size-based Costs
by: Kawase, Yasushi, et al.
Published: (2024)

Path-Reporting Distance Oracles with Linear Size
by: Neiman, Ofer, et al.
Published: (2024)

Reconfiguring Multiple Connected Components with Size Multiset Constraints
by: Nakahata, Yu
Published: (2025)

Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
by: Shen, Fangjian, et al.
Published: (2025)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
by: Jin, Wenyu, et al.
Published: (2024)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
by: Khanna, Sanjeev, et al.
Published: (2024)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
by: Staus, Luca Pascal, et al.
Published: (2024)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
by: Hermann, Stefan, et al.
Published: (2024)

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size
by: Chanda, Debarshi
Published: (2025)

Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
by: Parter, Merav, et al.
Published: (2025)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
by: El-Hayek, Antoine, et al.
Published: (2025)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
by: Bhattacharya, Sayan, et al.
Published: (2023)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
by: Shah, Vihan
Published: (2026)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
by: Elkin, Michael, et al.
Published: (2023)

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time
by: Hua, Kevin, et al.
Published: (2024)

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
by: Csáji, Gergely, et al.
Published: (2023)

Sampling Colorings with Fixed Color Class Sizes
by: Kuchukova, Aiya, et al.
Published: (2026)

Composition in Differential Privacy for General Granularity Notions (Long Version)
by: Guerra-Balboa, Patricia, et al.
Published: (2023)

A Sampling Lovász Local Lemma for Large Domain Sizes
by: Wang, Chunyang, et al.
Published: (2023)

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
by: Nakar, Yonatan, et al.
Published: (2025)