Filter your results
- 33
- 31
- 4
- 3
- 3
- 2
- 1
- 77
- 32
- 21
- 13
- 11
- 9
- 7
- 7
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 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
- 76
- 8
- 39
- 14
- 14
- 14
- 8
- 8
- 4
- 4
- 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
- 59
- 41
- 39
- 39
- 39
- 38
- 35
- 18
- 14
- 14
- 14
- 14
- 14
- 14
- 14
- 14
- 14
- 14
- 12
- 10
- 10
- 10
- 8
- 8
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 75
- 2
- 40
- 37
- 2
- 4
- 6
- 2
- 5
- 2
- 4
- 1
- 6
- 3
- 9
- 6
- 7
- 8
- 2
- 1
- 3
- 3
- 1
- 1
- 1
|
Present-biased optimizationMathematical Social Sciences, 2022, 119, pp.56-67. ⟨10.1016/j.mathsocsci.2022.06.001⟩
Journal articles
hal-03871448v1
|
||
|
Kernels for feedback arc set in tournamentsJournal of Computer and System Sciences, 2011, 77 (6), pp.1071-1078. ⟨10.1016/j.jcss.2010.10.001⟩
Journal articles
lirmm-00738221v1
|
||
|
Kernels for Feedback Arc Set In TournamentsIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.37-47, ⟨10.4230/LIPIcs.FSTTCS.2009.2305⟩
Conference papers
lirmm-00432668v1
|
||
|
Preface to the special issue on Graph Searching: Theory and ApplicationsTheoretical Computer Science, 858, Elsevier, pp.145-146, 2021, ⟨10.1016/j.tcs.2021.01.036⟩
Special issue
hal-03439955v1
|
||
|
To satisfy impatient Web surfers is hardTheoretical Computer Science, 2014, 526, pp.1-17. ⟨10.1016/j.tcs.2014.01.009⟩
Journal articles
hal-00966985v1
|
||
|
Report on GRASTA 2014[Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014
Reports
hal-01084230v1
|
||
Branch and Recharge: Exact Algorithms for Generalized DominationAlgorithmica, 2011, 61 (2), pp.252-273. ⟨10.1007/s00453-010-9418-9⟩
Journal articles
istex
hal-00512289v1
|
|||
Branch and Recharge: Exact algorithms for generalized dominationWADS'2007 : 10th Workshop on Algorithms and Data Structures, Aug 2007, Halifax, Canada. pp.507-518, ⟨10.1007/978-3-540-73951-7_44⟩
Conference papers
istex
hal-00460736v1
|
|||
|
Iterative Compression and Exact AlgorithmsTheoretical Computer Science, 2010, 411 (7-9), pp.1045-1053. ⟨10.1016/j.tcs.2009.11.012⟩
Journal articles
hal-00460862v1
|
||
|
On exact algorithms for treewidthACM Transactions on Algorithms, 2012, 9 (1), pp.12:1--12:23. ⟨10.1145/2390176.2390188⟩
Journal articles
lirmm-00804792v1
|
||
|
Optimal Linear Arrangement of Interval Graphs31st International Symposium on Mathematical Foundations of Computer Science - MFCS 2006, Aug 2006, Stara Lesna/Slovakia, pp.267-279, ⟨10.1007/11821069⟩
Conference papers
inria-00115249v1
|
||
|
Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017[Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017
Reports
lirmm-01645614v1
|
||
|
Parameterized Complexity of Connected Even/Odd Subgraph ProblemsSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.432-440
Conference papers
hal-00678168v1
|
||
|
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.421-432
Conference papers
inria-00358112v1
|
||
Algorithms parameterized by vertex cover and modular width, through potential maximal cliquesScandinavian Symposium and Workshops on Algorithm Theory, 2014, Denmark. To appear
Conference papers
hal-00984059v1
|
|||
|
Parameterized Complexity of Elimination Distance to First-Order Logic PropertiesACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩
Journal articles
hal-03389854v2
|
||
|
Fast Minor Testing in Planar GraphsESA 2010 - 18th Annual European Symposium on Algorithms, Sep 2010, Liverpool, United Kingdom. pp.97-109, ⟨10.1007/978-3-642-15775-2_9⟩
Conference papers
lirmm-00736769v1
|
||
|
Catalan structures and dynamic programming in H-minor-free graphsJournal of Computer and System Sciences, 2012, 78 (5), pp.1606-1622. ⟨10.1016/j.jcss.2012.02.004⟩
Journal articles
lirmm-00904498v1
|
||
BidimensionalityEncyclopedia of Algorithms, Springer, pp.203-207, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_47⟩
Book sections
lirmm-01483707v1
|
|||
|
On the Tractability of Optimization Problems on H-GraphsAlgorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
Journal articles
hal-03449925v1
|
||
|
Computing branchwidth via efficient triangulations and blocksDiscrete Applied Mathematics, 2009, 157, pp.2726-2736. ⟨10.1016/j.dam.2008.08.009⟩
Journal articles
hal-00390623v1
|
||
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In2004, pp.568-580
Conference papers
hal-00085561v1
|
|||
|
Large induced subgraphs via triangulations and CMSOSymposium on Discrete Algorithms, 2014, United States. pp.582-593, ⟨10.1137/1.9781611973402.44⟩
Conference papers
hal-00984058v1
|
||
Computing branchwidth via Efficient Triangulations and blocks2005, pp.374-384
Conference papers
hal-00085562v1
|
|||
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsACM Transactions on Algorithms, 2019, 15 (1), pp.1-44
Journal articles
hal-02055844v1
|
|||
|
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on GraphsGraph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.308-320, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_24⟩
Book sections
hal-03390090v1
|
||
|
Bidimensionality and KernelsSIAM Journal on Computing, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩
Journal articles
hal-03094544v1
|
||
|
Connected Graph Searching[Research Report] RR-7363, INRIA. 2010
Reports
inria-00508888v1
|
||
|
To Satisfy Impatient Web surfers is HardFUN: International Conference on FUN with Algorithms, Jun 2012, Venice, Italy. pp.166-176
Conference papers
hal-00704201v1
|
||
|
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological MinorsACM Transactions on Algorithms, 2018, 14 (1), pp.1-31. ⟨10.1145/3155298⟩
Journal articles
lirmm-01890563v1
|