Остановите войну!
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 31 matches
- 2010
- Ashkan Aazami:
Domination in graphs with bounded propagation: algorithms, formulations and hardness results. J. Comb. Optim. 19(4): 429-456 (2010) - Bo Chen, Xujin Chen, Xiaodong Hu:
The price of atomic selfish ring routing. J. Comb. Optim. 19(3): 258-278 (2010) - Zhixiang Chen, Bin Fu, John Abraham:
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor. J. Comb. Optim. 19(2): 134-157 (2010) - Lei Chen, Changhong Lu, Zhenbing Zeng:
Labelling algorithms for paired-domination problems in block and interval graphs. J. Comb. Optim. 19(4): 457-470 (2010) - James J. Cochran, Martin S. Levy, Jeffrey D. Camm:
Bayesian coverage optimization models. J. Comb. Optim. 19(2): 158-173 (2010) - Zhenhua Duan, Chen Yang:
Unconditional secure communication: a Russian Cards protocol. J. Comb. Optim. 19(4): 501-530 (2010) - Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski:
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. J. Comb. Optim. 19(2): 184-199 (2010) - Sourour Elloumi:
A tighter formulation of the p-median problem. J. Comb. Optim. 19(1): 69-83 (2010) - Diana Fanghänel, Frauke Liers:
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions. J. Comb. Optim. 19(3): 369-393 (2010) - Teresa Gomes, José M. F. Craveirinha, Luísa Jorge:
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs. J. Comb. Optim. 19(3): 394-414 (2010) - Çigdem Güler, Horst W. Hamacher:
Capacity inverse minimum cost flow problem. J. Comb. Optim. 19(1): 43-59 (2010) - Jun Guo:
Pooling designs associated with unitary space and ratio efficiency comparison. J. Comb. Optim. 19(4): 492-500 (2010) - Sun-Yuan Hsieh, Chang-Yu Wu:
Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults. J. Comb. Optim. 19(1): 16-30 (2010) - Shiyan Hu:
An almost four-approximation algorithm for maximum weight triangulation. J. Comb. Optim. 19(1): 31-42 (2010) - Tayuan Huang, Kaishun Wang, Chih-Wen Weng:
A class of error-correcting pooling designs over complexes. J. Comb. Optim. 19(4): 486-491 (2010) - Hongxing Jiang, Liying Kang:
Total restrained domination in claw-free graphs. J. Comb. Optim. 19(1): 60-68 (2010) - William S. Kennedy, Hui Kong, Guohui Lin, Guiying Yan:
Linear time construction of 5-phylogenetic roots for tree chordal graphs. J. Comb. Optim. 19(1): 94-106 (2010) - Yaron Leyvand, Dvir Shabtay, George Steiner, Liron Yedidsion:
Just-in-time scheduling with controllable processing times on parallel machines. J. Comb. Optim. 19(3): 347-368 (2010) - Shisheng Li, Jinjiang Yuan:
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. J. Comb. Optim. 19(1): 84-93 (2010) - Igor S. Litvinchev, Socorro Rangel, Jania Saucedo:
A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. 19(3): 241-257 (2010) - Lan Liu, Tao Jiang:
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops. J. Comb. Optim. 19(2): 217-240 (2010) - Eric McDermid, David F. Manlove:
Keeping partners together: algorithmic results for the hospitals/residents problem with couples. J. Comb. Optim. 19(3): 279-303 (2010) - Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos:
Complexity analysis for maximum flow problems with arc reversals. J. Comb. Optim. 19(2): 200-216 (2010) - Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven D. Prestwich, Semra Karacaer:
Scheduling internal audit activities: a stochastic combinatorial optimization problem. J. Comb. Optim. 19(3): 325-346 (2010) - Nicolas Sonnerat, Adrian Vetta:
Galaxy cutsets in graphs. J. Comb. Optim. 19(3): 415-427 (2010) - Francis Sourd:
Lexicographically minimizing axial motions for the Euclidean TSP. J. Comb. Optim. 19(1): 1-15 (2010) - Tami Tamir, Benny Vaksendiser:
Algorithms for storage allocation based on client preferences. J. Comb. Optim. 19(3): 304-324 (2010) - Yiqiao Wang, Weifan Wang:
Adjacent vertex distinguishing total colorings of outerplanar graphs. J. Comb. Optim. 19(2): 123-133 (2010) - Weifan Wang, Yiqiao Wang:
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19(4): 471-485 (2010) - Chen Wang, James Willson, Myung Ah Park, Andras Farago, Weili Wu:
On dual power assignment optimization for biconnectivity. J. Comb. Optim. 19(2): 174-183 (2010)
skipping 1 more match
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-02 02:39 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