All Stories

  1. Simultaneous Representation of Proper and Unit Interval Graphs

    Article • Algorithmica, February 2025, Springer Science + Business Media

    Darren Strash

  2. A dual-mode local search algorithm for solving the minimum dominating set problem

    Article • Knowledge-Based Systems, August 2024, Elsevier

    Darren Strash

  3. Finding Near-Optimal Weight Independent Sets at Scale

    Article • July 2023, ACM (Association for Computing Machinery)

    Christian Schulz, Darren Strash

  4. A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs

    Article • Journal of Artificial Intelligence Research, September 2021, AI Access Foundation

    Darren Strash

  5. Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

    Article • January 2021, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  6. Engineering Data Reduction for Nested Dissection

    Article • January 2021, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  7. WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track

    Article • January 2020, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  8. Engineering Kernelization for Maximum Cut

    Article • January 2020, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  9. Scalable Kernelization for Maximum Independent Sets

    Article • ACM Journal of Experimental Algorithmics, December 2019, ACM (Association for Computing Machinery)

    Darren Strash

  10. Convexity-increasing morphs of planar graphs

    Article • Computational Geometry, November 2019, Elsevier

    Darren Strash

  11. On Romeo and Juliet problems: Minimizing distance-to-sight

    Article • Computational Geometry, November 2019, Elsevier

    Darren Strash

  12. Communication-free massively distributed graph generation

    Article • Journal of Parallel and Distributed Computing, September 2019, Elsevier

    Darren Strash

  13. Graph Partitioning: Formulations and Applications to Big Data

    Article • January 2019, Springer Science + Business Media

    Darren Strash

  14. Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs

    Article • January 2019, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  15. Scalable Edge Partitioning

    Article • January 2019, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  16. Practical Minimum Cut Algorithms

    Article • ACM Journal of Experimental Algorithmics, November 2018, ACM (Association for Computing Machinery)

    Darren Strash

  17. On the complexity of barrier resilience for fat regions and bounded ply

    Article • Computational Geometry, June 2018, Elsevier

    Darren Strash

  18. Communication-Free Massively Distributed Graph Generation

    Article • May 2018, Institute of Electrical & Electronics Engineers (IEEE)

    Darren Strash

  19. Efficiently enumerating all maximal cliques with bit-parallelism

    Article • Computers & Operations Research, April 2018, Elsevier

    Darren Strash

  20. Practical Minimum Cut Algorithms

    Article • January 2018, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  21. Scalable Kernelization for Maximum Independent Sets

    Article • January 2018, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  22. Convexity-Increasing Morphs of Planar Graphs

    Article • January 2018, Springer Science + Business Media

    Darren Strash

  23. Graph Partitioning: Formulations and Applications to Big Data

    Article • January 2018, Springer Science + Business Media

    Darren Strash

  24. Reconstructing Generalized Staircase Polygons with Uniform Step Length

    Article • Journal of Graph Algorithms and Applications, January 2018, Journal of Graph Algorithms and Applications

    Darren Strash

  25. Reconstructing Generalized Staircase Polygons with Uniform Step Length

    Article • January 2018, Springer Science + Business Media

    Darren Strash

  26. Distributed evolutionary k -way node separators

    Article • July 2017, ACM (Association for Computing Machinery)

    Darren Strash

  27. Finding near-optimal independent sets at scale

    Article • Journal of Heuristics, May 2017, Springer Science + Business Media

    Darren Strash

  28. Shared Memory Parallel Subgraph Enumeration

    Article • May 2017, Institute of Electrical & Electronics Engineers (IEEE)

    Darren Strash

  29. Temporal map labeling

    Article • October 2016, ACM (Association for Computing Machinery)

    Darren Strash

  30. Accelerating Local Search for the Maximum Independent Set Problem

    Article • January 2016, Springer Science + Business Media

    Darren Strash

  31. On the Power of Simple Reductions for the Maximum Independent Set Problem

    Article • January 2016, Springer Science + Business Media

    Darren Strash

  32. Finding Near-Optimal Independent Sets at Scale

    Article • December 2015, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  33. On Minimizing Crossings in Storyline Visualizations

    Article • January 2015, Springer Science + Business Media

    Darren Strash

  34. On the Complexity of Barrier Resilience for Fat Regions

    Article • December 2013, Springer Science + Business Media

    Darren Strash

  35. Listing All Maximal Cliques in Large Sparse Real-World Graphs

    Article • ACM Journal of Experimental Algorithmics, November 2013, ACM (Association for Computing Machinery)

    Darren Strash

  36. Category-based routing in social networks: Membership dimension and the small-world phenomenon

    Article • Theoretical Computer Science, November 2013, Elsevier

    Darren Strash

  37. Dynamic Planar Point Location with Sub-logarithmic Local Updates

    Article • January 2013, Springer Science + Business Media

    Darren Strash

  38. Extended dynamic subgraph statistics using h-index parameterized data structures

    Article • Theoretical Computer Science, August 2012, Elsevier

    Darren Strash

  39. Category-based routing in social networks: Membership dimension and the small-world phenomenon

    Article • October 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Darren Strash

  40. Listing All Maximal Cliques in Large Sparse Real-World Graphs

    Article • January 2011, Springer Science + Business Media

    Darren Strash

  41. Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings

    Article • SIAM Journal on Computing, January 2010, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  42. Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures

    Article • January 2010, Springer Science + Business Media

    Darren Strash

  43. Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time

    Article • January 2010, Springer Science + Business Media

    Darren Strash

  44. Priority Range Trees

    Article • January 2010, Springer Science + Business Media

    Darren Strash

  45. Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings

    Article • January 2009, Society for Industrial & Applied Mathematics (SIAM)

    Darren Strash

  46. Succinct Greedy Geometric Routing in the Euclidean Plane

    Article • January 2009, Springer Science + Business Media

    Darren Strash