![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 12 matches
- 2007
- Francisco Azevedo, Pedro Barahona, François Fages, Francesca Rossi:
Recent Advances in Constraints, 11th Annual ERCIM International Workshop on Constraint Solving and Contraint Logic Programming, CSCLP 2006, Caparica, Portugal, June 26-28, 2006, Revised Selected and Invited Papers. Lecture Notes in Computer Science 4651, Springer 2007, ISBN 978-3-540-73816-9 [contents] - 2006
- Francisco Azevedo:
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem. CSCLP 2006: 33-47 - Roman Barták, Ondrej Cepek:
A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62 - Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Reusing CSP Propagators for QCSPs. CSCLP 2006: 63-77 - Stefano Bistarelli
, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Bipolar Preference Problems: Framework, Properties and Solving Techniques. CSCLP 2006: 78-92 - Ismel Brito, Pedro Meseguer:
Distributed Forward Checking May Lie for Privacy. CSCLP 2006: 93-107 - Thi-Bich-Hanh Dao, Khalil Djelloul:
Solving First-Order Constraints in the Theory of the Evaluated Trees. CSCLP 2006: 108-123 - Chavalit Likitvivatanavong, Roland H. C. Yap:
Extracting Microstructure in Binary Constraint Networks. CSCLP 2006: 124-138 - Marc Meister, Khalil Djelloul, Thom W. Frühwirth:
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees. CSCLP 2006: 139-153 - Igor Razgon, Barry O'Sullivan:
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems. CSCLP 2006: 154-168 - Armagan Tarim, Brahim Hnich
, Roberto Rossi, Steven D. Prestwich:
Cost-Based Filtering for Stochastic Inventory Control. CSCLP 2006: 169-183 - Mark Wallace:
Hybrid Algorithms in Constraint Programming. CSCLP 2006: 1-32
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 12:01 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