Darren Strash

Available identifiers

zbMath Open strash.darrenMaRDI QIDQ386906

List of research outcomes

Publication	Date of Publication	Type
Solving edge clique cover exactly via synergistic data reduction	2025-01-06	Paper
Effective data reduction for the vertex clique cover problem	2024-05-24	Paper
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem	2023-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q5874530	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5075828	2022-05-11	Paper
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs	2021-10-05	Paper
Engineering Kernelization for Maximum Cut	2021-01-27	Paper
Engineering Data Reduction for Nested Dissection	2021-01-27	Paper
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations	2021-01-27	Paper
On Romeo and Juliet Problems: Minimizing Distance-to-Sight.	2020-08-25	Paper
Convexity-increasing morphs of planar graphs	2019-10-25	Paper
On Romeo and Juliet problems: minimizing distance-to-sight	2019-10-25	Paper
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs	2019-09-13	Paper
Scalable Edge Partitioning	2019-09-13	Paper
Finding near-optimal independent sets at scale	2019-09-12	Paper
Practical Minimum Cut Algorithms	2019-09-12	Paper
Scalable Kernelization for Maximum Independent Sets	2019-09-12	Paper
Simultaneous Representation of Proper and Unit Interval Graphs	2019-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4633821	2019-05-06	Paper
Practical Minimum Cut Algorithms	2019-03-27	Paper
Reconstructing Generalized Staircase Polygons with Uniform Step Length	2019-02-20	Paper
Convexity-increasing morphs of planar graphs	2018-11-22	Paper
On the complexity of barrier resilience for fat regions and bounded ply	2018-10-31	Paper
Reconstructing Generalized Staircase Polygons with Uniform Step Length	2018-10-25	Paper
On the complexity of barrier resilience for fat regions	2018-10-17	Paper
Efficiently enumerating all maximal cliques with bit-parallelism	2018-07-12	Paper
Finding near-optimal independent sets at scale	2017-09-08	Paper
Listing All Maximal Cliques in Large Sparse Real-World Graphs	2017-06-16	Paper
On Minimizing Crossings in Storyline Visualizations	2017-02-10	Paper
On the Power of Simple Reductions for the Maximum Independent Set Problem	2016-09-02	Paper
Category-based routing in social networks: membership dimension and the small-world phenomenon	2013-12-11	Paper
Dynamic Planar Point Location with Sub-logarithmic Local Updates	2013-08-12	Paper
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures	2012-08-13	Paper
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings	2011-04-04	Paper
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures	2011-01-08	Paper
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time	2010-12-09	Paper
Priority Range Trees	2010-12-09	Paper
Succinct Greedy Geometric Routing in the Euclidean Plane	2009-12-17	Paper

Research outcomes over time

This page was built for person: Darren Strash