default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDarren Strash
- > Home > Persons > Darren Strash
Publications
- 2013
[j4]David Eppstein, Maarten Löffler, Darren Strash
:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM J. Exp. Algorithmics 18 (2013)- [j3]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-based routing in social networks: Membership dimension and the small-world phenomenon. Theor. Comput. Sci. 514: 96-104 (2013) - 2012
- [j2]David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. 447: 44-52 (2012) - 2011
- [c7]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN 2011: 102-107 - [c6]David Eppstein, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. SEA 2011: 364-375 - [i9]David Eppstein, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. CoRR abs/1103.0318 (2011) - [i8]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). CoRR abs/1108.4675 (2011) - [i7]David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott:
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). CoRR abs/1110.4499 (2011) - 2010
- [j1]David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39(8): 3814-3829 (2010) - [c5]David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141 - [c3]David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. ISAAC (1) 2010: 403-414 - [i6]David Eppstein, Maarten Löffler, Darren Strash:
Listing all maximal cliques in sparse graphs in near-optimal time. Exact Complexity of NP-hard Problems 2010 - [i5]David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. CoRR abs/1006.5440 (2010) - [i4]David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics. CoRR abs/1009.0783 (2010) - 2009
- [c1]David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159 - 2008
- [i2]David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. CoRR abs/0812.0893 (2008)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-13 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
