The following pages link to Karsten Weihe (Q820154):
Displaying 29 items.
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
- Improved approximations for minimum cardinality quadrangulations of finite element meshes (Q826106) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time (Q1384532) (← links)
- A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
- On the cardinality of the Pareto set in bicriteria shortest path problems (Q2379876) (← links)
- Reliability and delay distributions of train connections (Q2918960) (← links)
- (Q2934672) (← links)
- Edge-disjoint routing in plane switch graphs in linear time (Q3069904) (← links)
- Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time (Q3128989) (← links)
- (Q3140410) (← links)
- (Q4268438) (← links)
- The Vertex-Disjoint Menger Problem in Planar Graphs (Q4337639) (← links)
- Mesh refinement via bidirected flows (Q4376977) (← links)
- QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES (Q4682202) (← links)
- (Q4785583) (← links)
- (Q4840776) (← links)
- (Q4860304) (← links)
- (Q4886066) (← links)
- LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS (Q4886310) (← links)
- (Q4944991) (← links)
- On the discrete core of quadrilateral mesh refinement (Q4951627) (← links)
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051) (← links)
- Workload Balancing in Multi-stage Production Processes (Q5307530) (← links)
- Parameterized and Exact Computation (Q5311508) (← links)
- Local search starting from an LP solution (Q5406199) (← links)
- Dijkstra's algorithm on-line (Q5463409) (← links)
- Reconstructing the topology of a CAD model -- a discrete approach (Q5896858) (← links)
- Reconstructing the topology of a CAD model -- a discrete approach (Q5918022) (← links)
