Succinct Greedy Geometric Routing in R^2 - Michael T. Goodrich; Darren Strash (CoRR, 2008)

Succinct Greedy Geometric Routing in the Euclidean Plane. - Michael T. Goodrich; Darren Strash (ISAAC, 2009)

Linear-time algorithms for geometric graphs with sublinearly many crossings. - David Eppstein; Michael T. Goodrich; Darren Strash (SODA, 2009)

Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. - David Eppstein; Michael T. Goodrich; Darren Strash; Lowell Trott (COCOA (1), 2010)

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. - David Eppstein; Maarten Löffler; Darren Strash (ISAAC (1), 2010)

Priority Range Trees. - Michael T. Goodrich; Darren Strash (ISAAC (1), 2010)

Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics - David Eppstein; Michael T. Goodrich; Darren Strash; Lowell Trott (CoRR, 2010)

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. - David Eppstein; Michael T. Goodrich; Darren Strash (SIAM J. Comput., 2010)

Listing All Maximal Cliques in Large Sparse Real-World Graphs. - David Eppstein; Darren Strash (SEA, 2011)

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) - David Eppstein; Michael T. Goodrich; Maarten Löffler; Darren Strash; Lowell Trott (CoRR, 2011)

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) - David Eppstein; Michael T. Goodrich; Maarten Löffler; Darren Strash; Lowell Trott (CoRR, 2011)

Extended dynamic subgraph statistics using h-index parameterized data structures. - David Eppstein; Michael T. Goodrich; Darren Strash; Lowell Trott (Theor. Comput. Sci., 2012)

On the Complexity of Barrier Resilience for Fat Regions. - Matias Korman; Maarten Löffler; Rodrigo I. Silveira; Darren Strash (ALGOSENSORS, 2013)

Dynamic Planar Point Location with Sub-logarithmic Local Updates. - Maarten Löffler; Joseph A. Simons; Darren Strash (WADS, 2013)

Listing All Maximal Cliques in Large Sparse Real-World Graphs. - David Eppstein; Maarten Löffler; Darren Strash (ACM J. Exp. Algorithmics, 2013)

Category-based routing in social networks: Membership dimension and the small-world phenomenon. - David Eppstein; Michael T. Goodrich; Maarten Löffler; Darren Strash; Lowell Trott (Theor. Comput. Sci., 2013)

On Minimizing Crossings in Storyline Visualizations. - Irina Kostitsyna; Martin Nöllenburg; Valentin Polishchuk; André Schulz 001; Darren Strash (GD, 2015)

On the Power of Simple Reductions for the Maximum Independent Set Problem. - Darren Strash (COCOON, 2016)

Temporal map labeling: a new unified framework with experiments. - Lukas Barth; Benjamin Niedermann; Martin Nöllenburg; Darren Strash (SIGSPATIAL/GIS, 2016)

Accelerating Local Search for the Maximum Independent Set Problem. - Jakob Dahlum; Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Renato F. Werneck (SEA, 2016)

Distributed evolutionary k-way node separators. - Peter Sanders 001; Christian Schulz 003; Darren Strash; Robert Williger (GECCO, 2017)

Shared Memory Parallel Subgraph Enumeration. - Raphael Kimmig; Henning Meyerhenke; Darren Strash (IPDPS Workshops, 2017)

Distributed Evolutionary k-way Node Separators. - Peter Sanders 001; Christian Schulz 003; Darren Strash; Robert Williger (CoRR, 2017)

Finding near-optimal independent sets at scale. - Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Renato F. Werneck (J. Heuristics, 2017)

Communication-Free Massively Distributed Graph Generation. - Daniel Funke; Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (IPDPS, 2018)

On the complexity of barrier resilience for fat regions and bounded ply. - Matias Korman; Maarten Löffler; Rodrigo I. Silveira; Darren Strash (Comput. Geom., 2018)

Efficiently enumerating all maximal cliques with bit-parallelism. - Pablo San Segundo; Jorge Artieda; Darren Strash (Comput. Oper. Res., 2018)

Practical Minimum Cut Algorithms. - Monika Henzinger; Alexander Noe; Christian Schulz 003; Darren Strash (ACM J. Exp. Algorithmics, 2018)

Reconstructing Generalized Staircase Polygons with Uniform Step Length. - Nodari Sitchinava; Darren Strash (J. Graph Algorithms Appl., 2018)

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. - Sebastian Lamm; Christian Schulz 003; Darren Strash; Robert Williger; Huashuo Zhang (ALENEX, 2019)

Scalable Edge Partitioning. - Sebastian Schlag; Christian Schulz 003; Daniel Seemaier; Darren Strash (ALENEX, 2019)

On Romeo and Juliet problems: Minimizing distance-to-sight. - Hee-Kap Ahn; Eunjin Oh 001; Lena Schlipf; Fabian Stehn; Darren Strash (Comput. Geom., 2019)

Convexity-increasing morphs of planar graphs. - Linda Kleist; Boris Klemz; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash (Comput. Geom., 2019)

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. - Demian Hespe; Sebastian Lamm; Christian Schulz 003; Darren Strash (CoRR, 2019)

Scalable Kernelization for Maximum Independent Sets. - Demian Hespe; Christian Schulz 003; Darren Strash (ACM J. Exp. Algorithmics, 2019)

Communication-free massively distributed graph generation. - Daniel Funke; Sebastian Lamm; Ulrich Meyer 001; Manuel Penschuck; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (J. Parallel Distributed Comput., 2019)

Graph Partitioning: Formulations and Applications to Big Data. - Christian Schulz 003; Darren Strash (Encyclopedia of Big Data Technologies, 2019)

Engineering Kernelization for Maximum Cut. - Damir Ferizovic; Demian Hespe; Sebastian Lamm; Matthias Mnich; Christian Schulz 003; Darren Strash (ALENEX, 2020)

Finding All Global Minimum Cuts in Practice. - Monika Henzinger; Alexander Noe; Christian Schulz 003; Darren Strash (ESA, 2020)

WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. - Demian Hespe; Sebastian Lamm; Christian Schulz 003; Darren Strash (CSC, 2020)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (CoRR, 2020)

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. - Alexander Gellner; Sebastian Lamm; Christian Schulz 003; Darren Strash; Bogdán Zaválnij (ALENEX, 2021)

Engineering Data Reduction for Nested Dissection. - Lara Ost; Christian Schulz 003; Darren Strash (ALENEX, 2021)

A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. - Shaowei Cai 001; Jinkun Lin; Yiyuan Wang 002; Darren Strash (J. Artif. Intell. Res., 2021)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (Algorithms for Big Data, 2022)

Effective Data Reduction for the Vertex Clique Cover Problem. - Darren Strash; Louise Thompson (ALENEX, 2022)

The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set. - Ernestine Großmann; Tobias Heuer; Christian Schulz 003; Darren Strash (IPEC, 2022)

Efficient Maximum k-Plex Computation over Large Sparse Graphs. - Lijun Chang; Mouyi Xu; Darren Strash (Proc. VLDB Endow., 2022)

Solving Edge Clique Cover Exactly via Synergistic Data Reduction. - Anthony Hevia; Benjamin Kallus; Summer McClintic; Samantha Reisner; Darren Strash; Johnathan Wilson (ESA, 2023)

Improved Exact and Heuristic Algorithms for Maximum Weight Clique. - Roman Erhardt; Kathrin Hanauer; Nils M. Kriege; Christian Schulz 003; Darren Strash (CoRR, 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

Finding Near-Optimal Weight Independent Sets at Scale. - Ernestine Großmann; Sebastian Lamm; Christian Schulz 003; Darren Strash (J. Graph Algorithms Appl., 2024)

A dual-mode local search algorithm for solving the minimum dominating set problem. - Enqiang Zhu; Yu Zhang 231; Shengzhi Wang; Darren Strash; Chanjuan Liu (Knowl. Based Syst., 2024)

Simultaneous Representation of Proper and Unit Interval Graphs. - Ignaz Rutter; Darren Strash; Peter Stumpf; Michael Vollmer 001 (Algorithmica, 2025)