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-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
...
hal-02010704v1  Journal articles
Philippe PoncetFrançois Robert. ABOUT SUCCESSIVE GAUSS-SEIDELISATIONS
Taiwanese Journal of Mathematics, TJM, Mathematical Society of the Republic of China (Taiwan), 1999, 3, pp.491 - 501
...
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-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
...
hal-01531101v1  Journal articles
Valentin GledelAline Parreau. Identification of points using disks
Discrete Mathematics, Elsevier, 2019, 342 (1), pp.256-269. ⟨10.1016/j.disc.2018.10.002⟩
hal-02025955v1  Journal articles
A.R. MahjoubJean Mailfert. On the independent dominating set polytope
European Journal of Combinatorics, Elsevier, 2006, 27 (4), pp.601-616
...
hal-02017458v1  Journal articles
Gabriela ArgiroffoSilvia BianchiYanina P.LucariniAnnegret K. Wagler. Polyhedra associated with identifying codes in graphs
Discrete Applied Mathematics, Elsevier, 2018, 245, pp.16-27
...
hal-02017441v1  Book sections
Annegret K. Wagler. Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets
Combinatorial Optimization: ISCO 2018, pp.416-427, 2018