Остановите войну!
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 32 matches
- 2004
- Martin Anthony:
On data classification by iterative linear partitioning. Discret. Appl. Math. 144(1-2): 2-16 (2004) - Martin Anthony:
Some connections between learning and optimization. Discret. Appl. Math. 144(1-2): 17-26 (2004) - Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
Introduction to special volume of Discrete Applied Mathematics. Discret. Appl. Math. 144(1-2): 1- (2004) - Anne Berry, Alain Sigayret:
Representing a concept lattice by a graph. Discret. Appl. Math. 144(1-2): 27-42 (2004) - Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. 144(3): 231-236 (2004) - Endre Boros, Vladimir Menkov:
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. Discret. Appl. Math. 144(1-2): 43-58 (2004) - Renato Bruni:
Discrete models for data imputation. Discret. Appl. Math. 144(1-2): 59-69 (2004) - Giusi Castiglione, Antonio Restivo, Sergio Salemi:
Patterns in words and languages. Discret. Appl. Math. 144(3): 237-246 (2004) - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
On searching strategies, parallel questions, and delayed answers. Discret. Appl. Math. 144(3): 247-262 (2004) - Valentina Ciriani, Nadia Pisanti, Anna Bernasconi:
Room allocation: a polynomial subcase of the quadratic assignment problem. Discret. Appl. Math. 144(3): 263-269 (2004) - Christian S. Collberg, Todd A. Proebsting:
Problem identification using program checking. Discret. Appl. Math. 144(3): 270-280 (2004) - Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi:
Optimal covering designs: complexity results and new bounds. Discret. Appl. Math. 144(3): 281-290 (2004) - Jitender S. Deogun, Jamil Saquer:
Monotone concepts for formal concept analysis. Discret. Appl. Math. 144(1-2): 70-78 (2004) - Riccardo Focardi, Flaminia L. Luccio:
A modular approach to Sprouts. Discret. Appl. Math. 144(3): 303-319 (2004) - Pierre Fraigniaud:
A note on line broadcast in digraphs under the edge-disjoint paths mode. Discret. Appl. Math. 144(3): 320-323 (2004) - Vincenzo Gervasi, Giuseppe Prencipe:
Coordination without communication: the case of the flocking problem. Discret. Appl. Math. 144(3): 324-344 (2004) - Peter L. Hammer, Alexander Kogan, Bruno Simeone, Sándor Szedmák:
Pareto-optimal patterns in logical analysis of data. Discret. Appl. Math. 144(1-2): 79-102 (2004) - Peter L. Hammer, Yanpei Liu, Bruno Simeone, Sándor Szedmák:
Saturated systems of homogeneous boxes and the logical analysis of numerical data. Discret. Appl. Math. 144(1-2): 103-109 (2004) - Markus Holzer, Waltraud Holzer:
TantrixTM rotation puzzles are intractable. Discret. Appl. Math. 144(3): 345-358 (2004) - Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara:
Separability by two lines and by nearly straight polygonal chains. Discret. Appl. Math. 144(1-2): 110-122 (2004) - Szymon Jaroszewicz, Dan A. Simovici, Ivo G. Rosenberg:
Measures on Boolean polynomials and their applications in data mining. Discret. Appl. Math. 144(1-2): 123-139 (2004) - Gyula O. H. Katona, Attila Sali:
New type of coding problem motivated by database theory. Discret. Appl. Math. 144(1-2): 140-148 (2004) - Eduardo Sany Laber, Loana Tito Nogueira:
On the hardness of the minimum height decision tree problem. Discret. Appl. Math. 144(1-2): 209-212 (2004) - Elena Lodi, Linda Pagli, Nicola Santoro:
Fun with algorithms. Discret. Appl. Math. 144(3): 229-230 (2004) - Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi:
A bijection for the total area of parallelogram polyominoes. Discret. Appl. Math. 144(3): 291-302 (2004) - Anthony J. Macula, Leonard J. Popyack:
A group testing method for finding patterns in data. Discret. Appl. Math. 144(1-2): 149-157 (2004) - Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Waiting patterns for a printer. Discret. Appl. Math. 144(3): 359-373 (2004) - Michel Minoux:
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. Discret. Appl. Math. 144(1-2): 158-172 (2004) - Christophe Moan, Irena Rusu:
Hard problems in similarity searching. Discret. Appl. Math. 144(1-2): 213-227 (2004) - Pat Morin, Jason Morrison:
The geometry of carpentry and joinery. Discret. Appl. Math. 144(3): 374-380 (2004)
skipping 2 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-05-31 00:52 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