The following pages link to Frank Kammer (Q306254):
Displaying 29 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Linear-time in-place DFS and BFS on the word RAM (Q2294058) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem (Q2864311) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Space-efficient Basic Graph Algorithms (Q2955003) (← links)
- Determining the Smallest k Such That G Is k-Outerplanar (Q3527226) (← links)
- Approximation Algorithms for Intersection Graphs (Q3588413) (← links)
- The Complexity of Minimum Convex Coloring (Q3596703) (← links)
- (Q4608619) (← links)
- Space-Efficient Plane-Sweep Algorithms. (Q4636513) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- Simple 2^f-Color Choice Dictionaries (Q5091061) (← links)
- (Q5092344) (← links)
- On-the-Fly Array Initialization in Less Space (Q5136264) (← links)
- Space-Efficient Euler Partition and Bipartite Edge Coloring (Q5283378) (← links)
- Network Analysis (Q5703982) (← links)
- (Q5743430) (← links)
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area (Q5757908) (← links)
- The k-Disjoint Paths Problem on Chordal Graphs (Q5851105) (← links)
- Space-efficient graph coarsening with applications to succinct planar encodings (Q6602489) (← links)
- Space-efficient graph kernelizations (Q6636090) (← links)
