 |
 |
 |
|
|
||
|---|---|---|
| inria-00148103v1
Reports
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence [Research Report] 2007, pp.41 |
||
| hal-00871276v1
Conference papers
Pioneers of Influence Propagation in Social Networks COCOON/CSoNet, Aug 2014, Atlanta, United States. pp.626-636, ⟨10.1007/978-3-319-08783-2_54⟩ |
||
| hal-00793271v1
Reports
Transversals of Longest Paths and Cycles [Research Report] Loria & Inria Grand Est. 2013 |
||
| inria-00303330v1
Reports
Exact algorithms for $L(2,1)$-labeling of graphs [Research Report] RR-6587, INRIA. 2008 |
||
| |
||
| hal-00867713v1
Conference papers
Prototyper des Moteurs de Propagation avec un DSL Journées française de la Programmation par Contraintes, 2013, Aix-en-Provence, France. pp.279-288 |
||
| hal-00867576v1
Conference papers
When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent Meeting on Analytic Algorithmics and Combinatorics, 2013, New Orleans, Louisiana, USA, United States. pp.80-90 |
||
| lirmm-00379207v1
Journal articles
A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane Information and Computation, Elsevier, 2008, Special Issue: 1st International Conference on Language and Automata Theory and Applications (LATA 2007), 206 (9-10), pp.1065-1073. ⟨10.1016/j.ic.2008.03.008⟩  |
||
| hal-00754027v1
Conference papers
Learning Structured Constraint Models: a First Attempt The 22nd Irish Conference on Artificial Intelligence and Cognitive Science, AICS'11, 2011, Ulster, Ireland |
||
| tel-00933645v1
Theses
Load-balancing and resource-provisioning in large distributed systems Data Structures and Algorithms [cs.DS]. Telecom ParisTech, 2013. English |
||
| hal-00835437v1
Journal articles
Stability of the bipartite matching model Advances in Applied Probability, Applied Probability Trust, 2013, 45 (2), pp.351-378. ⟨10.1239/aap/1370870122⟩  |
||
| inria-00597447v1
Conference papers
Egomunities, Exploring Socially Cohesive Person-based Communities NetSci 2011 The International School and Conference on Network Science, Jun 2011, Budapest, Hungary |
||
| hal-00925767v1
Conference papers
Spatial Programming for Musical Transformations and Harmonization Spatial Computing Workshiop (SCW), May 2013, Saint-Paul, Minesota, United States. p. 9-16 |
||
| hal-00538953v1
Preprints, Working Papers, ...
Nonlinear threshold Boolean automata networks and phase transitions 2010 |
||
| hal-03060180v1
Journal articles
The (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs Journal of Combinatorial Theory, Series B, Elsevier, 2020, 143, pp.123-147. ⟨10.1016/j.jctb.2017.12.004⟩ |
||
| hal-03060182v1
Journal articles
The (theta, wheel)-free graphs Part II: Structure theorem Journal of Combinatorial Theory, Series B, Elsevier, 2020, 143, pp.148-184. ⟨10.1016/j.jctb.2019.07.004⟩ |
||
| hal-00719639v1
Conference papers
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), Jun 2012, Montreal, Canada. pp.219--232, ⟨10.46298/dmtcs.2996⟩ |
||
| hal-00639716v5
Conference papers
Checking NFA equivalence with bisimulations up to congruence Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. pp.457-468, ⟨10.1145/2429069.2429124⟩ |
||
| hal-03359505v2
Journal articles
Hilbert's Tenth Problem in Coq (Extended Version) Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2022, 18 (1), ⟨10.46298/lmcs-18(1:35)2022⟩ |
||
| hal-00720005v1
Reports
Towards the parallelization of Reversible Jump Markov Chain Monte Carlo algorithms for vision problems [Research Report] RR-8016, INRIA. 2012 |
||
| hal-00802000v1
Journal articles
Supersaturation in the Boolean lattice Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2014, The Dick de Bruijn Memorial Volume, 14A, pp.A4 |
||
| lirmm-00324589v1
Conference papers
A Note on α-Drawable k-Trees CCCG'08: Canadian Conference on Computational Geometry, Canada. pp.23-27 |
||
| hal-00967300v1
Journal articles
Necessary conditions for multistationarity in discrete dynamical systems Discrete Applied Mathematics, Elsevier, 2007, 155 (18), pp.2403--2413. ⟨10.1016/j.dam.2007.04.019⟩ |
||
| hal-00966985v1
Journal articles
To satisfy impatient Web surfers is hard Theoretical Computer Science, Elsevier, 2014, 526, pp.1-17. ⟨10.1016/j.tcs.2014.01.009⟩ |
||
| lirmm-02382066v1
Conference papers
Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding CPM 2019 - 30th Annual Symposium on Combinatorial Pattern Matching, University of Pisa, Jun 2019, Pise, Italy. pp.24:1--24:20, ⟨10.4230/LIPIcs.CPM.2019.24⟩ |
||
| hal-02915456v1
Software
nn_fac: Nonnegative Factorization techniques toolbox 2020, ⟨swh:1:dir:ec2a2153951a7f79b7d980ea0d9c7601e5755de9;origin=https://hal.archives-ouvertes.fr/hal-02915456;visit=swh:1:snp:6e4be34b95db089bc5e4455abb4037d0b633b9fe;anchor=swh:1:rev:88782798ee67126597c52fb12312a462e9f6439b;path=/⟩ |
||
| hal-03120899v1
Journal articles
Extending Drawings of Graphs to Arrangements of Pseudolines Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2021, 12 (2), pp.3-24. ⟨10.20382/jocg.v12i2a2⟩ |
||
| hal-03462570v1
Reports
Modularity of minor-free graphs [Research Report] Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142); Institute of Mathematics of the Polish Academy of Sciences; Wrocław University of Science and Technology. 2021 |
||
| hal-03121418v1
Journal articles
NP-completeness of the game Kingdomino Theoretical Computer Science, Elsevier, 2020, 822, pp.23-35. ⟨10.1016/j.tcs.2020.04.007⟩ |
||
| hal-01947563v1
Journal articles
Complexity dichotomies for the Minimum F -Overlay problem Journal of Discrete Algorithms, Elsevier, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩ |
||
|
|
||
