|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 15 keywords
|
|
|
|
|
Results
Found 47 publication records. Showing 47 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Fast Algorithms for max independent set.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire |
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
The Price of Optimum in a Matching Game. |
SAGT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard |
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. |
ADT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
A survey on the structure of approximation classes. |
Computer Science Review |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini |
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard |
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Minimum regulation of uncoordinated matchings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
A Bottom-Up Method and Fast Algorithms for max independent set. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
On the Impact of Local Taxes in a Set Cover Game. |
SIROCCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Fast Algorithms for min independent dominating set. |
SIROCCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Strategic Coloring of a Graph. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos |
Probabilistic graph-coloring in bipartite and split graphs. |
J. Comb. Optim. |
2009 |
DBLP DOI BibTeX RDF |
Probabilistic optimization, Approximation algorithms, Graph coloring |
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Approximation of min coloring by moderately exponential algorithms. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Efficient approximation of min set cover by moderately exponential algorithms. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos |
Simple and Fast Reoptimizations for the Steiner Tree Problem. |
Algorithmic Operations Research |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Fast algorithms for min independent dominating set |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of minimum and maximum traveling salesman's tours. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
Exact Algorithms for Dominating Clique Problems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some tractable instances of interval data minmax regret problems. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot |
A better differential approximation ratio for symmetric TSP. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Lang, Meltem Öztürk |
Single-peaked consistency and its complexity. |
ECAI |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data |
| 1 | Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
Improved worst-case complexity for the MIN 3-SET COVERING problem. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Peter L. Hammer |
Approximation of the Quadratic Set Covering problem. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Differential approximation of min sat. |
European Journal of Operational Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier |
Polynomial approximation: a structural and operational study. |
4OR |
2007 |
DBLP DOI BibTeX RDF |
MSC classification 68Q17, 68Q25, 05C15, 68W25 |
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Complexity and Approximation Results for the Connected Vertex Cover Problem. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs |
| 1 | Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini |
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: further complexity and approximability results. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Completeness in approximation classes beyond APX. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
On-line models and algorithms for max independent set. |
RAIRO - Operations Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Proving completeness by logic. |
Int. J. Comput. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
| 1 | Bruno Escoffier, Vangelis Th. Paschos |
Differential Approximation of min sat, max sat and Related Problems. |
ICCSA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos |
Probabilistic Coloring of Bipartite and Split Graphs. |
ICCSA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #47 of 47 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")