Darren Strash

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