![](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 52 matches
- 2015
- Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved local search for universal facility location. J. Comb. Optim. 29(1): 237-246 (2015) - Anna Angelucci, Vittorio Bilò
, Michele Flammini
, Luca Moscardelli:
On the sequential price of anarchy of isolation games. J. Comb. Optim. 29(1): 165-181 (2015) - Dana Angluin, James Aspnes, Lev Reyzin:
Network construction with subgraph connectivity constraints. J. Comb. Optim. 29(2): 418-432 (2015) - Jan Baumbach
, Jiong Guo, Rashid Ibragimov:
Covering tree with stars. J. Comb. Optim. 29(1): 141-152 (2015) - Paul C. Bell
, Prudence W. H. Wong
:
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. J. Comb. Optim. 29(4): 739-749 (2015) - Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto:
The $$k$$ k -separator problem: polyhedra, complexity and approximation results. J. Comb. Optim. 29(1): 276-307 (2015) - Davide Bilò
, Vittorio Bilò
:
New bounds for the balloon popping problem. J. Comb. Optim. 29(1): 182-196 (2015) - Yuehua Bu, Kai Lu, Sheng Yang:
Two smaller upper bounds of list injective chromatic number. J. Comb. Optim. 29(2): 373-388 (2015) - Zhipeng Cai
, Yueming Duan, Anu G. Bourgeois:
Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks. J. Comb. Optim. 29(4): 815-835 (2015) - Zhi-Zhong Chen, Ying Fan, Lusheng Wang
:
Faster exact computation of rSPR distance. J. Comb. Optim. 29(3): 605-635 (2015) - Peter Damaschke:
Parameterizations of hitting set of bundles and inverse scope. J. Comb. Optim. 29(4): 847-858 (2015) - Dariusz Dereniowski
, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
Zero-visibility cops and robber and the pathwidth of a graph. J. Comb. Optim. 29(3): 541-564 (2015) - Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen:
Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. J. Comb. Optim. 29(1): 125-140 (2015) - Hiroshi Fujiwara, Koji M. Kobayashi:
Improved lower bounds for the online bin packing problem with cardinality constraints. J. Comb. Optim. 29(1): 67-87 (2015) - Theodoros P. Gevezes, Leonidas S. Pitsoulis:
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. J. Comb. Optim. 29(4): 859-883 (2015) - Boris I. Goldengorin
, Dmitriy S. Malyshev
, Panos M. Pardalos, Victor Zamaraev
:
A tolerance-based heuristic approach for the weighted independent set problem. J. Comb. Optim. 29(2): 433-450 (2015) - Longkun Guo, Hong Shen, Kewen Liao
:
Improved approximation algorithms for computing k disjoint paths subject to two constraints. J. Comb. Optim. 29(1): 153-164 (2015) - Sheng-Long Hu, Liqun Qi
:
The Laplacian of a uniform hypergraph. J. Comb. Optim. 29(2): 331-366 (2015) - Andrzej Kisielewicz, Jakub Kowalski
, Marek Szykula
:
Computing the shortest reset words of synchronizing automata. J. Comb. Optim. 29(1): 88-124 (2015) - Chao Li, Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected computations on color spanning sets. J. Comb. Optim. 29(3): 589-604 (2015) - Hongyu Liang, Tiancheng Lou, Haisheng Tan, Yuexuan Wang, Dongxiao Yu:
On the complexity of connectivity in cognitive radio networks through spectrum assignment. J. Comb. Optim. 29(2): 472-487 (2015) - Chung-Shou Liao, Yamming Huang:
Generalized Canadian traveller problems. J. Comb. Optim. 29(4): 701-712 (2015) - Wensong Lin, Benqiu Dai:
On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice. J. Comb. Optim. 29(3): 655-669 (2015) - Peihai Liu
, Xiwen Lu:
Online unbounded batch scheduling on parallel machines with delivery times. J. Comb. Optim. 29(1): 228-236 (2015) - Xianmin Liu, Jianzhong Li:
Algorithms and complexity results for labeled correlation clustering problem. J. Comb. Optim. 29(2): 488-501 (2015) - Xianmin Liu, Jianzhong Li:
On the hardness of learning queries from tree structured data. J. Comb. Optim. 29(3): 670-684 (2015) - Tian Liu, Zhao Lu, Ke Xu:
Tractable connected domination for restricted bipartite graphs. J. Comb. Optim. 29(1): 247-256 (2015) - Tian Liu, Chaoyi Wang, Ke Xu:
Large hypertree width for sparse random hypergraphs. J. Comb. Optim. 29(3): 531-540 (2015) - Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. J. Comb. Optim. 29(1): 257-275 (2015) - Yiping Lu, Danny Z. Chen, Jianzhong Cha:
Packing cubes into a cube is NP-complete in the strong sense. J. Comb. Optim. 29(1): 197-215 (2015)
skipping 22 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-08-19 22:58 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