Filtrer vos résultats
- 50
- 16
- 44
- 20
- 2
- 66
- 10
- 1
- 8
- 5
- 3
- 10
- 5
- 11
- 6
- 8
- 5
- 3
- 1
- 66
- 30
- 26
- 7
- 6
- 4
- 4
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 66
- 15
- 14
- 9
- 9
- 7
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
66 résultats
|
|
Twin-width II: small classesCombinatorial Theory, 2022, ⟨10.5070/C62257876⟩
Article dans une revue
hal-03750978v1
|
||
|
|
The Graph Motif Problem Parameterized by the Structure of the Input Graph10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.319--330, ⟨10.4230/LIPIcs.IPEC.2015.319⟩
Communication dans un congrès
hal-01505505v1
|
||
|
|
A note on Edge Isoperimetric Numbers and Regular GraphsInternational Journal of Foundations of Computer Science, 2016, 27 (6), ⟨10.1142/S0129054116500283⟩
Article dans une revue
hal-01505500v1
|
||
|
|
Fine-grained complexity of coloring unit disks and ballsJournal of Computational Geometry, 2018
Article dans une revue
hal-01991656v1
|
||
|
|
Complexity of Token Swapping and its Variants34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017), Mar 2017, Hanovre, Germany. pp.16, ⟨10.4230/LIPIcs.STACS.2017.16⟩
Communication dans un congrès
hal-01994385v1
|
||
|
|
Parameterized Hardness of Art Gallery ProblemsACM Transactions on Algorithms, 2020, 16, pp.1 - 23. ⟨10.1145/3398684⟩
Article dans une revue
hal-03015328v1
|
||
|
|
The Inverse Voronoi Problem in Graphs I: HardnessAlgorithmica, 2020
Article dans une revue
hal-03015342v1
|
||
|
|
Cutting Barnette graphs perfectly is hardWG 2023, Jun 2023, Fribourg (Germany), Germany
Communication dans un congrès
hal-04292961v1
|
||
On the complexity of trick-taking card gamesTwenty-Third international joint conference on Artificial Intelligence, Aug 2013, Pékin, China. pp.482-488
Communication dans un congrès
hal-01343394v1
|
|||
|
|
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for ParameterizationAlgorithmica, 2015, 71 (3), pp.566-580. ⟨10.1007/s00453-014-9920-6⟩
Article dans une revue
hal-01200582v1
|
||
|
|
Parameterized Streaming Algorithms for Min-Ones d-SATFSTTCS 2019, Dec 2019, Bombay, India
Communication dans un congrès
hal-03015010v1
|
||
|
|
Orthogonal Terrain Guarding is NP-completeSoCG 2018, Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-01991647v1
|
||
|
|
The Complexity of Playing Durak25th International Joint Conference on Artificial Intelligence (IJCAI 2016), Jul 2016, New-York, NY, United States. pp.109-115
Communication dans un congrès
hal-01994440v1
|
||
On the parameterized complexity of red-blue points separationJournal of Computational Geometry, 2019, 10 (1)
Article dans une revue
hal-03966722v1
|
|||
|
|
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism25th International Workshop on Combinatorial Algorithms, IWOCA 2014, Oct 2014, Duluth, United States. pp.1-12, ⟨10.1007/978-3-319-19315-1_1⟩
Communication dans un congrès
hal-01366670v1
|
||
|
|
Parameterized algorithms for the max k-set cover and related satisfiability problems2013
Pré-publication, Document de travail
hal-00874259v1
|
||
|
|
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSPESA 2019, Sep 2019, Munich, Germany. pp.23 - 24, ⟨10.4230/LIPIcs.ESA.2019.23⟩
Communication dans un congrès
hal-03014960v1
|
||
|
|
Fine-grained complexity of coloring unit disks and balls33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia. ⟨10.4230/LIPIcs.SoCG.2017.18⟩
Communication dans un congrès
hal-01994374v1
|
||
|
|
An Algorithmic Weakening of the Erdős-Hajnal ConjectureESA 2020, Sep 2020, Pisa, Italy
Communication dans un congrès
hal-02935948v1
|
||
|
|
Using greediness for parameterization: the case of max and min (k, n − k)-cut2012
Pré-publication, Document de travail
hal-00874363v1
|
||
|
|
Twin-width I: tractable FO model checkingFOCS 2020, Nov 2020, online, United States
Communication dans un congrès
hal-03107581v1
|
||
|
|
Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphsDiscrete Optimization, 2018, 27, pp.26-56. ⟨10.1016/j.disopt.2017.09.001⟩
Article dans une revue
hal-02073599v1
|
||
|
|
Twin-width I: tractable FO model checkingJournal of the ACM (JACM), 2022, 69 (1), pp.1-46. ⟨10.1145/3486655⟩
Article dans une revue
hal-03750975v1
|
||
|
|
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
|
||
|
|
Designing RNA Secondary Structures Is HardJournal of Computational Biology, 2020, 27 (3), pp.302-316. ⟨10.1089/cmb.2019.0420⟩
Article dans une revue
hal-03032377v1
|
||
|
|
QPTAS and Subexponential Algorithm for Maximum Clique on Disk GraphsSoCG 2018, Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-01991635v1
|
||
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
|
|||
|
|
On the Complexity of Connection GamesTheoretical Computer Science, 2016, 644, pp.2-28. ⟨10.1016/j.tcs.2016.06.033⟩
Article dans une revue
hal-01994450v1
|
||
|
|
The Parameterized Complexity of Positional GamesICALP, Jul 2017, Varsovie, Poland. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-01994361v1
|
||
|
|
Treewidth is NP-Complete for Cubic Graphs (and related results)IPEC 2023, Sep 2023, Amsterdam, Netherlands
Communication dans un congrès
hal-04292980v1
|