Darren Strash

According to our database, Darren Strash authored at least 55 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Enqiang Zhu, Yu Zhang, Shengzhi Wang, Darren Strash, Chanjuan Liu

Knowl. Based Syst., 2024

Finding Near-Optimal Weight Independent Sets at Scale.

Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash

J. Graph Algorithms Appl., 2024

2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

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

Dagstuhl Reports, 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, 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

CoRR, 2023

Improved Exact and Heuristic Algorithms for Maximum Weight Clique.

Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash

CoRR, 2023

Solving Edge Clique Cover Exactly via Synergistic Data Reduction.

Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Efficient Maximum k-Plex Computation over Large Sparse Graphs.

Lijun Chang, Mouyi Xu, Darren Strash

Proc. VLDB Endow., 2022

The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set.

Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Effective Data Reduction for the Vertex Clique Cover Problem.

Darren Strash, Louise Thompson

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Recent Advances in Practical Data Reduction.

Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

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

Shaowei Cai, Jinkun Lin, Yiyuan Wang, Darren Strash

J. Artif. Intell. Res., 2021

Engineering Data Reduction for Nested Dissection.

Lara Ost, Christian Schulz, Darren Strash

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

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

Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

Recent Advances in Practical Data Reduction.

Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash

CoRR, 2020

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

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash

Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Finding All Global Minimum Cuts in Practice.

Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Engineering Kernelization for Maximum Cut.

Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Graph Partitioning: Formulations and Applications to Big Data.

Christian Schulz, Darren Strash

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Communication-free massively distributed graph generation.

Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz

J. Parallel Distributed Comput., 2019

Scalable Kernelization for Maximum Independent Sets.

Demian Hespe, Christian Schulz, Darren Strash

ACM J. Exp. Algorithmics, 2019

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

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash

CoRR, 2019

Convexity-increasing morphs of planar graphs.

Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash

Comput. Geom., 2019

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

Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash

Comput. Geom., 2019

Simultaneous Representation of Proper and Unit Interval Graphs.

Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Scalable Edge Partitioning.

Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

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

Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018

Reconstructing Generalized Staircase Polygons with Uniform Step Length.

Nodari Sitchinava, Darren Strash

J. Graph Algorithms Appl., 2018

Practical Minimum Cut Algorithms.

Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash

ACM J. Exp. Algorithmics, 2018

Efficiently enumerating all maximal cliques with bit-parallelism.

Pablo San Segundo, Jorge Artieda, Darren Strash

Comput. Oper. Res., 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

Communication-Free Massively Distributed Graph Generation.

Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017

Finding near-optimal independent sets at scale.

Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck

J. Heuristics, 2017

Distributed Evolutionary k-way Node Separators.

Peter Sanders, Christian Schulz, Darren Strash, Robert Williger

CoRR, 2017

Shared Memory Parallel Subgraph Enumeration.

Raphael Kimmig, Henning Meyerhenke, Darren Strash

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Distributed evolutionary <i>k</i>-way node separators.

Peter Sanders, Christian Schulz, Darren Strash, Robert Williger

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

Accelerating Local Search for the Maximum Independent Set Problem.

Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Temporal map labeling: a new unified framework with experiments.

Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

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

Darren Strash

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

On Minimizing Crossings in Storyline Visualizations.

Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

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

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

David Eppstein, Maarten Löffler, Darren Strash

ACM J. Exp. Algorithmics, 2013

Dynamic Planar Point Location with Sub-logarithmic Local Updates.

Maarten Löffler, Joseph A. Simons, Darren Strash

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Complexity of Barrier Resilience for Fat Regions.

Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash

Proceedings of the Algorithms for Sensor Systems, 2013

2012

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

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott

Theor. Comput. Sci., 2012

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

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

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

David Eppstein, Darren Strash

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010

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

David Eppstein, Michael T. Goodrich, Darren Strash

SIAM J. Comput., 2010

Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott

CoRR, 2010

Priority Range Trees.

Michael T. Goodrich, Darren Strash

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

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

David Eppstein, Maarten Löffler, Darren Strash

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Extended Dynamic Subgraph Statistics Using <i>h</i>-Index Parameterized Data Structures.

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Linear-time algorithms for geometric graphs with sublinearly many crossings.

David Eppstein, Michael T. Goodrich, Darren Strash

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Succinct Greedy Geometric Routing in the Euclidean Plane.

Michael T. Goodrich, Darren Strash

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Succinct Greedy Geometric Routing in R^2

Michael T. Goodrich, Darren Strash

CoRR, 2008