:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Zisis, Athanasios E., Sætrom, Pål
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2603.03909
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
por: Schmidt, Sebastian, et al.
Publicado: (2026)

Linear-space LCS enumeration with quadratic-time delay for two strings
por: Sakai, Yoshifumi
Publicado: (2025)

Constant time enumeration of perfect bipartite matchings
por: Fink, Jiří
Publicado: (2025)

On the enumeration of signatures of XOR-CNF's
por: Creignou, Nadia, et al.
Publicado: (2024)

Constant delay Gray code enumeration of ideals and antichains in posets
por: Brenner, Sofia, et al.
Publicado: (2026)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
por: Enright, Jessica, et al.
Publicado: (2020)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
por: Xiao, Chenglong, et al.
Publicado: (2024)

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

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

Online Drone Scheduling for Last-mile Delivery
por: Jana, Saswata, et al.
Publicado: (2024)

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

Towards an algebraic approach to the reconfiguration CSP
por: Kimura, Kei
Publicado: (2025)

Symmetry-breaking symmetry in directed spectral partitioning
por: Pasadakis, Dimosthenis, et al.
Publicado: (2025)

Constant-delay enumeration for SLP-compressed documents
por: Muñoz, Martín, et al.
Publicado: (2022)

Switching Classes: Characterization and Computation
por: Antony, Dhanyamol, et al.
Publicado: (2024)

Largest common subgraph of two forests
por: Rautenbach, Dieter, et al.
Publicado: (2024)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
por: Becchetti, Luca, et al.
Publicado: (2025)

OrderedCuts: A new approach for computing Gomory-Hu tree
por: Kolmogorov, Vladimir
Publicado: (2022)

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
por: Liu, Bowie, et al.
Publicado: (2024)

An Edge-Based Decomposition Framework for Temporal Networks
por: Oettershagen, Lutz, et al.
Publicado: (2023)

Inferring Tie Strength in Temporal Networks
por: Oettershagen, Lutz, et al.
Publicado: (2022)

Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation
por: Barkel, Mathijs, et al.
Publicado: (2025)

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

Efficient Matroid Intersection via a Batch-Update Auction Algorithm
por: Blikstad, Joakim, et al.
Publicado: (2024)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
por: Kobayashi, Yusuke, et al.
Publicado: (2024)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
por: Lindermayr, Alexander, et al.
Publicado: (2026)

Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
por: Oettershagen, Lutz, et al.
Publicado: (2024)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
por: Smart, Bridget, et al.
Publicado: (2025)

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
por: Sena, Francisco, et al.
Publicado: (2026)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
por: Chuzhoy, Julia, et al.
Publicado: (2024)

Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
por: Liu, Yang P.
Publicado: (2025)

A unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization
por: Rao, Sujit
Publicado: (2024)

Matroid Secretary via Labeling Schemes
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Search Trees on Trees via LP
por: Sadeh, Yaniv, et al.
Publicado: (2025)

Minimizing the Minimizers via Alphabet Reordering
por: Verbeek, Hilde, et al.
Publicado: (2024)

Suffix sorting via matching statistics
por: Lipták, Zsuzsanna, et al.
Publicado: (2022)

Boundaried Kernelization via Representative Sets
por: Antipov, Leonid, et al.
Publicado: (2025)

Commitment Gap via Correlation Gap
por: Chawla, Shuchi, et al.
Publicado: (2025)

Bootstrapping Dynamic APSP via Sparsification
por: Kyng, Rasmus, et al.
Publicado: (2024)