:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Ikenmeyer, Christian, Moosbauer, Jakob
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2503.05467
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster Convolutions: Yates and Strassen Revisited
por: Brand, Cornelius, et al.
Publicado: (2025)

Practical algorithms for Hierarchical overlap graphs
por: Talera, Saumya, et al.
Publicado: (2024)

Faster algorithms for packing forests in graphs and related problems
por: Arkhipov, Pavel, et al.
Publicado: (2024)

A customizable inexact subgraph matching algorithm for attributed graphs
por: Benko, Tatyana, et al.
Publicado: (2025)

Reconstruction of geometric random graphs with the Simple algorithm
por: Stegehuis, Clara, et al.
Publicado: (2024)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
por: Rosenke, Christian, et al.
Publicado: (2026)

Dynamic algorithms for k-center on graphs
por: Cruciani, Emilio, et al.
Publicado: (2023)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
por: Chalopin, Jérémie, et al.
Publicado: (2025)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
por: Grigoriev, Alexander, et al.
Publicado: (2025)

Advances in Exact and Approximate Group Closeness Centrality Maximization
por: Schulz, Christian, et al.
Publicado: (2026)

Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
por: Maier, Jakob, et al.
Publicado: (2025)

Fast exact algorithms via the Matrix Tree Theorem
por: Arvind, V., et al.
Publicado: (2025)

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
por: Berthe, Gaétan, et al.
Publicado: (2023)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
por: Biedl, Therese
Publicado: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
por: Daga, Mohit
Publicado: (2025)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
por: Wesołowski, Adam, et al.
Publicado: (2025)

The clustered Sparrow algorithm
por: Dumitrescu, Cristian
Publicado: (2018)

Layered Graph Drawing with Few Gaps and Few Crossings
por: Dobler, Alexander, et al.
Publicado: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
por: Dupont-Bouillard, Alexandre
Publicado: (2026)

Streaming algorithms for products of probabilities
por: Lohrey, Markus, et al.
Publicado: (2025)

Parameterized algorithms for $k$-Inversion
por: Antony, Dhanyamol, et al.
Publicado: (2026)

The graph alignment problem: fundamental limits and efficient algorithms
por: Ganassali, Luca
Publicado: (2024)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Undirected Replacement Paths: Dual Fault Reduces to Single Source
por: Nogler, Jakob, et al.
Publicado: (2026)

A practical algorithm for 3-admissibility
por: Awofeso, Christine, et al.
Publicado: (2025)

New algorithms for girth and cycle detection
por: Roditty, Liam, et al.
Publicado: (2025)

Engineering Semi-streaming DFS algorithms
por: Bhagavan, Kancharla Nikhilesh, et al.
Publicado: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
por: Leonhardt, Alexander, et al.
Publicado: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

Faster parameterized algorithm for 3-Hitting Set
por: Tsur, Dekel
Publicado: (2025)

An FPT algorithm for Matching Cut and d-cut
por: Aravind, N R, et al.
Publicado: (2021)

Optimal bounds on a tree inference algorithm
por: Gardiner, Jack, et al.
Publicado: (2024)

Hardness of Dynamic Tree Edit Distance and Friends
por: Hu, Bingbing, et al.
Publicado: (2025)

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
por: Pfrommer, Jakob, et al.
Publicado: (2022)

The Communication Complexity of Pattern Matching with Edits Revisited
por: Kociumaka, Tomasz, et al.
Publicado: (2026)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
por: Lachish, Oded, et al.
Publicado: (2026)

An efficient recursive decomposition algorithm for undirected graphs
por: Heng, Pei, et al.
Publicado: (2026)