Pages that link to "Item:Q5232715"
From MaRDI portal
The following pages link to 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Q5232715):
Displayed 19 items.
- Hybrid Indexing Revisited (Q5232716) (← links)
- Simple, Fast and Lightweight Parallel Wavelet Tree Construction (Q5232717) (← links)
- Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (Q5232720) (← links)
- Adaptive Cuckoo Filters (Q5232721) (← links)
- Practical Minimum Cut Algorithms (Q5232722) (← links)
- Faster Approximation Algorithm for the <i>k</i>-Regret Minimizing Set and Related Problems (Q5232723) (← links)
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly (Q5232724) (← links)
- Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data (Q5232725) (← links)
- Computing Floods Caused by Non-Uniform Sea-Level Rise (Q5232727) (← links)
- Grid peeling and the affine curve-shortening flow (Q5232728) (← links)
- Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice (Q5232730) (← links)
- A Geometric Heuristic for Rectilinear Crossing Minimization (Q5232732) (← links)
- A Generic Framework for Engineering Graph Canonization Algorithms (Q5232733) (← links)
- Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings (Q5232735) (← links)
- Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study (Q5232736) (← links)
- Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs (Q5232737) (← links)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing (Q5232738) (← links)
- Scaling up Group Closeness Maximization (Q5232740) (← links)
- Scalable Kernelization for Maximum Independent Sets (Q5232741) (← links)