Skip to main content

Search

Show all results for

Home

Person

Benjamin Leroy-Beaulieu

This person is no longer with EPFL

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (4)

Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.

On the online track assignment problem

Benjamin Leroy-Beaulieu

This paper aims to start an analytical study of the computational complexity of some online We analyze the following problem. Consider a train station consisting of a set of parallel tracks. Each track can be approached from one side only or from both side ...

2012

The Online Track Assignment Problem

Benjamin Leroy-Beaulieu

This chapter contains sections titled: Introduction Definitions and notations Bounds for the permutation graph in a left-to-right model Bounds for overlap graphs Bounds for permutation graphs in a more general model Conclusion Bibliography ...

wiley2010

Finding Hamiltonian circuits in quasi-adjoint graphs

Dominique de Werra, Benjamin Leroy-Beaulieu

This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothernnic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718-7291. This paper pr ...

2008