The following pages link to Norbert Zeh (Q270009):
Displaying 50 items.
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q540448) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- Low-interference networks in metric spaces of bounded doubling dimension (Q1944217) (← links)
- Maximal and convex layers of random point sets (Q2294718) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- I/O-efficient well-separated pair decomposition and applications (Q2505500) (← links)
- (Q2753938) (← links)
- (Q2768277) (← links)
- Hybridization Number on Three Rooted Binary Trees is EPT (Q2818206) (← links)
- Fixed-Parameter Algorithms for Maximum Agreement Forests (Q2862198) (← links)
- Lower Bounds for Sorted Geometric Queries in the I/O Model (Q2912825) (← links)
- (Q2934681) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths (Q3189063) (← links)
- Cache-Oblivious Red-Blue Line Segment Intersection (Q3541077) (← links)
- Geometric Algorithms for Private-Cache Chip Multiprocessors (Q3586385) (← links)
- (Q3601535) (← links)
- I/O-Efficient Planar Separators (Q3631891) (← links)
- I/O and Space-Efficient Path Traversal in Planar Graphs (Q3652302) (← links)
- (Q4418635) (← links)
- (Q4428991) (← links)
- (Q4428993) (← links)
- On External-Memory Planar Depth First Search (Q4435346) (← links)
- (Q4474222) (← links)
- (Q4511234) (← links)
- I/O-Optimal Algorithms for Outerplanar Graphs (Q4679081) (← links)
- (Q4778563) (← links)
- (Q4778580) (← links)
- (Q4828956) (← links)
- On the Advice Complexity of Buffer Management (Q4909530) (← links)
- A Space-Efficient Framework for Dynamic Point Location (Q4909571) (← links)
- Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
- Engineering a Topological Sorting Algorithm for Massive Graphs (Q5233709) (← links)
- Algorithm Theory - SWAT 2004 (Q5315368) (← links)
- Algorithm Theory - SWAT 2004 (Q5315399) (← links)
- (Q5365050) (← links)
- (Q5365152) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q5370727) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q5370728) (← links)
- I/O-efficient computation of water flow across a terrain (Q5405907) (← links)
- A topological sorting algorithm for large graphs (Q5406271) (← links)
- Geometric Spanners with Small Chromatic Number (Q5443374) (← links)
- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths (Q5449557) (← links)
- Politician’s Firefighting (Q5459155) (← links)
