Filter your results
- 15
- 9
- 2
- 13
- 12
- 9
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 22
- 7
- 26
- 25
- 8
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 26
- 17
- 9
- 19
- 7
- 1
- 8
- 6
- 5
- 5
- 1
|
|
sorted by
|
Demonstration of GOOSE: A Secure Framework for Graph Outsourcing and SPARQL EvaluationInternational Semantic Web Conference (ISWC) - Demo Track, Nov 2020, Conférence online, Greece
Conference papers
hal-02942717v1
|
|||
Secure Best Arm Identification in Multi-Armed BanditsISPEC 2019 : The 15th International Conference on Information Security Practice and Experience, Nov 2019, Kuala Lumpur, Malaysia. ⟨10.1007/978-3-030-34339-2_9⟩
Conference papers
hal-02270418v1
|
|||
|
Cliques in exact distance powers of graphs of given maximum degreeLAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium, May 2021, Sao Paulo, Brazil. pp.427-436, ⟨10.1016/j.procs.2021.11.052⟩
Conference papers
hal-03540673v1
|
||
|
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond2022
Preprints, Working Papers, ...
hal-03710812v2
|
||
|
Strengthening the Murty-Simon conjecture on diameter 2 critical graphsDiscrete Mathematics, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩
Journal articles
hal-01959683v1
|
||
|
On the Complexity of Broadcast Domination and Multipacking in DigraphsAlgorithmica, 2021, 83 (9), pp.2651-2677. ⟨10.1007/s00453-021-00828-5⟩
Journal articles
hal-03318912v1
|
||
Secure and Efficient Matrix Multiplication with MapReduceSECRYPT/ICETE - Revised Selected Papers, Jul 2019, Prague, Czech Republic. ⟨10.1007/978-3-030-52686-3_6⟩
Conference papers
hal-02942677v1
|
|||
|
GOOSE: A Secure Framework for Graph Outsourcing and SPARQL Evaluation34th Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy (DBSec'20), Jun 2020, Conférence online, Germany. pp.347-366, ⟨10.1007/978-3-030-49669-2_20⟩
Conference papers
hal-02544920v1
|
||
|
Complexity and algorithms for injective edge-coloring in graphsInformation Processing Letters, 2021, 170, pp.106121. ⟨10.1016/j.ipl.2021.106121⟩
Journal articles
hal-03201544v1
|
||
On graphs coverable by k shortest paths33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, South Korea. pp.40:1--40:15, ⟨10.4230/LIPIcs.ISAAC.2022.40⟩
Conference papers
hal-03895886v1
|
|||
|
Smallest $C_{2l+1}$-critical graphs of odd-girth $2k+1$Discrete Applied Mathematics, 2022, 319, pp.564 - 575. ⟨10.1016/j.dam.2021.08.040⟩
Journal articles
hal-03784719v1
|
||
|
Characterizing extremal graphs for open neighbourhood location-dominationDiscrete Applied Mathematics, 2021, 302, pp.76-79. ⟨10.1016/j.dam.2021.06.006⟩
Journal articles
hal-03540625v1
|
||
|
Revisiting and Improving Upper Bounds for Identifying CodesSIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2619-2634. ⟨10.1137/22M148999X⟩
Journal articles
hal-03849449v1
|
||
|
Secure Joins with MapReduceFPS 2018 : The 11th International Symposium on Foundations & Practice of Security, Nov 2018, Montreal, Canada
Conference papers
hal-01903098v1
|
||
|
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical ComplexityAlgorithmica, 2022, 84 (5), pp.1183-1212. ⟨10.1007/s00453-021-00918-4⟩
Journal articles
hal-03658581v1
|
||
|
The RED-BLUE SEPARATION problem on graphs2022
Preprints, Working Papers, ...
hal-03854400v1
|
||
|
Generic Construction for Identity-based Proxy Blind SignatureFPS 2022 : The 14th International Symposium on Foundations & Practice of Security, Dec 2021, Paris, France
Conference papers
hal-03435956v1
|
||
|
Practical Construction for Secure Trick-Taking Games Even With Cards Set AsideFC2023 - Twenty-Seventh International Conference Financial Cryptography and Data Security, International Financial Cryptography Association, May 2023, Bol, Brač, Croatia
Conference papers
hal-04008484v1
|
||
|
Monitoring the edges of a graph using distancesDiscrete Applied Mathematics, 2022, 319, pp.425-438
Journal articles
hal-03043870v2
|
||
Secure Cumulative Reward Maximization in Linear Stochastic BanditsInternational Conference on Provable and Practical Security (ProvSec), Nov 2020, Conférence online, Singapore. pp.257-277, ⟨10.1007/978-3-030-62576-4_13⟩
Conference papers
hal-02942694v1
|
|||
Secure Intersection with MapReduceInternational Conference on Security and Cryptography (SECRYPT), Jul 2019, Prague, Czech Republic. pp.236-243, ⟨10.5220/0007918902360243⟩
Conference papers
hal-02273966v1
|
|||
|
The Red-Blue Separation Problem on GraphsIWOCA 2022, Jun 2022, Trier, Germany. pp.285-298, ⟨10.1007/978-3-031-06678-8_21⟩
Conference papers
hal-03711361v1
|
||
Secure Outsourcing of Multi-Armed Bandits19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2020), Dec 2020, Conférence online, China. pp.202-209
Conference papers
hal-02953292v1
|
|||
|
Generic Plaintext Equality and Inequality ProofsFinancial Cryptography and Data Security - 25th International Conference, FC 2021, Virtual Event, March 1-5, 2021, Revised Selected Papers, Part I, 2021, Online, Unknown Region. pp.415--435, ⟨10.1007/978-3-662-64322-8\_20⟩
Conference papers
hal-03478247v1
|
||
|
Secure Strassen-Winograd Matrix Multiplication with MapReduceInternational Conference on Security and Cryptography (SECRYPT), Jul 2019, Prague, Czech Republic. pp.220-227
Conference papers
hal-02129149v1
|
||
|
A Faster Cryptographer's Conspiracy SantaTheoretical Computer Science, 2020, 839, pp.122-134. ⟨10.1016/j.tcs.2020.05.034⟩
Journal articles
hal-02611751v1
|