Evripidis Bampis

From MaRDI portal
(Redirected from Person:398883)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Competitive query minimization for stable matching with one-sided uncertainty2025-10-06Paper
Non-clairvoyant makespan minimization scheduling with predictions2025-07-24Paper
Learning-augmented online TSP on rings, trees, flowers and (almost) everywhere else2025-01-06Paper
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament2024-07-05Paper
On the parallel complexity of the alternating Hamiltonian cycle problem2024-07-05Paper
Online TSP with known locations
Lecture Notes in Computer Science
2024-01-16Paper
NC algorithms for antidirected hamiltonian paths and cycles in tournaments
Graph-Theoretic Concepts in Computer Science
2024-01-05Paper
Online 2-stage stable matching
Discrete Applied Mathematics
2023-11-13Paper
scientific article; zbMATH DE number 7740865 (Why is no real title available?)
(available as arXiv preprint)
2023-09-20Paper
Canadian traveller problem with predictions
Approximation and Online Algorithms
2023-07-25Paper
Target-based computer-assisted orchestration: complexity and approximation algorithms
European Journal of Operational Research
2022-09-29Paper
Online learning for min-max discrete problems
Theoretical Computer Science
2022-08-25Paper
scientific article; zbMATH DE number 7561666 (Why is no real title available?)2022-07-21Paper
scientific article; zbMATH DE number 7525448 (Why is no real title available?)2022-05-11Paper
Multistage knapsack
Journal of Computer and System Sciences
2022-03-29Paper
LP-based algorithms for multistage minimization problems
(available as arXiv preprint)
2022-03-22Paper
A simple rounding scheme for multistage optimization
Theoretical Computer Science
2022-02-21Paper
Calibrations scheduling with arbitrary lengths and activation length
Journal of Scheduling
2022-01-14Paper
Scheduling independent multiprocessor tasks
1477.68043
2021-12-20Paper
Online multistage subset maximization problems
Algorithmica
2021-07-26Paper
Online multistage subset maximization problems
Algorithmica
2021-07-26Paper
scientific article; zbMATH DE number 7238962 (Why is no real title available?)2020-08-25Paper
Correction to: approximation and online algorithms2020-08-24Paper
Speed scaling on parallel processors with migration
Journal of Combinatorial Optimization
2019-06-25Paper
On the Complexity of Minimizing the Total Calibration Cost
Frontiers in Algorithmics
2019-04-26Paper
Parameterized power vertex cover
Discrete Mathematics and Theoretical Computer Science. DMTCS
2018-12-10Paper
Energy-efficient scheduling and routing via randomized rounding
Journal of Scheduling
2018-11-07Paper
Throughput maximization for speed scaling with agreeable deadlines
Journal of Scheduling
2018-02-28Paper
Non-preemptive throughput maximization for speed-scaling with power-down2018-01-11Paper
Scheduling on power-heterogeneous processors
Information and Computation
2017-11-16Paper
Optimal schedules for d-D grid graphs with communication delays
STACS 96
2017-11-16Paper
Throughput maximization in the speed-scaling setting
(available as arXiv preprint)
2017-03-03Paper
Energy efficient scheduling and routing via randomized rounding
(available as arXiv preprint)
2017-02-21Paper
Parameterized power vertex cover
Lecture Notes in Computer Science
2016-12-22Paper
Clustering on \(k\)-edge-colored graphs
Discrete Applied Mathematics
2016-11-02Paper
Truthfulness for the sum of weighted completion times
Lecture Notes in Computer Science
2016-09-02Paper
Scheduling on power-heterogeneous processors
LATIN 2016: Theoretical Informatics
2016-05-03Paper
Throughput maximization in multiprocessor speed-scaling
Theoretical Computer Science
2016-05-02Paper
Speed scaling for maximum lateness
Theory of Computing Systems
2016-03-09Paper
Min-Power Covering Problems
Algorithms and Computation
2016-01-11Paper
Speed-scaling with no preemptions
Algorithms and Computation
2015-09-11Paper
Throughput Maximization in Multiprocessor Speed-Scaling
Algorithms and Computation
2015-09-11Paper
Green scheduling, flows and matchings
Theoretical Computer Science
2015-05-18Paper
From preemptive to non-preemptive speed-scaling scheduling
Discrete Applied Mathematics
2014-12-05Paper
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
Discrete Applied Mathematics
2014-08-26Paper
On multiprocessor temperature-aware scheduling problems
Journal of Scheduling
2014-08-18Paper
Optimal data placement on networks with a constant number of clients
Theoretical Computer Science
2014-06-06Paper
Bounded max-colorings of graphs
Journal of Discrete Algorithms
2014-04-28Paper
Clustering on k-Edge-Colored Graphs
Mathematical Foundations of Computer Science 2013
2013-09-20Paper
From preemptive to non-preemptive speed-scaling scheduling
Lecture Notes in Computer Science
2013-06-11Paper
Throughput maximization for speed-scaling with agreeable deadlines
Lecture Notes in Computer Science
2013-05-28Paper
Green scheduling, flows and matchings
Algorithms and Computation
2013-03-21Paper
Speed scaling on parallel processors with migration
Euro-Par 2012 Parallel Processing
2012-11-14Paper
Speed scaling on parallel processors with migration
Euro-Par 2012 Parallel Processing
2012-11-14Paper
Speed scaling for maximum lateness
Lecture Notes in Computer Science
2012-09-25Paper
On multiprocessor temperature-aware scheduling problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
2012-07-16Paper
Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
LATIN 2012: Theoretical Informatics
2012-06-29Paper
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Theoretical Computer Science
2012-03-13Paper
Bounded Max-colorings of Graphs
Algorithms and Computation
2010-12-09Paper
scientific article; zbMATH DE number 5823944 (Why is no real title available?)2010-12-08Paper
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
LATIN 2010: Theoretical Informatics
2010-04-27Paper
Fundamentals of Computation Theory
Lecture Notes in Computer Science
2010-04-20Paper
Fair cost-sharing methods for the minimum spanning tree game
Information Processing Letters
2010-01-29Paper
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
2009-12-04Paper
On truthfulness and approximation for scheduling selfish tasks
Journal of Scheduling
2009-12-02Paper
On the minimum hitting set of bundles problem
Theoretical Computer Science
2009-11-04Paper
The impact of local policies on the quality of packet routing in paths, trees, and rings
Journal of Scheduling
2009-08-28Paper
How good are SPT schedules for fair optimality criteria
Annals of Operations Research
2008-09-03Paper
Bicriteria scheduling for contiguous and non contiguous parallel tasks
Annals of Operations Research
2008-09-03Paper
On the Minimum Hitting Set of Bundles Problem
Algorithmic Aspects in Information and Management
2008-07-10Paper
An exponential (matching based) neighborhood for the vehicle routing problem
Journal of Combinatorial Optimization
2008-05-13Paper
Scheduling trees with large communication delays on two identical processors
Journal of Scheduling
2007-12-20Paper
A note on scheduling to meet two min-sum objectives
Operations Research Letters
2007-08-27Paper
Bicriteria approximation algorithms for scheduling problems with communications delays
Journal of Scheduling
2007-05-15Paper
Truthful algorithms for scheduling selfish tasks on parallel machines
Theoretical Computer Science
2007-01-09Paper
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science
2006-11-01Paper
Fundamentals of Computation Theory
Lecture Notes in Computer Science
2006-10-20Paper
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics
2006-08-14Paper
Computing and Combinatorics
Lecture Notes in Computer Science
2006-01-11Paper
Structural Information and Communication Complexity
Lecture Notes in Computer Science
2005-09-07Paper
Computing and Combinatorics
Lecture Notes in Computer Science
2005-06-15Paper
Scheduling in switching networks with set-up delays
Journal of Combinatorial Optimization
2005-05-17Paper
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
European Journal of Operational Research
2005-02-09Paper
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science
2004-10-27Paper
scientific article; zbMATH DE number 2102230 (Why is no real title available?)2004-09-22Paper
scientific article; zbMATH DE number 2090586 (Why is no real title available?)2004-08-12Paper
Scheduling tasks with small communication delays for clusters of processors
Annals of Operations Research
2004-08-10Paper
scientific article; zbMATH DE number 2080224 (Why is no real title available?)2004-08-04Paper
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
Theoretical Computer Science
2004-03-14Paper
scientific article; zbMATH DE number 1979516 (Why is no real title available?)2003-09-14Paper
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theoretical Computer Science
2003-08-17Paper
A PTAS for the average weighted completion time problem on unrelated machines.
Journal of Scheduling
2003-07-27Paper
scientific article; zbMATH DE number 1875417 (Why is no real title available?)2003-03-02Paper
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
Theoretical Computer Science
2003-01-21Paper
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research
2002-09-30Paper
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research
2002-09-30Paper
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research
2002-09-30Paper
Scheduling independent multiprocessor tasks
Algorithmica
2002-03-07Paper
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
RAIRO - Theoretical Informatics and Applications
2001-04-26Paper
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
RAIRO - Theoretical Informatics and Applications
2001-04-26Paper
On the complexity of scheduling with large communication delays
European Journal of Operational Research
2000-11-08Paper
scientific article; zbMATH DE number 1500535 (Why is no real title available?)2000-09-04Paper
The complexity of short schedules for uet bipartite graphs
RAIRO - Operations Research
2000-08-24Paper
The complexity of short schedules for uet bipartite graphs
RAIRO - Operations Research
2000-08-24Paper
On the parallel complexity of the alternating Hamiltonian cycle problem
RAIRO - Operations Research
2000-08-24Paper
On the parallel complexity of the alternating Hamiltonian cycle problem
RAIRO - Operations Research
2000-08-24Paper
scientific article; zbMATH DE number 1424438 (Why is no real title available?)2000-03-23Paper
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems
Parallel Computing
1999-04-28Paper
Minimizing the overhead for some tree-scheduling problems
European Journal of Operational Research
1999-02-22Paper
Minimizing the schedule length for a parallel 3D-grid precedence graph
European Journal of Operational Research
1999-02-22Paper
Scheduling UET-UCT series-parallel graphs on two processors
Theoretical Computer Science
1997-09-10Paper
Some models for scheduling parallel programs with communication delays
Discrete Applied Mathematics
1997-05-22Paper
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
Theoretical Computer Science
1997-02-28Paper
scientific article; zbMATH DE number 927063 (Why is no real title available?)1997-01-28Paper
Impact of communications of the complexity of the parallel Gaussian elimination
Parallel Computing
1991-01-01Paper


Research outcomes over time


This page was built for person: Evripidis Bampis