Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 120 matches
- 2023
- Laurent Bulteau, Vincent Jugé, Stéphane Vialette:
On shuffled-square-free words. Theor. Comput. Sci. 941: 91-103 (2023) - Romeo Rizzi, Stéphane Vialette:
On recognising words that are squares for the shuffle product. Theor. Comput. Sci. 956: 111156 (2023) - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing Unit Multiple Intervals Is Hard. ISAAC 2023: 8:1-8:18 - Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. WALCOM 2023: 384-395 - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing unit multiple intervals is hard. CoRR abs/2309.11908 (2023) - Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Quasi-kernels in split graphs. CoRR abs/2312.15519 (2023) - 2022
- Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM 2022: 21:1-21:17 - Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette:
The Maximum Zero-Sum Partition Problem. ICS 2022: 73-85 - Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of Small Quasi-Kernels. WG 2022: 370-382 - 2021
- Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette:
Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. 124: 406-421 (2021) - Laurent Bulteau, Samuele Giraudo, Stéphane Vialette:
Disorders and Permutations. CPM 2021: 11:1-11:15 - Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic aspects of quasi-kernels. CoRR abs/2107.03793 (2021) - 2020
- Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with forbidden intermediates. Discret. Appl. Math. 279: 49-68 (2020) - Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - Laurent Bulteau, Stéphane Vialette:
Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. 806: 116-132 (2020) - 2019
- Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette:
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience 2019: 136-145 - Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette:
Unshuffling Permutations: Trivial Bijections and Compositions. TAMC 2019: 242-261 - 2018
- Guillaume Fertin, Irena Rusu, Stéphane Vialette:
The S-labeling problem: An algorithmic tour. Discret. Appl. Math. 246: 49-61 (2018) - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246: 62-79 (2018) - Samuele Giraudo, Stéphane Vialette:
Algorithmic and algebraic aspects of unshuffling permutations. Theor. Comput. Sci. 729: 20-41 (2018) - Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CSR 2018: 53-64 - Laurent Bulteau, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for k-Track Permutations. IWOCA 2018: 102-114 - Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CoRR abs/1802.07944 (2018) - Samuele Giraudo, Stéphane Vialette:
Algorithmic and algebraic aspects of unshuffling permutations. CoRR abs/1805.08255 (2018) - Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - 2016
- Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with Forbidden Intermediates. AlCoB 2016: 133-144 - Samuele Giraudo, Stéphane Vialette:
Unshuffling Permutations. LATIN 2016: 509-521 - Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for Separable Permutations. SPIRE 2016: 260-272
skipping 90 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-25 17:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint