The following pages link to Egon Wanke (Q261534):
Displaying 50 items.
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
- (Q826112) (redirect page) (← links)
- Competitive analysis of on-line stack-up algorithms (Q826113) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Directed NLC-width (Q906393) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- Storage controlled pile-up systems, theoretical foundations (Q1280184) (← links)
- On the decidability of certain integer subgraph problems on context-free graph languages (Q1333275) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- Movement minimization for unit distances in conveyor flow shop processing (Q1395369) (← links)
- The combinatorial complexity of masterkeying (Q1397694) (← links)
- Movement optimization in flow shop processing with buffers. (Q1403180) (← links)
- An approximation algorithm for the stack-up problem (Q1574533) (← links)
- Stack-up algorithms for palletizing at delivery industry (Q1592737) (← links)
- Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements (Q1751413) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
- Undecidability of restricted uniform recurrence equations (Q1901700) (← links)
- Emptiness problems of eNCE graph languages (Q1908340) (← links)
- Exact solutions for the Steiner path cover problem on special graph classes (Q2050271) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms (Q2284641) (← links)
- The fault-tolerant metric dimension of cographs (Q2291430) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- (Q2766682) (← links)
- Algorithms for Controlling Palletizers (Q2806926) (← links)
- (Q3140457) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- Directed Pathwidth and Palletizers (Q3467832) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- Exakte Algorithmen für schwere Graphenprobleme (Q3578291) (← links)
- (Q3795251) (← links)
- Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs (Q3826621) (← links)
- (Q3830538) (← links)
- (Q3974888) (← links)
- (Q3995732) (← links)
- (Q4037298) (← links)
- (Q4233344) (← links)
- (Q4260370) (← links)
- (Q4266530) (← links)
- (Q4281576) (← links)
- Bounded Tree-Width and LOGCFL (Q4290918) (← links)
- Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348) (← links)
