Rodolphe Giroudeau

82 papers A* 1A 1B 7C 16Journal 42Unranked 13

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Indoor Navigation: Navmesh Applied to Indoor Graph Creation. ICORES Maxime Callico, Rodolphe Giroudeau, Benoît Darties, Jean Carrière
2024	J	`jnl`	On the Shared Transportation Problem: Computational Hardness and Exact Approach. Int. J. Found. Comput. Sci. Tom Davot, Rodolphe Giroudeau, Jean-Claude König
2023	J	`jnl`	Ricochet Robots with Infinite Horizontal Board is Turing-complete. J. Inf. Process. Samuel Masseport, Tom Davot, Rodolphe Giroudeau
2023	J	`jnl`	Using VRPSolver to efficiently solve the Differential Harvest Problem. Comput. Oper. Res. Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
2022	J	`jnl`	On a greedy approach for genome scaffolding. Algorithms Mol. Biol. Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller
2021	C	`conf`	Complexity and Approximation Results on the Shared Transportation Problem. COCOA Tom Davot, Rodolphe Giroudeau, Jean-Claude König
2021	J	`jnl`	Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
2021	J	`jnl`	Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Algorithmica Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary
2020	B	`conf`	Exact Method Approaches for the Differential Harvest Problem. CPAIOR Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
2020	B	`conf`	Linearizing Genomes: Exact Methods and Local Search. SOFSEM Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2020	—	`conf`	Proof of Experience: empowering Proof of Work protocol with miner previous work. BRAINS Samuel Masseport, Benoît Darties, Rodolphe Giroudeau, Jorick Lartigau
2020	J	`jnl`	Proof of usage: user-centric consensus for data provision and exchange. Ann. des Télécommunications Samuel Masseport, Jorick Lartigau, Benoît Darties, Rodolphe Giroudeau
2019	—	`conf`	New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2019	J	`jnl`	Parameterized complexity of a coupled-task scheduling problem. J. Sched. Stéphane Bessy, Rodolphe Giroudeau
2019	C	`conf`	Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2019	C	`conf`	The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. COCOA Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
2019	C	`conf`	The Workforce Routing and Scheduling Problem: solving real-world Instances. INOC Gabriel Volte, Chloé Desdouits, Rodolphe Giroudeau
2018	J	`jnl`	Approximability and exact resolution of the multidimensional binary vector assignment problem. J. Comb. Optim. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
2018	J	`jnl`	Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2018	C	`conf`	New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
2018	J	`jnl`	On residual approximation in solution extension problems. J. Comb. Optim. Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
2018	—	`conf`	On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2018	J	`jnl`	Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
2017	J	`jnl`	Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin
2017	C	`conf`	Improved Complexity for Power Edge Set Problem. IWOCA Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2017	J	`jnl`	Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
2017	J	`jnl`	Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Discret. Math. Theor. Comput. Sci. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
2017	—	`conf`	New Insights for Power Edge Set Problem. COCOA (1) Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
2017	—	`conf`	On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2) Mathias Weller, Annie Chateau, Rodolphe Giroudeau
2017	J	`jnl`	Some complexity and approximation results for coupled-tasks scheduling problem according to topology. CoRR Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
2016	—	`conf`	A Method for the Energy Optimization of a Multisource Elevator. ICINCO (Selected Papers) Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
2016	C	`conf`	Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. ISCO Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
2016	J	`jnl`	Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
2016	J	`jnl`	Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res. Florent Hernández, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud
2016	C	`conf`	Certification Under Uncertainties of Control Methods for Multisource Elevators. ISDA Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
2016	C	`conf`	Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
2016	C	`conf`	On Residual Approximation in Solution Extension Problems. COCOA Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
2016	J	`jnl`	On the complexity of Wafer-to-Wafer Integration. Discret. Optim. Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau
2016	—	`conf`	Production scheduling with a piecewise-linear energy cost function. SSCI Mustapha Haouassi, Chloe Desdouits, Rodolphe Giroudeau, Claude Le Pape
2016	J	`jnl`	Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO Oper. Res. Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
2016	—	`conf`	The Sourcing Problem - Energy Optimization of a Multisource Elevator. ICINCO (1) Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
2015	J	`jnl`	A complexity and approximation framework for the maximization scaffolding problem. Theor. Comput. Sci. Annie Chateau, Rodolphe Giroudeau
2015	J	`jnl`	Exact approaches for scaffolding. BMC Bioinform. Mathias Weller, Annie Chateau, Rodolphe Giroudeau
2015	B	`conf`	Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. FCT Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
2015	J	`jnl`	Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. CoRR Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
2015	C	`conf`	On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA Mathias Weller, Annie Chateau, Rodolphe Giroudeau
2015	C	`conf`	On the Complexity of Wafer-to-Wafer Integration. CIAC Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau
2014	J	`jnl`	A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR Florent Hernández, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud
2014	C	`conf`	Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau
2014	—	`conf`	Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB Annie Chateau, Rodolphe Giroudeau
2014	C	`conf`	Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
2014	J	`jnl`	On the sum-max graph partitioning problem. Theor. Comput. Sci. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
2014	B	`conf`	Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. SOFSEM Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant
2013	B	`conf`	Approximating the Sparsest k-Subgraph in Chordal Graphs. WAOA Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
2012	B	`conf`	Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
2012	J	`jnl`	Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks". Adv. Oper. Res. Marwane Bouznif, Rodolphe Giroudeau
2012	J	`jnl`	Scheduling in the presence of processor networks : complexity and approximation. RAIRO Oper. Res. Vincent Boudet, Johanne Cohen, Rodolphe Giroudeau, Jean-Claude König
2012	C	`conf`	Sum-Max Graph Partitioning Problem. ISCO Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
2012	J	`jnl`	Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. Algorithmic Oper. Res. Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König
2012	—	`book`	ordonnancement et communications. (Communications and scheduling). Rodolphe Giroudeau
2011	J	`jnl`	Complexity and approximation for scheduling problem for a torpedo. Comput. Ind. Eng. Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
2011	J	`jnl`	Erratum to: Scheduling 4OR Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry
2011	J	`jnl`	Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Adv. Oper. Res. Marwane Bouznif, Rodolphe Giroudeau
2011	J	`jnl`	Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
2011	J	`jnl`	Scheduling 4OR Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry
2011	A*	`conf`	Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. ICAPS Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties
2010	J	`jnl`	Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electron. Notes Discret. Math. Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
2009	—	`ch.`	Approximation Algorithms for Scheduling Problems. Introduction to Scheduling Jean-Claude König, Rodolphe Giroudeau
2008	J	`jnl`	Complexity and approximation for precedence constrained scheduling problems with large communication delays. Theor. Comput. Sci. Rodolphe Giroudeau, Jean-Claude König, Farida Kamila Moulai, Jérôme Palaysi
2008	J	`jnl`	General scheduling non-approximability results in presence of hierarchical communications. Eur. J. Oper. Res. Rodolphe Giroudeau, Jean-Claude König
2008	J	`jnl`	Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs. Une preuve alternative. Tech. Sci. Informatiques Rodolphe Giroudeau
2005	—	`conf`	Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. Euro-Par Rodolphe Giroudeau, Jean-Claude König, Feryal-Kamila Moulaï, Jérôme Palaysi
2005	J	`jnl`	Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques. Tech. Sci. Informatiques Rodolphe Giroudeau
2004	—	`conf`	General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar Rodolphe Giroudeau, Jean-Claude König
2004	J	`jnl`	Scheduling Tasks with Small Communication Delays for Clusters of Processors. Ann. Oper. Res. Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov
2003	J	`jnl`	An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. Theor. Comput. Sci. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
2002	—	`conf`	Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. Euro-Par Eric Angel, Evripidis Bampis, Rodolphe Giroudeau
2002	J	`jnl`	On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Oper. Res. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
2001	B	`conf`	Scheduling tasks with small communication delays for clusters of processors. SPAA Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov
2000	A	`conf`	An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
2000	J	`jnl`	Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Process. Lett. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
1999	—	`conf`	Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König