Skip to Main content Skip to Navigation

hal-00793271v1  Reports
Dieter RautenbachJean-Sébastien Sereni. Transversals of Longest Paths and Cycles
[Research Report] Loria & Inria Grand Est. 2013
hal-00867713v1  Conference papers
Charles Prud'HommeXavier LorcaRémi DouenceNarendra Jussien. 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
Jérémie Du BoisberrangerDanièle GardyXavier LorcaCharlotte Truchet. 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
Olivier BodiniThomas FerniqueÉric Rémila. 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
Nicolas BeldiceanuHelmut Simonis. 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
Mathieu Leconte. Load-balancing and resource-provisioning in large distributed systems
Data Structures and Algorithms [cs.DS]. Telecom ParisTech, 2013. English
hal-00835437v1  Journal articles
Ana BušićVarun GuptaJean Mairesse. 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
Adrien FriggeriGuillaume CheliusEric Fleury. 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
Louis BigoJean-Louis GiavittoAntoine Spicher. Spatial Programming for Musical Transformations and Harmonization
Spatial Computing Workshiop (SCW), May 2013, Saint-Paul, Minesota, United States. p. 9-16
hal-03060182v1  Journal articles
Marko RadovanovićNicolas TrotignonKristina Vušković. 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
Basile MorcretteHosam M. Mahmoud. 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
Filippo BonchiDamien Pous. 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
Dominique Larchey-Wendlingyannick Forster. 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-00802000v1  Journal articles
Andrew P. DoveJerrold R. GriggsRoss J. KangJean-Sébastien Sereni. 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
David BremnerJonathan LenchnerGiuseppe LiottaChristophe PaulMarc Pouget et al.  A Note on α-Drawable k-Trees
CCCG'08: Canadian Conference on Computational Geometry, Canada. pp.23-27
hal-00967300v1  Journal articles
Adrien RichardJean-Paul Comet. 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⟩
lirmm-02382066v1  Conference papers
Bastien CazauxEric Rivals. 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-03120899v1  Journal articles
Alan ArroyoJulien BensmailBruce R. Richter. 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
Małgorzata SulkowskaMichał Lasoń. 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
Viet-Ha NguyenKévin PerrotMathieu Vallet. NP-completeness of the game Kingdomino
Theoretical Computer Science, Elsevier, 2020, 822, pp.23-35. ⟨10.1016/j.tcs.2020.04.007⟩