Filtrer vos résultats
- 34
- 10
- 27
- 16
- 1
- 44
- 1
- 2
- 6
- 2
- 10
- 7
- 10
- 5
- 1
- 44
- 44
- 4
- 4
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 44
- 13
- 11
- 11
- 10
- 7
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 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
44 résultats
|
|
triés par
|
Finer Tight Bounds for Coloring on Clique-Width45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Jul 2018, Prague, Czech Republic
Communication dans un congrès
hal-03966729v1
|
|||
|
Defective Coloring on Classes of Perfect Graphs43rd International Workshop (WG 2017), Jul 2017, Eindhoven, Netherlands. pp.113-126, ⟨10.1007/978-3-319-68705-6_9⟩
Communication dans un congrès
hal-02165868v1
|
||
|
Parameterized Orientable DeletionAlgorithmica, 2020, 82 (7), pp.1909-1938. ⟨10.1007/s00453-020-00679-6⟩
Article dans une revue
hal-02793714v1
|
||
|
On the Parameterized Complexity of Red-Blue Points SeparationIPEC 2017 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. ⟨10.4230/LIPIcs.IPEC.2017.8⟩
Communication dans un congrès
hal-01991650v1
|
||
|
Hedonic Games and Treewidth RevisitedESA 2022, Sep 2022, Berlin, Germany. ⟨10.4230/LIPIcs.ESA.2022.64⟩
Communication dans un congrès
hal-04330052v1
|
||
|
Parameterized Complexity of Safe SetJournal of Graph Algorithms and Applications, 2020, 24 (3), pp.215-245. ⟨10.7155/jgaa.00528⟩
Article dans une revue
hal-03107732v1
|
||
|
Independent Set Reconfiguration Parameterized by Modular-WidthAlgorithmica, 2020, 82 (9), pp.2586-2605. ⟨10.1007/s00453-020-00700-y⟩
Article dans une revue
hal-03107726v1
|
||
|
QBF as an Alternative to Courcelle’s Theorem21st International Conference on Theory and Applications of Satisfiability Testing – SAT 2018, Jul 2018, Oxford, United Kingdom. pp.235-252, ⟨10.1007/978-3-319-94144-8_15⟩
Communication dans un congrès
hal-02187884v1
|
||
|
Parameterized (Approximate) Defective ColoringSIAM Journal on Discrete Mathematics, 2020, 34 (2), pp.1084-1106. ⟨10.1137/18M1223666⟩
Article dans une revue
hal-03107738v1
|
||
|
K3 Edge Cover Problem in a Wide SenseJournal of Information Processing, 2020, 28, pp.849-858. ⟨10.2197/ipsjjip.28.849⟩
Article dans une revue
hal-03107744v1
|
||
|
How Bad is the Freedom to Flood-It?Journal of Graph Algorithms and Applications, 2019, 23 (2), pp.111-134. ⟨10.7155/jgaa.00486⟩
Article dans une revue
hal-02310396v1
|
||
|
Independent Set Reconfiguration Parameterized by Modular-Width45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.285-297, ⟨10.1007/978-3-030-30786-8_22⟩
Communication dans un congrès
hal-02414613v1
|
||
Digraph Coloring and Distance to Acyclicity38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Mar 2021, Saarbrucken, Germany
Communication dans un congrès
hal-03964895v1
|
|||
|
Complexity and Approximability of Parameterized MAX-CSPsAlgorithmica, 2017, 79 (1), ⟨10.1007/s00453-017-0310-8⟩
Article dans une revue
hal-02170675v1
|
||
|
Structural Graph Parameters, Fine-Grained Complexity, and ApproximationComputer Science [cs]. Université Paris Dauphine, 2022
HDR
tel-03848575v1
|
||
|
Token Sliding on Split GraphsSTACS 2019, Mar 2019, Berlin, Germany
Communication dans un congrès
hal-03107597v1
|
||
|
Maximum Independent Sets in Subcubic Graphs: New ResultsGraph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Jun 2019, Vall de Nuria, Spain. ⟨10.1007/978-3-030-30786-8_4⟩
Communication dans un congrès
hal-02344055v1
|
||
|
First Order Logic on Pathwidth Revisited AgainICALP 2023, Jul 2023, Paderborn, Germany, Germany. ⟨10.4230/LIPIcs.ICALP.2023.132⟩
Communication dans un congrès
hal-04330032v1
|
||
|
Determining a Slater Winner Is Complete for Parallel Access to NPSTACS 2022, Mar 2022, Marseille, France. ⟨10.4230/LIPIcs.STACS.2022.45⟩
Communication dans un congrès
hal-04330056v1
|
||
|
Grundy Distinguishes Treewidth from PathwidthSIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1761-1787. ⟨10.1137/20M1385779⟩
Article dans une revue
hal-03956253v1
|
||
(In)approximability of Maximum Minimal FVS31st International Symposium on Algorithms and Computation, ISAAC 2020, Dec 2020, Hong Kong, China
Communication dans un congrès
hal-03966712v1
|
|||
|
Multistage Matchings16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), Jun 2018, Malmo, Sweden. pp.7:1--7:13, ⟨10.4230/LIPIcs.SWAT.2018.7⟩
Communication dans un congrès
hal-01926860v1
|
||
|
Parameterized Power Vertex CoverDiscrete Mathematics and Theoretical Computer Science, 2018, 20 (2), ⟨10.23638/DMTCS-20-2-10⟩
Article dans une revue
hal-01926709v1
|
||
|
Parameterized Edge HamiltonicityDiscrete Applied Mathematics, 2018, 248, ⟨10.1016/j.dam.2017.04.045⟩
Article dans une revue
hal-02165855v1
|
||
|
Structural parameters, tight bounds, and approximation for (k,r)-centerDiscrete Applied Mathematics, 2019, 264, ⟨10.1016/j.dam.2018.11.002⟩
Article dans une revue
hal-02417608v1
|
||
|
Time-approximation trade-offs for inapproximable problemsJournal of Computer and System Sciences, 2018, 92, pp.171-180. ⟨10.1016/j.jcss.2017.09.009⟩
Article dans une revue
hal-02170681v1
|
||
|
Filling crosswords is very hardTheoretical Computer Science, 2024, 982, pp.114275. ⟨10.1016/J.TCS.2023.114275⟩
Article dans une revue
hal-04487531v1
|
||
|
Grundy Distinguishes Treewidth from PathwidthESA 2020, Sep 2020, pisa, Italy. ⟨10.4230/LIPIcs.ESA.2020.38⟩
Communication dans un congrès
hal-03107591v1
|
||
Time-Approximation Trade-offs for Inapproximable Problems33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Feb 2016, Orléans, France. pp.22:1-22:14, ⟨10.4230/LIPIcs.STACS.2016.22⟩
Communication dans un congrès
hal-01489450v1
|
|||
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
Communication dans un congrès
hal-03966693v1
|
- 1
- 2