Publications¶

Papers¶

DRESS: A Continuous Framework for Structural Graph Refinement E. Castrillo. arXiv preprint, 2026. arXiv:2602.20833

DRESS and the WL Hierarchy: Climbing One Deletion at a Time E. Castrillo. Preprint, 2026. vertex-k-DRESS.pdf

Proves unconditionally that Δᵏ-DRESS distinguishes every CFI(K_{k+3}) pair for all k ≥ 0 (CFI Staircase Theorem), via the CFI Deck Separation theorem and Virtual Pebble Lemma. Also proves Δᵏ-DRESS ≥ (k+2)-WL for all graphs conditional on the WL-Deck Separation Conjecture.

Breaking Hard Isomorphism Benchmarks with DRESS E. Castrillo. Preprint, 2026. delta1-dress-hard-families.pdf

Empirical evaluation of Δ¹-DRESS on 51,816 graphs across 34 hard benchmark families (16 SRG families + 18 constructed), achieving 100% separation and resolving over 576 million non-isomorphic pairs. Establishes that Δ¹-DRESS strictly exceeds 3-WL.

Dynamic Structural Similarity on Graphs E. Castrillo, E. León, J. Gómez. arXiv preprint, 2018. arXiv:1805.01419

Fast Heuristic Algorithm for Multi-Scale Hierarchical Community Detection E. Castrillo, E. León, J. Gómez. ASONAM 2017. ACM Digital Library

High-Quality Disjoint and Overlapping Community Structure in Large-Scale Complex Networks E. Castrillo, E. León, J. Gómez. arXiv preprint, 2018. arXiv:1805.12238

Thesis¶

A fast heuristic algorithm for community detection in large-scale complex networks Eduar Castrillo. MSc thesis, Universidad Nacional de Colombia, 2018. bdigital.unal.edu.co/69933

Citing DRESS¶

If you use DRESS in your research, please cite:

@misc{castrillo2026dress,
  title   = {DRESS: A Continuous Framework for Structural Graph Refinement},
  author  = {Eduar Castrillo Velilla},
  year    = {2026},
  eprint  = {2602.20833},
  archivePrefix = {arXiv},
  primaryClass  = {cs.DS},
  url     = {https://arxiv.org/abs/2602.20833}
}