The following pages link to M. Ancona (Q1173533):
Displayed 12 items.
- Computational algorithms for hierarchically structured project networks (Q1173535) (← links)
- Optimization of LR(\(k\)) ''reduced parsers'' (Q1186566) (← links)
- (Q2771359) (← links)
- Confluent Drawing Algorithms Using Rectangular Dualization (Q3073685) (← links)
- Integrating library modules into Pascal programs (Q3321458) (← links)
- Using structured steiner trees for hierarchical global routing (Q3348418) (← links)
- A high level language based system for cross-assembler definition (Q3694679) (← links)
- Path Problems in Structured Graphs (Q3745869) (← links)
- A hypergraph-based hierarchial data structure and its applications (Q3835002) (← links)
- (Q4858943) (← links)
- (Q4944987) (← links)
- ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME (Q5249048) (← links)