Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

76 résultats
Page :
triés par

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

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
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

Efficient approximation by "low-complexity" exponential algorithms

 Nicolas Bourgeois , Bruno Escoffier , Vangelis Paschos
2007
Pré-publication, Document de travail hal-00907607v1
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

LP-Based Algorithms for Multistage Minimization Problems

 Bruno Escoffier , Evripidis Bampis , Alexander Kononov
Approximation and Online Algorithms, WAOA 2020, Sep 2020, Pisa, Italy. pp.1-15, ⟨10.1007/978-3-030-80879-2_1⟩
Communication dans un congrès hal-03333740v1

Canadian Traveller Problem with Predictions

 Evripidis Bampis , Bruno Escoffier , Michalis Xefteris
20th International Workshop on Approximation and Online Algorithms, WAOA 2022, Sep 2022, Potsdam, Germany. pp.116--133, ⟨10.1007/978-3-031-18367-6_6⟩
Communication dans un congrès hal-03880690v1
Image document

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

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

Fast algorithms for MAX INDEPENDENT SET in graphs of small average degree

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

Weighted coloring: further complexity and approximability results

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

Parallel Algorithms are Good for Streaming

 Camil Demetrescu , Bruno Escoffier , Gabriel Moruz , Andrea Ribichini
2006
Pré-publication, Document de travail hal-00957571v1
Image document

Improved worst-case complexity for the MIN 3-SET COVERING problem (janvier 2006)

 Federico Della Croce , Bruno Escoffier , Vangelis Th. Paschos
2006
Pré-publication, Document de travail hal-00017586v1
Image document

Probabilistic graph-coloring in bipartite and split graphs

 Nicolas Bourgeois , Federico Della Croce , Bruno Escoffier , Cecile Murat , Vangelis Paschos
2007
Pré-publication, Document de travail hal-00909484v1
Image document

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

 Bruno Escoffier , Laurent Gourvès , Jérôme Monnot
2007
Pré-publication, Document de travail hal-00178912v1
Image document

Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions

 Tahar Allouche , Bruno Escoffier , Stefano Moretti , Meltem Ozturk
Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jan 2021, Yokohama, Japan. pp.17-23, ⟨10.24963/ijcai.2020/3⟩
Communication dans un congrès hal-02930241v1
Image document

On-line models and algorithms for MAX INDEPENDENT SET

 Bruno Escoffier , Vangelis Th. Paschos
pp.16, 2004
Ouvrages hal-00017612v1
Image document

Parallel Algorithms are Good for Streaming

 Camil Demestrescu , Bruno Escoffier , Gabriel Moruz , Andrea Ribichini
2006
Pré-publication, Document de travail hal-00023607v1
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

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

Complexity and Approximation in Reoptimization

 Giorgio Ausiello , Vincenzo Bonifaci , Bruno Escoffier
2008
Pré-publication, Document de travail hal-00906941v1
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

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

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

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

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

Completeness in approximation classes beyong APX (septembre 2005)

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

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

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
Page :