The following pages link to Darren Strash (Q386906):
Displaying 36 items.
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- On the complexity of barrier resilience for fat regions (Q1796437) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- Dynamic Planar Point Location with Sub-logarithmic Local Updates (Q2842186) (← links)
- On Minimizing Crossings in Storyline Visualizations (Q2959756) (← links)
- Priority Range Trees (Q3060725) (← links)
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time (Q3060751) (← links)
- Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures (Q3066151) (← links)
- Succinct Greedy Geometric Routing in the Euclidean Plane (Q3652264) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4625103) (← links)
- Practical Minimum Cut Algorithms (Q4629534) (← links)
- (Q4633821) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4961754) (← links)
- (Q5075828) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- Engineering Kernelization for Maximum Cut (Q5147491) (← links)
- Engineering Data Reduction for Nested Dissection (Q5147532) (← links)
- Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations (Q5147534) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- Practical Minimum Cut Algorithms (Q5232722) (← links)
- Scalable Kernelization for Maximum Independent Sets (Q5232741) (← links)
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs (Q5232762) (← links)
- Scalable Edge Partitioning (Q5232768) (← links)
- Listing All Maximal Cliques in Large Sparse Real-World Graphs (Q5266538) (← links)
- Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings (Q5390616) (← links)
- (Q5874530) (← links)
- Convexity-increasing morphs of planar graphs (Q5915593) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- Simultaneous Representation of Proper and Unit Interval Graphs (Q6324098) (← links)
- Effective data reduction for the vertex clique cover problem (Q6543125) (← links)
- Solving edge clique cover exactly via synergistic data reduction (Q6657022) (← links)
