The following pages link to Ekkehard Köhler (Q264184):
Displaying 50 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- The \(k\)-splittable flow problem (Q818654) (← links)
- Approximating earliest arrival flows with flow-dependent transit times (Q867858) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- Edge elimination and weighted graph classes (Q2110614) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs (Q2706129) (← links)
- (Q2741346) (← links)
- (Q2766687) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- (Q2816022) (← links)
- (Q3044328) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Eccentricity Approximating Trees (Q3181054) (← links)
- Line-Distortion, Bandwidth and Path-Length of a Graph (Q3188891) (← links)
- Linear Time LexDFS on Cocomparability Graphs. (Q3188906) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- The Maximum Energy-Constrained Dynamic Flow Problem (Q3512452) (← links)
- (Q3574261) (← links)
- Length-Bounded Cuts and Flows (Q3613800) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- (Q4411349) (← links)
- (Q4411394) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- (Q4448763) (← links)
- (Q4778564) (← links)
- (Q4828930) (← links)
- (Q4944993) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
- (Q5226833) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311133) (← links)
- Flows over Time with Load-Dependent Transit Times (Q5317544) (← links)
- Higher‐Dimensional Packing with Order Constraints (Q5426891) (← links)
- Benchmarks for Strictly Fundamental Cycle Bases (Q5432326) (← links)
- Linear Orderings of Subfamilies of AT‐Free Graphs (Q5470820) (← links)
- (Q5706101) (← links)
- Experimental and Efficient Algorithms (Q5710012) (← links)
- (Q5874479) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897552) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
- The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs (Q6530827) (← links)
