The following pages link to Adil I. Erzin (Q299419):
Displaying 34 items.
- A provably tight delay-driven concurrently congestion mitigating global routing algorithm (Q299423) (← links)
- (Q1597156) (redirect page) (← links)
- A deep-submicron Steiner tree. (Q1597158) (← links)
- Variable neighborhood search variants for min-power symmetric connectivity problem (Q1652130) (← links)
- Skew minimization problem with possible sink displacement (Q1778863) (← links)
- Concurrent placement and routing in the design of integrated circuits (Q1779143) (← links)
- (Q2026166) (redirect page) (← links)
- Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks (Q2026168) (← links)
- A 3/2-approximation for big two-bar charts packing (Q2045041) (← links)
- Two-bar charts packing problem (Q2047190) (← links)
- Using VNS for the optimal synthesis of the communication tree in wireless sensor networks (Q2631223) (← links)
- (Q2885294) (← links)
- (Q2898977) (← links)
- (Q2999010) (← links)
- (Q3023484) (← links)
- (Q3115178) (← links)
- (Q3115284) (← links)
- Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks (Q3133215) (← links)
- On the density of a strip cover with identical sectors (Q3186837) (← links)
- (Q3347915) (← links)
- (Q3824438) (← links)
- (Q4891463) (← links)
- Optimal Investment in the Development of Oil and Gas Field (Q4965124) (← links)
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3 (Q5056059) (← links)
- On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem (Q5263800) (← links)
- (Q5393720) (← links)
- Covering a plane with ellipses (Q5746678) (← links)
- Efficient band monitoring with sensors outer positioning (Q5746679) (← links)
- Barrier coverage problem in 2D (Q6051503) (← links)
- Three-Bar Charts Packing Problem (Q6090762) (← links)
- Aggregation tree construction using hierarchical structures (Q6134051) (← links)
- An improved approximation for packing big two-bar charts (Q6187994) (← links)
- Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem (Q6317647) (← links)