Ioannis Milis

Orestis Papadigenopoulos

Vasilis Vassalos

Georgios Zois

Theory Comput. Syst., 2020

2017

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem.

[BibT_eX]

[DOI]

Nicolas Bourgeois

Eur. J. Oper. Res., 2017

2016

Speed Scaling for Maximum Lateness.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Bin Packing with Colocations.

[BibT_eX]

[DOI]

Vassilis Zissimopoulos

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Scheduling MapReduce Jobs Under Multi-round Precedences.

[BibT_eX]

[DOI]

Dimitris Fotakis

Orestis Papadigenopoulos

Vasilis Vassalos

Georgios Zois

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors.

[BibT_eX]

[DOI]

Dimitris Fotakis

Orestis Papadigenopoulos

Emmanouil Zampetakis

Georgios Zois

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity".

[BibT_eX]

[DOI]

Vangelis Markakis

Theor. Comput. Sci., 2014

Bounded max-colorings of graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Energy-Efficient Algorithms for Non-preemptive Speed-Scaling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Energy Efficient Scheduling of MapReduce Jobs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2014 Parallel Processing, 2014

Scheduling MapReduce Jobs on Unrelated Processors.

[BibT_eX]

[DOI]

Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

2013

On multiprocessor temperature-aware scheduling problems.

[BibT_eX]

[DOI]

J. Sched., 2013

Energy Minimization via a Primal-Dual Algorithm for a Convex Program.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Exact and Approximation Algorithms for Densest <i>k</i>-Subgraph.

[BibT_eX]

[DOI]

Nicolas Bourgeois

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012

Speed scaling with power down scheduling for agreeable deadlines.

[BibT_eX]

[DOI]

Sustain. Comput. Informatics Syst., 2012

The max quasi-independent set problem.

[BibT_eX]

[DOI]

Nicolas Bourgeois

J. Comb. Optim., 2012

Approximating the Throughput by Coolest First Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Topic 3: Scheduling and Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Improved approximation algorithms for the Max Edge-Coloring problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2010

Approximating the max-edge-coloring problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On the max-weight edge coloring problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

2009

Max Edge Coloring of Trees

[BibT_eX]

[DOI]

CoRR, 2009

2008

A constant approximation algorithm for the densest k.

[BibT_eX]

[DOI]

Maria Liazi

Vassilis Zissimopoulos

Inf. Process. Lett., 2008

On the Maximum Edge Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007

The densest <i>k</i>-subgraph problem on clique graphs.

[BibT_eX]

[DOI]

Maria Liazi

Fanny Pascual

Vassilis Zissimopoulos

J. Comb. Optim., 2007

Selfish Routing and Path Coloring in All-Optical Networks.

[BibT_eX]

[DOI]

Aris Pagourtzis

Katerina Potika

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

Approximating a Class of Classification Problems.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Designing PTASs for MIN-SUM scheduling problems.

[BibT_eX]

[DOI]

Foto N. Afrati

Discret. Appl. Math., 2006

2005

Scheduling trees with large communication delays on two identical processors.

[BibT_eX]

[DOI]

J. Sched., 2005

Scheduling in Switching Networks with Set-Up Delays.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

2002

Scheduling and Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2000

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases.

[BibT_eX]

[DOI]

Alexander V. Karzanov

RAIRO Theor. Informatics Appl., 2000

1999

On the parallel complexity of the alternating Hamiltonian cycle problem.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 1999

A sufficient condition for maximum cycles in bipartite digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Scheduling on a Constant Number of Machines.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph.

[BibT_eX]

[DOI]

Alexander V. Karzanov

Parallel Process. Lett., 1998

1996

Scheduling UET-UCT Series-Parallel Graphs on Two Processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

Task Assignment in Distributed Systems Using Network Flow Methods.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

1994

NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract).

[BibT_eX]

[DOI]