default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Rémila
Éric Rémila
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Éric Duchêne, Arthur Dumas, Nacim Oijid
, Aline Parreau, Eric Rémila:
The Maker-Maker domination game in forests. Discret. Appl. Math. 348: 6-34 (2024)- 2023
- [j62]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Local certification of graphs with bounded genus. Discret. Appl. Math. 325: 9-36 (2023) - 2022
- [j61]Sylvain Béal, Eric Rémila, Philippe Solal:
Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution. J. Comb. Optim. 43(4): 818-849 (2022) - 2021
- [j60]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021) - [j59]Sylvain Béal, André Casajus, Eric Rémila, Philippe Solal:
Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations. Ann. Oper. Res. 302(1): 23-47 (2021) - [j58]Encarnación Algaba, Stefano Moretti, Eric Rémila, Philippe Solal:
Lexicographic solutions for coalitional rankings. Soc. Choice Welf. 57(4): 817-849 (2021) - [j57]Éric Duchêne, Stéphane Gonzalez, Aline Parreau, Eric Rémila, Philippe Solal:
influence: A partizan scoring game on graphs. Theor. Comput. Sci. 878-879: 26-46 (2021) - 2020
- [j56]Sylvain Béal, Issofa Moyouwou, Eric Rémila, Philippe Solal:
Cooperative games on intersection closed systems and the Shapley value. Math. Soc. Sci. 104: 15-22 (2020) - [j55]Kévin Perrot, Éric Rémila:
On the emergence of regularities on one-dimensional decreasing sandpiles. Theor. Comput. Sci. 843: 1-24 (2020) - [c32]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328 - [i13]Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020) - [i12]Éric Duchêne, Stéphane Gonzalez, Aline Parreau, Eric Rémila, Philippe Solal:
INFLUENCE: a partizan scoring game on graphs. CoRR abs/2005.12818 (2020) - [i11]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca:
Local Certification of Graphs with Bounded Genus. CoRR abs/2007.08084 (2020)
2010 – 2019
- 2019
- [j54]Encarnación Algaba, Sylvain Béal, Eric Rémila, Philippe Solal:
Harsanyi power solutions for cooperative games on voting structures. Int. J. Gen. Syst. 48(6): 575-602 (2019) - 2018
- [j53]Sylvain Béal, Sylvain Ferrières, Eric Rémila, Philippe Solal:
The proportional Shapley value and applications. Games Econ. Behav. 108: 93-112 (2018) - [j52]Enrico Formenti, Kévin Perrot, Eric Rémila:
Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles. J. Cell. Autom. 13(3): 215-228 (2018) - [j51]Sylvain Béal, Sylvain Ferrières, Eric Rémila, Philippe Solal:
Axiomatization of an allocation rule for ordered tree TU-games. Math. Soc. Sci. 93: 132-140 (2018) - [j50]Damien Regnault, Eric Rémila:
Lost in self-stabilization: A local process that aligns connected cells. Theor. Comput. Sci. 736: 41-61 (2018) - [i10]Enrico Formenti, Kévin Perrot, Eric Rémila:
Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles. CoRR abs/1803.05498 (2018) - 2017
- [j49]Sylvain Béal, Eric Rémila, Philippe Solal:
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games. Ann. Oper. Res. 253(1): 43-59 (2017) - [j48]Kévin Perrot, Eric Rémila:
Strong Emergence of Wave Patterns on Kadanoff Sandpiles. Electron. J. Comb. 24(2): 2 (2017) - [j47]Sylvain Béal, Eric Rémila, Philippe Solal:
Discounted tree solutions. Discret. Appl. Math. 219: 1-17 (2017) - 2016
- [j46]Sylvain Béal, Eric Rémila, Philippe Solal:
Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form. IGTR 18(1): 1650003:1-1650003:21 (2016) - [j45]Sylvain Béal, Sylvain Ferrières, Eric Rémila, Philippe Solal:
Axiomatic characterizations under players nullification. Math. Soc. Sci. 80: 47-57 (2016) - [c31]Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila:
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. COCOON 2016: 182-193 - 2015
- [j44]Sylvain Béal, Eric Rémila, Philippe Solal:
A decomposition of the space of TU-games using addition and transfer invariance. Discret. Appl. Math. 184: 1-13 (2015) - [j43]Sylvain Béal, Eric Rémila, Philippe Solal:
Axioms of invariance for TU-games. Int. J. Game Theory 44(4): 891-902 (2015) - [j42]Sylvain Béal, Eric Rémila, Philippe Solal:
Preserving or removing special players: What keeps your payoff unchanged in TU-games? Math. Soc. Sci. 73: 23-31 (2015) - [j41]Sylvain Béal, Eric Rémila, Philippe Solal:
Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value. Oper. Res. Lett. 43(2): 123-125 (2015) - [j40]Richard Baron, Mostapha Diss, Eric Rémila, Philippe Solal:
A geometric examination of majorities based on difference in support. Soc. Choice Welf. 45(1): 123-153 (2015) - [j39]Kévin Perrot, Eric Rémila:
Piles de sable décroissantes 1D. Classification expérimentale d'émergences. Tech. Sci. Informatiques 34(4): 377-400 (2015) - [c30]Kévin Perrot, Eric Rémila:
Emergence on Decreasing Sandpile Models. MFCS (1) 2015: 419-431 - [c29]Damien Regnault, Eric Rémila:
Lost in Self-Stabilization. MFCS (1) 2015: 432-443 - [c28]Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila:
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. PODC 2015: 167-169 - 2014
- [c27]Enrico Formenti, Kévin Perrot, Eric Rémila:
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. Automata 2014: 21-30 - [c26]Kévin Perrot, Eric Rémila:
Emergence of Wave Patterns on Kadanoff Sandpiles. LATIN 2014: 634-647 - [i9]Damien Regnault, Eric Rémila:
Lost in Self-stabilization. CoRR abs/1410.7669 (2014) - 2013
- [j38]Sylvain Béal, Eric Rémila, Philippe Solal:
An optimal bound to access the core in TU-games. Games Econ. Behav. 80: 1-9 (2013) - [j37]Sylvain Béal, Amandine Ghintran, Eric Rémila, Philippe Solal:
The River Sharing Problem: a Survey. IGTR 15(3) (2013) - [j36]Sylvain Béal, Eric Rémila, Philippe Solal:
Accessibility and stability of the coalition structure core. Math. Methods Oper. Res. 78(2): 187-202 (2013) - [j35]Kévin Perrot, Eric Rémila:
Kadanoff sand pile model. Avalanche structure and wave shape. Theor. Comput. Sci. 504: 52-72 (2013) - [i8]Kévin Perrot, Eric Rémila:
Kadanoff Sand Piles, following the snowball. CoRR abs/1301.0997 (2013) - [i7]Kévin Perrot, Eric Rémila:
Kadanoff Sand Pile Model. Avalanche Structure and Wave Shape. CoRR abs/1304.5109 (2013) - [i6]Kévin Perrot, Eric Rémila:
Emergence of wave patterns on Kadanoff Sandpiles. CoRR abs/1312.4066 (2013) - 2012
- [j34]Sylvain Béal, Aymeric Lardon, Eric Rémila, Philippe Solal:
The average tree solution for multi-choice forest games. Ann. Oper. Res. 196(1): 27-51 (2012) - [j33]Sylvain Béal, Eric Rémila, Philippe Solal:
On the number of blocks required to access the core. Discret. Appl. Math. 160(7-8): 925-932 (2012) - [j32]Sylvain Béal, Eric Rémila, Philippe Solal:
Compensations in the Shapley value and the compensation solutions for graph games. Int. J. Game Theory 41(1): 157-178 (2012) - [j31]Sylvain Béal, Eric Rémila, Philippe Solal:
Weighted component fairness for forest games. Math. Soc. Sci. 64(2): 144-151 (2012) - [c25]Sylvain Béal, Eric Rémila, Philippe Solal:
An Optimal Bound to Access the Core in TU-Games. SAGT 2012: 49-60 - 2011
- [j30]Richard Baron, Sylvain Béal, Eric Rémila, Philippe Solal:
Average tree solutions and the distribution of Harsanyi dividends. Int. J. Game Theory 40(2): 331-349 (2011) - [j29]Olivier Bodini, Thomas Fernique, Michaël Rao, Eric Rémila:
Distances on rhombus tilings. Theor. Comput. Sci. 412(36): 4787-4794 (2011) - [c24]Eric Rémila:
The Optimal Strategy for the Average Long-Lived Consensus. CSR 2011: 415-428 - [c23]Kévin Perrot, Eric Rémila:
Avalanche Structure in the Kadanoff Sand Pile Model. LATA 2011: 427-439 - [c22]Kévin Perrot, Eric Rémila:
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. MFCS 2011: 508-519 - [i5]Kévin Perrot, Eric Rémila:
Avalanche Structure in the Kadanoff Sand Pile Model. CoRR abs/1101.5940 (2011) - [i4]Kévin Perrot, Eric Rémila:
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. CoRR abs/1106.2670 (2011) - 2010
- [j28]Sylvain Béal, Eric Rémila, Philippe Solal:
Rooted-tree solutions for tree games. Eur. J. Oper. Res. 203(2): 404-408 (2010) - [j27]Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila:
Average long-lived binary consensus: Quantifying the stabilizing role played by memory. Theor. Comput. Sci. 411(14-15): 1558-1566 (2010) - [c21]Ivan Rapaport, Eric Rémila:
Average Long-Lived Memoryless Consensus: The Three-Value Case. SIROCCO 2010: 114-126
2000 – 2009
- 2009
- [c20]Olivier Bodini, Thomas Fernique, Eric Rémila:
Distances on Lozenge Tilings. DGCI 2009: 240-251 - [i3]Olivier Bodini, Eric Rémila, Thomas Fernique:
Distances on Lozenge Tilings. CoRR abs/0911.2804 (2009) - 2008
- [j26]Olivier Bodini, Thomas Fernique, Eric Rémila:
A characterization of flip-accessibility for rhombus tilings of the whole plane. Inf. Comput. 206(9-10): 1065-1073 (2008) - [c19]Florent Becker, Eric Rémila, Nicolas Schabanel:
Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes. DNA 2008: 144-155 - [c18]Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila:
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. SIROCCO 2008: 48-60 - 2007
- [j25]Michel Morvan, Eric Rémila, Eric Thierry:
A note on the structure of spaces of domino tilings. Discret. Math. 307(6): 769-773 (2007) - [c17]Olivier Bodini, Thomas Fernique, Eric Rémila:
A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane. LATA 2007: 139-150 - 2006
- [j24]Frédéric Chavanon, Eric Rémila:
Rhombus Tilings: Decomposition and Space Structure. Discret. Comput. Geom. 35(2): 329-358 (2006) - [j23]Sébastien Desreux, Eric Rémila:
An optimal algorithm to generate tilings. J. Discrete Algorithms 4(1): 168-180 (2006) - [c16]Florent Becker, Ivan Rapaport, Eric Rémila:
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. FSTTCS 2006: 45-56 - [c15]Bertrand Nouvel, Eric Rémila:
Incremental and Transitive Discrete Rotations. IWCIA 2006: 199-213 - 2005
- [j22]Bertrand Nouvel, Eric Rémila:
Configurations induced by discrete rotations: periodicity and quasi-periodicity properties. Discret. Appl. Math. 147(2-3): 325-343 (2005) - [j21]Eric Rémila:
Tiling a Polygon with Two Kinds of Rectangles. Discret. Comput. Geom. 34(2): 313-330 (2005) - [j20]Frédéric Chavanon, Matthieu Latapy, Michel Morvan, Eric Rémila, Laurent Vuillon:
Graph encoding of 2D-gon tilings. Theor. Comput. Sci. 346(2-3): 226-253 (2005) - [i2]Bertrand Nouvel, Eric Rémila:
Incremental and Transitive Discrete Rotations. CoRR abs/cs/0512070 (2005) - 2004
- [j19]Frédéric Chavanon, Eric Rémila:
Rhombus tilings: decomposition and space structure: (extended abstract). Electron. Notes Discret. Math. 18: 81-87 (2004) - [j18]Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila:
Algebraic tools for the construction of colored flows with boundary constraints. RAIRO Theor. Informatics Appl. 38(3): 229-243 (2004) - [j17]Olivier Bodini, Eric Rémila:
Tilings with trichromatic colored-edges triangles. Theor. Comput. Sci. 319(1-3): 59-70 (2004) - [j16]Sébastien Desreux, Martín Matamala, Ivan Rapaport, Eric Rémila:
Domino tilings and related models: space of configurations of domains with holes. Theor. Comput. Sci. 319(1-3): 83-101 (2004) - [j15]Codrin M. Nichitiu, Christophe Papazian, Eric Rémila:
Leader election in plane cellular automata, only with left-right global convention. Theor. Comput. Sci. 319(1-3): 367-384 (2004) - [j14]Eric Rémila:
The lattice structure of the set of domino tilings of a polygon. Theor. Comput. Sci. 322(2): 409-422 (2004) - [c14]Eric Rémila:
Tiling a Polygon with Two Kinds of Rectangles. ESA 2004: 568-579 - [c13]Bertrand Nouvel, Eric Rémila:
Characterization of Bijective Discretized Rotations. IWCIA 2004: 248-259 - 2003
- [j13]Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila:
Tiling with bars under tomographic constraints. Theor. Comput. Sci. 290(3): 1317-1329 (2003) - [c12]Bertrand Nouvel, Eric Rémila:
On Colorations Induced by Discrete Rotations. DGCI 2003: 174-183 - [e1]Michel Morvan, Eric Rémila:
Discrete Models for Complex Systems, DMCS'03, Lyon, France, June 16-19, 2003. DMTCS Proceedings AB, DMTCS 2003 [contents] - 2002
- [j12]Codrin M. Nichitiu, Eric Rémila:
Effective Simulations on Hyperbolic Networks. Fundam. Informaticae 52(1-3): 203-231 (2002) - [j11]Eric Rémila:
On the Structure of Some Spaces of Tilings. SIAM J. Discret. Math. 16(1): 1-19 (2002) - [c11]Christophe Papazian, Eric Rémila:
Hyperbolic Recognition by Graph Automata. ICALP 2002: 330-342 - [c10]Cristopher Moore, Ivan Rapaport, Eric Rémila:
Tiling groups for Wang tiles. SODA 2002: 402-411 - 2001
- [j10]Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila:
Algorithms for Leader Election by Cellular Automata. J. Algorithms 41(2): 302-329 (2001) - [c9]Christophe Papazian, Eric Rémila:
Linear Time Recognizer for Subsets of Z2. FCT 2001: 400-403 - 2000
- [j9]Claire Kenyon, Eric Rémila:
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. Math. Oper. Res. 25(4): 645-656 (2000) - [c8]Christophe Papazian, Eric Rémila:
Some Properties of Hyperbolic Networks. DGCI 2000: 149-158 - [c7]Eric Rémila:
An algebraic method to compute a shortest path of local flips between two tilings. SODA 2000: 646-653
1990 – 1999
- 1999
- [c6]Codrin M. Nichitiu, Eric Rémila:
Leader Election by d Dimensional Cellular Automata. ICALP 1999: 565-574 - [c5]Jacques Mazoyer, Codrin M. Nichitiu, Eric Rémila:
Compass Permits Leader Election. SODA 1999: 947-948 - [i1]Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila:
Tiling with bars under tomographic constraints. CoRR cs.DS/9903020 (1999) - 1998
- [j8]Eric Rémila:
Tiling Groups: New Applications in the Triangular Lattice. Discret. Comput. Geom. 20(2): 189-204 (1998) - [c4]Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila:
Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure. STACS 1998: 587-595 - 1996
- [j7]Claire Kenyon, Eric Rémila:
Perfect matchings in the triangular lattice. Discret. Math. 152(1-3): 191-210 (1996) - [j6]Eric Rémila:
Tiling a simply connected figure with bars of length 2 or 3. Discret. Math. 160(1-3): 189-198 (1996) - [j5]Eric Rémila:
Tiling with Bars and Satisfaction of Boolean Formulas. Eur. J. Comb. 17(5): 485-491 (1996) - [c3]Claire Kenyon, Eric Rémila:
Approximate Strip Packing. FOCS 1996: 31-36 - [c2]Eric Rémila:
Tiling a Figure Using a Height in a Tree. SODA 1996: 168-174 - 1995
- [j4]Danièle Beauquier, Maurice Nivat, Eric Rémila, Mike Robson:
Tiling Figures of the Plane with Two Bars. Comput. Geom. 5: 1-25 (1995) - [c1]Eric Rémila:
Tiling with Bars and Satisfaction of Boolean Formulas. FCT 1995: 404-413 - 1994
- [j3]Eric Rémila:
A Linear Algorithm to Tile the Trapezes with h_m and v_n. Theor. Comput. Sci. 123(1): 151-165 (1994) - [j2]Eric Rémila:
On the Tiling of a Torus with Two Bars. Theor. Comput. Sci. 134(2): 415-426 (1994) - [j1]Eric Rémila:
Recognition of Graphs by Automata. Theor. Comput. Sci. 136(2): 291-332 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
