Saved in:
| Main Authors: | Cunha, Luís, Medina, Mário |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.00111 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021)
by: Sølvsten, Steffan Christ, et al.
Published: (2021)
Reconfiguration of Independent Transversals
by: Buys, Pjotr, et al.
Published: (2024)
by: Buys, Pjotr, et al.
Published: (2024)
Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)
by: Mathieu, Claire, et al.
Published: (2020)
Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
An Allele-Centric Pan-Graph-Matrix Representation for Scalable Pangenome Analysis
by: Garrone, Roberto
Published: (2025)
by: Garrone, Roberto
Published: (2025)
Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)
by: Bonnet, Édouard, et al.
Published: (2023)
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)
by: Bonnet, Édouard, et al.
Published: (2023)
On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)
by: Date, Vinicius T. V., et al.
Published: (2025)
Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)
by: Gabryelski, Wojciech, et al.
Published: (2026)
Untangling Graphs on Surfaces
by: de Verdière, Éric Colin, et al.
Published: (2023)
by: de Verdière, Éric Colin, et al.
Published: (2023)
Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
by: Oum, Sang-il, et al.
Published: (2026)
by: Oum, Sang-il, et al.
Published: (2026)
The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations
by: Gurski, Frank, et al.
Published: (2024)
by: Gurski, Frank, et al.
Published: (2024)
Testing forbidden order-pattern properties on hypergrids
by: Chandramouleeswaran, Harish, et al.
Published: (2025)
by: Chandramouleeswaran, Harish, et al.
Published: (2025)
A New Construction of the Vietoris-Rips Complex
by: Rieser, Antonio
Published: (2023)
by: Rieser, Antonio
Published: (2023)
On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)
by: Heinrich, Irene, et al.
Published: (2025)
An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)
by: Mundhra, S.
Published: (2025)
Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
by: Urata, Tsuyoshi, et al.
Published: (2024)
by: Urata, Tsuyoshi, et al.
Published: (2024)
Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)
by: Griesbach, Svenja M., et al.
Published: (2023)
Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)
by: Jerrum, Mark
Published: (2021)
Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)
by: Thilikos, Dimitrios M., et al.
Published: (2022)
Towards a Unified Theory of Time-Varying Data
by: Bumpus, Benjamin Merlin, et al.
Published: (2024)
by: Bumpus, Benjamin Merlin, et al.
Published: (2024)
A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)
by: Rahat, Md Tanzeem, et al.
Published: (2025)
On the zeros of partition functions with multi-spin interactions
by: Barvinok, Alexander
Published: (2024)
by: Barvinok, Alexander
Published: (2024)
Degree Realization by Bipartite Cactus Graphs
by: Bar-Noy, Amotz, et al.
Published: (2025)
by: Bar-Noy, Amotz, et al.
Published: (2025)
Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
by: Alimi, Morteza, et al.
Published: (2025)
by: Alimi, Morteza, et al.
Published: (2025)
Optimal Adjacency Labels for Subgraphs of Cartesian Products
by: Esperet, Louis, et al.
Published: (2022)
by: Esperet, Louis, et al.
Published: (2022)
The Algorithmic Phase Transition of Random Graph Alignment Problem
by: Du, Hang, et al.
Published: (2023)
by: Du, Hang, et al.
Published: (2023)
The Merkle Mountain Belt
by: Cevallos, Alfonso, et al.
Published: (2025)
by: Cevallos, Alfonso, et al.
Published: (2025)
BFS versus DFS for random targets in ordered trees
by: Dimitrov, Stoyan, et al.
Published: (2024)
by: Dimitrov, Stoyan, et al.
Published: (2024)
On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)
by: Munaro, Andrea, et al.
Published: (2022)
The Minimum Subgraph Complementation Problem
by: Gutiérrez, Juan, et al.
Published: (2025)
by: Gutiérrez, Juan, et al.
Published: (2025)
Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2024)
by: Sølvsten, Steffan Christ, et al.
Published: (2024)
On the thinness of trees
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
An optimal algorithm for average distance in typical regular graphs
by: Eskenazis, Alexandros, et al.
Published: (2025)
by: Eskenazis, Alexandros, et al.
Published: (2025)
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)
by: Buchbinder, Niv, et al.
Published: (2024)
Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)
by: Bhangale, Amey, et al.
Published: (2025)
Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
by: Atherton, William, et al.
Published: (2024)
by: Atherton, William, et al.
Published: (2024)
Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)
by: Mezzini, Mauro, et al.
Published: (2025)
Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)
Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)
by: De Luca, Alessandro, et al.
Published: (2025)
Similar Items
-
Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021) -
Reconfiguration of Independent Transversals
by: Buys, Pjotr, et al.
Published: (2024) -
Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020) -
Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024) -
An Allele-Centric Pan-Graph-Matrix Representation for Scalable Pangenome Analysis
by: Garrone, Roberto
Published: (2025)