The following pages link to Evripidis Bampis (Q398883):
Displayed 50 items.
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
- A note on scheduling to meet two min-sum objectives (Q2643821) (← links)
- Scheduling on Power-Heterogeneous Processors (Q2802926) (← links)
- Truthfulness for the Sum of Weighted Completion Times (Q2817845) (← links)
- Clustering on k-Edge-Colored Graphs (Q2849897) (← links)
- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines (Q2894449) (← links)
- On Multiprocessor Temperature-Aware Scheduling Problems (Q2897990) (← links)
- Speed Scaling for Maximum Lateness (Q2914308) (← links)
- Throughput Maximization in Multiprocessor Speed-Scaling (Q2942633) (← links)
- Speed-Scaling with No Preemptions (Q2942634) (← links)
- (Q2963934) (← links)
- (Q2965471) (← links)
- (Q3059324) (← links)
- Bounded Max-colorings of Graphs (Q3060747) (← links)
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- Min-Power Covering Problems (Q3459876) (← links)
- On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines (Q3557007) (← links)
- (Q4427860) (← links)
- (Q4472467) (← links)
- The complexity of short schedules for uet bipartite graphs (Q4497865) (← links)
- On the parallel complexity of the alternating Hamiltonian cycle problem (Q4497876) (← links)
- (Q4501554) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- Optimal schedules for d-D grid graphs with communication delays (Q4593968) (← links)
- On the Complexity of Minimizing the Total Calibration Cost (Q4632198) (← links)
- Speed Scaling on Parallel Processors with Migration (Q4649807) (← links)
- Computing and Combinatorics (Q4681180) (← links)
- (Q4796176) (← links)
- (Q4813032) (← links)
- (Q4817407) (← links)
- (Q4892336) (← links)
- Green Scheduling, Flows and Matchings (Q4909527) (← links)
- Throughput Maximization for Speed-Scaling with Agreeable Deadlines (Q4922109) (← links)
- From Preemptive to Non-preemptive Speed-Scaling Scheduling (Q4925232) (← links)
- (Q4945672) (← links)
- (Q5075745) (← links)
- (Q5092381) (← links)
- (Q5116470) (← links)
- Structural Information and Communication Complexity (Q5315217) (← links)
- Fundamentals of Computation Theory (Q5492939) (← links)
- Computing and Combinatorics (Q5716948) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897567) (← links)
- Fundamentals of Computation Theory (Q5900784) (← links)
- Scheduling independent multiprocessor tasks (Q5957575) (← links)
- Some models for scheduling parallel programs with communication delays (Q5961603) (← links)
- Online 2-stage stable matching (Q6069183) (← links)
- (Q6075894) (← links)
- Online TSP with known locations (Q6138990) (← links)