Jérémie Chalopin

130 papers A* 7A 13B 21C 3Journal 80Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Deterministic self-stabilising leader election for programmable matter with constant memory. Distributed Comput. Jérémie Chalopin, Shantanu Das, Maria Kokkou
2026	J	`jnl`	Distance-based certification for leader election in meshed graphs and local recognition of their subclasses. CoRR Jérémie Chalopin, Victor Chepoi, Maria Kokkou
2026	J	`jnl`	Efficient Counting and Simulation in Content-Oblivious Rings. CoRR Jérémie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna, Haoran Zhou
2026	J	`jnl`	Generating minimal redundant and maximal irredundant sets in incidence graphs. CoRR Emanuel Elias Silva Castelo, Jérémie Chalopin, Oscar Defrain, Simon Vilmin
2026	J	`jnl`	Isometric path complexity of graphs. Discret. Math. Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
2026	J	`jnl`	Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness. CoRR Jérémie Chalopin, Emmanuel Godard
2025	A	`conf`	Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. DISC Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou
2025	J	`jnl`	Constant-Size Certificates for Leader Election in Chordal Graphs and Related Classes. CoRR Jérémie Chalopin, Maria Kokkou
2025	A	`conf`	Content-Oblivious Leader Election in 2-Edge-Connected Networks. DISC Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou
2025	J	`jnl`	Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. CoRR Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou
2025	J	`jnl`	On G CoRR Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Yann Vaxès
2025	J	`jnl`	Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes. CoRR Jérémie Chalopin, Shantanu Das, Maria Kokkou
2024	J	`jnl`	ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discret. Appl. Math. Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2024	J	`jnl`	Boundary rigidity of CAT(0) cube complexes. J. Comb. Theory B Jérémie Chalopin, Victor Chepoi
2024	B	`conf`	Deterministic Leader Election for Stationary Programmable Matter with Common Direction. SIROCCO Jérémie Chalopin, Shantanu Das, Maria Kokkou
2024	J	`jnl`	Deterministic Leader Election for Stationary Programmable Matter with Common Direction. CoRR Jérémie Chalopin, Shantanu Das, Maria Kokkou
2024	A	`conf`	Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. DISC Jérémie Chalopin, Shantanu Das, Maria Kokkou
2024	J	`jnl`	Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. CoRR Jérémie Chalopin, Shantanu Das, Maria Kokkou
2024	J	`jnl`	First-order logic axiomatization of metric graph theory. Theor. Comput. Sci. Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob
2024	J	`jnl`	Graphs with G Math. Program. Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2024	A*	`conf`	Non-Clashing Teaching Maps for Balls in Graphs. COLT Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
2023	J	`jnl`	Boundary rigidity of finite CAT(0) cube complexes. CoRR Jérémie Chalopin, Victor Chepoi
2023	B	`conf`	Isometric Path Complexity of Graphs. MFCS Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
2023	J	`jnl`	Non-Clashing Teaching Maps for Balls in Graphs. CoRR Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
2023	J	`jnl`	Sample Compression Schemes for Balls in Graphs. SIAM J. Discret. Math. Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
2022	J	`jnl`	ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G CoRR Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2022	J	`jnl`	First-order logic axiomatization of metric graph theory. CoRR Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob
2022	J	`jnl`	Graphs with G CoRR Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2022	J	`jnl`	Graphs with convex balls. CoRR Jérémie Chalopin, Victor Chepoi, Ugo Giocanti
2022	J	`jnl`	Medians in median graphs and their cube complexes in linear time. J. Comput. Syst. Sci. Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2022	B	`conf`	Sample Compression Schemes for Balls in Graphs. MFCS Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
2022	J	`jnl`	Sample compression schemes for balls in graphs. CoRR Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
2022	J	`jnl`	Unlabeled sample compression schemes and corner peelings for ample and maximum classes. J. Comput. Syst. Sci. Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth
2021	J	`jnl`	Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
2021	J	`jnl`	Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
2021	J	`jnl`	Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
2020	J	`jnl`	A counterexample to Thiagarajan's conjecture on regular event structures. J. Comput. Syst. Sci. Jérémie Chalopin, Victor Chepoi
2020	J	`jnl`	Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2020	A*	`conf`	Medians in Median Graphs and Their Cube Complexes in Linear Time. ICALP Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2019	J	`jnl`	1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. ACM Trans. Comput. Log. Jérémie Chalopin, Victor Chepoi
2019	B	`conf`	Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
2019	J	`jnl`	Medians in median graphs in linear time. CoRR Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
2019	B	`conf`	Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
2019	A*	`conf`	Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. ICALP Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth
2018	J	`jnl`	1-Safe Petri nets and special cube complexes: equivalence and applications. CoRR Jérémie Chalopin, Victor Chepoi
2018	A*	`conf`	Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
2018	J	`jnl`	Fast approximation and exact computation of negative curvature parameters of graphs. CoRR Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
2018	J	`jnl`	Maximal Exploration of Trees with Energy-Constrained Agents. CoRR Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou
2018	—	`conf`	Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
2018	J	`jnl`	Unlabeled sample compression schemes and corner peelings for ample and maximum classes. CoRR Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth
2017	A*	`conf`	A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. ICALP Jérémie Chalopin, Victor Chepoi
2017	A	`conf`	Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
2016	J	`jnl`	A counterexample to Thiagarajan's conjecture. CoRR Jérémie Chalopin, Victor Chepoi
2016	B	`conf`	Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2016	J	`jnl`	Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2016	J	`jnl`	Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2016	J	`jnl`	Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2016	J	`jnl`	Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
2016	J	`jnl`	Rendezvous in networks in spite of delay faults. Distributed Comput. Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2016	J	`jnl`	Restricted Frame Graphs and a Conjecture of Scott. Electron. J. Comb. Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez
2016	B	`conf`	Sequence Hypergraphs. WG Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
2016	J	`jnl`	Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. CoRR Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2015	A	`conf`	Anonymous Graph Exploration with Binoculars. DISC Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2015	J	`jnl`	Anonymous Graph Exploration with Binoculars. CoRR Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2015	J	`jnl`	Isometric Embedding of Busemann Surfaces into L Discret. Comput. Geom. Jérémie Chalopin, Victor Chepoi, Guyslain Naves
2015	A	`conf`	Limit Behavior of the Multi-agent Rotor-Router System. DISC Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
2015	J	`jnl`	Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2015	J	`jnl`	On two conjectures of Maurer concerning basis graphs of matroids. J. Comb. Theory B Jérémie Chalopin, Victor Chepoi, Damian Osajda
2014	J	`jnl`	Cop and Robber Game and Hyperbolicity. SIAM J. Discret. Math. Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte
2014	—	`conf`	Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer
2014	—	`conf`	Fault-Tolerant Rendezvous in Networks. ICALP (2) Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2014	J	`jnl`	Fault-Tolerant Rendezvous in Networks. CoRR Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2014	J	`jnl`	Lock-in Problem for Parallel Rotor-router Walks. CoRR Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
2014	J	`jnl`	Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. Jérémie Chalopin, Daniël Paulusma
2014	B	`conf`	What Do We Need to Know to Elect in Networks with Unknown Participants? SIROCCO Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2013	J	`jnl`	Cop and robber game and hyperbolicity. CoRR Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte
2013	C	`conf`	Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
2013	J	`jnl`	Isometric embedding of Busemann surfaces into L CoRR Jérémie Chalopin, Victor Chepoi, Guyslain Naves
2013	J	`jnl`	Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2013	J	`jnl`	Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
2013	J	`jnl`	Retracts of Products of Chordal Graphs. J. Graph Theory Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès
2013	J	`jnl`	Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2013	J	`jnl`	Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
2012	A	`conf`	Collecting Information by Power-Aware Mobile Agents. DISC Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2012	J	`jnl`	Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. Jérémie Chalopin, Emmanuel Godard, Yves Métivier
2012	J	`jnl`	Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Informaticae Jérémie Chalopin, Yves Métivier, Thomas Morsellino
2012	B	`conf`	On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO Jérémie Chalopin, Yves Métivier, Thomas Morsellino
2012	J	`jnl`	Proof of two Maurer's conjectures on basis graphs of matroids CoRR Jérémie Chalopin, Victor Chepoi, Damian Osajda
2012	J	`jnl`	Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons CoRR Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2011	J	`jnl`	Asymetric Pavlovian Populations CoRR Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
2011	J	`jnl`	Black Hole Search with Finite Automata Scattered in a Synchronous Torus CoRR Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
2011	A	`conf`	Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
2011	B	`conf`	Computing with Pavlovian Populations. OPODIS Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
2011	J	`jnl`	Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès
2011	J	`jnl`	Graph labelings derived from models in distributed computing: A complete complexity classification. Networks Jérémie Chalopin, Daniël Paulusma
2011	A	`conf`	Telling convex from reflex allows to map a polygon. STACS Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2011	J	`jnl`	Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings CoRR Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
2011	B	`conf`	Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
2010	B	`conf`	Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS Jérémie Chalopin, Shantanu Das, Adrian Kosowski
2010	J	`jnl`	Cop and robber games when the robber can hide and ride CoRR Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès
2010	C	`conf`	How Simple Robots Benefit from Looking Back. CIAC Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2010	B	`conf`	Network Exploration by Silent and Oblivious Robots. WG Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro
2010	J	`jnl`	On the power of synchronization between two adjacent processes. Distributed Comput. Jérémie Chalopin, Yves Métivier
2010	C	`conf`	Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC Jérémie Chalopin, Daniël Paulusma
2010	J	`jnl`	Planar Graphs Have 1-string Representations. Discret. Comput. Geom. Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
2010	A	`conf`	Rendezvous of Mobile Agents in Directed Graphs. DISC Jérémie Chalopin, Shantanu Das, Peter Widmayer
2010	—	`conf`	Rendezvous of Mobile Agents without Agreement on Local Orientation. ICALP (2) Jérémie Chalopin, Shantanu Das
2009	A*	`conf`	Every planar graph is the intersection graph of segments in the plane: extended abstract. STOC Jérémie Chalopin, Daniel Gonçalves
2009	J	`jnl`	Population Protocols that Correspond to Symmetric Games CoRR Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
2008	J	`jnl`	Dejean's conjecture and letter frequency. RAIRO Theor. Informatics Appl. Jérémie Chalopin, Pascal Ochem
2008	J	`jnl`	Election and rendezvous with incomparable labels. Theor. Comput. Sci. Jérémie Chalopin
2008	B	`conf`	Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier
2008	A	`conf`	Local Terminations and Distributed Computability in Anonymous Networks. DISC Jérémie Chalopin, Emmanuel Godard, Yves Métivier
2008	—	`conf`	Playing With Population Protocols CSP Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
2007	—	`conf`	About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
2007	J	`jnl`	An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundam. Informaticae Jérémie Chalopin, Yves Métivier
2007	J	`jnl`	Dejean's conjecture and letter frequency. Electron. Notes Discret. Math. Jérémie Chalopin, Pascal Ochem
2007	A*	`conf`	Planar graphs are in 1-STRING. SODA Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
2007	A	`conf`	Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. DISC Jérémie Chalopin, Shantanu Das, Nicola Santoro
2006	B	`conf`	Election in the Qualitative World. SIROCCO Jérémie Chalopin
2006	B	`conf`	Graph Labelings Derived from Models in Distributed Computing. WG Jérémie Chalopin, Daniël Paulusma
2006	A	`conf`	Groupings and Pairings in Anonymous Networks. DISC Jérémie Chalopin, Shantanu Das, Nicola Santoro
2006	J	`jnl`	Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2006	B	`conf`	Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
2005	B	`conf`	A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS Jérémie Chalopin, Yves Métivier
2005	J	`jnl`	Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2005	B	`conf`	Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. SOFSEM Jérémie Chalopin
2004	B	`conf`	Election and Local Computations on Edges. FoSSaCS Jérémie Chalopin, Yves Métivier
2004	B	`conf`	Election, Naming and Cellular Edge Local Computations. ICGT Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
2004	J	`jnl`	On factorization forests of finite height. Theor. Comput. Sci. Jérémie Chalopin, Hing Leung