Остановите войну!
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 35 matches
- 2021
- José María García, Octavio Martín-Díaz, Pablo Fernandez, Carlos Müller, Antonio Ruiz-Cortés:
A Flexible Billing Life Cycle for Cloud Services Using Augmented Customer Agreements. IEEE Access 9: 44374-44389 (2021) - Tabitha C. Peck, Kyla A. McMullen, John Quarles, Kyle Johnsen, Christian Sandor, Mark Billinghurst:
DiVRsify: Break the Cycle and Develop VR for Everyone. IEEE Computer Graphics and Applications 41(6): 133-142 (2021) - Tobias Enderle:
On the Impact of Billing Cycles on Compensations in Network SLAs. ONDM 2021: 1-6 - 2015
- Gourav Saha, Ramkrishna Pasumarthy:
Maximizing profit of Cloud Brokers under Quantized Billing Cycles: a Dynamic pricing strategy based on ski-rental problem. Allerton 2015: 1000-1007 - Gourav Saha, Ramkrishna Pasumarthy:
Maximizing Profit of Cloud Brokers under Quantized Billing Cycles: a Dynamic Pricing Strategy based on Ski-Rental Problem. CoRR abs/1507.02545 (2015) - 2012
- Elizabeth J. Billington, Nicholas J. Cavenagh, Abdollah Khodkar:
Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. Discret. Math. 312(16): 2438-2445 (2012) - 2011
- Elizabeth J. Billington:
5-cycle decompositions from paired 3- and 4-cycle decompositions. Australas. J Comb. 51: 109-114 (2011) - Elizabeth J. Billington, Dean G. Hoffman, Charles C. Lindner, Mariusz Meszka:
Almost resolvable minimum coverings of complete graphs with 4-cycles. Australas. J Comb. 50: 73-86 (2011) - Elizabeth J. Billington, Dean G. Hoffman:
Lambda-fold 2-perfect 6-cycle systems in equipartite graphs. Discret. Math. 311(21): 2423-2427 (2011) - Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner:
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs Comb. 27(2): 161-170 (2011) - 2010
- Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. Comb. 30(6): 617-625 (2010) - Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. Discret. Math. 310(2): 241-254 (2010) - 2009
- Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: Four parts. Discret. Math. 309(10): 3061-3073 (2009) - Elizabeth J. Billington, Charles Curtis Lindner:
Embedding 5-cycle systems into pentagon triple systems. Discret. Math. 309(14): 4828-4834 (2009) - Chris Groër, Bruce L. Golden, Edward A. Wasil:
The balanced billing cycle vehicle routing problem. Networks 54(4): 243-254 (2009) - 2008
- Elizabeth J. Billington, Dean G. Hoffman:
Equipartite and almost-equipartite gregarious 4-cycle systems. Discret. Math. 308(5-6): 696-714 (2008) - Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger:
Resolvable gregarious cycle decompositions of complete equipartite graphs. Discret. Math. 308(13): 2844-2853 (2008) - Elizabeth J. Billington, Christopher A. Rodger:
Resolvable 4-cycle group divisible designs with two associate classes: Part size even. Discret. Math. 308(2-3): 303-307 (2008) - 2007
- Elizabeth J. Billington, Benjamin R. Smith, Dean G. Hoffman:
Equipartite gregarious 6- and 8-cycle systems. Discret. Math. 307(13): 1659-1667 (2007) - 2005
- Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger:
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs Comb. 21(2): 169-186 (2005) - 2004
- Elizabeth J. Billington:
The extended metamorphosis of a complete bipartite design into a cycle system. Discret. Math. 284(1-3): 63-70 (2004) - 2003
- Elizabeth J. Billington, Dean G. Hoffman:
Decomposition of complete tripartite graphs into gregarious 4-cycles. Discret. Math. 261(1-3): 87-111 (2003) - 2002
- Elizabeth J. Billington, Gaetano Quattrocchi:
The metamorphosis of lambda-fold K3, 3-designs into lambda-fold 6-cycle systems. Ars Comb. 64: 65- (2002) - 2001
- Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar:
The mu-way intersection problem for m-cycle systems. Discret. Math. 231(1-3): 27-56 (2001) - 2000
- Nicholas J. Cavenagh, Elizabeth J. Billington:
On decomposing complete tripartite graphs into 5-cycles. Australas. J Comb. 22: 41-62 (2000) - Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner:
The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. Discret. Math. 220(1-3): 1-11 (2000) - Nicholas J. Cavenagh, Elizabeth J. Billington:
Decompositions of Complete Multipartite Graphs into Cycles of Even Length. Graphs Comb. 16(1): 49-65 (2000) - 1999
- Elizabeth J. Billington, Darryn E. Bryant:
The possible number of cycles in cycle systems. Ars Comb. 52 (1999) - Elizabeth J. Billington:
Decomposing complete tripartite graphs into cycles of lengths 3 and 4. Discret. Math. 197-198: 123-135 (1999) - 1996
- Peter Adams, Elizabeth J. Billington:
Lambda-fold 3-perfect 9-cycle systems. Ars Comb. 44 (1996)
skipping 5 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-04-27 01:17 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