| Engineering Data Reduction for Nested Dissection | 0 | 0.34 | 2021 |
| WeGotYouCovered - The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. | 2 | 0.36 | 2020 |
| Finding All Global Minimum Cuts In Practice | 0 | 0.34 | 2020 |
| Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. | 0 | 0.34 | 2019 |
| Scalable Edge Partitioning. | 0 | 0.34 | 2019 |
| Simultaneous Representation of Proper and Unit Interval Graphs. | 0 | 0.34 | 2019 |
| Engineering Kernelization for Maximum Cut. | 0 | 0.34 | 2019 |
| Convexity-Increasing Morphs of Planar Graphs. | 0 | 0.34 | 2018 |
| On Romeo and Juliet Problems: Minimizing Distance-to-Sight. | 1 | 0.38 | 2018 |
| Communication-Free Massively Distributed Graph Generation | 2 | 0.37 | 2018 |
| Efficiently Enumerating all Maximal Cliques with Bit-Parallelism. | 2 | 0.39 | 2018 |
| On the complexity of barrier resilience for fat regions and bounded ply. | 0 | 0.34 | 2018 |
| Distributed Evolutionary k-way Node Separators. | 2 | 0.37 | 2017 |
| Shared Memory Parallel Subgraph Enumeration | 1 | 0.35 | 2017 |
| Scalable Kernelization for Maximum Independent Sets. | 2 | 0.42 | 2017 |
| Reconstructing Generalized Staircase Polygons with Uniform Step Length. | 0 | 0.34 | 2017 |
| Accelerating Local Search for the Maximum Independent Set Problem. | 6 | 0.44 | 2016 |
| Temporal Map Labeling: A New Unified Framework with Experiments. | 4 | 0.45 | 2016 |
| On minimizing crossings in storyline visualizations | 4 | 0.44 | 2015 |
| Finding Near-Optimal Independent Sets at Scale | 8 | 0.50 | 2015 |
| Dynamic planar point location with sub-logarithmic local updates | 3 | 0.59 | 2013 |
| On the Complexity of Barrier Resilience for Fat Regions | 2 | 0.38 | 2013 |
| Category-based routing in social networks: Membership dimension and the small-world phenomenon | 0 | 0.34 | 2011 |
| Listing All Maximal Cliques in Large Sparse Real-World Graphs | 77 | 2.07 | 2011 |
| Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) | 0 | 0.34 | 2011 |
| Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) | 0 | 0.34 | 2011 |
| Extended dynamic subgraph statistics using h-index parameterized data structures | 10 | 0.68 | 2010 |
| Listing all maximal cliques in sparse graphs in near-optimal time. | 76 | 2.40 | 2010 |
| Priority Range Trees | 0 | 0.34 | 2010 |
| Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings | 0 | 0.34 | 2010 |
| Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics | 0 | 0.34 | 2010 |
| Succinct Greedy Geometric Routing in the Euclidean Plane | 29 | 1.15 | 2009 |
| Succinct Greedy Geometric Routing in R^2 | 3 | 0.51 | 2008 |
| Linear-time algorithms for geometric graphs with sublinearly many crossings | 4 | 0.40 | 2008 |
