Skip to Main content Skip to Navigation
  1. Browse by search


hal-00152860v1  Conference papers
Cyril Banderier. Average queue length and area below lattice paths
AofA'2006, Jul 2006, France
...
hal-00150373v1  Conference papers
Russ Harmer, Martin Hyland, Paul-André Melliès. Categorical Combinatorics for Innocent Strategies
Logic in Computer Science, Jul 2007, France. pp. 379-388
...
hal-00159487v1  Preprints, Working Papers, ...
Enrica Duchi, Roberto Mantaci, Ha Duong Phan, Dominique Rossin. Bidimensional Sand Pile and Ice Pile Models
2007
...
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-01508884v1  Preprints, Working Papers, ...
Claire David. A note on energy forms on fractal domains
2017
...
hal-01503158v1  Journal articles
Frédéric Chapoton, Baptiste Rognerud. On the wildness of cambrian lattices
Algebras and Representation Theory, Springer Verlag, 2018
hal-00152880v1  Conference papers
Didier El Baz, Moussa Elkihel, Laurent Gély, Gé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-01504669v1  Journal articles
Julien Ah-Pine. On aggregation functions based on linguistically quantified propositions and finitely additive set functions
Fuzzy Sets and Systems, Elsevier, 2016, 287, pp.1-21. ⟨10.1016/j.fss.2015.06.002⟩
...
hal-02010704v1  Journal articles
Philippe Poncet, Franç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-01508495v1  Preprints, Working Papers, ...
Aurélie Lagoutte, Sébastien Tavenas. The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters
2017
...
hal-02011265v1  Conference papers
Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa, Rozica 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 Ducoffe, Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa, Rozica 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-02021678v1  Preprints, Working Papers, ...
Valentin Gledel, Michael A. Henning, Vesna Iršič, Sandi Klavžar. Maker-Breaker total domination game
2019
...
hal-02015985v1  Journal articles
P Ashraf, K Germina, Sudev 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-00877211v3  Reports
Fanny Dufossé, Kamer Kaya, Bora Uçar. Bipartite matching heuristics with quality guarantees on shared memory parallel computers
[Research Report] Inria; laas. 2013, pp.28
...
hal-01518715v1  Journal articles
Mohammed Amin Tahraoui, Eric Duchene, Hamamache Kheddouci, Mariusz Wozniak. Labeled embedding of (n, n − 2)-graphs in their complements
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2017, ⟨10.7151/dmgt.1977⟩
...
hal-01574304v4  Journal articles
Laura Ciobanu, Alexander Kolpakov. Free subgroups of free products and combinatorial hypermaps
Discrete Mathematics, Elsevier, 2019
...
hal-01350976v4  Preprints, Working Papers, ...
Kolosov Petro. On the link between finite difference and derivative of polynomials
2017
...
hal-01518713v1  Conference papers
Florent Foucaud, George Mertzios, Reza Naserasr, Aline Parreau, Petru 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 Dross, Mickaël Montassier, Alexandre 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. Oshanin, R. Voituriez, S. Nechaev, O. Vasilyev, Florent Hivert. Random patterns generated by random permutations of natural numbers
The European Physical Journal. Special Topics, EDP Sciences, 2007, 143, pp.143-157
...
hal-00167108v1  Conference papers
Luaï Jaff, Gérard H.E. Duchamp, Hatem Hadj Kacem, Cyrille Bertelle. Moderate Growth Time Series for Dynamic Combinatorics Modelisation
ECELM-2, Jun 2006, Tirgu-Mures, Romania
...
hal-01531101v1  Journal articles
Valentin Gledel, Aline 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. Mahjoub, Jean Mailfert. On the independent dominating set polytope
European Journal of Combinatorics, Elsevier, 2006, 27 (4), pp.601-616
...
hal-02017458v1  Journal articles
Gabriela Argiroffo, Silvia Bianchi, Yanina P.Lucarini, Annegret K. Wagler. Polyhedra associated with identifying codes in graphs
Discrete Applied Mathematics, Elsevier, 2018, 245, pp.16-27
...
hal-02017469v1  Preprints, Working Papers, ...
G Argiroffo, S. Bianchi, Y Lucarini, Annegret K. Wagler. The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
2019
...
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