default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDarren Strash
Person information
- affiliation: Hamilton College, Clinton, NY, USA
SPARQL queries 
🛈 Please note that only 63% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j16]Enqiang Zhu
, Yu Zhang, Shengzhi Wang, Darren Strash, Chanjuan Liu:
A dual-mode local search algorithm for solving the minimum dominating set problem. Knowl. Based Syst. 298: 111950 (2024)- 2023
- [c34]Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson:
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. ESA 2023: 61:1-61:19 - [c33]Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. GECCO 2023: 293-302 - [i40]Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash:
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. CoRR abs/2302.00458 (2023) - [i39]Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson:
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. CoRR abs/2306.17804 (2023) - [i38]Enqiang Zhu, Yu Zhang, Shengzhi Wang, Darren Strash, Chanjuan Liu:
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem. CoRR abs/2307.16815 (2023) - [i37]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i36]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [j15]Lijun Chang, Mouyi Xu, Darren Strash:
Efficient Maximum k-Plex Computation over Large Sparse Graphs. Proc. VLDB Endow. 16(2): 127-139 (2022) - [c32]Darren Strash, Louise Thompson:
Effective Data Reduction for the Vertex Clique Cover Problem. ALENEX 2022: 41-53 - [c31]Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash:
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set. IPEC 2022: 26:1-26:18 - [p1]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - [i35]Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. CoRR abs/2208.13645 (2022) - 2021
- [j14]Shaowei Cai, Jinkun Lin, Yiyuan Wang, Darren Strash:
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. J. Artif. Intell. Res. 72: 39-67 (2021) - [c30]Lara Ost, Christian Schulz, Darren Strash:
Engineering Data Reduction for Nested Dissection. ALENEX 2021: 113-127 - [c29]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ALENEX 2021: 128-142 - 2020
- [c28]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. ALENEX 2020: 27-41 - [c27]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts in Practice. ESA 2020: 59:1-59:20 - [c26]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. CSC 2020: 1-11 - [i34]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - [i33]Lara Ost, Christian Schulz, Darren Strash:
Engineering Data Reduction for Nested Dissection. CoRR abs/2004.11315 (2020) - [i32]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. CoRR abs/2008.05180 (2020) - [i31]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. CoRR abs/2012.12594 (2020)
2010 – 2019
- 2019
- [j13]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84: 12-21 (2019) - [j12]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-increasing morphs of planar graphs. Comput. Geom. 84: 69-88 (2019) - [j11]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. ACM J. Exp. Algorithmics 24(1): 1.16:1-1.16:22 (2019) - [j10]Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131: 200-217 (2019) - [c25]Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. ALENEX 2019: 144-158 - [c24]Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. ALENEX 2019: 211-225 - [c23]Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. ESA 2019: 80:1-80:15 - [r1]Christian Schulz, Darren Strash:
Graph Partitioning: Formulations and Applications to Big Data. Encyclopedia of Big Data Technologies 2019 - [i30]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. CoRR abs/1905.10902 (2019) - [i29]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR abs/1906.01114 (2019) - [i28]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. CoRR abs/1908.06795 (2019) - [i27]Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer:
Simultaneous Representation of Proper and Unit Interval Graphs. CoRR abs/1908.08882 (2019) - 2018
- [j9]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the complexity of barrier resilience for fat regions and bounded ply. Comput. Geom. 72: 34-51 (2018) - [j8]Pablo San Segundo, Jorge Artieda, Darren Strash:
Efficiently enumerating all maximal cliques with bit-parallelism. Comput. Oper. Res. 92: 37-46 (2018) - [j7]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018) - [j6]Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. J. Graph Algorithms Appl. 22(3): 431-459 (2018) - [c22]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. ALENEX 2018: 48-61 - [c21]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. ALENEX 2018: 223-237 - [c20]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-Free Massively Distributed Graph Generation. IPDPS 2018: 336-347 - [c19]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT 2018: 6:1-6:13 - [c18]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - [i26]Pablo San Segundo, Jorge Artieda, Darren Strash:
Efficiently Enumerating all Maximal Cliques with Bit-Parallelism. CoRR abs/1801.00202 (2018) - [i25]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. CoRR abs/1802.06579 (2018) - [i24]Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. CoRR abs/1808.06411 (2018) - [i23]Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. CoRR abs/1810.10834 (2018) - 2017
- [j5]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding near-optimal independent sets at scale. J. Heuristics 23(4): 207-229 (2017) - [c17]Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. GD 2017: 88-101 - [c16]Peter Sanders, Christian Schulz, Darren Strash, Robert Williger:
Distributed evolutionary k-way node separators. GECCO 2017: 345-352 - [c15]Raphael Kimmig, Henning Meyerhenke, Darren Strash:
Shared Memory Parallel Subgraph Enumeration. IPDPS Workshops 2017: 519-529 - [i22]Peter Sanders, Christian Schulz, Darren Strash, Robert Williger:
Distributed Evolutionary k-way Node Separators. CoRR abs/1702.01692 (2017) - [i21]Raphael Kimmig, Henning Meyerhenke, Darren Strash:
Shared Memory Parallel Subgraph Enumeration. CoRR abs/1705.09358 (2017) - [i20]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. CoRR abs/1708.06127 (2017) - [i19]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. CoRR abs/1708.06151 (2017) - [i18]Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. CoRR abs/1708.09842 (2017) - [i17]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free Massively Distributed Graph Generation. CoRR abs/1710.07565 (2017) - 2016
- [c14]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. ALENEX 2016: 138-150 - [c13]Darren Strash:
On the Power of Simple Reductions for the Maximum Independent Set Problem. COCOON 2016: 345-356 - [c12]Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash:
Temporal map labeling: a new unified framework with experiments. SIGSPATIAL/GIS 2016: 23:1-23:10 - [c11]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. SEA 2016: 118-133 - [i16]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. CoRR abs/1602.01659 (2016) - [i15]Darren Strash:
On the Power of Simple Reductions for the Maximum Independent Set Problem. CoRR abs/1608.00724 (2016) - [i14]Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash:
Temporal Map Labeling: A New Unified Framework with Experiments. CoRR abs/1609.06327 (2016) - 2015
- [c10]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. GD 2015: 192-198 - [i13]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. CoRR abs/1509.00442 (2015) - [i12]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. CoRR abs/1509.00764 (2015) - 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) - [c9]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the Complexity of Barrier Resilience for Fat Regions. ALGOSENSORS 2013: 201-216 - [c8]Maarten Löffler, Joseph A. Simons, Darren Strash:
Dynamic Planar Point Location with Sub-logarithmic Local Updates. WADS 2013: 499-511 - [i11]Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash:
On the Complexity of Barrier Resilience for Fat Regions. CoRR abs/1302.4707 (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) - [i10]Maarten Löffler, Joseph A. Simons, Darren Strash:
Dynamic Planar Point Location with Sub-Logarithmic Local Updates. CoRR abs/1204.4714 (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 - [c4]Michael T. Goodrich, Darren Strash:
Priority Range Trees. ISAAC (1) 2010: 97-108 - [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) - [i3]Michael T. Goodrich, Darren Strash:
Priority Range Trees. CoRR abs/1009.3527 (2010)
2000 – 2009
- 2009
- [c2]Michael T. Goodrich, Darren Strash:
Succinct Greedy Geometric Routing in the Euclidean Plane. ISAAC 2009: 781-791 - [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) - [i1]Michael T. Goodrich, Darren Strash:
Succinct Greedy Geometric Routing in R^2. CoRR abs/0812.3893 (2008)
Coauthor Index
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-10-07 22:21 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:
