![]() |
Free and accessible knowledge |
|
||
---|---|---|
hal-00408012v1
Journal articles
Extensions and restrictions of Wyhtoff's game preserving Wythoff's P-positions Journal of Combinatorial Theory, Series A, Elsevier, 2009 |
||
hal-00408010v1
Journal articles
Another bridge between Nim and Wythoff The Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2009, 44, pp.43-56 |
||
hal-02165557v1
Conference papers
Scalable Evaluation of 3D City Models IGARSS 2019 - IEEE International Geoscience and Remote Sensing Symposium, Jul 2019, Yokohama, Japan |
||
hal-00724788v1
Preprints, Working Papers, ...
Towards a statement of the S-adic conjecture through examples 2012 |
||
hal-02884177v1
Conference papers
Robust Predictive-Reactive Scheduling : an Information-Based Decision Tree Model 18th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2020, Lisbon, France. pp.479-492, ⟨10.1007/978-3-030-50153-2_36⟩ |
||
hal-00407264v1
Directions of work or proceedings
Electronic Notes in Discrete Mathematics, Volume 22, 7th International Colloquium on Graph Theory Elsevier, pp.562, 2005 |
||
hal-02087529v1
Conference papers
Digital Plane Recognition with Fewer Probes 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Couprie M.; Cousty J.; Kenmochi Y.; Mustafa N., Mar 2019, Marne-la-Vallée, France. pp.380-393, ⟨10.1007/978-3-030-14085-4_30⟩ |
||
lirmm-00250083v1
Journal articles
Graphs with Large Girth Not Embeddable in the Sphere Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2007, 16 (6), pp.829-832. ⟨10.1017/S0963548307008528⟩ |
||
hal-00165947v1
Conference papers
Performance evaluation of timed Petri nets using heaps of pieces PNPM'99, 1999, Zaragoza, Spain. pp.158-169 |
||
inria-00407672v1
Reports
Critical paths in the Partial Order Unfolding of a Stochastic Petri Net [Research Report] RR-7003, INRIA. 2009, pp.17 |
||
hal-01765520v1
Journal articles
Representing lattices using many-valued relations Information Sciences, Elsevier, 2009, 179 (16), pp.2729 - 2739. ⟨10.1016/j.ins.2009.03.018⟩ |
||
hal-01765521v1
Journal articles
Enumeration aspects of maximal cliques and bicliques Discrete Applied Mathematics, Elsevier, 2009, 157 (7), pp.1447 - 1459. ⟨10.1016/j.dam.2008.10.010⟩ ![]() |
||
hal-00407964v1
Journal articles
A new deletion game on graphs : Le Pic'arête Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2006, 6, pp.#G2 |
||
hal-00408007v1
Journal articles
A morphic approach to combinatorial games: the Tribonacci case RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42, pp.375-393 |
||
lirmm-00408114v1
Conference papers
Counting ordered patterns in words generated by morphisms LATA'2008: 2nd International Conference on Language and Automata Theory and Applications, Mar 2008, Tarragona, Spain. pp.287-298 |
||
hal-00166911v1
Journal articles
Algorithms for perfectly contractile graphs SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2005, 19 (3), pp.553-574. ⟨10.1137/S0895480104442522⟩ ![]() |
||
hal-00966748v1
Journal articles
Fulleroids with dihedral symmetry Discrete Mathematics, Elsevier, 2010, 310 (3), pp.652-661 |
||
hal-01765510v1
Journal articles
Gray Codes for the Ideals of Interval Orders Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 1997, 25 (1), pp.52 - 66. ⟨10.1006/jagm.1997.0863⟩ ![]() |
||
hal-01765643v1
Journal articles
On the minimum size of an identifying code over all orientations of a graph The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.49 |
||
hal-00966501v1
Journal articles
Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, Vol. 9 no. 1 (1), pp.247--272. ⟨10.46298/dmtcs.399⟩ |
||
hal-00966514v1
Journal articles
FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, Vol. 9 no. 1 (1), pp.23--46. ⟨10.46298/dmtcs.407⟩ |
||
hal-01763169v1
Journal articles
Distributing pairs of vertices on Hamiltonian cycles Science China Mathematics, Science China Press, In press, ⟨10.1007/s11425-016-9057-x⟩ |
||
hal-03203497v1
Journal articles
Broadcasting in wraparound meshes with parallel monodirectional links Parallel Computing, Elsevier, 1992, 18 (6), pp.639-648. ⟨10.1016/0167-8191(92)90004-Q⟩ |
||
hal-00085034v1
Conference papers
Reoptimization in lagrangean methods for the quadratic knapsack problem 19th International Symposium on Mathematical Programming, 2006, Rio de Janeiro, Brazil |
||
hal-01283169v1
Conference papers
Les polynômes eul\IeC èriens stables de type B 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.297-306, ⟨10.46298/dmtcs.3040⟩ |
||
lirmm-00325145v1
Book sections
Branchwidth of graphic matroids Surveys in Combinatorics 2007, 346, pp.275-286, 2007, 9780511666209. ⟨10.1017/CBO9780511666209.010⟩ |
||
hal-00964206v1
Conference papers
There are Plane Spanners of Maximum Degree 4 (extended abstract) SoCG, Jun 2014, Kyoto, Japan |
||
lirmm-00325147v1
Conference papers
Guarding Art Galleries: The Extra Cost for Sculptures is Linear SWAT: Scandinavian Workshop on Algorithm Theory, Jul 2008, Gothenburg, Sweden. pp.41-52, ⟨10.1007/978-3-540-69903-3_6⟩ |
||
lirmm-00325158v1
Conference papers
Cyclic Orderings of Matroids LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2007, Puerto Varas, Chile |
||
hal-01283120v1
Conference papers
Cartan invariant matrices for finite monoids 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.887-898, ⟨10.46298/dmtcs.3091⟩ |
||
|