Darren Strash

According to our database1, Darren Strash authored at least 33 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Graph Partitioning: Formulations and Applications to Big Data.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Communication-free massively distributed graph generation.
J. Parallel Distrib. Comput., 2019

Simultaneous Representation of Proper and Unit Interval Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Scalable Edge Partitioning.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
Efficiently enumerating all maximal cliques with bit-parallelism.
Computers & OR, 2018

On the complexity of barrier resilience for fat regions and bounded ply.
Comput. Geom., 2018

Convexity-Increasing Morphs of Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Communication-Free Massively Distributed Graph Generation.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Scalable Kernelization for Maximum Independent Sets.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

Practical Minimum Cut Algorithms.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Shared Memory Parallel Subgraph Enumeration.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Distributed evolutionary k-way node separators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Reconstructing Generalized Staircase Polygons with Uniform Step Length.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Accelerating Local Search for the Maximum Independent Set Problem.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Temporal map labeling: a new unified framework with experiments.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

On the Power of Simple Reductions for the Maximum Independent Set Problem.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Finding Near-Optimal Independent Sets at Scale.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
On Minimizing Crossings in Storyline Visualizations.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2013
Listing All Maximal Cliques in Large Sparse Real-World Graphs.
ACM Journal of Experimental Algorithmics, 2013

Dynamic Planar Point Location with Sub-logarithmic Local Updates.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On the Complexity of Barrier Resilience for Fat Regions.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Extended dynamic subgraph statistics using h-index parameterized data structures.
Theor. Comput. Sci., 2012

2011
Listing All Maximal Cliques in Large Sparse Real-World Graphs.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Category-based routing in social networks: Membership dimension and the small-world phenomenon.
Proceedings of the International Conference on Computational Aspects of Social Networks, 2011

2010
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings.
SIAM J. Comput., 2010

Priority Range Trees.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Listing all maximal cliques in sparse graphs in near-optimal time.
Proceedings of the Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010, 2010

Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Linear-time algorithms for geometric graphs with sublinearly many crossings.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Succinct Greedy Geometric Routing in the Euclidean Plane.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009


  Loading...