Остановите войну!
for scientists:
default search action
Bruno Escoffier
- > Home > Persons > Bruno Escoffier
Publications
- 2013
- [j27]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4-5): 558-572 (2013) - [j26]Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22: 43-52 (2013) - 2012
- [j25]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for max independent set. Algorithmica 62(1-2): 382-415 (2012) - [j23]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Algorithms for dominating clique problems. Theor. Comput. Sci. 459: 77-88 (2012) - 2011
- [j22]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17): 1954-1970 (2011) - 2010
- [c16]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast Algorithms for min independent dominating set. SIROCCO 2010: 247-261 - [c15]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: 62-73 - [c14]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: 373-384 - 2009
- [j15]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16): 950-954 (2009) - [j14]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17(3): 274-311 (2009) - [j12]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. 410(21-23): 2184-2195 (2009) - [c13]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13 - [c12]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS 2009: 507-518 - [i2]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 abs/0901.1563 (2009) - [i1]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. CoRR abs/0905.1993 (2009) - 2008
- [c10]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. IWPEC 2008: 55-65
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint