:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Pasadakis, Dimosthenis, Steiner, Raphael S., Papp, Pál András, Böhnlein, Toni, Yzelman, Albert-Jan N.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2508.16173
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximate Realizations for Outerplanaric Degree Sequences
by: Bar-Noy, Amotz, et al.
Published: (2024)

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions
by: Papp, Pál András, et al.
Published: (2025)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
by: Böhnlein, Toni, et al.
Published: (2024)

Replication in Graph Partitioning and Scheduling Problems
by: Papp, Pál András, et al.
Published: (2026)

Short circuit walks in fixed dimension
by: Black, Alexander E., et al.
Published: (2025)

Efficient Parallel Scheduling for Sparse Triangular Solvers
by: Böhnlein, Toni, et al.
Published: (2025)

Degree Realization by Bipartite Cactus Graphs
by: Bar-Noy, Amotz, et al.
Published: (2025)

Complexity of polytope diameters via perfect matchings
by: Nöbel, Christian, et al.
Published: (2024)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
by: Gerlach, Raphael, et al.
Published: (2024)

String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)

Graph matching based on similarities in structure and attributes
by: Candelier, Raphaël
Published: (2024)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
by: Harris, David G., et al.
Published: (2017)

Computing Flows in Subquadratic Space
by: Brand, Jan van den, et al.
Published: (2026)

KeBaB: $k$-mer based breaking for finding long MEMs
by: Brown, Nathaniel K., et al.
Published: (2025)

Efficient algorithm for linear diophantine equations in two variables
by: Deora, Mayank, et al.
Published: (2025)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

Ultrabubble enumeration via a lowest common ancestor approach
by: Zisis, Athanasios E., et al.
Published: (2026)

Longest Common Extension of a Dynamic String in Parallel Constant Time
by: Albert, Daniel
Published: (2026)

An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
by: Mastikhina, Anna, et al.
Published: (2024)

Nonlinear spectral clustering with C++ GraphBLAS
by: Pasadakis, Dimosthenis, et al.
Published: (2026)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2024)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
by: Kothalawala, Buddhi, et al.
Published: (2026)

String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)

An FPRAS for two terminal reliability in directed acyclic graphs
by: Feng, Weiming, et al.
Published: (2023)

A Quantum Constraint Generation Framework for Binary Linear Programs
by: Czégel, András, et al.
Published: (2025)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)

A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost
by: Biswas, Umesh, et al.
Published: (2025)

Similarity analysis of DNA sequences through local distribution of nucleotides in strategic neighborhood
by: Mondal, Probir, et al.
Published: (2023)

Spectral partitioning of graphs into compact, connected regions
by: Davies, Ewan, et al.
Published: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
by: Clifford, Peter, et al.
Published: (2026)

Finding the diameter of a tree with distance queries
by: Gerbner, Dániel, et al.
Published: (2025)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
by: Crane, Alex, et al.
Published: (2026)

Data reduction for directed feedback vertex set on graphs without long induced cycles
by: Dirks, Jona, et al.
Published: (2023)

A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
by: Chen, Yanlin, et al.
Published: (2024)

Differentially Private Continual Release of Histograms and Related Queries
by: Henzinger, Monika, et al.
Published: (2023)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
by: Henzinger, Monika, et al.
Published: (2024)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
by: Jaberi, Raed, et al.
Published: (2024)

Efficient Trace Frequency Queries in Sparse Graphs
by: Awofeso, Christine, et al.
Published: (2025)