متابعة
Darren Strash
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Listing all maximal cliques in sparse graphs in near-optimal time‏
D Eppstein, M Löffler, D Strash‏
Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010‏
4652010
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‏
4642013
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‏
1232016
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‏
922019
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‏
702019
Succinct greedy geometric routing in the Euclidean plane‏
MT Goodrich, D Strash‏
Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009‏
642009
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track∗‏
D Hespe, S Lamm, C Schulz, D Strash‏
2020 proceedings of the SIAM workshop on combinatorial scientific computing …, 2020‏
62*2020
Scalable kernelization for maximum independent sets‏
D Hespe, C Schulz, D Strash‏
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019‏
542019
Accelerating local search for the maximum independent set problem‏
J Dahlum, S Lamm, P Sanders, C Schulz, D Strash, RF Werneck‏
Experimental Algorithms: 15th International Symposium, SEA 2016, St …, 2016‏
482016
Graph partitioning: Formulations and applications to big data‏
C Schulz, D Strash‏
Encyclopedia of Big Data Technologies, 1-7, 2018‏
342018
Practical minimum cut algorithms‏
M Henzinger, A Noe, C Schulz, D Strash‏
Journal of Experimental Algorithmics (JEA) 23, 1-22, 2018‏
332018
On the power of simple reductions for the maximum independent set problem‏
D Strash‏
Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho …, 2016‏
332016
Efficient maximum k-plex computation over large sparse graphs‏
L Chang, M Xu, D Strash‏
Proceedings of the VLDB Endowment 16 (2), 127-139, 2022‏
312022
Scalable edge partitioning‏
S Schlag, C Schulz, D Seemaier, D Strash‏
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019‏
302019
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‏
30*2012
Efficiently enumerating all maximal cliques with bit-parallelism‏
P San Segundo, J Artieda, D Strash‏
Computers & Operations Research 92, 37-46, 2018‏
292018
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‏
272016
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‏
26*2018
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‏
25*2010
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‏
242015
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20