The following pages link to Marc Benkert (Q450571):
Displaying 18 items.
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Reporting flock patterns (Q945937) (← links)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- (Q3043770) (← links)
- Algorithms for Multi-Criteria Boundary Labeling (Q3402364) (← links)
- A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem (Q3591350) (← links)
- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps (Q3595490) (← links)
- FINDING POPULAR PLACES (Q5305062) (← links)
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM (Q5322316) (← links)
- Finding Popular Places (Q5387811) (← links)
- Reporting Flock Patterns (Q5449569) (← links)
- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation (Q5449750) (← links)
- Algorithms for Multi-criteria One-Sided Boundary Labeling (Q5452228) (← links)
- Algorithms – ESA 2005 (Q5475827) (← links)
- Network Analysis (Q5703973) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897980) (← links)
