Filter your results
- 299
- 174
- 7
- 253
- 137
- 49
- 12
- 9
- 7
- 6
- 4
- 1
- 1
- 1
- 8
- 2
- 480
- 199
- 26
- 24
- 23
- 19
- 19
- 11
- 5
- 4
- 1
- 5
- 21
- 14
- 13
- 31
- 18
- 14
- 10
- 15
- 10
- 20
- 15
- 24
- 25
- 14
- 36
- 21
- 31
- 23
- 10
- 19
- 8
- 11
- 6
- 6
- 3
- 13
- 4
- 5
- 6
- 6
- 6
- 6
- 1
- 2
- 2
- 1
- 4
- 1
- 458
- 22
- 320
- 70
- 31
- 28
- 26
- 25
- 23
- 21
- 20
- 20
- 18
- 18
- 16
- 13
- 12
- 11
- 11
- 10
- 9
- 9
- 8
- 8
- 7
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 47
- 37
- 27
- 23
- 23
- 23
- 20
- 20
- 15
- 14
- 14
- 13
- 12
- 11
- 11
- 9
- 9
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
|
On graphs with no induced subdivision of K4Journal of Combinatorial Theory, Series B, 2012, 102, pp.924-947. ⟨10.1016/j.jctb.2012.04.005⟩
Journal articles
lirmm-00736503v1
|
||
|
Noncommutative symmetric functions IV : Quantum linear groups and Hecke algebras at q = 0Journal of Algebraic Combinatorics, 1997, 6, (4), pp.339-376
Journal articles
hal-00018539v1
|
||
|
Utilisation de l'algèbre linéaire en théorie des automates1er Colloque AFCET-SMF de Mathématiques Appliquées, Sep 1978, Palaiseau, France. pp.85-92
Conference papers
hal-00340773v1
|
||
On alpha-adic expansions in Pisot basesTheoretical Computer Science, 2007, 380, pp.238-250
Journal articles
hal-00159691v1
|
|||
|
A topological approach to transductionsTheoretical Computer Science, 2005, 340, pp.443-456
Journal articles
hal-00112837v1
|
||
|
Cycle time of stochastic max-plus linear systemsElectronic Journal of Probability, 2008, 13 (2008), Paper 12, 322-340
Journal articles
hal-00197850v2
|
||
|
On a conjecture of Schnoebelen2003, pp.35--54
Conference papers
hal-00112692v1
|
||
On univoque Pisot numbersMathematics of Computation, 2007, 76, pp.1639-1660
Journal articles
hal-00159701v1
|
|||
On the representation of numbers in a rational baseWords 2005, 2005, Montréal, Canada. pp.47-64
Conference papers
hal-00159715v1
|
|||
|
Griggs and Yeh's Conjecture and L(p,1)-labelingsSIAM Journal on Discrete Mathematics, 2012, 26 (1), pp.145--168. ⟨10.1137/090763998⟩
Journal articles
inria-00327909v2
|
||
Bilinear functions and trees over the (max,+) semiringMFCS 2000, 2000, Bratislava, Slovakia. pp.549-558
Conference papers
hal-00165941v1
|
|||
|
Analysis of an algorithm catching elephants on the InternetFifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.295-310, ⟨10.46298/dmtcs.3572⟩
Conference papers
hal-01194674v1
|
||
|
Homomorphisms of signed graphs: An updateEuropean Journal of Combinatorics, 2021, ⟨10.1016/j.ejc.2020.103222⟩
Journal articles
hal-02429415v2
|
||
|
On Bi-infinite and Conjugate Post Correspondence Problems2022
Preprints, Working Papers, ...
hal-03780128v1
|
||
|
Queues with Skill Based Parallel Servers and a FCFS Infinite Matching ModelMAMA 2013 workshop of ACM Sigmetrics, 2013, Pittsburgh, United States. pp.22-24, ⟨10.1145/2567529.2567536⟩
Conference papers
hal-01273894v1
|
||
|
Probabilistic cellular automata and random fields with i.i.d. directions2012
Preprints, Working Papers, ...
hal-00727312v1
|
||
Partially commutative Magnus transformationsInternational Journal of Algebra and Computation, 1993, 3, (1), pp.15-41
Journal articles
hal-00017315v1
|
|||
|
Probabilistic analyses of the plain multiple GCD algorithmJournal of Symbolic Computation, 2016, 74, pp.425-474. ⟨10.1016/j.jsc.2015.08.007⟩
Journal articles
hal-01578381v1
|
||
|
A Tight Bound on the Set Chromatic NumberDiscussiones Mathematicae Graph Theory, 2013, 33 (2), pp.461--465. ⟨10.7151/dmgt.1679⟩
Journal articles
hal-00624323v2
|
||
|
Report on GRASTA 2014[Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014
Reports
hal-01084230v1
|
||
|
Graphs with bounded tree-width and large odd-girth are almost bipartiteJournal of Combinatorial Theory, Series B, 2010, 100 (6), pp.554--559. ⟨10.1016/j.jctb.2010.04.004⟩
Journal articles
hal-00515582v1
|
||
|
A note on antisymmetric flows in graphsEuropean Journal of Combinatorics, 2010, 31 (1), pp.320--324. ⟨10.1016/j.ejc.2009.05.005⟩
Journal articles
hal-00487098v1
|
||
|
The Price of Connectivity for Vertex CoverDiscrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.207--223. ⟨10.46298/dmtcs.1262⟩
Journal articles
hal-01179215v1
|
||
|
Adjacent transformations in permutations23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.765-776, ⟨10.46298/dmtcs.2951⟩
Conference papers
hal-01215071v1
|
||
|
A combinatorial method to find sharp lower bounds on flip distances25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.1-12
Conference papers
hal-01229752v1
|
||
|
Deficiency Zero Petri Nets and Product Form2010
Preprints, Working Papers, ...
hal-00385673v3
|
||
WG'09: International Workshop on Theoretic Concepts in Computer Science5911, 352 p., 2010, Lecture Notes in Computer Science
Books
lirmm-00533518v1
|
|||
|
Redundancy of minimal weight expansions in Pisot basesTheoretical Computer Science, 2011, 412 (45), pp.6303-6315. ⟨10.1016/j.tcs.2011.08.018⟩
Journal articles
hal-00572575v1
|
||
The four-in-a-tree problem for triangle-free graphsGraphs and Combinatorics, 2009, 25, pp.489-502
Journal articles
hal-00536448v1
|
|||
|
Sensitivity lower bounds from linear dependencies2020
Preprints, Working Papers, ...
hal-02429358v1
|