Остановите войну!
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 25 matches
- 2009
- Djangir A. Babayev, George I. Bell, Urfat G. Nuriyev:
The bandpass problem: combinatorial optimization and library of problems. J. Comb. Optim. 18(2): 151-172 (2009) - Fatiha Bendali, Jean Mailfert:
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron. J. Comb. Optim. 18(1): 1-22 (2009) - René Brandenberg, Lucia Roth:
New algorithms for k-center and extensions. J. Comb. Optim. 18(4): 376-392 (2009) - Véronique Bruyère, Hadrien Mélot:
Fibonacci index and stability number of graphs: a polyhedral study. J. Comb. Optim. 18(3): 207-228 (2009) - Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3): 307-318 (2009) - Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18(3): 229-257 (2009) - Peter Damaschke:
Multiple hypernode hitting sets and smallest two-cores with targets. J. Comb. Optim. 18(3): 294-306 (2009) - Xiaotie Deng, Qizhi Fang, Xiaoxun Sun:
Finding nucleolus of flow game. J. Comb. Optim. 18(1): 64-86 (2009) - Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz:
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. J. Comb. Optim. 18(2): 124-150 (2009) - Patricia A. Evans, Todd Wareham, Rhonda Chaytor:
Fixed-parameter tractability of anonymizing data by suppressing entries. J. Comb. Optim. 18(4): 362-375 (2009) - Henning Fernau, Daniel Raible:
A parameterized perspective on packing paths of length two. J. Comb. Optim. 18(4): 319-341 (2009) - Bin Fu, Zhiyu Zhao:
Separating sublinear time computations by approximate diameter. J. Comb. Optim. 18(4): 393-416 (2009) - Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination in complementary prisms. J. Comb. Optim. 18(1): 23-37 (2009) - Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu:
A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim. 18(2): 179-194 (2009) - Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa:
A 6.55 factor primal-dual approximation algorithm for the connected facility location problem. J. Comb. Optim. 18(3): 258-271 (2009) - Ning Li, Xinmin Hou:
On the total {k}-domination number of Cartesian products of graphs. J. Comb. Optim. 18(2): 173-178 (2009) - Chunmei Liu, Yinglei Song:
Parameterized dominating set problem in chordal graphs: complexity and lower bound. J. Comb. Optim. 18(1): 87-97 (2009) - Maren Martens, Martin Skutella:
Flows with unit path capacities and related packing and covering problems. J. Comb. Optim. 18(3): 272-293 (2009) - Margaret-Ellen Messinger, Richard J. Nowakowski:
The robot cleans up. J. Comb. Optim. 18(4): 350-361 (2009) - Qingqin Nong, Jinjiang Yuan, Yixun Lin:
The weighted link ring loading problem. J. Comb. Optim. 18(1): 38-50 (2009) - Caterina De Simone, Anna Galluccio:
Edge-colouring of joins of regular graphs, I. J. Comb. Optim. 18(4): 417-428 (2009) - Xiao-Feng Xie, Jiming Liu:
Graph coloring by multiagent fusion search. J. Comb. Optim. 18(2): 99-123 (2009) - Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu:
The canadian traveller problem and its competitive analysis. J. Comb. Optim. 18(2): 195-205 (2009) - Geng-sheng Zhang, Xiao-lei Sun, Bo-li Li:
Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison. J. Comb. Optim. 18(1): 51-63 (2009) - Feng Zou, Xianyue Li, Suogang Gao, Weili Wu:
Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18(4): 342-349 (2009)
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-02 10:14 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