Darren Strash

Citat de

	Toate	Din 2020
Referințe bibliografice	2028	1296
h-index	21	18
i10-index	31	28

300

150

225

201020112012201320142015201620172018201920202021202220232024202511 9 30 49 65 67 75 112 124 164 240 200 243 260 294 59

Acces public

Afișați-le pe toate

20 de articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Christian SchulzProfessor of Computer Science, Heidelberg UniversityAdresă de e-mail confirmată pe informatik.uni-heidelberg.de
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineAdresă de e-mail confirmată pe uci.edu
Sebastian LammKarlsruhe Institute of Technology (KIT)Adresă de e-mail confirmată pe kit.edu
Maarten LöfflerComputer Science, Utrecht UniversityAdresă de e-mail confirmată pe cs.uu.nl
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineAdresă de e-mail confirmată pe uci.edu
Peter SandersProfessor of Computer Science, Karlsruhe Institute of TechnologyAdresă de e-mail confirmată pe kit.edu
Demian HespeKarlsruhe Institute of TechnologyAdresă de e-mail confirmată pe kit.edu
Renato WerneckAmazonAdresă de e-mail confirmată pe cs.princeton.edu
Alexander NoePhD Student, University of ViennaAdresă de e-mail confirmată pe univie.ac.at
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienAdresă de e-mail confirmată pe ac.tuwien.ac.at
Matthias MnichTU HamburgAdresă de e-mail confirmată pe tuhh.de
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaAdresă de e-mail confirmată pe upc.edu
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Adresă de e-mail confirmată pe ist.ac.at
Manuel PenschuckGoethe University FrankfurtAdresă de e-mail confirmată pe ae.cs.uni-frankfurt.de
Moritz von LoozEuropean Space AgencyAdresă de e-mail confirmată pe esa.int
Ulrich MeyerProfessor of Algorithm Engineering, Goethe University FrankfurtAdresă de e-mail confirmată pe cs.uni-frankfurt.de
Mouyi XuThe University of SydneyAdresă de e-mail confirmată pe uni.sydney.edu.au
Matias KormanSiemens EDAAdresă de e-mail confirmată pe mentor.com
Lukas BarthKarlsruhe Institute of TechnologyAdresă de e-mail confirmată pe lukas-barth.net
Faisal N. Abu-KhzamProfessor of Computer Science, Lebanese American UniversityAdresă de e-mail confirmată pe lau.edu.lb

Urmăriți

Darren Strash

Hamilton College

Adresă de e-mail confirmată pe hamilton.edu - Pagina de pornire

Theoretical Computer Science Combinatorial Optimization Algorithm Engineering Geometric and Graph Algorithms


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	465	2013
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	465	2010
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	128	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	91	2019
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	74	2019
Succinct greedy geometric routing in the Euclidean plane MT Goodrich, D Strash International Symposium on Algorithms and Computation, 781-791, 2009	64	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	61*	2020
Scalable kernelization for maximum independent sets D Hespe, C Schulz, D Strash Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019	57	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	48	2016
Practical minimum cut algorithms M Henzinger, A Noe, C Schulz, D Strash Journal of Experimental Algorithmics (JEA) 23, 1-22, 2018	35	2018
Graph partitioning: Formulations and applications to big data C Schulz, D Strash Encyclopedia of Big Data Technologies, 1-7, 2018	34	2018
On the power of simple reductions for the maximum independent set problem D Strash Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho …, 2016	34	2016
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	33	2022
Scalable edge partitioning S Schlag, C Schulz, D Seemaier, D Strash 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019	31	2019
Efficiently enumerating all maximal cliques with bit-parallelism P San Segundo, J Artieda, D Strash Computers & Operations Research 92, 37-46, 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	30*	2012
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	29	2016
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	27*	2018
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	26	2015
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

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori