Nombre de documents

57

CV de Bruno Escoffier


Communication dans un congrès5 documents

  • Eric Angel, Evripidis Bampis, Bruno Escoffier, Michail Lampis. Parameterized Power Vertex Cover. WG 2016, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. Springer-Verlag, Proceedings of WG 2016, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, to appear, Lecture Notes in Computer Science. <hal-01360665>
  • Bruno Escoffier. Saving colors and Max Coloring: some fixed-parameter tractability results. WG 2016, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. Proceedings of WG 2016, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science. <hal-01360669>
  • Edouard Bonnet, Bruno Escoffier, Vangelis Paschos, Giorgios Stamoulis. A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, 2016, Ensenada, Mexico. Springer, 9644, pp.235-248, 2016, Lecture Notes in Computer Science. <10.1007/978-3-662-49529-2>. <hal-01343951>
  • J. Lang, Bruno Escoffier, Meltem Öztürk. Single-Peaked consistency and its complexity. 18th European Conference on Artificial Intelligence(ECAI'08), 2008, Greece. pp.366-370, 2008. <hal-00800731>
  • Dominique De Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Paschos. Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation. xxx, 2004, France. LNCS 3341-springer verlaag, pp.896-907, 2004. <hal-00004074>

Article dans une revue6 documents

Pré-publication, Document de travail43 documents

  • Edouard Bonnet, Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Using greediness for parameterization: the case of max and min (k, n − k)-cut. 2012. <hal-00874363>
  • Bruno Escoffier, Kim Eun Jung, Vangelis Paschos. Subexponential and FPT-time Inapproximability of Independent Set and Related Problems. 2012. <hal-00875483>
  • Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Moderate exponential time approximation and branching algorithms. 2012. <hal-00874358>
  • Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Approximating MAX SAT by moderately exponential algorithms. 2011. <hal-00875648>
  • Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Exponential approximation schemata for some network design problems. 2011. <hal-00875650>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, J. M. M. Van Rooij. Fast algorithms for max independent set. 2009. <hal-00880187>
  • Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Exact algorithms for dominating clique problems. 2009. <hal-00877043>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. An improved exact algorithm for maximum independent set in sparse graphs. 2008. <hal-00203163>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Effcient approximation by “low-complexity” exponential algorithms. 2008. <hal-00203156>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Efficient approximation of MIN SET COVER by "low-complexity" exponential algorithms. 2008. <hal-00906972>
  • Giorgio Ausiello, Vincenzo Bonifaci, Bruno Escoffier. Complexity and Approximation in Reoptimization. 2008. <hal-00906941>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Efficient approximation of MIN COLORING by moderately exponential algorithms. 2008. <hal-00906946>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. An improved exact algorithm for maximum independent set in sparse graphs. 2008. <hal-00907599>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, J. M. M. Van Rooij. Fast algorithms for max independent set in graphs of small average degree. 2008. <hal-00907043>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, J. M. M. Van Rooij. Fast algorithms for MAX INDEPENDENT SET in graphs of small average degree. 2008. <hal-00321618>
  • Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cecile Murat, Vangelis Paschos. Probabilistic graph-coloring in bipartite and split graphs. 2007. <hal-00909484>
  • Bruno Escoffier, Vangelis Paschos. A survey on the structure of approximation classes. 2007. <hal-00909487>
  • Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems: bounded distance from triviality. 2007. <hal-00909552>
  • Bruno Escoffier, Jérôme Monnot. Better differential approximation for symmetric TSP. 2007. <hal-00917811>
  • Bruno Escoffier, Vangelis Paschos. Structures des classes d'approximation : un état de l'art. 2007. <hal-00175827>
  • N. Bourgeois, Federico Della Croce, Bruno Escoffier, Cecile Murat, Vangelis Paschos. Probabilistic graph-coloring in bipartite and split graphs (Exented version of cahier du LAMSADE 218). 2007. <hal-00179422>
  • Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems: bounded distance from triviality. 2007. <hal-00179399>
  • Bruno Escoffier, Martin Milanic, Vangelis Paschos. Simple and fast reoptimizations for the Steiner tree problem. 2007. <hal-00174494>
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Efficient approximation by "low-complexity" exponential algorithms. 2007. <hal-00907607>
  • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot. Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. 2007. <hal-00178912>
  • Bruno Escoffier, Jérôme Monnot. Better differential approximation for symetric TSP. 2007. <hal-00178903>
  • Bruno Escoffier, Vangelis Paschos. Structures des classes d'approximation : un état de l'art. 2007. <hal-00948835>
  • Bruno Escoffier, Martin Milanic, Vangelis Paschos. Simple and fast reoptimizations for the Steiner tree problem. 2007. <hal-00948864>
  • Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Paschos. Reoptimization of minimum and maximum traveling salesman's tours (février 2006). 2006. <hal-00023583>
  • Camil Demestrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini. Parallel Algorithms are Good for Streaming. 2006. <hal-00023607>
  • Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini. Parallel Algorithms are Good for Streaming. 2006. <hal-00957571>
  • Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Improved worst-case complexity for the MIN 3-SET COVERING problem. 2006. <hal-00957610>
  • Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Improved worst-case complexity for the MIN 3-SET COVERING problem (janvier 2006). 2006. <hal-00017586>
  • Bruno Escoffier, Peter Hammer. Approximation of Quadratic Set Covering Problem. ANNALES DU LAMSADE N°4-5. 2006. <hal-00116702>
  • Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Paschos, Dominique De Werra. Weighted coloring on planar, bipartite and split graphs: complexity and approximation. ANNALES DU LAMSADE N°4-5. 2006. <hal-00116696>
  • Bruno Escoffier, Jérôme Monnot, Vangelis Paschos. Weighted coloring: further complexity and approximability results. ANNALES DU LAMSADE N°4-5. 2006. <hal-00116712>
  • Bruno Escoffier, Vangelis Paschos. Completeness in approximation classes beyond APX. 2005. <hal-00958036>
  • Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Paschos. Reoptimization of minimum and maximum travelling salesman's tours. 2005. <hal-00957601>
  • Bruno Escoffier, Vangelis Paschos. Completeness in approximation classes beyong APX (septembre 2005). 2005. <hal-00013651>
  • Cristina Bazgan, Bruno Escoffier, Vangelis Paschos. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. 2005. <hal-00004059>
  • Bruno Escoffier, Vangelis Paschos. Differential approximation of MIN SAT, MAX SAT and related problems. 2005. <hal-00003901v2>
  • Federico Della Croce, Bruno Escoffier, Cecile Murat, Vangelis Paschos. Probabilistic coloring of bipartite and split graphs. 2005. <hal-00004173>
  • Bruno Escoffier, Vangelis Paschos. Differential approximation of MIN SAT, MAX SAT and related problems. 2004. <hal-00958506>

Ouvrage (y compris édition critique et traduction)3 documents

  • Bruno Escoffier, Vangelis Paschos. An Alternative proof of SAT NP-Completeness. pp.10, 2004. <hal-00017602>
  • Bruno Escoffier, Vangelis Paschos. On-line models and algorithms for MAX INDEPENDENT SET. pp.16, 2004. <hal-00017612>
  • Bruno Escoffier, Vangelis Paschos. Differential approximation of MIN SAT, MAX SAT and related problems. pp.21, 2004. <hal-00018310>