Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Darren Strash
Observed names:
Dr. Darren Strash,
Strash, D.,
Strash, Darren
Institution:
Hamilton College
Observed institutions:
Karlsruhe Institute of Technology,
Hamilton College,
University of California, Irvine,
University of California System,
Colgate University
ORCID:
0000-0001-7095-8749
Observed ORCID:
0000-0001-7095-8749
OpenAlex ID:
A5066225806
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
2010
·
David Eppstein
, Maarten Löffler
, et al.
·
Lecture notes in computer science
·
370
Listing All Maximal Cliques in Large Sparse Real-World Graphs
2013
·
David Eppstein
, Maarten Löffler
, et al.
·
ACM Journal of Experimental Algorithmics
·
236
Listing All Maximal Cliques in Large Sparse Real-World Graphs
2011
·
David Eppstein
, Darren Strash
·
Lecture notes in computer science
·
158
Finding Near-Optimal Independent Sets at Scale
2015
·
Sebastian Lamm
, Peter Sanders
, et al.
·
Journal of Heuristics
·
122
PDF
Communication-Free Massively Distributed Graph Generation
2018
·
Daniel Funke
, Sebastian Lamm
, et al.
·
Journal of Parallel and Distributed Computing
·
85
PDF
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
2019
·
Sebastian Lamm
, Christian Schulz
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
73
PDF
Scalable Kernelization for Maximum Independent Sets
2019
·
Demian Hespe
, Christian Schulz
, et al.
·
ACM Journal of Experimental Algorithmics
·
57
PDF
Succinct Greedy Geometric Routing in the Euclidean Plane
2009
·
Michael T. Goodrich
, Darren Strash
·
Lecture notes in computer science
·
54
PDF
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track
2020
·
Demian Hespe
, Sebastian Lamm
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
44
Accelerating Local Search for the Maximum Independent Set Problem
2016
·
Jakob Dahlum
, Sebastian Lamm
, et al.
·
Lecture notes in computer science
·
37
Efficient maximum k -plex computation over large sparse graphs
2022
·
Lijun Chang
, Mouyi Xu
, et al.
·
Proceedings of the VLDB Endowment
·
35
Scalable Edge Partitioning
2019
·
Sebastian Schlag
, Christian Schulz
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
33
PDF
Efficiently enumerating all maximal cliques with bit-parallelism
2017
·
Pablo San Segundo
, Jorge Artieda
, et al.
·
Computers & Operations Research
·
32
PDF
Listing All Maximal Cliques in Large Sparse Real-World Graphs
2011
·
Eppstein, David
, Strash, Darren
·
arXiv (Cornell University)
·
30
PDF
Practical Minimum Cut Algorithms
2018
·
Monika Henzinger
, Alexander Noe
, et al.
·
ACM Journal of Experimental Algorithmics
·
28
PDF
On the Power of Simple Reductions for the Maximum Independent Set Problem
2016
·
Darren Strash
·
Lecture notes in computer science
·
24
PDF
On Minimizing Crossings in Storyline Visualizations
2015
·
Irina Kostitsyna
, Martin Nöllenburg
, et al.
·
Lecture notes in computer science
·
24
PDF
Graph Partitioning: Formulations and Applications to Big Data
2018
·
Christian Schulz
, Darren Strash
·
Springer eBooks
·
23
Extended dynamic subgraph statistics using h -index parameterized data structures
2011
·
David Eppstein
, Michael T. Goodrich
, et al.
·
Theoretical Computer Science
·
22
Temporal map labeling
2016
·
Lukas Barth
, Benjamin Niedermann
, et al.
·
ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS)
·
21
Engineering Kernelization for Maximum Cut
2019
·
Damir Ferizovic
, Demian Hespe
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
20
PDF
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
2021
·
Alexander Gellner
, Sebastian Lamm
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
18
PDF
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
2010
·
Eppstein, David
, Löffler, Maarten
, et al.
·
arXiv (Cornell University)
·
16
PDF
Scalable Kernelization for Maximum Independent Sets
2018
·
Demian Hespe
, Christian Schulz
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
15
PDF
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
2010
·
David Eppstein
, Michael T. Goodrich
, et al.
·
SIAM Journal on Computing
·
15
PDF
Show more works
View as search
Works count:
87
Citation count:
1,857
H-index:
20
I10-index:
34
Year
Topic
Type
