Darren Strash
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
26
Venues
12
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
26 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPAIOR | A Scalable Learning Approach for Efficient Computation of Independent Set and Cover Variants. | Ryan O'Connor, Noah Coleman, Darren Strash, Saurabh Ray, Deepak Ajwani |
| 2023 | ESA | Solving Edge Clique Cover Exactly via Synergistic Data Reduction. | Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson |
| 2023 | GECCO | Finding Near-Optimal Weight Independent Sets at Scale. | Ernestine Gromann, Sebastian Lamm, Christian Schulz, Darren Strash |
| 2022 | ALENEX | Effective Data Reduction for the Vertex Clique Cover Problem. | Darren Strash, Louise Thompson |
| 2021 | ALENEX | Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. | Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdn Zavlnij |
| 2021 | ALENEX | Engineering Data Reduction for Nested Dissection. | Lara Ost, Christian Schulz, Darren Strash |
| 2020 | ALENEX | Engineering Kernelization for Maximum Cut. | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
| 2020 | ESA | Finding All Global Minimum Cuts in Practice. | Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash |
| 2019 | ALENEX | Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. | Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang |
| 2019 | ALENEX | Scalable Edge Partitioning. | Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash |
| 2019 | ESA | Simultaneous Representation of Proper and Unit Interval Graphs. | Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer |
| 2018 | ALENEX | Practical Minimum Cut Algorithms. | Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash |
| 2018 | ALENEX | Scalable Kernelization for Maximum Independent Sets. | Demian Hespe, Christian Schulz, Darren Strash |
| 2018 | WG | Convexity-Increasing Morphs of Planar Graphs. | Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash |
| 2017 | GD | Reconstructing Generalized Staircase Polygons with Uniform Step Length. | Nodari Sitchinava, Darren Strash |
| 2017 | GECCO | Distributed evolutionary | Peter Sanders, Christian Schulz, Darren Strash, Robert Williger |
| 2016 | ALENEX | Finding Near-Optimal Independent Sets at Scale. | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
| 2016 | COCOON | On the Power of Simple Reductions for the Maximum Independent Set Problem. | Darren Strash |
| 2015 | GD | On Minimizing Crossings in Storyline Visualizations. | Irina Kostitsyna, Martin Nllenburg, Valentin Polishchuk, Andr Schulz, Darren Strash |
| 2013 | Algosensors | On the Complexity of Barrier Resilience for Fat Regions. | Matias Korman, Maarten Lffler, Rodrigo I. Silveira, Darren Strash |
| 2013 | WADS | Dynamic Planar Point Location with Sub-logarithmic Local Updates. | Maarten Lffler, Joseph A. Simons, Darren Strash |
| 2010 | COCOA | Extended Dynamic Subgraph Statistics Using | David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott |
| 2010 | ISAAC | Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. | David Eppstein, Maarten Lffler, Darren Strash |
| 2010 | ISAAC | Priority Range Trees. | Michael T. Goodrich, Darren Strash |
| 2009 | ISAAC | Succinct Greedy Geometric Routing in the Euclidean Plane. | Michael T. Goodrich, Darren Strash |
| 2009 | SODA | Linear-time algorithms for geometric graphs with sublinearly many crossings. | David Eppstein, Michael T. Goodrich, Darren Strash |