Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly

Filter your results

77 Results
Author: personID (integer) : 1194024

Present-biased optimization

Fedor Fomin , Pierre Fraigniaud , Petr Golovach
Mathematical Social Sciences, 2022, 119, pp.56-67. ⟨10.1016/j.mathsocsci.2022.06.001⟩
Journal articles hal-03871448v1
Image document

Kernels for feedback arc set in tournaments

Stéphane Bessy , Fedor V. Fomin , Serge Gaspers , Christophe Paul , Anthony Perez et al.
Journal of Computer and System Sciences, 2011, 77 (6), pp.1071-1078. ⟨10.1016/j.jcss.2010.10.001⟩
Journal articles lirmm-00738221v1
Image document

Kernels for Feedback Arc Set In Tournaments

Stéphane Bessy , Fedor V. Fomin , Serge Gaspers , Christophe Paul , Anthony Perez et al.
IARCS 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
Image document

Preface to the special issue on Graph Searching: Theory and Applications

Spyros Angelopoulos , Nancy Clarke , Fedor Fomin , Archontia Giannopoulou , Roman Rabinovich et al.
Theoretical Computer Science, 858, Elsevier, pp.145-146, 2021, ⟨10.1016/j.tcs.2021.01.036⟩
Special issue hal-03439955v1
Image document

To satisfy impatient Web surfers is hard

Fedor V. Fomin , Frédéric Giroire , Alain Jean-Marie , Dorian Mazauric , Nicolas Nisse et al.
Theoretical Computer Science, 2014, 526, pp.1-17. ⟨10.1016/j.tcs.2014.01.009⟩
Journal articles hal-00966985v1
Image document

Report on GRASTA 2014

Fedor V. Fomin , Pierre Fraigniaud , Nicolas Nisse , Dimitrios M. Thilikos
[Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014
Reports hal-01084230v1

Branch and Recharge: Exact Algorithms for Generalized Domination

Fedor V. Fomin , Petr A. Golovach , Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff et al.
Algorithmica, 2011, 61 (2), pp.252-273. ⟨10.1007/s00453-010-9418-9⟩
Journal articles istex hal-00512289v1

Branch and Recharge: Exact algorithms for generalized domination

Fedor V. Fomin , Petr A. Golovach , Jan Kratochvil , Dieter Kratsch , Mathieu Liedloff et al.
WADS'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 Algorithms

Fedor V. Fomin , Serge Gaspers , Dieter Kratsch , Mathieu Liedloff , Saket Saurabh et al.
Theoretical Computer Science, 2010, 411 (7-9), pp.1045-1053. ⟨10.1016/j.tcs.2009.11.012⟩
Journal articles hal-00460862v1

On exact algorithms for treewidth

Hans L. Bodlaender , Fedor V. Fomin , Aries Koster , Dieter Kratsch , Dimitrios M. Thilikos et al.
ACM Transactions on Algorithms, 2012, 9 (1), pp.12:1--12:23. ⟨10.1145/2390176.2390188⟩
Journal articles lirmm-00804792v1
Image document

Optimal Linear Arrangement of Interval Graphs

Johanne Cohen , Fedor V. Fomin , Pinar Heggernes , Dieter Kratsch , Gregory Kucherov et al.
31st 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
Image document

Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017

Spyros Angelopoulos , Pierre Fraigniaud , Fedor V. Fomin , Nicolas Nisse , Dimitrios M. Thilikos et al.
[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
Image document

Parameterized Complexity of Connected Even/Odd Subgraph Problems

Fedor V. Fomin , Petr A. Golovach
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.432-440
Conference papers hal-00678168v1
Image document

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

Henning Fernau , Fedor V. Fomin , Daniel Lokshtanov , Daniel Raible , Saket Saurabh et al.
26th 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 cliques

Fedor V. Fomin , Mathieu Liedloff , Pedro Montealegre-Barba , Ioan Todinca
Scandinavian Symposium and Workshops on Algorithm Theory, 2014, Denmark. To appear
Conference papers hal-00984059v1
Image document

Parameterized Complexity of Elimination Distance to First-Order Logic Properties

Fedor Fomin , Petr Golovach , Dimitrios M. Thilikos
ACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩
Journal articles hal-03389854v2
Image document

Fast Minor Testing in Planar Graphs

Isolde Adler , Frederic Dorn , Fedor V. Fomin , Ignasi Sau , Dimitrios M. Thilikos et al.
ESA 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 graphs

Frederic Dorn , Fedor V. Fomin , Dimitrios M. Thilikos
Journal of Computer and System Sciences, 2012, 78 (5), pp.1606-1622. ⟨10.1016/j.jcss.2012.02.004⟩
Journal articles lirmm-00904498v1

Bidimensionality

Fedor V. Fomin , Erik D. Demaine , Mohammed Taghi Hajiaghayi , Dimitrios M. Thilikos
Encyclopedia 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-Graphs

Fedor Fomin , Petr Golovach , Jean-Florent Raymond
Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
Journal articles hal-03449925v1
Image document

Computing branchwidth via efficient triangulations and blocks

Fedor V. Fomin , Frédéric Mazoit , Ioan Todinca
Discrete 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-In

Dieter Kratsch , Fedor V. Fomin , Ioan Todinca
2004, pp.568-580
Conference papers hal-00085561v1

Large induced subgraphs via triangulations and CMSO

Fedor V. Fomin , Ioan Todinca , Yngve Villanger
Symposium on Discrete Algorithms, 2014, United States. pp.582-593, ⟨10.1137/1.9781611973402.44⟩
Conference papers hal-00984058v1

Computing branchwidth via Efficient Triangulations and blocks

Fedor V. Fomin , Frédéric Mazoit , Ioan Todinca
2005, pp.374-384
Conference papers hal-00085562v1

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems

Fedor V. Fomin , Tien-Nam Le , Daniel Lokshtanov , Saket Saurabh , Stéphan Thomassé et al.
ACM Transactions on Algorithms, 2019, 15 (1), pp.1-44
Journal articles hal-02055844v1
Image document

Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs

Fedor Fomin , Petr Golovach , Dimitrios M. Thilikos
Graph-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
Image document

Bidimensionality and Kernels

Fedor Fomin , Daniel Lokshtanov , Saket Saurabh , Dimitrios M. Thilikos
SIAM Journal on Computing, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩
Journal articles hal-03094544v1
Image document

Connected Graph Searching

Lali Barrière , Paola Flocchini , Fedor V. Fomin , Pierre Fraigniaud , Nicolas Nisse et al.
[Research Report] RR-7363, INRIA. 2010
Reports inria-00508888v1
Image document

To Satisfy Impatient Web surfers is Hard

Fedor V. Fomin , Frédéric Giroire , Alain Jean-Marie , Dorian Mazauric , Nicolas Nisse et al.
FUN: 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 Minors

Fedor V. Fomin , Daniel Lokshtanov , Saket Saurabh , Dimitrios M. Thilikos
ACM Transactions on Algorithms, 2018, 14 (1), pp.1-31. ⟨10.1145/3155298⟩
Journal articles lirmm-01890563v1