Darren Strash

From MaRDI portal
Person:386906

Available identifiers

zbMath Open strash.darrenMaRDI QIDQ386906

List of research outcomes





PublicationDate of PublicationType
Solving edge clique cover exactly via synergistic data reduction2025-01-06Paper
Effective data reduction for the vertex clique cover problem2024-05-24Paper
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem2023-07-25Paper
https://portal.mardi4nfdi.de/entity/Q58745302023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q50758282022-05-11Paper
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs2021-10-05Paper
Engineering Kernelization for Maximum Cut2021-01-27Paper
Engineering Data Reduction for Nested Dissection2021-01-27Paper
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations2021-01-27Paper
On Romeo and Juliet Problems: Minimizing Distance-to-Sight.2020-08-25Paper
Convexity-increasing morphs of planar graphs2019-10-25Paper
On Romeo and Juliet problems: minimizing distance-to-sight2019-10-25Paper
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs2019-09-13Paper
Scalable Edge Partitioning2019-09-13Paper
Finding near-optimal independent sets at scale2019-09-12Paper
Practical Minimum Cut Algorithms2019-09-12Paper
Scalable Kernelization for Maximum Independent Sets2019-09-12Paper
Simultaneous Representation of Proper and Unit Interval Graphs2019-08-23Paper
https://portal.mardi4nfdi.de/entity/Q46338212019-05-06Paper
Practical Minimum Cut Algorithms2019-03-27Paper
Reconstructing Generalized Staircase Polygons with Uniform Step Length2019-02-20Paper
Convexity-increasing morphs of planar graphs2018-11-22Paper
On the complexity of barrier resilience for fat regions and bounded ply2018-10-31Paper
Reconstructing Generalized Staircase Polygons with Uniform Step Length2018-10-25Paper
On the complexity of barrier resilience for fat regions2018-10-17Paper
Efficiently enumerating all maximal cliques with bit-parallelism2018-07-12Paper
Finding near-optimal independent sets at scale2017-09-08Paper
Listing All Maximal Cliques in Large Sparse Real-World Graphs2017-06-16Paper
On Minimizing Crossings in Storyline Visualizations2017-02-10Paper
On the Power of Simple Reductions for the Maximum Independent Set Problem2016-09-02Paper
Category-based routing in social networks: membership dimension and the small-world phenomenon2013-12-11Paper
Dynamic Planar Point Location with Sub-logarithmic Local Updates2013-08-12Paper
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures2012-08-13Paper
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings2011-04-04Paper
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures2011-01-08Paper
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010-12-09Paper
Priority Range Trees2010-12-09Paper
Succinct Greedy Geometric Routing in the Euclidean Plane2009-12-17Paper

Research outcomes over time

This page was built for person: Darren Strash