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 24 matches
- 2012
- Claver P. Bhunu, Steady Mushayabasa:
A Theoretical Analysis of Smoking and Alcoholism. J. Math. Model. Algorithms 11(4): 387-408 (2012) - Ana Martínez Blanco, Arcadio Sotto, Angel Castellanos Peñuela:
Prediction of the Amount of Wood Using Neural Networks. J. Math. Model. Algorithms 11(3): 295-307 (2012) - Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms 11(1): 45-76 (2012) - Akbar Hashemi Borzabadi, Mohammad Heidari:
Evolutionary Algorithms for Approximate Optimal Control of the Heat Equation with Thermal Sources. J. Math. Model. Algorithms 11(1): 77-88 (2012) - Anthony Dekker, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Paul A. Watters:
The Maximum Degree & Diameter-Bounded Subgraph and its Applications. J. Math. Model. Algorithms 11(3): 249-268 (2012) - Sidi Mohamed Douiri, Souad El Bernoussi:
A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem. J. Math. Model. Algorithms 11(2): 181-192 (2012) - Seyed Ahmad Hosseini, Fardin Dashty Saridarq:
Determining the Optimal Flows in Zero-Time Dynamic Networks. J. Math. Model. Algorithms 11(2): 105-117 (2012) - Marie-José Huguet, Pierre Lopez, Wafa Karoui:
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems. J. Math. Model. Algorithms 11(2): 193-215 (2012) - Cédric Joncour, Arnaud Pêcher:
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems. J. Math. Model. Algorithms 11(1): 23-44 (2012) - Cédric Joncour, Arnaud Pêcher, Petru Valicov:
MPQ-trees for the Orthogonal Packing Problem. J. Math. Model. Algorithms 11(1): 3-22 (2012) - Tapan Kumar Kar, Prasanta Kumar Mondal:
Global Dynamics of a Tuberculosis Epidemic Model and the Influence of Backward Bifurcation. J. Math. Model. Algorithms 11(4): 433-459 (2012) - Ali Kaveh, H. Fazli:
Canonical Forms for Symmetric and Regular Structures. J. Math. Model. Algorithms 11(2): 119-157 (2012) - Ranjeet Kumar, Anil Kumar, Rajesh Kumar Pandey:
Electrocardiogram Signal Compression Using Beta Wavelets. J. Math. Model. Algorithms 11(3): 235-248 (2012) - Guillaume Lanquepin-Chesnais, Kjetil K. Haugen, Asmund Olstad:
Large-Scale Joint Price-Inventory Decision Problems, Under Resource Limitation and a Discrete Price Set. J. Math. Model. Algorithms 11(3): 269-280 (2012) - Bahia Lounis, Grégoire Mercier, Aichouche Belhadj Aissa:
Combination of Statistical Similarity Measure and Derivative Morphological Profile Approach for Oil Slick Detection in SAR Images. J. Math. Model. Algorithms 11(4): 409-432 (2012) - Mircea Merca:
Fast Algorithm for Generating Ascending Compositions. J. Math. Model. Algorithms 11(1): 89-104 (2012) - Sathi Mukherjee:
Dijkstra's Algorithm for Solving the Shortest Path Problem on Networks Under Intuitionistic Fuzzy Environment. J. Math. Model. Algorithms 11(4): 345-359 (2012) - Siamak Noori, Seyed Farid Ghannadpour:
High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows. J. Math. Model. Algorithms 11(2): 159-179 (2012) - Radu Precup, Marcel-Adrian Serban, Damian Trif, Andrei Cucuianu:
A Planning Algorithm for Correction Therapies After Allogeneic Stem Cell Transplantation. J. Math. Model. Algorithms 11(3): 309-323 (2012) - Victor J. Rayward-Smith:
Editorial for the JMMA, Number 1, 2012. J. Math. Model. Algorithms 11(1): 1-2 (2012) - Arifusalam Shaikh, Saïd Salhi, Malick M. Ndiaye:
Customer Allocation in Maximum Capture Problems. J. Math. Model. Algorithms 11(3): 281-293 (2012) - Oana Ruxandra Tuns:
Bilevel Biobjective Pseudo Boolean Programming Problems. J. Math. Model. Algorithms 11(3): 325-344 (2012) - Tony Wauters, Wim Vancroonenburg, Greet Vanden Berghe:
A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J. Math. Model. Algorithms 11(3): 217-233 (2012) - Andrea Weiss, Laurence Williams, J. MacGregor Smith:
Performance & Optimization of M/G/c/c Building Evacuation Networks. J. Math. Model. Algorithms 11(4): 361-386 (2012)
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-10-04 19:09 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