Eric Rémila

J. Comb. Optim., 2022

2021

influence: A partizan scoring game on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Lexicographic solutions for coalitional rankings.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2021

Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2021

Compact Distributed Certification of Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

On the emergence of regularities on one-dimensional decreasing sandpiles.

[BibT_eX]

[DOI]

Éric Rémila

Theor. Comput. Sci., 2020

Cooperative games on intersection closed systems and the Shapley value.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2020

2019

Harsanyi power solutions for cooperative games on voting structures.

[BibT_eX]

[DOI]

Int. J. Gen. Syst., 2019

2018

Lost in self-stabilization: A local process that aligns connected cells.

[BibT_eX]

[DOI]

Damien Regnault

Theor. Comput. Sci., 2018

Axiomatization of an allocation rule for ordered tree TU-games.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2018

Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles.

[BibT_eX]

[DOI]

Enrico Formenti

J. Cell. Autom., 2018

The proportional Shapley value and applications.

[BibT_eX]

[DOI]

Games Econ. Behav., 2018

2017

Discounted tree solutions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Strong Emergence of Wave Patterns on Kadanoff Sandpiles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

A strategic implementation of the sequential equal surplus division rule for digraph cooperative games.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2017

2016

Axiomatic characterizations under players nullification.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2016

Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form.

[BibT_eX]

[DOI]

IGTR, 2016

The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.

[BibT_eX]

[DOI]

Antonio Fernández Anta

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Piles de sable décroissantes 1D. Classification expérimentale d'émergences.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2015

A geometric examination of majorities based on difference in support.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2015

Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Preserving or removing special players: What keeps your payoff unchanged in TU-games?

[BibT_eX]

[DOI]

Math. Soc. Sci., 2015

Axioms of invariance for TU-games.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2015

A decomposition of the space of TU-games using addition and transfer invariance.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast.

[BibT_eX]

[DOI]

Antonio Fernández Anta

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Lost in Self-Stabilization.

[BibT_eX]

[DOI]

Damien Regnault

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Emergence on Decreasing Sandpile Models.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Emergence of Wave Patterns on Kadanoff Sandpiles.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles.

[BibT_eX]

[DOI]

Enrico Formenti

Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013

Kadanoff sand pile model. Avalanche structure and wave shape.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Accessibility and stability of the coalition structure core.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2013

The River Sharing Problem: a Survey.

[BibT_eX]

[DOI]

IGTR, 2013

An optimal bound to access the core in TU-games.

[BibT_eX]

[DOI]

Games Econ. Behav., 2013

Kadanoff Sand Piles, following the snowball

[BibT_eX]

[DOI]

CoRR, 2013

2012

Weighted component fairness for forest games.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2012

Compensations in the Shapley value and the compensation solutions for graph games.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2012

On the number of blocks required to access the core.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

The average tree solution for multi-choice forest games.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2012

2011

Distances on rhombus tilings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Average tree solutions and the distribution of Harsanyi dividends.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2011

Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Avalanche Structure in the Kadanoff Sand Pile Model.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

The Optimal Strategy for the Average Long-Lived Consensus.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

2010

Average long-lived binary consensus: Quantifying the stabilizing role played by memory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Rooted-tree solutions for tree games.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Average Long-Lived Memoryless Consensus: The Three-Value Case.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

2009

Distances on Lozenge Tilings.

[BibT_eX]

[DOI]

Olivier Bodini

Thomas Fernique

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

A characterization of flip-accessibility for rhombus tilings of the whole plane.

[BibT_eX]

[DOI]

Olivier Bodini

Thomas Fernique

Inf. Comput., 2008

Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.

[BibT_eX]

[DOI]

Nicolas Schabanel

Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007

A note on the structure of spaces of domino tilings.

[BibT_eX]

[DOI]

Michel Morvan

Eric Thierry

Discret. Math., 2007

2006

An optimal algorithm to generate tilings.

[BibT_eX]

[DOI]

Sébastien Desreux

J. Discrete Algorithms, 2006

Rhombus Tilings: Decomposition and Space Structure.

[BibT_eX]

[DOI]

Frédéric Chavanon

Discret. Comput. Geom., 2006

Incremental and Transitive Discrete Rotations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Graph encoding of 2<i>D</i>-gon tilings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Tiling a Polygon with Two Kinds of Rectangles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Configurations induced by discrete rotations: periodicity and quasi-periodicity properties.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

The lattice structure of the set of domino tilings of a polygon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Leader election in plane cellular automata, only with left-right global convention.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Domino tilings and related models: space of configurations of domains with holes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Tilings with trichromatic colored-edges triangles.

[BibT_eX]

[DOI]

Olivier Bodini

Marie-Christine Eglin-Leclerc

Theor. Comput. Sci., 2004

Algebraic tools for the construction of colored flows with boundary constraints.

[BibT_eX]

[DOI]

Marius Dorkenoo

RAIRO Theor. Informatics Appl., 2004

Rhombus tilings: decomposition and space structure: (extended abstract).

[BibT_eX]

[DOI]

Frédéric Chavanon

Electron. Notes Discret. Math., 2004

Characterization of Bijective Discretized Rotations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003

Tiling with bars under tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On Colorations Induced by Discrete Rotations.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

2002

On the Structure of Some Spaces of Tilings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Effective Simulations on Hyperbolic Networks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Tiling groups for Wang tiles.

[BibT_eX]

[DOI]

Cristopher Moore

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Hyperbolic Recognition by Graph Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Algorithms for Leader Election by Cellular Automata.

[BibT_eX]

[DOI]

Jacques Mazoyer

J. Algorithms, 2001

Linear Time Recognizer for Subsets of Z<sup>2</sup>.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem.

[BibT_eX]

[DOI]

Claire Kenyon

Math. Oper. Res., 2000

An algebraic method to compute a shortest path of local flips between two tilings.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Some Properties of Hyperbolic Networks.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

1999

Compass Permits Leader Election.

[BibT_eX]

[DOI]

Jacques Mazoyer

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Leader Election by d Dimensional Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

Tiling Groups: New Applications in the Triangular Lattice.

[BibT_eX]

[DOI]

Marie-Christine Eglin-Leclerc

Discret. Comput. Geom., 1998

Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure.

[BibT_eX]

[DOI]

Marius Dorkenoo

Proceedings of the STACS 98, 1998

1996

Tiling with Bars and Satisfaction of Boolean Formulas.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Tiling a simply connected figure with bars of length 2 or 3.

[BibT_eX]

[DOI]

Discret. Math., 1996

Perfect matchings in the triangular lattice.

[BibT_eX]

[DOI]

Claire Kenyon

Discret. Math., 1996

Tiling a Figure Using a Height in a Tree.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Approximate Strip Packing.

[BibT_eX]

[DOI]

Claire Kenyon

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Tiling Figures of the Plane with Two Bars.

[BibT_eX]

[DOI]

Comput. Geom., 1995

1994

Recognition of Graphs by Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

On the Tiling of a Torus with Two Bars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

A Linear Algorithm to Tile the Trapezes with h_m and v_n.

[BibT_eX]

[DOI]