| Publication | Date of Publication | Type |
|---|
The shortest temporal exploration problem
Theoretical Computer Science | 2026-09-14 | Paper |
The dynamic Steiner tree problem: definitions, complexity, algorithms
Discrete Applied Mathematics | 2026-07-28 | Paper |
Stochastic quay partitioning problem
European Journal of Operational Research | 2026-02-09 | Paper |
The Shortest Temporal Exploration Problem
(available as arXiv preprint) | 2025-01-01 | Paper |
Temporally connected components
Theoretical Computer Science | 2024-10-01 | Paper |
Cops and Robbers on Dynamic Graphs: Offline and Online Case
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
Quay partitioning problem
International Transactions in Operational Research | 2024-01-31 | Paper |
A study of connectivity on dynamic graphs: computing persistent connected components
4OR | 2023-06-07 | Paper |
The Basic Cyclic Scheduling Model For Robotic Flow Shops
INFOR: Information Systems and Operational Research | 2023-04-24 | Paper |
Cops and Robbers on Dynamic Graphs: Offline and Online Case
Structural Information and Communication Complexity | 2022-09-01 | Paper |
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
Discrete Applied Mathematics | 2021-04-20 | Paper |
Selecting algorithms for large berth allocation problems
European Journal of Operational Research | 2020-02-11 | Paper |
Datation of Faults for Markovian Stochastic DESs
IEEE Transactions on Automatic Control | 2019-07-18 | Paper |
Faults prognosis using partially observed stochastic Petri nets: an incremental approach
Discrete Event Dynamic Systems | 2018-10-08 | Paper |
Fault prognosis of timed stochastic discrete event systems with bounded estimation error
Automatica | 2017-10-11 | Paper |
Fair resource allocation for different scenarios of demands
European Journal of Operational Research | 2012-08-16 | Paper |
A polynomial algorithm for recognizing the \(\mathcal A\)-order class
Discrete Mathematics | 2009-12-09 | Paper |
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
RAIRO - Operations Research | 2009-01-29 | Paper |
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
RAIRO - Operations Research | 2009-01-29 | Paper |
Linear programming based algorithms for preemptive and non-preemptive RCPSP
European Journal of Operational Research | 2007-06-13 | Paper |
Sensitivity bounds for machine scheduling with uncertain communication delays
Journal of Scheduling | 2007-05-15 | Paper |
Parallel Machine Scheduling with Uncertain Communication Delays
RAIRO - Operations Research | 2004-08-30 | Paper |
Parallel Machine Scheduling with Uncertain Communication Delays
RAIRO - Operations Research | 2004-08-30 | Paper |
Parallel Machine Scheduling with Uncertain Communication Delays
RAIRO - Operations Research | 2004-08-30 | Paper |
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
European Journal of Operational Research | 2004-01-05 | Paper |
Machine scheduling with availability constraints
Acta Informatica | 1999-06-13 | Paper |
Stochastic Scheduling with Variable Profile and Precedence Constraints
SIAM Journal on Computing | 1997-10-05 | Paper |
Preemptive scheduling with variable profile, precedence constraints and due dates
Discrete Applied Mathematics | 1996-03-18 | Paper |
Nearly on line scheduling of preemptive independent tasks
Discrete Applied Mathematics | 1995-04-10 | Paper |
