Остановите войну!
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 47 matches
- 2013
- Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Complexity of determining the most vital elements for the p-median and p-center location problems. J. Comb. Optim. 25(2): 191-207 (2013) - Stéphane Bessy, Frédéric Havet:
Enumerating the edge-colourings and total colourings of a regular graph. J. Comb. Optim. 25(4): 523-535 (2013) - Ioannis Caragiannis, Gianpiero Monaco:
A 6/5-approximation algorithm for the maximum 3-cover problem. J. Comb. Optim. 25(1): 60-77 (2013) - Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. 25(1): 19-46 (2013) - Huilan Chang, Hung-Lin Fu, Min-Yun Lien:
The decycling number of outerplanar graphs. J. Comb. Optim. 25(4): 536-542 (2013) - Ting-Pang Chang, Li-Da Tong:
The hamiltonian numbers in digraphs. J. Comb. Optim. 25(4): 694-701 (2013) - Clément Charpentier, Mickaël Montassier, André Raspaud:
L(p, q)-labeling of sparse graphs. J. Comb. Optim. 25(4): 646-660 (2013) - Xin Chen:
On sorting unsigned permutations by double-cut-and-joins. J. Comb. Optim. 25(3): 339-351 (2013) - Zhixiang Chen, Bin Fu:
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. J. Comb. Optim. 25(2): 234-254 (2013) - Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen:
Equivalence of two conjectures on equitable coloring of graphs. J. Comb. Optim. 25(4): 501-504 (2013) - Ma-Lian Chia, David Kuo, Jing-Ho Yan, Siou-Ru Yang:
(p, q)-total labeling of complete graphs. J. Comb. Optim. 25(4): 543-561 (2013) - Chun-Ying Chiang, Liang-Hao Huang, Bo-Jr Li, Jiaojiao Wu, Hong-Gwa Yeh:
Some results on the target set selection problem. J. Comb. Optim. 25(4): 702-715 (2013) - Byung-Cheon Choi, Kangbok Lee:
Two-stage proportionate flexible flow shop to minimize the makespan. J. Comb. Optim. 25(1): 123-134 (2013) - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Edge lifting and total domination in graphs. J. Comb. Optim. 25(1): 47-59 (2013) - Sen-Peng Eu, Tung-Shan Fu, Yeh-Jong Pan:
A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra. J. Comb. Optim. 25(4): 617-638 (2013) - Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue:
A note on optimal pebbling of hypercubes. J. Comb. Optim. 25(4): 597-601 (2013) - Bin Fu, Lusheng Wang:
Constant time approximation scheme for largest well predicted subset. J. Comb. Optim. 25(3): 352-367 (2013) - Jerrold R. Griggs, Wei-Tian Li:
The partition method for poset-free families. J. Comb. Optim. 25(4): 587-596 (2013) - Yanhong Gu, Mark Goh, Q. L. Chen, Robert de Souza, G. C. Tang:
A new two-party bargaining mechanism. J. Comb. Optim. 25(1): 135-163 (2013) - Jian Guan, Xiaoyan Liu, Changhong Lu, Zhengke Miao:
Three conjectures on the signed cycle domination in graphs. J. Comb. Optim. 25(4): 639-645 (2013) - D. J. Guan, Ko-Wei Lih, Xuding Zhu:
Preface: optimization in graphs. J. Comb. Optim. 25(4): 499-500 (2013) - Frédéric Havet, Xuding Zhu:
The game Grundy number of graphs. J. Comb. Optim. 25(4): 752-765 (2013) - Jing He, Hongyu Liang:
Improved approximation for spanning star forest in dense graphs. J. Comb. Optim. 25(2): 255-264 (2013) - Máté Hegyháti, Zsolt Tuza:
Colorability of mixed hypergraphs and their chromatic inversions. J. Comb. Optim. 25(4): 737-751 (2013) - Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil:
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. J. Comb. Optim. 25(3): 430-459 (2013) - Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle. J. Comb. Optim. 25(1): 91-98 (2013) - Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2): 176-190 (2013) - Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25(2): 279-307 (2013) - Sandi Klavzar:
Structure of Fibonacci cubes: a survey. J. Comb. Optim. 25(4): 505-522 (2013)
skipping 17 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-06-15 02:54 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