|
|
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms
Bruno Escoffier
,
Olivier Spanjaard
,
Magdaléna Tydrichová
Communication dans un congrès
hal-02979839v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
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
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
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
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Exact algorithms for dominating clique problems
Nicolas Bourgeois
,
Federico Della Croce
,
Bruno Escoffier
,
Vangelis Paschos
2009
Pré-publication, Document de travail
hal-00877043v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
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
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Efficient approximation by "low-complexity" exponential algorithms
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis Paschos
2007
Pré-publication, Document de travail
hal-00907607v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Differential approximation of MIN SAT, MAX SAT and related problems
Bruno Escoffier
,
Vangelis Th. Paschos
pp.21, 2004
Ouvrages
hal-00018310v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
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
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
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
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Structures des classes d'approximation : un état de l'art
Bruno Escoffier
,
Vangelis Th. Paschos
2007
Pré-publication, Document de travail
hal-00175827v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms
Bruno Escoffier
,
Olivier Spanjaard
,
Magdaléna Tydrichová
Article dans une revue
hal-04475674v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Differential approximation of MIN SAT, MAX SAT and related problems
Bruno Escoffier
,
Vangelis Paschos
2004
Pré-publication, Document de travail
hal-00958506v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Online Multistage Subset Maximization Problems
Evripidis Bampis
,
Bruno Escoffier
,
Kevin Schewior
,
Alexandre Teiller
Communication dans un congrès
hal-02280919v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
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
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Some tractable instances of interval data minmax regret problems
Bruno Escoffier
,
Jérôme Monnot
,
Olivier Spanjaard
Article dans une revue
hal-01170223v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
Bruno Escoffier
,
Laurent Gourvès
,
Jérôme Monnot
,
Olivier Spanjaard
Article dans une revue
hal-01170295v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Differential approximation of MIN SAT, MAX SAT and related problems
Bruno Escoffier
,
Vangelis Th. Paschos
2005
Pré-publication, Document de travail
hal-00003901v2
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Cristina Bazgan
,
Bruno Escoffier
,
Vangelis Th. Paschos
2005
Pré-publication, Document de travail
hal-00004059v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Weighted coloring on planar, bipartite and split graphs: complexity and approximation
Marc Demange
,
Bruno Escoffier
,
Jérôme Monnot
,
Vangelis Th. Paschos
,
Dominique de Werra
2006
Pré-publication, Document de travail
hal-00116696v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Super-polynomial approximation branching algorithms
Bruno Escoffier
,
Vangelis Th. Paschos
,
Emeric Tourniaire
Article dans une revue
hal-01432021v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Using greediness for parameterization: the case of max and min (k, n − k)-cut
Edouard Bonnet
,
Bruno Escoffier
,
Vangelis Paschos
,
Emeric Tourniaire
2012
Pré-publication, Document de travail
hal-00874363v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Algorithms and complexity results for resource leveling problems
Pascale Bendotti
,
Luca Brunod-Indrigo
,
Philippe Chrétienne
,
Bruno Escoffier
ROADEF, Feb 2023, Rennes, France
Communication dans un congrès
hal-03932673v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs
Edouard Bonnet
,
Bruno Escoffier
,
Vangelis Th. Paschos
,
Georgios Stamoulis
Article dans une revue
hal-02073599v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network
Bruno Escoffier
,
Hugo Gilbert
,
Adèle Pass-Lanneau
Communication dans un congrès
hal-02930257v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms
Bruno Escoffier
,
Vangelis Paschos
,
Emeric Tourniaire
Article dans une revue
hal-01099861v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
Edouard Bonnet
,
Bruno Escoffier
,
Vangelis Paschos
,
Emeric Tourniaire
Article dans une revue
hal-01200582v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Multistage Matchings
Evripidis Bampis
,
Bruno Escoffier
,
Michael Lampis
,
Vangelis Th. Paschos
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), Jun 2018, Malmo, Sweden. pp.7:1--7:13, ⟨10.4230/LIPIcs.SWAT.2018.7⟩
Communication dans un congrès
hal-01926860v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Fair resource allocation over time
Evripidis Bampis
,
Bruno Escoffier
,
Sasa Mladenovic
AAMAS 2018 - 17th International Conference on Autonomous Agents and MultiAgent Systems, Jul 2018, Stockholm, Sweden. pp.766-773
Communication dans un congrès
hal-01926989v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Parameterized Power Vertex Cover
Eric Angel
,
Evripidis Bampis
,
Bruno Escoffier
,
Michael Lampis
Article dans une revue
hal-01926709v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
A survey on the structure of approximation classes
Bruno Escoffier
,
Vangelis Paschos
2007
Pré-publication, Document de travail
hal-00909487v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|