Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

76 résultats
Page :
triés par

Single-Peaked consistency and its complexity

 Jérôme Lang , Bruno Escoffier , Meltem Öztürk
18th European Conference on Artificial Intelligence(ECAI'08), 2008, Greece. pp.366-370
Communication dans un congrès hal-00800731v1

Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms

 Bruno Escoffier , Olivier Spanjaard , Magdaléna Tydrichová
13th International Symposium on Algorithmic Game Theory, SAGT 2020, Sep 2020, Augsburg, Germany. pp.291-306, ⟨10.1007/978-3-030-57980-7_19⟩
Communication dans un congrès hal-02979839v1
Image document

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

 Bruno Escoffier , Eun Jung Kim , Vangelis Paschos
2012
Pré-publication, Document de travail hal-00875483v1
Image document

Efficient approximation of MIN SET COVER by "low-complexity" exponential algorithms

 Nicolas Bourgeois , Bruno Escoffier , Vangelis Paschos
2008
Pré-publication, Document de travail hal-00906972v1
Image document

Efficient approximation by "low-complexity" exponential algorithms

 Nicolas Bourgeois , Bruno Escoffier , Vangelis Paschos
2007
Pré-publication, Document de travail hal-00907607v1
Image document

Exact algorithms for dominating clique problems

 Nicolas Bourgeois , Federico Della Croce , Bruno Escoffier , Vangelis Paschos
2009
Pré-publication, Document de travail hal-00877043v1
Image document

Fast algorithms for max independent set

 Nicolas Bourgeois , Bruno Escoffier , Vangelis Paschos , J. M. M. van Rooij
2009
Pré-publication, Document de travail hal-00880187v1
Image document

Efficient approximation of MIN COLORING by moderately exponential algorithms

 Nicolas Bourgeois , Bruno Escoffier , Vangelis Paschos
2008
Pré-publication, Document de travail hal-00906946v1
Image document

Completeness in approximation classes beyong APX (septembre 2005)

 Bruno Escoffier , Vangelis Th. Paschos
2005
Pré-publication, Document de travail hal-00013651v1
Image document

On Subexponential and FPT-Time Inapproximability

 Edouard Bonnet , Bruno Escoffier , Eunjung Kim , Vangelis Paschos
Algorithmica, 2015, 71 (3), pp.541-565. ⟨10.1007/s00453-014-9889-1⟩
Article dans une revue hal-01099850v1
Image document

Exponential approximation schemata for some network design problems

 Nicolas Boria , Nicolas Bourgeois , Bruno Escoffier , Vangelis Paschos
2011
Pré-publication, Document de travail hal-00875650v1
Image document

Saving colors and Max Coloring: some fixed-parameter tractability results

 Bruno Escoffier
Theoretical Computer Science, 2019, 758, pp.30-41. ⟨10.1016/j.tcs.2018.08.002⟩
Article dans une revue hal-01926891v1
Image document

Complexity and Approximation in Reoptimization

 Giorgio Ausiello , Vincenzo Bonifaci , Bruno Escoffier
2008
Pré-publication, Document de travail hal-00906941v1
Image document

Reoptimization of minimum and maximum traveling salesman's tours (février 2006)

 Giorgio Ausiello , Bruno Escoffier , Jérôme Monnot , Vangelis Th. Paschos
2006
Pré-publication, Document de travail hal-00023583v1
Image document

Simple and fast reoptimizations for the Steiner tree problem

 Bruno Escoffier , Martin Milanic , Vangelis Th. Paschos
2007
Pré-publication, Document de travail hal-00174494v1
Image document

Differential approximation of MIN SAT, MAX SAT and related problems

 Bruno Escoffier , Vangelis Paschos
2004
Pré-publication, Document de travail hal-00958506v1
Image document

Differential approximation of MIN SAT, MAX SAT and related problems

 Bruno Escoffier , Vangelis Th. Paschos
pp.21, 2004
Ouvrages hal-00018310v1

Online Multistage Subset Maximization Problems

 Evripidis Bampis , Bruno Escoffier , Kevin Schewior , Alexandre Teiller
European Symposium on Algorithms (ESA), Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.11⟩
Communication dans un congrès hal-02280919v1

Fast algorithms for min independent dominating set

 Nicolas Bourgeois , Federico Della Croce , Vangelis Paschos , Bruno Escoffier
Discrete Applied Mathematics, 2013, 161 (4-5), pp.558-572
Article dans une revue hal-01519214v1
Image document

Structures des classes d'approximation : un état de l'art

 Bruno Escoffier , Vangelis Th. Paschos
2007
Pré-publication, Document de travail hal-00175827v1
Image document

Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation

 Dominique de Werra , Marc Demange , Bruno Escoffier , Jérôme Monnot , Vangelis Th. Paschos
xxx, 2004, France. pp.896-907
Communication dans un congrès hal-00004074v1

Saving colors and Max Coloring: some fixed-parameter tractability results

 Bruno Escoffier
WG 2016, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey
Communication dans un congrès hal-01360669v1

Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms

 Bruno Escoffier , Olivier Spanjaard , Magdaléna Tydrichová
Discrete Applied Mathematics, 2024, 348, pp.301-319. ⟨10.1016/j.dam.2024.02.009⟩
Article dans une revue hal-04475674v1

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization

 Edouard Bonnet , Bruno Escoffier , Vangelis Paschos , Emeric Tourniaire
Algorithmica, 2015, 71 (3), pp.566-580. ⟨10.1007/s00453-014-9920-6⟩
Article dans une revue hal-01200582v1
Image document

A survey on the structure of approximation classes

 Bruno Escoffier , Vangelis Paschos
2007
Pré-publication, Document de travail hal-00909487v1
Image document

Approximation of Quadratic Set Covering Problem

 Bruno Escoffier , Peter L. Hammer
2006
Pré-publication, Document de travail hal-00116702v1
Image document

Completeness in approximation classes beyond APX

 Bruno Escoffier , Vangelis Paschos
2005
Pré-publication, Document de travail hal-00958036v1
Image document

Effcient approximation by “low-complexity” exponential algorithms

 Nicolas Bourgeois , Bruno Escoffier , Vangelis Th. Paschos
2008
Pré-publication, Document de travail hal-00203156v1
Image document

Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms

 Bruno Escoffier , Vangelis Paschos , Emeric Tourniaire
Theoretical Computer Science, 2014, 560 (2), pp.147-157. ⟨10.1016/j.tcs.2014.10.039⟩
Article dans une revue hal-01099861v1
Image document

Some tractable instances of interval data minmax regret problems: bounded distance from triviality

 Bruno Escoffier , Jérôme Monnot , Olivier Spanjaard
2007
Pré-publication, Document de travail hal-00179399v1
Page :