Filtrer vos résultats
- 27
- 12
- 26
- 5
- 3
- 2
- 1
- 1
- 1
- 38
- 5
- 1
- 1
- 1
- 2
- 2
- 1
- 3
- 4
- 2
- 2
- 2
- 2
- 4
- 6
- 1
- 2
- 2
- 1
- 37
- 2
- 17
- 15
- 10
- 5
- 4
- 4
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 39
- 7
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
39 résultats
|
|
|
triés par
|
|
|
Regular simplices and periodic billiard orbitsProceedings of the American Mathematical Society, 2014, ⟨10.1090/S0002-9939-2014-12076-4⟩
Article dans une revue
hal-01219084v1
|
||
|
|
Distances on rhombus tilingsTheoretical Computer Science, 2011, 412 (36), pp.4787-- 4794. ⟨10.1016/j.tcs.2011.04.015⟩
Article dans une revue
hal-01146174v1
|
||
|
|
Preuves aidées par ordinateur en combinatoire des motsInformatique [cs]. ENS de Lyon, 2017
HDR
tel-02157167v1
|
||
|
|
NLC-2 graph recognition and isomorphismWG'07, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, 2007, Jena, Germany
Communication dans un congrès
hal-00159700v1
|
||
On Shuffling of Infinite Square-Free WordsThe Electronic Journal of Combinatorics, 2015, 22, pp.1-55
Article dans une revue
hal-01993481v1
|
|||
|
|
Solving Some NP-Complete Problems using Split DecompositionDiscrete Applied Mathematics, 2008, 156 (14), pp.2768-2780. ⟨10.1016/j.dam.2007.11.013⟩
Article dans une revue
lirmm-00324549v1
|
||
Directed Rank-Width and Displit Decomposition35th International Workshop on Theoretic-Concepts in Computer Science, Jun 2009, Montpellier, France. pp.220-230
Communication dans un congrès
hal-00400815v1
|
|||
|
|
Bipartitive families and the bi-join decomposition2005
Pré-publication, Document de travail
hal-00132862v1
|
||
|
|
A Note On Computing Set Overlap Classes2007
Pré-publication, Document de travail
hal-00192579v1
|
||
How Many Square Occurrences Must a Binary Sequence Contain?The Electronic Journal of Combinatorics, 2003, 10, pp.R12
Article dans une revue
hal-00307205v1
|
|||
|
|
Odd Perfect Numbers are Greater than 10^1500Mathematics of Computation, 2012, 81 (279), pp.1869-1877. ⟨10.1090/S0025-5718-2012-02563-4⟩
Article dans une revue
lirmm-00739245v1
|
||
Another remark on the radical of an ODD perfect numberThe Fibonacci Quarterly, 2014, 52 (3), pp.215-217
Article dans une revue
lirmm-01349855v1
|
|||
|
|
On the number of prime factors of an odd perfect numberMathematics of Computation, 2014, 83 (289), pp.2435-2439. ⟨10.1090/S0025-5718-2013-02776-7⟩
Article dans une revue
lirmm-01263897v1
|
||
|
|
Tree-representation of set families and applications to combinatorial decompositionsEuropean Journal of Combinatorics, 2012, 33 (5), pp.688-711. ⟨10.1016/j.ejc.2011.09.032⟩
Article dans une revue
hal-00555520v1
|
||
|
|
A Note on Computing Set Overlap ClassesInformation Processing Letters, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩
Article dans une revue
lirmm-00325371v1
|
||
Representing Partitive Crossing Families and Union-Difference Families, with Application to Sesquimodular DecompositionRR-07031, 2007
Rapport
lirmm-00199916v1
|
|||
|
|
NLC-2 graph recognition and isomorphismGraph-Theoretic Concepts in Computer Science 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007., Jun 2007, Dornburg, Germany. pp.86-98, ⟨10.1007/978-3-540-74839-7_9⟩
Communication dans un congrès
hal-00134605v1
|
||
|
|
How many square occurrences must a binary sequence contain?The Electronic Journal of Combinatorics, 2003, 10 (1), 11 p. ⟨10.37236/1705⟩
Article dans une revue
inria-00099596v1
|
||
|
|
An aperiodic set of 11 Wang tilesAdvances in Combinatorics, 2021, ⟨10.19086/aic.18614⟩
Article dans une revue
hal-01166053v4
|
||
Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$SIAM Journal on Discrete Mathematics, 2018, 32 (4), pp.2381-2397
Article dans une revue
hal-01993498v1
|
|||
|
|
Décompositions de graphes et algorithmes efficacesAutre [cs.OH]. Université Paul Verlaine - Metz, 2006. Français. ⟨NNT : 2006METZ007S⟩
Thèse
tel-01752468v1
|
||
|
|
Clique-Width and the Speed of Hereditary PropertiesThe Electronic Journal of Combinatorics, 2009, 16 (1), pp.11. ⟨10.37236/124⟩
Article dans une revue
lirmm-00808010v1
|
||
On cardinalities of k-abelian equivalence classesTheoretical Computer Science, 2017, 658, pp.190-204
Article dans une revue
hal-01993169v1
|
|||
Avoidability of long $k$-abelian repetitionsMathematics of Computation, 2016, 85 (302), pp.3051-3060
Article dans une revue
hal-01993427v1
|
|||
|
|
Well-Quasi-Order of Relabel FunctionsOrder, 2010, 27, pp.301-315. ⟨10.1007/s11083-010-9174-0⟩
Article dans une revue
lirmm-00806804v1
|
||
Avoiding 2-binomial squares and cubesTheoretical Computer Science, 2015, 572, pp.83-91
Article dans une revue
hal-01993439v1
|
|||
|
|
Diamond-Free Circle Graphs are Helly CircleDiscrete Mathematics, 2010, 310 (4), pp.845-849. ⟨10.1016/j.disc.2009.09.022⟩
Article dans une revue
lirmm-00432897v1
|
||
|
|
Testing Balanced Splitting Cycles in Complete TriangulationsCanadian Conference on Computational Geometry (CCCG 2020), Aug 2020, Saskatchewan/Online, Canada. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-03059811v1
|
||
Avoiding or limiting regularities in wordsSequences, Groups and Number Theory, pp.177-212, 2018, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_5⟩
Chapitre d'ouvrage
lirmm-02083655v1
|
|||
|
|
New decompositions of 2-structures2007
Pré-publication, Document de travail
hal-00141480v2
|
- 1
- 2