![](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 130 matches
- 2016
- Alexander A. Ageev
:
Constant-Factor Approximations for Cycle Cover Problems. DOOR 2016: 93-104 - Alexander A. Ageev, Alexei E. Baburin:
Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines. DOOR (Supplement) 2016: 325-335 - Alexander A. Ageev
, Mikhail Ivanov:
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays. DOOR 2016: 259-271 - Natalia Aizenberg
:
Application of Supply Function Equilibrium Model to Describe the Interaction of Generation Companies in the Electricity Market. DOOR 2016: 469-479 - Gennady Alekseev, Aleksey Lobanov, Yuliya Spivak:
Optimization and Discretization in 2D Problems of Electromagnetic Invisible Cloaking. DOOR (Supplement) 2016: 125-137 - Maxim Anop:
Using Graph Model to Analyze the Topological Vulnerability of Transport Infrastructure. DOOR (Supplement) 2016: 358-366 - Alexander Bahrushin, Galina Bahrushina, Ruslan Bazhenov, Kiseon Kim, Rudolf Tsoy:
Robust Image Watermarking Technique Based on Genetic Algorithm Optimization and Even Odd Modulation. DOOR (Supplement) 2016: 415-427 - Natalia Bakhtadze, Valery E. Pyatetsky, Ekaterina A. Sakrutina:
Predictive Model's Development Based on the Wavelet Analysis Technique. DOOR (Supplement) 2016: 138-151 - Evripidis Bampis
:
Algorithmic Issues in Energy-Efficient Computation. DOOR 2016: 3-14 - Bakhbergen Bekbauov, Abdumauvlen Berdyshev, Zharasbek Baishemirov:
Numerical Simulation of Chemical Enhanced Oil Recovery Processes. DOOR (Supplement) 2016: 664-676 - Vladimir L. Beresnev, Andrey A. Melnikov
:
Facility Location in Unfair Competition. DOOR 2016: 325-335 - André Berger, Alexander Grigoriev
, Artem A. Panin, Andrej Winokurow:
Location, Pricing and the Problem of Apollonius. DOOR 2016: 563-569 - Vladimir B. Berikov:
Cluster Ensemble with Averaged Co-Association Matrix Maximizing the Expected Margin. DOOR (Supplement) 2016: 489-500 - René van Bevern, Robert Bredereck
, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon
, Gerhard J. Woeginger:
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR 2016: 105-120 - Galina Boush, Vitaly Shamis, Oksana Kulikova, Svetlana Neiman:
Markov Processes in Modeling Life Cycle of Economic Clusters. DOOR (Supplement) 2016: 545-557 - Jack Brimberg, Nenad Mladenovic
, Raca Todosijevic
, Dragan Urosevic
:
Variable Neighborhood Descent for the Capacitated Clustering Problem. DOOR 2016: 336-349 - Roman Brizitskii, Zhanna Saritskaya:
Optimization in Nonlinear Models of Mass Transfer. DOOR (Supplement) 2016: 152-164 - Igor A. Bykadorov
, Andrea Ellero, Stefania Funari, Sergey G. Kokovin, Marina Pudova:
Chain Store Against Manufacturers: Regulation Can Mitigate Market Distortion. DOOR 2016: 480-493 - Valentina Bykova, Alexander Soldatenko:
Adaptive Landmark Selection when Routing in Time-Depended Network. DOOR (Supplement) 2016: 367-372 - Yair Censor
, Yehuda Zur:
Linear Superiorization for Infeasible Linear Programming. DOOR 2016: 15-24 - Alexander Yu. Chebotarev, Gleb Grenkin, Andrey E. Kovtanyuk:
Optimal Control Algorithm for Complex Heat Transfer Model. DOOR (Supplement) 2016: 165-177 - Alexander Yu. Chebotarev, Andrey E. Kovtanyuk, Veronika Pestretsova:
Optimization Iterative Procedure for Radiative-Conductive Heat Transfer Model. DOOR (Supplement) 2016: 178-184 - Po-An Chen:
Generalized Mirror Descents with Non-Convex Potential Functions in Atomic Congestion Games. DOOR (Supplement) 2016: 558-562 - Kuei Fen Chen, Hsin-Ginn Hwang, Ming-Ling Sher, Elisa Hui-Ting Lin:
An Empirical Study of Concern for Privacy on Providing Health Information in the EMR Context. DOOR (Supplement) 2016: 677-688 - A. G. Chentsov
, Alexey M. Grigoryev
:
A Scheme of Independent Calculations in a Precedence Constrained Routing Problem. DOOR 2016: 121-135 - Alexey Chernov, Pavel E. Dvurechensky
, Alexander V. Gasnikov:
Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints. DOOR 2016: 391-403 - Ilya Chernykh
:
Routing Open Shop with Unrelated Travel Times. DOOR 2016: 272-283 - Ilya Chernykh
, Ekaterina Lgotina
:
The 2-Machine Routing Open Shop on a Triangular Transportation Network. DOOR 2016: 284-297 - Ananya Christman, Hamza Alsarhan, Davin Chia, Shannia Fu, Yanfeng Jin:
A Two-Pass Algorithm for Unordered Colored Bin Packing. DOOR (Supplement) 2016: 1-10 - Dimitrije D. Cvokic
, Yury A. Kochetov
, Aleksandr V. Plyasunov:
A Leader-Follower Hub Location Problem Under Fixed Markups. DOOR 2016: 350-363
skipping 100 more matches
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-09-02 22:22 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