Saved in:
| Main Author: | Fink, Jiří |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.16135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Constant delay Gray code enumeration of ideals and antichains in posets
by: Brenner, Sofia, et al.
Published: (2026)
by: Brenner, Sofia, et al.
Published: (2026)
Online matching and market imbalance
by: Barrientos, Benjamin, et al.
Published: (2025)
by: Barrientos, Benjamin, et al.
Published: (2025)
Online matching games in bipartite expanders and applications
by: Bauwens, Bruno, et al.
Published: (2022)
by: Bauwens, Bruno, et al.
Published: (2022)
Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)
by: Li, Yifei
Published: (2024)
Counting perfect matchings and Hamiltonian cycles faster
by: Li, Baitian
Published: (2023)
by: Li, Baitian
Published: (2023)
A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)
by: Bringolf, Jeffrey, et al.
Published: (2025)
Buffered Partially-Persistent External-Memory Search Trees
by: Brodal, Gerth Stølting, et al.
Published: (2025)
by: Brodal, Gerth Stølting, et al.
Published: (2025)
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
by: Assadi, Sepehr, et al.
Published: (2022)
by: Assadi, Sepehr, et al.
Published: (2022)
Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
by: Künnemann, Marvin, et al.
Published: (2024)
by: Künnemann, Marvin, et al.
Published: (2024)
What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
by: Blin, Lélia, et al.
Published: (2024)
by: Blin, Lélia, et al.
Published: (2024)
On the Parameterized Complexity of Diverse SAT
by: Misra, Neeldhara, et al.
Published: (2024)
by: Misra, Neeldhara, et al.
Published: (2024)
On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
by: Clark, Emily, et al.
Published: (2024)
by: Clark, Emily, et al.
Published: (2024)
Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)
by: Gao, Zhimeng, et al.
Published: (2025)
Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)
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)
by: Awofeso, Christine, et al.
Published: (2025)
Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)
by: Kucherov, Gregory, et al.
Published: (2025)
Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)
by: Gong, Mingyang, et al.
Published: (2025)
Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)
by: Mosenzon, Ron
Published: (2025)
Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)
by: Lindermayr, Alexander, et al.
Published: (2025)
Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
by: Emmerich, Michael
Published: (2025)
by: Emmerich, Michael
Published: (2025)
Hierarchical Exponential Search Via K-Spines
by: Dong, Bob
Published: (2025)
by: Dong, Bob
Published: (2025)
Simple in-place yet comparison-optimal Mergesort
by: Siebert, Christian
Published: (2025)
by: Siebert, Christian
Published: (2025)
Minimizing the Weighted Makespan with Restarts on a Single Machine
by: Amouzandeh, Aflatoun, et al.
Published: (2025)
by: Amouzandeh, Aflatoun, et al.
Published: (2025)
On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)
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)
by: Hommelsheim, Felix, et al.
Published: (2025)
Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
Impact of Knowledge on the Cost of Treasure Hunt in Trees
by: Bouchard, Sébastien, et al.
Published: (2025)
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)
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)
by: Ahn, Jungho, et al.
Published: (2025)
Fast Order Statistics with Group Inequality Testing
by: Liyanage, Adiesha, et al.
Published: (2025)
by: Liyanage, Adiesha, et al.
Published: (2025)
PtrHash: Minimal Perfect Hashing at RAM Throughput
by: Koerkamp, Ragnar Groot
Published: (2025)
by: Koerkamp, Ragnar Groot
Published: (2025)
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)
by: Chuzhoy, Julia, et al.
Published: (2025)
New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)
by: Wei, Jia Xu
Published: (2025)
Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
by: Bauernöppel, Frank, et al.
Published: (2025)
by: Bauernöppel, Frank, et al.
Published: (2025)
Counting large patterns in degenerate graphs
by: Awofeso, Christine, et al.
Published: (2025)
by: Awofeso, Christine, et al.
Published: (2025)
Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
by: Chen, Lin, et al.
Published: (2025)
by: Chen, Lin, et al.
Published: (2025)
An improved local search based algorithm for $k^-$-star partition
by: Gong, Mingyang, et al.
Published: (2025)
by: Gong, Mingyang, et al.
Published: (2025)
On the Approximability of Unsplittable Flow on a Path with Time Windows
by: Armbruster, Alexander, et al.
Published: (2025)
by: Armbruster, Alexander, et al.
Published: (2025)
Improving Online Bin Covering with Little Advice
by: Brodnik, Andrej, et al.
Published: (2025)
by: Brodnik, Andrej, et al.
Published: (2025)
Colorful Vertex Recoloring of Bipartite Graphs
by: Patt-Shamir, Boaz, et al.
Published: (2025)
by: Patt-Shamir, Boaz, et al.
Published: (2025)
Similar Items
-
Constant delay Gray code enumeration of ideals and antichains in posets
by: Brenner, Sofia, et al.
Published: (2026) -
Online matching and market imbalance
by: Barrientos, Benjamin, et al.
Published: (2025) -
Online matching games in bipartite expanders and applications
by: Bauwens, Bruno, et al.
Published: (2022) -
Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024) -
Counting perfect matchings and Hamiltonian cycles faster
by: Li, Baitian
Published: (2023)