Filtrer vos résultats
- 23
- 12
- 20
- 7
- 7
- 1
- 3
- 35
- 1
- 1
- 2
- 5
- 1
- 4
- 6
- 3
- 1
- 4
- 3
- 5
- 33
- 2
- 18
- 11
- 9
- 7
- 5
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 1
- 1
- 35
- 13
- 13
- 8
- 7
- 7
- 6
- 6
- 6
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
35 résultats
|
|
|
triés par
|
The bi-objective workflow satisfiability problem and workflow resiliency1Journal of Computer Security, 2017, 25 (1), pp.83-115
Article dans une revue
hal-01995985v1
|
|||
|
|
Overlaying a hypergraph with a graph with bounded maximum degreeDiscrete Applied Mathematics, In press, 319, pp.394-406. ⟨10.1007/978-3-030-39219-2_32⟩
Article dans une revue
hal-02025469v3
|
||
|
|
Comparing two clusterings using matchings between clusters of clusters[Research Report] RR-9063, INRIA Sophia Antipolis - Méditerranée; Universite Cote d'Azur. 2017, pp.1-45
Rapport
hal-01514872v4
|
||
|
|
Twin-width II: small classesACM-SIAM Symposium on Discrete Algorithms (SODA21), Jan 2021, Alexandria, United States
Communication dans un congrès
hal-03107577v1
|
||
Parameterized Resiliency Problems via Integer Linear ProgrammingCIAC 2017: 10th International Conference, May 2017, Athènes, Greece. pp.164-176
Communication dans un congrès
hal-01995981v1
|
|||
|
|
Comparaison de deux clusterings par couplage entre clusters de clustersALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France
Communication dans un congrès
hal-01774440v1
|
||
|
|
Approximating the sparsest $k$-subgraph in chordal graphTheory of Computing Systems, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩
Article dans une revue
lirmm-01383119v1
|
||
|
|
Complexity Dichotomies for the Minimum F-Overlay Problem[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport
hal-01490535v1
|
||
|
|
On the sum-max graph partitioning problemTheoretical Computer Science, 2014, Combinatorial Optimization: Theory of algorithms and Complexity, 540, pp.143-155. ⟨10.1016/j.tcs.2013.11.024⟩
Article dans une revue
lirmm-01251016v1
|
||
|
|
The k-Sparsest Subgraph ProblemRR-12019, 2012
Rapport
lirmm-00735713v2
|
||
|
|
Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphesGéométrie algorithmique [cs.CG]. Université Montpellier II - Sciences et Techniques du Languedoc, 2014. Français. ⟨NNT : 2014MON20100⟩
Thèse
tel-01488596v1
|
||
|
|
Overlaying a hypergraph with a graph with bounded maximum degreeCALDAM 2020 - 6th Annual International Conference on Algorithms and Discrete Applied Mathematics, Feb 2020, Hyderabad, India
Communication dans un congrès
hal-03035849v1
|
||
|
|
Parameterized Complexity of Independent Set in H-free GraphsAlgorithmica, 2020, Parameterized and Exact Computation, IPEC 2018, 82 (8), pp.2360-2394. ⟨10.1007/s00453-020-00730-6⟩
Article dans une revue
hal-03015353v2
|
||
|
|
When Maximum Stable Set Can Be Solved in FPT Time30th International Symposium on Algorithms and Computation (ISAAC 2019), Dec 2019, Shanghai, China. ⟨10.4230/LIPIcs.ISAAC.2019.49⟩
Communication dans un congrès
hal-02935501v1
|
||
|
|
Overlaying a hypergraph with a graph with bounded maximum degreeALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
Communication dans un congrès
hal-02796730v1
|
||
Resiliency Policies in Access Control RevisitedSACMAT: Symposium on Access Control Models and Technologies, Jun 2016, Shanghai, China. pp.101-111, ⟨10.1145/2914642.2914650⟩
Communication dans un congrès
hal-01995964v1
|
|||
|
|
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.35⟩
Communication dans un congrès
hal-03107571v1
|
||
|
|
NP-hardness of the Sparsest k-Subgraph Problem in Chordal GraphsRR-12026, 2012
Rapport
lirmm-00744655v3
|
||
|
|
On the Approximability of the Sum-Max Graph Partitioning ProblemAPEX: Approximation, Parameterized and EXact algorithms, Feb 2012, Paris, France
Communication dans un congrès
lirmm-00675888v1
|
||
|
|
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizationsDiscrete Mathematics and Theoretical Computer Science, 2017, FCT '15, 19 (4), ⟨10.23638/DMTCS-19-4-3⟩
Article dans une revue
lirmm-01889400v1
|
||
|
|
Approximating the Sparsest k-Subgraph in Chordal Graphs2013
Rapport
hal-00868188v1
|
||
|
|
Complexity dichotomies for the Minimum F -Overlay problemJournal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩
Article dans une revue
hal-01947563v1
|
||
|
|
Complexity Dichotomies for the Minimum $F$-Overlay Problem28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩
Communication dans un congrès
hal-01571229v1
|
||
On the Satisfiability of Workflows with Release PointsSACMAT 2018: 22nd ACM on Symposium on Access Control Models and Technologies, Jun 2017, Indianapolis, United States. pp.207-217
Communication dans un congrès
hal-01995974v1
|
|||
A Multivariate Approach for Checking Resiliency in Access ControlAAIM 2016: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.173-184
Communication dans un congrès
hal-01995968v1
|
|||
|
|
The Authorization Policy Existence ProblemCODASPY: Conference on Data and Application Security and Privacy, Mar 2017, Scottsdale, United States. pp.163-165, ⟨10.1145/3029806.3029844⟩
Communication dans un congrès
hal-01995978v1
|
||
|
|
Parameterized Complexity of Independent Set in H-free graphsIPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.CVIT.2016.23⟩
Communication dans un congrès
hal-01962369v1
|
||
|
|
Parameterized Complexity of the Sparsest k-Subgraph in Chordal Graphs[Research Report] RR-13033, LIRMM. 2013
Rapport
lirmm-00875132v1
|
||
|
|
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee ParameterizationsFCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩
Communication dans un congrès
lirmm-01250997v1
|
||
|
|
Twin-width I: tractable FO model checkingFOCS 2020, Nov 2020, online, United States
Communication dans un congrès
hal-03107581v1
|
- 1
- 2