( en | de | ru )

 

Disambiguation of "Strash, Darren"

Author of the publication

copydeleteadd this publication to your clipboard
Shared Memory Parallel Subgraph Enumeration.

, , and . IPDPS Workshops, page 519-529. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Darren Gould

Darren Goins

Darren Croton

Darren Parker

Darren Dancey

 

Other publications of authors with the same name

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings, , and . CoRR, (2008)Extended dynamic subgraph statistics using h-index parameterized data structures., , , and . Theor. Comput. Sci., (2012)Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures., , , and . COCOA (1), volume 6508 of Lecture Notes in Computer Science, page 128-141. Springer, (2010)Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations., , , , and . CoRR, (2020)Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics, , , and . CoRR, (2010)Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs., , , , and . ALENEX, page 144-158. SIAM, (2019)Scalable Kernelization for Maximum Independent Sets., , and . ACM J. Exp. Algorithmics, 24 (1): 1.16:1-1.16:22 (2019)Solving Edge Clique Cover Exactly via Synergistic Data Reduction., , , , , and . ESA, volume 274 of LIPIcs, page 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Effective Data Reduction for the Vertex Clique Cover Problem., and . ALENEX, page 41-53. SIAM, (2022)Engineering Kernelization for Maximum Cut., , , , , and . ALENEX, page 27-41. SIAM, (2020)