Остановите войну!
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
no 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 13 matches
- 2020
- Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis:
Invariants for time-series constraints. Constraints An Int. J. 25(3-4): 71-120 (2020) - Gilles Audemard, Frédéric Boussemart, Christophe Lecoutre, Cédric Piette, Olivier Roussel:
XCSP3 and its ecosystem. Constraints An Int. J. 25(1-2): 47-69 (2020) - Ondrej Benedikt, István Módos, Zdenek Hanzálek:
Power of pre-processing: production scheduling with variable energy pricing and power-saving states. Constraints An Int. J. 25(3-4): 300-318 (2020) - Jaime E. González, André Augusto Ciré, Andrea Lodi, Louis-Martin Rousseau:
Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem. Constraints An Int. J. 25(1-2): 23-46 (2020) - Hiroyuki Goto, Alan T. Murray:
Exact and flexible solution approach to a critical chain project management problem. Constraints An Int. J. 25(3-4): 280-297 (2020) - Mohd. Hafiz Hasan, Pascal Van Hentenryck:
The flexible and real-time commute trip sharing problems. Constraints An Int. J. 25(3-4): 160-179 (2020) - Emmanuel Hebrard, Nysret Musliu:
Introduction to the CPAIOR 2020 fast track issue. Constraints An Int. J. 25(3-4): 298-299 (2020) - Mohamed Amine Omrani, Wady Naanaa:
Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs. Constraints An Int. J. 25(1-2): 1-22 (2020) - Rodrigue Konan Tchinda, Clémentin Tayou Djamégni:
On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers. Constraints An Int. J. 25(3-4): 251-279 (2020) - Dimosthenis C. Tsouros, Kostas Stergiou:
Efficient multiple constraint acquisition. Constraints An Int. J. 25(3-4): 180-225 (2020) - Olga Tveretina, Pavel Zaichenkov, Alex Shafarenko:
Non-local configuration of component interfaces by constraint satisfaction. Constraints An Int. J. 25(3-4): 121-159 (2020) - Hélène Verhaeghe, Siegfried Nijssen, Gilles Pesant, Claude-Guy Quimper, Pierre Schaus:
Learning optimal decision trees using constraint programming. Constraints An Int. J. 25(3-4): 226-250 (2020) - Mark Wallace, Neil Yorke-Smith:
A new constraint programming model and solving for the cyclic hoist scheduling problem. Constraints An Int. J. 25(3-4): 319-337 (2020)
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-06-13 22:07 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