:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Cabello, Sergio
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2502.16193
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair densest subgraph across multiple graphs
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)

Cover time of random subgraphs of the hypercube
by: Cooper, Colin, et al.
Published: (2025)

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

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
by: Tu, Sijing, et al.
Published: (2025)

Delaunay Triangulations with Predictions
by: Cabello, Sergio, et al.
Published: (2026)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
by: Bodlaender, Hans L., et al.
Published: (2025)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
by: Cabello, Sergio, et al.
Published: (2021)

Compression with wildcards: All induced metric subgraphs
by: Wild, Marcel
Published: (2024)

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

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)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
by: Tsin, Yung H.
Published: (2023)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
by: Bonnet, Édouard, et al.
Published: (2026)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
by: Lokshtanov, Daniel, et al.
Published: (2026)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
by: Blank, Lotte, et al.
Published: (2025)

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

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

Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)

On the instance optimality of detecting collisions and subgraphs
by: Ben-Eliezer, Omri, et al.
Published: (2023)

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

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
by: Cabello, Sergio, et al.
Published: (2025)

Testing frequency distributions in a stream
by: Mathieu, Claire, et al.
Published: (2023)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025)

Testing Connectedness of Images
by: Berman, Piotr, et al.
Published: (2023)

Local certification of forbidden subgraphs
by: Bousquet, Nicolas, et al.
Published: (2024)

Sequential Testing with Subadditive Costs
by: Harris, Blake, et al.
Published: (2025)

Property Testing of Computational Networks
by: Czumaj, Artur, et al.
Published: (2025)

Tolerant Testing for Unique Games
by: Yoshida, Yuichi
Published: (2026)

Testing Intersectingness of Uniform Families
by: Haviv, Ishay, et al.
Published: (2024)

Testing Distributions of Huge Objects
by: Goldreich, Oded, et al.
Published: (2022)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
by: Chen, Xi, et al.
Published: (2024)

Homomorphism Testing with Resilience to Online Manipulations
by: Kelman, Esty, et al.
Published: (2025)

Distribution Testing Meets Sum Estimation
by: Pradhan, Pinki, et al.
Published: (2025)

Testing Depth First Search Numbering
by: Czumaj, Artur, et al.
Published: (2025)

Equivalence Testing: The Power of Bounded Adaptivity
by: Chakraborty, Diptarka, et al.
Published: (2024)

Testing Sparse Functions over the Reals
by: Arora, Vipul, et al.
Published: (2026)

Testing Graph Properties with the Container Method
by: Blais, Eric, et al.
Published: (2023)