Skip to Main content Skip to Navigation

hal-00152860v1  Conference papers
Cyril Banderier. Average queue length and area below lattice paths
AofA'2006, Jul 2006, France
hal-00150373v1  Conference papers
Russ HarmerMartin HylandPaul-André Melliès. Categorical Combinatorics for Innocent Strategies
Logic in Computer Science, Jul 2007, France. pp. 379-388
hal-01477981v2  Reports
Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph
[Research Report] Université Côte d’Azur, Inria, CNRS, I3S, France. 2017
hal-01510975v1  Conference papers
Dan BeteaJérémie BouttierPeter NejjarMirjana Vuletić. The free boundary Schur process and applications (extended abstract)
29th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2017), Jul 2017, Londres, United Kingdom
hal-01503158v1  Journal articles
Frédéric ChapotonBaptiste Rognerud. On the wildness of cambrian lattices
Algebras and Representation Theory, Springer Verlag, 2018
hal-00152880v1  Conference papers
Didier El BazMoussa ElkihelLaurent GélyGérard Plateau. Improved time and space complexity for Kianfar's inequality rotation algorithm
META'06, Workshop" Métaheuristiques : de la théorie aux applications", Nov 2006, Hammamet, Tunisia
lirmm-00153515v1  Journal articles
Reinhard DiestelImre LeaderAlex ScottStéphan Thomassé. Partitions and orientations of the Rado graph
Transactions of the American Mathematical Society, American Mathematical Society, 2007, 359, pp.2395-2405. ⟨10.1090/S0002-9947-06-04086-4⟩
hal-02010704v1  Journal articles
Taiwanese Journal of Mathematics, TJM, Mathematical Society of the Republic of China (Taiwan), 1999, 3, pp.491 - 501
hal-00801674v1  Journal articles
Jérémie BouttierEmmanuel Guitter. On Irreducible Maps and Slices
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2014, 23, pp.914-972. ⟨10.1017/S0963548314000340⟩
hal-02011265v1  Conference papers
Guillaume DucoffeRuxandra Marinescu-GhemeciCamelia ObrejaAlexandru PopaRozica Tache. Extremal Graphs with respect to the Modified First Zagreb Connection Index
Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), Jun 2018, Paris, France
hal-02011274v1  Conference papers
Guillaume DucoffeRuxandra Marinescu-GhemeciCamelia ObrejaAlexandru PopaRozica Tache. Extremal Graphs with respect to the Modified First Zagreb Connection Index
20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Sep 2018, Timisoara, Romania. ⟨10.1109/SYNASC.2018.00033⟩
hal-01526465v1  Journal articles
Sandi KlavžarMichel Mollard. Daisy cubes and distance cube polynomial
European Journal of Combinatorics, Elsevier, 2019, 80, pp.214-223
hal-00176609v1  Preprints, Working Papers, ...
Roland Bacher. Fair Triangulations
hal-02015985v1  Journal articles
P AshrafK GerminaSudev Naduvath. On certain associated graphs of set-valued signed graphs
Malaya Journal of Matematik, University Press, 2019, 7 (1), pp.113-117. ⟨10.26637/MJM0701/0022⟩
hal-01518713v1  Conference papers
Florent FoucaudGeorge MertziosReza NaserasrAline ParreauPetru Valicov. Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
International Workshop on Graph-Theoretic Concepts in Computer Science WG 2015, Jun 2015, Munich, Germany. pp.175 - 471, ⟨10.1007/978-3-662-53174-7_32⟩
lirmm-01730269v1  Journal articles
François DrossMickaël MontassierAlexandre Pinlou. Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.45
hal-00163637v1  Journal articles
G. OshaninR. VoituriezS. NechaevO. VasilyevFlorent Hivert. Random patterns generated by random permutations of natural numbers
The European Physical Journal. Special Topics, EDP Sciences, 2007, 143, pp.143-157