| Listing all maximal cliques in sparse graphs in near-optimal time D Eppstein, M Löffler, D Strash arXiv preprint arXiv:1006.5440, 2010 | 391 | 2010 |
| 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 | 384 | 2013 |
| 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 | 82 | 2016 |
| 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 | 70 | 2019 |
| Succinct greedy geometric routing in the Euclidean plane MT Goodrich, D Strash Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009 | 60 | 2009 |
| 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 | 41* | 2020 |
| 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 | 39 | 2019 |
| 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 | 39 | 2016 |
| Scalable kernelization for maximum independent sets D Hespe, C Schulz, D Strash Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019 | 36 | 2019 |
| Graph partitioning: Formulations and applications to big data C Schulz, D Strash Encyclopedia of Big Data Technologies, 1-7, 2018 | 30 | 2018 |
| 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 | 28* | 2012 |
| On the power of simple reductions for the maximum independent set problem D Strash Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho …, 2016 | 26 | 2016 |
| Practical minimum cut algorithms M Henzinger, A Noe, C Schulz, D Strash Journal of Experimental Algorithmics (JEA) 23, 1-22, 2018 | 25 | 2018 |
| Scalable edge partitioning S Schlag, C Schulz, D Seemaier, D Strash 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019 | 24 | 2019 |
| Efficiently enumerating all maximal cliques with bit-parallelism P San Segundo, J Artieda, D Strash Computers & Operations Research 92, 37-46, 2018 | 24 | 2018 |
| 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 | 22* | 2018 |
| 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 | 22 | 2016 |
| 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 | 21* | 2010 |
| 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 | 20 | 2013 |
| Shared memory parallel subgraph enumeration R Kimmig, H Meyerhenke, D Strash 2017 IEEE International Parallel and Distributed Processing Symposium …, 2017 | 15 | 2017 |
Christian SchulzProfessor of Computer Science, Heidelberg UniversityVerified email at informatik.uni-heidelberg.de
