:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Emmerich, Michael
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms F.2.2
Online Access:	https://arxiv.org/abs/2502.01163
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
by: Chen, Lin, et al.
Published: (2025)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
by: DeHaan, Ian, et al.
Published: (2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

Set Parameterized Matching via Multi-Layer Hashing
by: Lewenstein, Moshe, et al.
Published: (2026)

Multiplication of 0-1 matrices via clustering
by: Jansson, Jesper, et al.
Published: (2025)

Deterministic Minimum Steiner Cut in Maximum Flow Time
by: Ding, Matthew, et al.
Published: (2023)

Finding Diverse Minimum s-t Cuts
by: de Berg, Mark, et al.
Published: (2023)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
by: Salas, Jesus
Published: (2025)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
by: Chakrabarti, Amit, et al.
Published: (2024)

Minimum-cost paths for electric cars
by: Dorfman, Dani, et al.
Published: (2024)

Fast approximate $\ell$-center clustering in high dimensional spaces
by: Kowaluk, Mirosław, et al.
Published: (2025)

Maintaining Routing Structures under Deletions via Self-Pruning
by: Haeupler, Bernhard, et al.
Published: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

Online Maximum Independent Set of Hyperrectangles
by: Advani, Rishi, et al.
Published: (2023)

Customizable Contraction Hierarchies -- A Survey
by: Bläsius, Thomas, et al.
Published: (2025)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
by: Awofeso, Christine, et al.
Published: (2025)

Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)

Hierarchical Exponential Search Via K-Spines
by: Dong, Bob
Published: (2025)

Simple in-place yet comparison-optimal Mergesort
by: Siebert, Christian
Published: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
by: Amouzandeh, Aflatoun, et al.
Published: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
by: Hommelsheim, Felix, et al.
Published: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
by: Bouchard, Sébastien, et al.
Published: (2025)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
by: Duan, Ran, et al.
Published: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
by: Ahn, Jungho, et al.
Published: (2025)