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 83 matches
- 2016
- Sebastian Abshoff, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, Peter Pietrzyk:
Towards the price of leasing online. J. Comb. Optim. 32(4): 1197-1216 (2016) - Kolos Csaba Ágoston, Péter Biró, Iain McBride:
Integer programming methods for special college admissions problems. J. Comb. Optim. 32(4): 1371-1399 (2016) - Hossein Abdollahzadeh Ahangar, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed mixed Roman domination numbers in graphs. J. Comb. Optim. 32(1): 299-317 (2016) - Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Euclidean movement minimization. J. Comb. Optim. 32(2): 354-367 (2016) - Barbara M. Anthony, Christine Chung:
Serve or skip: the power of rejection in online bottleneck matching. J. Comb. Optim. 32(4): 1232-1253 (2016) - Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32(4): 1288-1304 (2016) - Pawan Aurora, Sumit Singh, Shashank K. Mehta:
Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs. J. Comb. Optim. 32(1): 159-173 (2016) - Ran Bi, Jianzhong Li, Hong Gao, Yingshu Li:
(α, τ) -Monitoring for event detection in wireless sensor networks. J. Comb. Optim. 32(4): 985-1001 (2016) - Vittorio Bilò, Mauro Paladini:
On the performance of mildly greedy players in cut games. J. Comb. Optim. 32(4): 1036-1051 (2016) - Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. J. Comb. Optim. 32(3): 885-905 (2016) - Annalisa De Bonis:
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing. J. Comb. Optim. 32(4): 1254-1287 (2016) - Yuehua Bu, Xia Lv:
2-Distance coloring of a planar graph without 3, 4, 7-cycles. J. Comb. Optim. 32(1): 244-259 (2016) - Sabine Büttner, Sven O. Krumke:
The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation. J. Comb. Optim. 32(3): 842-854 (2016) - Zhipeng Cai, Chaokun Wang, Anu G. Bourgeois:
Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference. J. Comb. Optim. 32(4): 983-984 (2016) - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs. J. Comb. Optim. 32(2): 594-607 (2016) - Weidong Chen, Zhixiang Chen:
Introduction: Special issue dedicated to the memory of professor Wenqi Huang. J. Comb. Optim. 32(2): 331-340 (2016) - Jianer Chen, John E. Hopcroft:
Special Issue for FAW 2014. J. Comb. Optim. 32(1): 1-2 (2016) - Hao Chen, Zihan Lei, Tian Liu, Ziyang Tang, Chaoyi Wang, Ke Xu:
Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32(1): 95-110 (2016) - Min Chen, André Raspaud, Weifan Wang:
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32(3): 927-940 (2016) - David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. 32(1): 3-24 (2016) - Ágnes Cseh, Brian C. Dean:
Improved algorithmic results for unsplittable stable allocation problems. J. Comb. Optim. 32(3): 657-671 (2016) - Ali Dehghan:
On strongly planar not-all-equal 3SAT. J. Comb. Optim. 32(3): 721-724 (2016) - Wei Dong, Wensong Lin:
An improved bound on 2-distance coloring plane graphs with girth 5. J. Comb. Optim. 32(2): 645-655 (2016) - Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Optimal space coverage with white convex polygons. J. Comb. Optim. 32(2): 341-353 (2016) - Farzad Farnoud, Eitan Yaakobi, Jehoshua Bruck:
Approximate sorting of data streams with limited storage. J. Comb. Optim. 32(4): 1133-1164 (2016) - Qilong Feng, Qian Zhou, Jianxin Wang:
Kernelization and randomized Parameterized algorithms for Co-path Set problem. J. Comb. Optim. 32(1): 67-78 (2016) - Jing Gao, Jianzhong Li, Yingshu Li:
Approximate event detection over multi-modal sensing data. J. Comb. Optim. 32(4): 1002-1016 (2016) - Mehdi Ghiyasvand, Iman Keshtkar:
Finding a contra-risk path between two nodes in undirected graphs. J. Comb. Optim. 32(3): 917-926 (2016) - Longkun Guo:
Efficient approximation algorithms for computing k disjoint constrained shortest paths. J. Comb. Optim. 32(1): 144-158 (2016) - Fu-Tao Hu, Moo Young Sohn, Xue-Gang Chen:
Total and paired domination numbers of Cm bundles over a cycle Cn. J. Comb. Optim. 32(2): 608-625 (2016)
skipping 53 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-09-20 10: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