Остановите войну!
for scientists:
default search action
Stéphane Vialette
- > Home > Persons > Stéphane Vialette
Publications
- 2020
- [j37]Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - 2018
- [c48]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CSR 2018: 53-64 - [i13]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CoRR abs/1802.07944 (2018) - 2012
- [c34]Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474 - 2011
- [j26]Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011) - 2010
- [j21]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010) - 2009
- [j16]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette:
On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009) - 2008
- [j15]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008) - [j12]Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008) - [j11]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette:
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008) - 2007
- [c19]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252 - [c16]Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351 - [c13]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover Problem. WAOA 2007: 170-183 - 2005
- [c6]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette:
Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437 - [c3]Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282
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-01-11 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint