Rodolphe Giroudeau

Int. J. Found. Comput. Sci., September, 2024

2023

Ricochet Robots with Infinite Horizontal Board is Turing-complete.

[BibT_eX]

[DOI]

Samuel Masseport

Tom Davot

J. Inf. Process., 2023

Using VRPSolver to efficiently solve the Differential Harvest Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2023

2022

On a greedy approach for genome scaffolding.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2022

2021

Complexity and inapproximability results for balanced connected subgraph problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds.

[BibT_eX]

[DOI]

Algorithmica, 2021

Complexity and Approximation Results on the Shared Transportation Problem.

[BibT_eX]

[DOI]

Tom Davot

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Proof of usage: user-centric consensus for data provision and exchange.

[BibT_eX]

[DOI]

Ann. des Télécommunications, 2020

Linearizing Genomes: Exact Methods and Local Search.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Exact Method Approaches for the Differential Harvest Problem.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

Proof of Experience: empowering Proof of Work protocol with miner previous work.

[BibT_eX]

[DOI]

Proceedings of the 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services, 2020

2019

Parameterized complexity of a coupled-task scheduling problem.

[BibT_eX]

[DOI]

Stéphane Bessy

J. Sched., 2019

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

The Workforce Routing and Scheduling Problem: solving real-world Instances.

[BibT_eX]

[DOI]

Gabriel Volte

Chloé Desdouits

Proceedings of the 9th International Network Optimization Conference, 2019

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

New Polynomial-Time Algorithm Around the Scaffolding Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018

Complexity and lowers bounds for Power Edge Set Problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

On residual approximation in solution extension problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Approximability and exact resolution of the multidimensional binary vector assignment problem.

[BibT_eX]

[DOI]

Marin Bougeret

Guillerme Duvillié

J. Comb. Optim., 2018

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases.

[BibT_eX]

[DOI]

Algorithmica, 2018

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 16th International Conference, 2018

New Results About the Linearization of Scaffolds Sharing Repeated Contigs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints.

[BibT_eX]

[DOI]

CoRR, 2017

Improved Complexity for Power Edge Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

On the Linearization of Scaffolds Sharing Repeated Contigs.

[BibT_eX]

[DOI]

Mathias Weller

Proceedings of the Combinatorial Optimization and Applications, 2017

New Insights for Power Edge Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Some complexity and approximation results for coupled-tasks scheduling problem according to topology.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2016

Approximating the Sparsest k-Subgraph in Chordal Graphs.

[BibT_eX]

[DOI]

Rémi Watrigant

Marin Bougeret

Theory Comput. Syst., 2016

Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

On the complexity of Wafer-to-Wafer Integration.

[BibT_eX]

[DOI]

Discret. Optim., 2016

Production scheduling with a piecewise-linear energy cost function.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

Certification Under Uncertainties of Control Methods for Multisource Elevators.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems Design and Applications, 2016

A Method for the Energy Optimization of a Multisource Elevator.

[BibT_eX]

[DOI]

Proceedings of the Informatics in Control, Automation and Robotics, 2016

The Sourcing Problem - Energy Optimization of a Multisource Elevator.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Informatics in Control, Automation and Robotics (ICINCO 2016), 2016

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Exact approaches for scaffolding.

[BibT_eX]

[DOI]

Mathias Weller

BMC Bioinform., December, 2015

A complexity and approximation framework for the maximization scaffolding problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs.

[BibT_eX]

[DOI]

Mathias Weller

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

On the sum-max graph partitioning problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration.

[BibT_eX]

[DOI]

4OR, 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Approximation algorithm for constrained coupled-tasks scheduling problem.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2014

Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2012

Scheduling in the presence of processor networks : complexity and approximation.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2012

Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2012

Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks".

[BibT_eX]

[DOI]

Marwane Bouznif

Adv. Oper. Res., 2012

Approximation Algorithms for the Wafer to Wafer Integration Problem.

[BibT_eX]

[DOI]

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

ordonnancement et communications. (Communications and scheduling).

[BibT_eX]

[DOI]

, 2012

2011

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor.

[BibT_eX]

[DOI]

J. Sched., 2011

Complexity and approximation for scheduling problem for a torpedo.

[BibT_eX]

[DOI]

Gilles Simonin

Comput. Ind. Eng., 2011

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks.

[BibT_eX]

[DOI]

Marwane Bouznif

Adv. Oper. Res., 2011

Erratum to: Scheduling <i>UET</i>-tasks on a star network: complexity and approximation.

[BibT_eX]

[DOI]

Benoît Valéry

4OR, 2011

Scheduling <i>UET</i>-tasks on a star network: complexity and approximation.

[BibT_eX]

[DOI]

Benoît Valéry

4OR, 2011

2010

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks.

[BibT_eX]

[DOI]

Gilles Simonin

Electron. Notes Discret. Math., 2010

2009

Approximation Algorithms for Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Introduction to Scheduling., 2009

2008

Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs. Une preuve alternative.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2008

Complexity and approximation for precedence constrained scheduling problems with large communication delays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

General scheduling non-approximability results in presence of hierarchical communications.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

2005

Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2005

Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004

Scheduling Tasks with Small Communication Delays for Clusters of Processors.

[BibT_eX]

[DOI]

Alexander V. Kononov

Ann. Oper. Res., 2004

General Non-Approximability Results in Presence of Hierarchical Communications.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

2003

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2002

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

[BibT_eX]

[DOI]

Eric Angel

Proceedings of the Euro-Par 2002, 2002

2000

Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.

[BibT_eX]

[DOI]