|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié |
The max quasi-independent set problem.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 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 | 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 | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
Approximating the max-edge-coloring problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié |
The max quasi-independent set Problem. |
CSR |
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 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Fast Algorithms for min independent dominating set. |
SIROCCO |
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 | Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos |
Greedy Algorithms For On-Line Set-Covering. |
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 | 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 | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
Approximating the Max Edge-Coloring Problem. |
IWOCA |
2009 |
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 |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")