Filter your results
- 1203
- 1188
- 6
- 902
- 826
- 332
- 144
- 80
- 68
- 20
- 13
- 5
- 3
- 3
- 1
- 2001
- 280
- 135
- 46
- 42
- 29
- 28
- 25
- 21
- 18
- 15
- 13
- 2
- 1
- 44
- 44
- 37
- 30
- 28
- 24
- 22
- 21
- 7
- 176
- 193
- 177
- 188
- 176
- 149
- 158
- 146
- 145
- 150
- 147
- 74
- 59
- 48
- 47
- 91
- 59
- 74
- 34
- 18
- 27
- 11
- 6
- 4
- 4
- 6
- 4
- 2
- 1
- 4
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 2
- 2106
- 290
- 1
- 2387
- 51
- 51
- 42
- 42
- 42
- 40
- 37
- 37
- 31
- 30
- 29
- 29
- 24
- 24
- 23
- 23
- 22
- 22
- 20
- 19
- 18
- 18
- 18
- 16
- 16
- 15
- 15
- 14
- 14
- 14
- 14
- 13
- 13
- 13
- 12
- 12
- 12
- 12
- 12
- 11
- 11
- 11
- 11
- 11
- 11
- 11
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 120
- 117
- 101
- 74
- 74
- 65
- 63
- 61
- 60
- 56
- 55
- 52
- 49
- 48
- 45
- 45
- 42
- 41
- 41
- 40
- 39
- 38
- 37
- 37
- 35
- 33
- 33
- 33
- 32
- 32
- 32
- 31
- 31
- 31
- 30
- 28
- 25
- 25
- 25
- 25
- 25
- 24
- 24
- 24
- 24
- 24
- 23
- 23
- 23
- 23
- 23
- 23
- 21
- 20
- 20
- 19
- 19
- 19
- 18
- 18
- 18
- 17
- 17
- 17
- 16
- 16
- 16
- 16
- 16
- 16
- 16
- 16
- 16
- 15
- 15
- 15
- 15
- 15
- 15
- 15
- 15
- 14
- 14
- 14
- 14
- 14
- 14
- 13
- 13
- 13
- 13
- 13
- 13
- 13
- 13
- 13
- 13
- 13
- 12
- 12
2 397 Results
|
Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictionsEuropean Journal of Operational Research, 2021, 290 (3), pp.946-955. ⟨10.1016/j.ejor.2020.08.038⟩
Journal articles
hal-03003764v1
|
||
A collaboration context ontology to enhance human-related collaboration into Industry 4.0Cognition, Technology & Work, 2022, 24 (1)
Journal articles
hal-03970722v1
|
|||
Grundy Coloring and Friends, Half-Graphs, BicliquesAlgorithmica, 2023, 85 (1), pp.1-28. ⟨10.1007/s00453-022-01001-2⟩
Journal articles
hal-03968360v1
|
|||
|
Responsible AI communication: How do European officials share their concerns?Congrès Lambda Mu 23 « Innovations et maîtrise des risques pour un avenir durable » - 23e Congrès de Maîtrise des Risques et de Sûreté de Fonctionnement, Institut pour la Maîtrise des Risques, Oct 2022, Saclay, France
Conference papers
hal-03968180v1
|
||
Parameterized (Approximate) Defective Coloring35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Feb 2018, Caen, France
Conference papers
hal-03966731v1
|
|||
Finer Tight Bounds for Coloring on Clique-Width45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Jul 2018, Prague, Czech Republic
Conference papers
hal-03966729v1
|
|||
How Bad is the Freedom to Flood-It?9th International Conference on Fun with Algorithms, FUN 2018, Jun 2018, La Maddalena, Italy
Conference papers
hal-03966725v1
|
|||
On the parameterized complexity of red-blue points separationJournal of Computational Geometry, 2019, 10 (1)
Journal articles
hal-03966722v1
|
|||
|
Parameterized Complexity of $$(A,\ell )$$-Path PackingCombinatorial Algorithms - 31st International Workshop, IWOCA 2020, Jun 2020, Bordeaux, France. pp.43-55, ⟨10.1007/978-3-030-48966-3_4⟩
Conference papers
hal-03966714v1
|
||
(In)approximability of Maximum Minimal FVS31st International Symposium on Algorithms and Computation, ISAAC 2020, Dec 2020, Hong Kong, China
Conference papers
hal-03966712v1
|
|||
Fine-Grained Meta-Theorems for Vertex Integrity32nd International Symposium on Algorithms and Computation, ISAAC 2021, Dec 2021, Fukuoka, Japan
Conference papers
hal-03966708v1
|
|||
Minimum Stable Cut and Treewidth48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Jul 2021, Glasgow (Ecosse), United Kingdom
Conference papers
hal-03966704v1
|
|||
Determining a Slater Winner Is Complete for Parallel Access to NP39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Mar 2022, Marseilles, France
Conference papers
hal-03966693v1
|
|||
Hedonic Games and Treewidth Revisited30th Annual European Symposium on Algorithms, ESA 2022, Sep 2022, Berlin/Potsdam, Germany
Conference papers
hal-03966688v1
|
|||
Teaching modeling to anyone the aristotelian wayACM; MODELS'22, pp.107-114, 2022, ⟨10.1145/3550356.3556504⟩
Proceedings
hal-03966592v1
|
|||
|
A robust p-Center problem under pressure to locate shelters in wildfire contextEURO Journal on Computational Optimization, 2020, 8 (2), pp.103-139. ⟨10.1007/s13675-020-00124-x⟩
Journal articles
hal-03964936v1
|
||
|
Counting types for massive JSON datasetsDBPL 2017: The 16th International Symposium on Database Programming Languages, 2017, Munich Germany, Germany. pp.1-12, ⟨10.1145/3122831.3122837⟩
Conference papers
hal-03964935v1
|
||
|
Linear Time Membership in a Class of Regular Expressions with Counting, Interleaving, and Unordered ConcatenationACM Transactions on Database Systems, 2017, 42 (4), pp.1-44. ⟨10.1145/3132701⟩
Journal articles
hal-03964932v1
|
||
PathGraphSSDBM '18: 30th International Conference on Scientific and Statistical Database Management, 2018, Bozen-Bolzano Italy, Italy. pp.1-4, ⟨10.1145/3221269.3222331⟩
Conference papers
hal-03964928v1
|
|||
|
CBPF: Leveraging Context and Content Information for Better RecommendationsAdvanced Data Mining and Applications, 2018, nankin, China. pp.381-391, ⟨10.1007/978-3-030-05090-0_32⟩
Conference papers
hal-03964916v1
|
||
Evaluating Queries and Updates on Big XML DocumentsInformation Systems Frontiers, 2018, 20 (1), pp.63-90. ⟨10.1007/s10796-017-9744-4⟩
Journal articles
hal-03964899v1
|
|||
Digraph Coloring and Distance to Acyclicity38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Mar 2021, Saarbrucken, Germany
Conference papers
hal-03964895v1
|
|||
|
Schemas and Types for JSON DataSIGMOD/PODS '19: International Conference on Management of Data, 2019, Amsterdam Netherlands, Netherlands. pp.2060-2063, ⟨10.1145/3299869.3314032⟩
Conference papers
hal-03964893v1
|
||
|
Streaming saturation for large RDF graphs with dynamic schema informationPLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019, Phoenix AZ USA, United States. pp.42-52, ⟨10.1145/3315507.3330201⟩
Conference papers
hal-03964876v1
|
||
|
Parametric schema inference for massive JSON datasetsThe VLDB Journal, 2019, 28 (4), pp.497-521. ⟨10.1007/s00778-018-0532-7⟩
Journal articles
hal-03964865v1
|
||
Challenges in Checking JSON Schema Containment over Evolving Real-World SchemasAdvances in Conceptual Modeling - ER 2020 Workshops, 2020, Vienna, Austria. pp.220-230, ⟨10.1007/978-3-030-65847-2_20⟩
Conference papers
hal-03964859v1
|
|||
ILP Models and Column Generation for the Minimum Sum Coloring ProblemElectronic Notes in Discrete Mathematics, 2018, 64, pp.215-224. ⟨10.1016/j.endm.2018.01.023⟩
Journal articles
hal-03964835v1
|
|||
|
An Empirical Study on the “Usage of Not” in Real-World JSON Schema DocumentsInternational Conference on Extending Database Technology (EDBT), 2020, Copenhagen, Denmark. pp.102-112, ⟨10.1007/978-3-030-89022-3_9⟩
Conference papers
hal-03964821v1
|
||
|
Theoretical and computational study of several linearisation techniques for binary quadratic problemsAnnals of Operations Research, 2019, 279 (1-2), pp.387-411. ⟨10.1007/s10479-018-3118-2⟩
Journal articles
hal-03964811v1
|
||
|
Scalable Saturation of Streaming RDF TriplesTransactions on Large-Scale Data- and Knowledge-Centered Systems, 2020, Lecture Notes in Computer Science, 12380, pp.1-40. ⟨10.1007/978-3-662-62271-1_1⟩
Journal articles
hal-03964809v1
|