Darren Strash
Title
Cited by
Cited by
Year
Listing all maximal cliques in sparse graphs in near-optimal time
D Eppstein, M Löffler, D Strash
International Symposium on Algorithms and Computation, 403-414, 2010
2782010
Listing all maximal cliques in large sparse real-world graphs
D Eppstein, D Strash
International Symposium on Experimental Algorithms, 364-375, 2011
1922011
Listing all maximal cliques in large sparse real-world graphs in near-optimal time
D Eppstein, M Löffler, D Strash
Journal of Experimental Algorithmics (JEA) 18, 3.1, 2013
1012013
Succinct greedy geometric routing in the Euclidean plane
MT Goodrich, D Strash
International Symposium on Algorithms and Computation, 781-791, 2009
572009
Finding near-optimal independent sets at scale
S Lamm, P Sanders, C Schulz, D Strash, RF Werneck
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016
502016
Accelerating local search for the maximum independent set problem
J Dahlum, S Lamm, P Sanders, C Schulz, D Strash, RF Werneck
International symposium on experimental algorithms, 118-133, 2016
242016
Communication-free massively distributed graph generation
D Funke, S Lamm, U Meyer, M Penschuck, P Sanders, C Schulz, D Strash, ...
Journal of Parallel and Distributed Computing 131, 200-217, 2019
23*2019
Extended dynamic subgraph statistics using h-index parameterized data structures
D Eppstein, MT Goodrich, D Strash, L Trott
Theoretical Computer Science 447, 44-52, 2012
20*2012
Scalable kernelization for maximum independent sets
D Hespe, C Schulz, D Strash
Journal of Experimental Algorithmics (JEA) 24 (1), 1-22, 2019
182019
Category-based routing in social networks: Membership dimension and the small-world phenomenon
D Eppstein, MT Goodrich, M Löffler, D Strash, L Trott
Theoretical Computer Science 514, 96-104, 2013
182013
On the complexity of barrier resilience for fat regions and bounded ply
M Korman, M Löffler, RI Silveira, D Strash
Computational Geometry 72, 34-51, 2018
17*2018
On the power of simple reductions for the maximum independent set problem
D Strash
International Computing and Combinatorics Conference, 345-356, 2016
162016
Temporal map labeling: a new unified framework with experiments
L Barth, B Niedermann, M Nöllenburg, D Strash
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances …, 2016
152016
Efficiently enumerating all maximal cliques with bit-parallelism
P San Segundo, J Artieda, D Strash
Computers & Operations Research 92, 37-46, 2018
142018
Graph partitioning: Formulations and applications to big data
C Schulz, D Strash
Encyclopedia of Big Data Technologies, 1-7, 2018
142018
Practical minimum cut algorithms
M Henzinger, A Noe, C Schulz, D Strash
Journal of Experimental Algorithmics (JEA) 23, 1-22, 2018
132018
Linear-time algorithms for geometric graphs with sublinearly many edge crossings
D Eppstein, MT Goodrich, D Strash
SIAM Journal on Computing 39 (8), 3814-3829, 2010
12*2010
Exactly solving the maximum weight independent set problem on large real-world graphs
S Lamm, C Schulz, D Strash, R Williger, H Zhang
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019
112019
On minimizing crossings in storyline visualizations
I Kostitsyna, M Nöllenburg, V Polishchuk, A Schulz, D Strash
International Symposium on Graph Drawing, 192-198, 2015
102015
Shared memory parallel subgraph enumeration
R Kimmig, H Meyerhenke, D Strash
2017 IEEE International Parallel and Distributed Processing Symposium …, 2017
92017
The system can't perform the operation now. Try again later.
Articles 1–20