default search action
Laurent Vuillon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Michela Ascolese
, Andrea Frosini, Elisa Pergola, Simone Rinaldi, Laurent Vuillon:
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence. Theor. Comput. Sci. 1020: 114872 (2024) - 2022
- [j37]Benoît Colange
MING: An interpretative support method for visual exploration of multidimensional data. Inf. Vis. 21(3): 246-269 (2022) - [j36]Aria Gheeraert, Laurent Vuillon, Laurent Chaloin, Olivier Moncorgé, Thibaut Very, Serge Perez
Singular Interface Dynamics of the SARS-CoV-2 Delta Variant Explained with Contact Perturbation Analysis. J. Chem. Inf. Model. 62(12): 3107-3122 (2022) - [j35]Paolo Dulio, Andrea Frosini, Simone Rinaldi
Further steps on the reconstruction of convex polyominoes from orthogonal projections. J. Comb. Optim. 44(4): 2423-2442 (2022) - 2021
- [j34]Clément Lagisquet, Edita Pelantová
On the Markov numbers: Fixed numerator, denominator, and sum conjectures. Adv. Appl. Math. 130: 102227 (2021)
2010 – 2019
- 2019
- [j33]Katerina Medková, Edita Pelantová, Laurent Vuillon:
Derived sequences of complementary symmetric Rote sequences. RAIRO Theor. Informatics Appl. 53(3-4): 125-151 (2019) - [j32]Andrea Frosini
Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses. Theor. Comput. Sci. 777: 329-337 (2019) - [c9]Eric Domenjoud, Bastien Laboureix, Laurent Vuillon:
Facet Connectedness of Arithmetic Discrete Hyperplanes with Non-Zero Shift. DGCI 2019: 38-50 - [c8]Lama Tarsissi
Second Order Balance Property on Christoffel Words. MACIS 2019: 295-312 - [c7]Benoît Colange, Laurent Vuillon, Sylvain Lespinats
Interpreting Distortions in Dimensionality Reduction by Superimposing Neighbourhood Graphs. IEEE VIS (Short Papers) 2019: 211-215 - [i1]Benoît Colange, Laurent Vuillon, Sylvain Lespinats, Denys Dutykh:
Interpreting Distortions in Dimensionality Reduction by Superimposing Neighbourhood Graphs. CoRR abs/1909.12902 (2019) - 2018
- [j31]Laurent Vuillon, Denys Dutykh
Some special solutions to the Hyperbolic NLS equation. Commun. Nonlinear Sci. Numer. Simul. 57: 202-220 (2018) - 2017
- [c6]Paolo Dulio
First Steps in the Algorithmic Reconstruction of Digital Convex Sets. WORDS 2017: 164-176 - 2016
- [j30]Ian Gambini, Laurent Vuillon:
Tiling the Space by Polycube Analogues of Fedorov's Polyhedra. Fundam. Informaticae 146(2): 197-209 (2016) - [j29]Eric Domenjoud, Xavier Provençal, Laurent Vuillon:
Palindromic language of thin discrete planes. Theor. Comput. Sci. 624: 101-108 (2016) - 2015
- [j28]Xavier Provençal
Discrete segments of Z3 constructed by synchronization of words. Discret. Appl. Math. 183: 102-117 (2015) - [c5]Annette Casagrande, Edison Loza Aguirre
Improving Strategic Scanning Information Analysis: An Alternative Measure for Information Proximity Evaluation. ES 2015: 1-8 - 2014
- [c4]Eric Domenjoud, Xavier Provençal, Laurent Vuillon:
Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case. DGCI 2014: 1-12 - 2013
- [j27]Khalil Tawbe, Laurent Vuillon:
2L convex polyominoes: discrete tomographical aspects. Contributions Discret. Math. 8(1) (2013) - [j26]Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
On the shape of permutomino tiles. Discret. Appl. Math. 161(15): 2316-2327 (2013) - 2012
- [j25]Eric Domenjoud, Damien Jamet, Damien Vergnaud
Enumeration formula for (2, n)-cubes in discrete planes. Discret. Appl. Math. 160(15): 2158-2171 (2012) - [j24]Ian Gambini, Laurent Vuillon:
Non-lattice-periodic tilings of R3 by single polycubes. Theor. Comput. Sci. 432: 52-57 (2012) - 2011
- [j23]Khalil Tawbe, Laurent Vuillon:
2L-convex polyominoes: Geometrical aspects. Contributions Discret. Math. 6(1) (2011) - [j22]Ian Gambini, Laurent Vuillon:
How many Faces can the Polycubes of Lattice Tilings by Translation of R3 have? Electron. J. Comb. 18(1) (2011) - [j21]Damien Jamet, Geneviève Paquin, Gwénaël Richomme, Laurent Vuillon:
On the fixed points of the iterated pseudopalindromic closure operator. Theor. Comput. Sci. 412(27): 2974-2987 (2011) - [j20]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412(46): 6455-6463 (2011) - [c3]Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
Tiling the Plane with Permutations. DGCI 2011: 381-393
2000 – 2009
- 2009
- [j19]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
Codings of rotations on two intervals are full. Electron. Notes Discret. Math. 34: 289-293 (2009) - [j18]Pál Dömösi, Géza Horváth, Laurent Vuillon:
On the Shyr-Yu theorem. Theor. Comput. Sci. 410(47-49): 4874-4877 (2009) - 2007
- [j17]Geneviève Paquin, Laurent Vuillon:
A Characterization of Balanced Episturmian Sequences. Electron. J. Comb. 14(1) (2007) - [j16]Pascal Hubert, Laurent Vuillon:
Complexity of cutting words on regular tilings. Eur. J. Comb. 28(1): 429-438 (2007) - [j15]Ian Gambini, Laurent Vuillon:
An algorithm for deciding if a polyomino tiles the plane. RAIRO Theor. Informatics Appl. 41(2): 147-155 (2007) - 2006
- [j14]Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
Tilings by Translation: Enumeration by a Rational Language Approach. Electron. J. Comb. 13(1) (2006) - [j13]Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon:
Combinatorial properties of smooth infinite words. Theor. Comput. Sci. 352(1-3): 306-317 (2006) - 2005
- [j12]Christiane Frougny, Laurent Vuillon:
Coding of Two-Dimensional Constraints of Finite Type by Substitutions. J. Autom. Lang. Comb. 10(4): 465-482 (2005) - [j11]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) - [j10]Andrea Frosini, Maurice Nivat, Laurent Vuillon:
An introduction to periodical discrete sets from a tomographical perspective. Theor. Comput. Sci. 347(1-2): 370-392 (2005) - 2004
- [j9]Laurent Vuillon:
Foreword: Combinatorics of the Discrete Plane and Tilings. Theor. Comput. Sci. 319(1-3): 1 (2004) - 2002
- [j8]Isabelle Fagnot, Laurent Vuillon:
Generalized balances in Sturmian words. Discret. Appl. Math. 121(1-3): 83-101 (2002) - [j7]Jean Mairesse, Laurent Vuillon:
Asymptotic behavior in a heap model with two pieces. Theor. Comput. Sci. 270(1-2): 525-560 (2002) - [j6]Jean Berstel, Laurent Vuillon:
Coding rotations on intervals. Theor. Comput. Sci. 281(1-2): 99-107 (2002) - [c2]Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon:
Discrete Tomography: Reconstruction under Periodicity Constraints. ICALP 2002: 38-56 - 2001
- [j5]Laurent Vuillon:
A Characterization of Sturmian Words by Return Words. Eur. J. Comb. 22(2): 263-275 (2001) - [j4]Valérie Berthé, Laurent Vuillon:
Palindromes and Two-Dimensional Sturmian Sequences. J. Autom. Lang. Comb. 6(2): 121-138 (2001) - [c1]Clémence Magnien, Ha Duong Phan, Laurent Vuillon:
Characterization of Lattices Induced by (extended) Chip Firing Games. DM-CCG 2001: 229-244 - 2000
- [j3]Valérie Berthé, Laurent Vuillon:
Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences. Discret. Math. 223(1-3): 27-53 (2000) - [j2]Jacques Justin, Laurent Vuillon:
Return words in Sturmian and episturmian words. RAIRO Theor. Informatics Appl. 34(5): 343-356 (2000)
1990 – 1999
- 1998
- [j1]Laurent Vuillon:
Combinatoire des motifs d'une suite sturmienne bidimensionnelle. Theor. Comput. Sci. 209(1-2): 261-285 (1998)
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-11-07 20:29 CET 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: