Darren Strash

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 63

Top Topics

Independent Set

Top Venues

Publications

Enqiang Zhu, Yu Zhang, Shengzhi Wang, Darren Strash, Chanjuan Liu
A dual-mode local search algorithm for solving the minimum dominating set problem. Knowl. Based Syst. 298 (2024)
Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. CoRR (2023)
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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Open Problems in (Hyper)Graph Decomposition. CoRR (2023)
Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. CoRR (2023)
Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash
Finding Near-Optimal Weight Independent Sets at Scale. GECCO (2023)
Enqiang Zhu, Yu Zhang, Shengzhi Wang, Darren Strash, Chanjuan Liu
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem. CoRR (2023)
Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. ESA (2023)
George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13 (8) (2023)
Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set. IPEC (2022)
Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash
Finding Near-Optimal Weight Independent Sets at Scale. CoRR (2022)
Lijun Chang, Mouyi Xu, Darren Strash
Efficient Maximum k-Plex Computation over Large Sparse Graphs. Proc. VLDB Endow. 16 (2) (2022)
Darren Strash, Louise Thompson
Effective Data Reduction for the Vertex Clique Cover Problem. ALENEX (2022)
Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ALENEX (2021)
Wolfgang Ost, Christian Schulz, Darren Strash
Engineering Data Reduction for Nested Dissection. ALENEX (2021)
Shaowei Cai, Jinkun Lin, Yiyuan Wang, Darren Strash
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. J. Artif. Intell. Res. 72 (2021)
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
Finding All Global Minimum Cuts in Practice. ESA (2020)
Wolfgang Ost, Christian Schulz, Darren Strash
Engineering Data Reduction for Nested Dissection. CoRR (2020)
Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. CoRR (2020)
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
Finding All Global Minimum Cuts In Practice. CoRR (2020)
Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
Engineering Kernelization for Maximum Cut. ALENEX (2020)
Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. CSC (2020)
Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
Recent Advances in Practical Data Reduction. CoRR (2020)
Demian Hespe, Christian Schulz, Darren Strash
Scalable Kernelization for Maximum Independent Sets. ACM J. Exp. Algorithmics 24 (1) (2019)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR (2019)
Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
Engineering Kernelization for Maximum Cut. CoRR (2019)
Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131 (2019)
Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. ALENEX (2019)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84 (2019)
Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
Simultaneous Representation of Proper and Unit Interval Graphs. CoRR (2019)
Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
Simultaneous Representation of Proper and Unit Interval Graphs. ESA (2019)
Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. CoRR (2019)
Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash
Scalable Edge Partitioning. ALENEX (2019)
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
Convexity-increasing morphs of planar graphs. Comput. Geom. 84 (2019)
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018)
Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash
On the complexity of barrier resilience for fat regions and bounded ply. Comput. Geom. 72 (2018)
Nodari Sitchinava, Darren Strash
Reconstructing Generalized Staircase Polygons with Uniform Step Length. J. Graph Algorithms Appl. 22 (3) (2018)
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
Convexity-Increasing Morphs of Planar Graphs. WG (2018)
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
Convexity-Increasing Morphs of Planar Graphs. CoRR (2018)
Demian Hespe, Christian Schulz, Darren Strash
Scalable Kernelization for Maximum Independent Sets. ALENEX (2018)
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
Practical Minimum Cut Algorithms. ALENEX (2018)
Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
Communication-Free Massively Distributed Graph Generation. IPDPS (2018)
Pablo San Segundo, Jorge Artieda, Darren Strash
Efficiently Enumerating all Maximal Cliques with Bit-Parallelism. CoRR (2018)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT (2018)
Pablo San Segundo, Jorge Artieda, Darren Strash
Efficiently enumerating all maximal cliques with bit-parallelism. Comput. Oper. Res. 92 (2018)
Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. CoRR (2018)
Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash
Scalable Edge Partitioning. CoRR (2018)
Nodari Sitchinava, Darren Strash
Reconstructing Generalized Staircase Polygons with Uniform Step Length. Graph Drawing (2017)
Peter Sanders, Christian Schulz, Darren Strash, Robert Williger
-way node separators. GECCO (2017)
Raphael Kimmig, Henning Meyerhenke, Darren Strash
Shared Memory Parallel Subgraph Enumeration. CoRR (2017)
Raphael Kimmig, Henning Meyerhenke, Darren Strash
Shared Memory Parallel Subgraph Enumeration. IPDPS Workshops (2017)
Peter Sanders, Christian Schulz, Darren Strash, Robert Williger
Distributed Evolutionary k-way Node Separators. CoRR (2017)
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
Practical Minimum Cut Algorithms. CoRR (2017)
Demian Hespe, Christian Schulz, Darren Strash
Scalable Kernelization for Maximum Independent Sets. CoRR (2017)
Nodari Sitchinava, Darren Strash
Reconstructing Generalized Staircase Polygons with Uniform Step Length. CoRR (2017)
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Finding near-optimal independent sets at scale. J. Heuristics 23 (4) (2017)
Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
Communication-free Massively Distributed Graph Generation. CoRR (2017)
Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash
Temporal Map Labeling: A New Unified Framework with Experiments. CoRR (2016)
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Accelerating Local Search for the Maximum Independent Set Problem. CoRR (2016)
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Finding Near-Optimal Independent Sets at Scale. ALENEX (2016)
Darren Strash
On the Power of Simple Reductions for the Maximum Independent Set Problem. COCOON (2016)
Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash
Temporal map labeling: a new unified framework with experiments. SIGSPATIAL/GIS (2016)
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Accelerating Local Search for the Maximum Independent Set Problem. SEA (2016)
Darren Strash
On the Power of Simple Reductions for the Maximum Independent Set Problem. CoRR (2016)
Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Finding Near-Optimal Independent Sets at Scale. CoRR (2015)
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash
On Minimizing Crossings in Storyline Visualizations. Graph Drawing (2015)
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash
On Minimizing Crossings in Storyline Visualizations. CoRR (2015)
David Eppstein, Maarten Löffler, Darren Strash
Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM J. Exp. Algorithmics 18 (2013)
Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash
On the Complexity of Barrier Resilience for Fat Regions CoRR (2013)
Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash
On the Complexity of Barrier Resilience for Fat Regions. ALGOSENSORS (2013)
Maarten Löffler, Joseph A. Simons, Darren Strash
Dynamic Planar Point Location with Sub-logarithmic Local Updates. WADS (2013)
David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
Category-based routing in social networks: Membership dimension and the small-world phenomenon. Theor. Comput. Sci. 514 (2013)
Maarten Löffler, Joseph A. Simons, Darren Strash
Dynamic Planar Point Location with Sub-Logarithmic Local Updates CoRR (2012)
David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. 447 (2012)
David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN (2011)
David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) CoRR (2011)
David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) CoRR (2011)
David Eppstein, Darren Strash
Listing All Maximal Cliques in Large Sparse Real-World Graphs CoRR (2011)
David Eppstein, Darren Strash
Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA (2011)
David Eppstein, Maarten Löffler, Darren Strash
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time CoRR (2010)
David Eppstein, Maarten Löffler, Darren Strash
Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems (2010)
David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics CoRR (2010)
David Eppstein, Michael T. Goodrich, Darren Strash
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39 (8) (2010)
Michael T. Goodrich, Darren Strash
Priority Range Trees. ISAAC (1) (2010)
David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
-Index Parameterized Data Structures. COCOA (1) (2010)
David Eppstein, Maarten Löffler, Darren Strash
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) (2010)
Michael T. Goodrich, Darren Strash
Priority Range Trees CoRR (2010)
David Eppstein, Michael T. Goodrich, Darren Strash
Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA (2009)
Michael T. Goodrich, Darren Strash
Succinct Greedy Geometric Routing in the Euclidean Plane. ISAAC (2009)
David Eppstein, Michael T. Goodrich, Darren Strash
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings CoRR (2008)
Michael T. Goodrich, Darren Strash
Succinct Greedy Geometric Routing in R^2 CoRR (2008)