Eric Angel

Sébastien Morais

Damien Regnault

CoRR, 2022

A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

Sébastien Morais

Damien Regnault

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

2021

Calibrations scheduling with arbitrary lengths and activation length.

[BibT_eX]

[DOI]

J. Sched., 2021

RNANet: an automatically built dual-source dataset integrating homologous sequences and RNA structures.

[BibT_eX]

[DOI]

Louis Becquey

Bioinform., 2021

2020

BiORSEO: a bi-objective method to predict RNA secondary structures with pseudoknots using RNA 3D modules.

[BibT_eX]

[DOI]

Louis Becquey

Bioinform., 2020

2019

Approximating <i>k</i>-forest with resource augmentation: A primal-dual approach.

[BibT_eX]

[DOI]

Kim Thang Nguyen

Shikha Singh

Theor. Comput. Sci., 2019

Speed scaling on parallel processors with migration.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Mechanism Design for Maximum Vectors.

[BibT_eX]

[DOI]

CoRR, 2019

RCPred: RNA complex prediction as a constrained maximum weight clique problem.

[BibT_eX]

[DOI]

Audrey Legendre

BMC Bioinform., 2019

2018

Parameterized Power Vertex Cover.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Bi-objective integer programming for RNA secondary structure prediction with pseudoknots.

[BibT_eX]

[DOI]

Audrey Legendre

BMC Bioinform., 2018

2017

On the Complexity of Minimizing the Total Calibration Cost.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach.

[BibT_eX]

[DOI]

Kim Thang Nguyen

Shikha Singh

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Throughput maximization in multiprocessor speed-scaling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Throughput maximization for speed scaling with agreeable deadlines.

[BibT_eX]

[DOI]

J. Sched., 2016

Clustering on k-edge-colored graphs.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

Discret. Appl. Math., 2016

FPT Approximation Algorithm for Scheduling with Memory Constraints.

[BibT_eX]

[DOI]

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

Truthfulness for the Sum of Weighted Completion Times.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Improved local search for universal facility location.

[BibT_eX]

[DOI]

Kim Thang Nguyen

Damien Regnault

J. Comb. Optim., 2015

Minimizing Total Calibration Cost.

[BibT_eX]

[DOI]

CoRR, 2015

Min-Power Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down.

[BibT_eX]

[DOI]

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

2014

Optimal data placement on networks with a constant number of clients.

[BibT_eX]

[DOI]

Gerasimos G. Pollatos

Theor. Comput. Sci., 2014

Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Throughput Maximization in the Speed-Scaling Setting.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

A new lower bound on the independence number of graphs.

[BibT_eX]

[DOI]

Romain Campigotto

Christian Laforest

Discret. Appl. Math., 2013

2012

Randomized truthful algorithms for scheduling selfish tasks on parallel machines.

[BibT_eX]

[DOI]

Nicolas Thibault

Theor. Comput. Sci., 2012

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs.

[BibT_eX]

[DOI]

Romain Campigotto

Christian Laforest

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Energy Aware Scheduling for Unrelated Parallel Machines.

[BibT_eX]

[DOI]

Fadi Kacem

Proceedings of the 2012 IEEE International Conference on Green Computing and Communications, 2012

2011

Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities.

[BibT_eX]

[DOI]

Romain Campigotto

Christian Laforest

Algorithmic Oper. Res., 2011

2009

On the minimum hitting set of bundles problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On truthfulness and approximation for scheduling selfish tasks.

[BibT_eX]

[DOI]

J. Sched., 2009

2008

The impact of local policies on the quality of packet routing in paths, trees, and rings.

[BibT_eX]

[DOI]

J. Sched., 2008

An exponential (matching based) neighborhood for the vehicle routing problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

How good are SPT schedules for fair optimality criteria.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

2007

Approximation in Multiobjective Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Algorithmic Game Theory and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A note on scheduling to meet two min-sum objectives.

[BibT_eX]

[DOI]

Aleksei V. Fishkin

Oper. Res. Lett., 2007

2006

A Survey of Approximation Results for Local Search Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Truthful algorithms for scheduling selfish tasks on parallel machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Fair cost-sharing methods for the minimum spanning tree game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Approximation algorithms for the bi-criteria weighted MAX-CUT problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

The Price of Approximate Stability for Scheduling Selfish Tasks on Two Links.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

Approximation results for a bicriteria job scheduling problem on a single machine without preemption.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

(Non)-Approximability for the Multi-criteria <i>TSP</i>(1, 2).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Traffic Grooming in a Passive Star WDM Network.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004

2003

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.

[BibT_eX]

[DOI]

Alexander V. Kononov

Theor. Comput. Sci., 2003

2002

On the Hardness of the Quadratic Assignment Problem with Metaheuristics.

[BibT_eX]

[DOI]

J. Heuristics, 2002

Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters.

[BibT_eX]

[DOI]

Rodolphe Giroudeau

Proceedings of the Euro-Par 2002, 2002

2001

On the landscape ruggedness of the quadratic assignment problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.

[BibT_eX]

[DOI]

Alexander V. Kononov

Proceedings of the Algorithms, 2001

2000

On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1998

Autocorrelation Coefficient for the Graph Bipartitioning Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

On the Quality of Local Search for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]