Saved in:
| Main Authors: | Ameen, Taha, Hajek, Bruce |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.12293 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
$σ$-Maximal Ancestral Graphs
by: Yao, Binghua, et al.
Published: (2025)
by: Yao, Binghua, et al.
Published: (2025)
Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)
by: Canonne, Clément L., et al.
Published: (2026)
Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
by: Li, Xiaxin, et al.
Published: (2025)
by: Li, Xiaxin, et al.
Published: (2025)
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
by: Holtgrefe, Niels, et al.
Published: (2024)
by: Holtgrefe, Niels, et al.
Published: (2024)
An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)
by: Münch, Sabine, et al.
Published: (2025)
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
by: Chakrabarty, Deeparnab, et al.
Published: (2025)
by: Chakrabarty, Deeparnab, et al.
Published: (2025)
A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)
by: Chinyaev, Boris
Published: (2025)
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
by: Dudeja, Aditi, et al.
Published: (2024)
by: Dudeja, Aditi, et al.
Published: (2024)
UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
by: Arhire, Andrei, et al.
Published: (2025)
by: Arhire, Andrei, et al.
Published: (2025)
Ranking with Multiple Objectives
by: Devanur, Nikhil R., et al.
Published: (2024)
by: Devanur, Nikhil R., et al.
Published: (2024)
(Approximate) Matrix Multiplication via Convolutions
by: Uffenheimer, Yahel, et al.
Published: (2025)
by: Uffenheimer, Yahel, et al.
Published: (2025)
Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)
by: Draper, Thomas L., et al.
Published: (2025)
Online Graph Coloring for $k$-Colorable Graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)
A Faster Isomorphism Test for Graphs of Small Degree
by: Grohe, Martin, et al.
Published: (2018)
by: Grohe, Martin, et al.
Published: (2018)
Random local access for sampling k-SAT solutions
by: Dong, Dingding, et al.
Published: (2024)
by: Dong, Dingding, et al.
Published: (2024)
Monotone Randomized Apportionment
by: Correa, José, et al.
Published: (2024)
by: Correa, José, et al.
Published: (2024)
Randomized Communication and Implicit Graph Representations
by: Harms, Nathaniel, et al.
Published: (2021)
by: Harms, Nathaniel, et al.
Published: (2021)
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)
by: Efthymiou, Charilaos, et al.
Published: (2023)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Graph Visualization for Blockchain Data
by: Dietl, Marcell, et al.
Published: (2024)
by: Dietl, Marcell, et al.
Published: (2024)
Distance-Preserving Graph Compression Techniques
by: Madani, Amirali, et al.
Published: (2023)
by: Madani, Amirali, et al.
Published: (2023)
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Distortion of Metric Voting with Bounded Randomness
by: Cai, Ziyi, et al.
Published: (2026)
by: Cai, Ziyi, et al.
Published: (2026)
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
by: Brlek, Srečko, et al.
Published: (2024)
by: Brlek, Srečko, et al.
Published: (2024)
Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)
by: Filtser, Arnold, et al.
Published: (2024)
Online Graph Balancing and the Power of Two Choices
by: Bansal, Nikhil, et al.
Published: (2026)
by: Bansal, Nikhil, et al.
Published: (2026)
Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)
by: Bals, Ben, et al.
Published: (2026)
FO and MSO Model Checking on Temporal Graphs
by: Döring, Michelle, et al.
Published: (2026)
by: Döring, Michelle, et al.
Published: (2026)
Unbalanced Random Matching Markets with Partial Preferences
by: Potukuchi, Aditya, et al.
Published: (2024)
by: Potukuchi, Aditya, et al.
Published: (2024)
Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)
by: Austhof, Bethany, et al.
Published: (2025)
An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
by: Arndt, Stephen, et al.
Published: (2026)
by: Arndt, Stephen, et al.
Published: (2026)
Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Approximating Maximum Edge 2-Coloring by Normalizing Graphs
by: Mömke, Tobias, et al.
Published: (2024)
by: Mömke, Tobias, et al.
Published: (2024)
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
by: Paul-Pena, Daniel, et al.
Published: (2024)
by: Paul-Pena, Daniel, et al.
Published: (2024)
Algorithmic Results for Weak Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)
by: Paul, Kaustav, et al.
Published: (2024)
Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
by: Dahan, Anatole, et al.
Published: (2026)
by: Dahan, Anatole, et al.
Published: (2026)
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)
by: Hamm, Thekla, et al.
Published: (2022)
Tight Paths and Tight Pairs in Weighted Directed Graphs
by: Balcázar, José Luis
Published: (2025)
by: Balcázar, José Luis
Published: (2025)
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)
by: Wang, Chen, et al.
Published: (2024)
Similar Items
-
$σ$-Maximal Ancestral Graphs
by: Yao, Binghua, et al.
Published: (2025) -
Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026) -
Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
by: Li, Xiaxin, et al.
Published: (2025) -
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
by: Holtgrefe, Niels, et al.
Published: (2024) -
An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)