No article text was recorded for this version.
lack of empirical evaluation (empirical validation gap)
Version 1 of 160 papers62 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)
- Blog: XPath for DL Ontologies
- Blog: 2-Edge Connectivity in Directed Graphs
- Blog: The Number of Spanning Trees in Regular Graphs
- Blog: Multi-priority Graph Sparsification
- Blog: Partitioning graphs into balanced components
- Blog: Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
- Blog: Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
- Blog: Faster single-source shortest paths with negative real weights via proper hop distance
- Blog: An Exponential Time 2-Approximation Algorithm for Bandwidth
- Blog: Ruling Sets in Random Order and Adversarial Streams
- Blog: Sparse Balanced Partitions and the Complexity of Subgraph Problems
- Blog: Towards a Spectrum of Graph Convolutional Networks
- Blog: An Improved Isomorphism Test for Bounded-Tree-Width Graphs
- Blog: Counting Vertex-Disjoint Shortest Paths in Graphs
- Blog: Network topology inference using information cascades with limited statistical knowledge
- Blog: Path Embeddings with Prescribed Edge in the Balanced Hypercube Network
- Blog: Influence Maximization in the Independent Cascade Model
- Blog: More powerful closure operations on graphs
- Blog: Faster Fully Dynamic Transitive Closure in Practice
- Blog: Graph Motif Problems Parameterized by Dual
- Blog: Degree Distribution of Competition-Induced Preferential Attachment Graphs
- Blog: Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
- Blog: Clustering on k-Edge-Colored Graphs
- Blog: Local Computation Algorithms for Spanners
- Blog: Morphological filtering on graphs
- Blog: Transitive-closure spanners
- Blog: The Algebraic Path Problem for Graph Metrics
- Blog: Fully Dynamic Four-Vertex Subgraph Counting
- Blog: Graph Theory versus Minimum Rank for Index Coding.
- Blog: Chain graphs for learning
- Blog: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
- Blog: Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
- Blog: On approximating the number of k-cliques in sublinear time
- Blog: Bounded max-colorings of graphs
- Blog: On mimicking networks representing minimum terminal cuts
- Blog: Maintaining a large matching and a small vertex cover
- Blog: Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
- Blog: Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
- Blog: Relation between the H-rank of a mixed graph and the rank of its underlying graph
- Blog: Gelfand’s inverse problem for the graph Laplacian
- Blog: Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Blog: Exact and approximate bandwidth
- Blog: Sort and Search: Exact algorithms for generalized domination
- Blog: PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs
- Blog: On Hashing Graphs
- Blog: Lipschitz Unimodal and Isotonic Regression on Paths and Trees
- Blog: All-distances sketches, revisited: HIP estimators for massive graphs analysis
- Blog: Equality Reasoning in Clause Graphics
- Blog: Unit interval vertex deletion: Fewer vertices are relevant
- Blog: Dynamic Matching Algorithms in Practice
- Blog: Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.
- Blog: Faster Generation of Random Spanning Trees.
- Blog: Self-similar non-clustered planar graphs as models for complex networks
- Blog: Dynamic Balanced Graph Partitioning
- Blog: Online Dominating Set
- Blog: Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models
- Blog: On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
- Blog: Improved algorithm for finding next-to-shortest paths
- Blog: An Online Algorithm for Learning a Labeling of a Graph
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_lack_of_empirical_evaluation_empirical_v_4c7b1e05,
title = {lack of empirical evaluation (empirical validation gap)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lack-of-empirical-evaluation-empirical-validation-gap/rdr_4c7b1e0577b64de3ab4aed9d845f188a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_lack_of_empirical_evaluation_empirical_v_4c7b1e05_v1,
title = {lack of empirical evaluation (empirical validation gap)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lack-of-empirical-evaluation-empirical-validation-gap/rdr_4c7b1e0577b64de3ab4aed9d845f188a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}