The following pages link to Christian Sommer (Q429667):
Displayed 18 items.
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Geometrical and topological properties of a parameterized binary relation in vector optimization (Q481049) (← links)
- A note on coloring sparse random graphs (Q1025963) (← links)
- Geometric properties of a parameterized order relation in vector optimization (Q2808323) (← links)
- A compact routing scheme and approximate distance oracle for power-law graphs (Q2933632) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Approximate Shortest Path Queries Using Voronoi Duals (Q3052756) (← links)
- Approximate Distance Queries for Weighted Polyhedral Surfaces (Q3092262) (← links)
- Compact Routing in Power-Law Graphs (Q3646238) (← links)
- On Shortest Disjoint Paths in Planar Graphs (Q3652216) (← links)
- All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing (Q4598194) (← links)
- Distance Oracles for Sparse Graphs (Q5171228) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5232446) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- Structured recursive separator decompositions for planar graphs in linear time (Q5495821) (← links)
- More Compact Oracles for Approximate Distances in Undirected Planar Graphs (Q5741748) (← links)
- (Q5743390) (← links)