Остановите войну!
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 44 matches
- 2011
- A. K. Agarwal, Geetika Narang:
Genralized Frobenius partitions and mock-theta functions. Ars Comb. 99: 439-444 (2011) - Ali Ahmad, Imran Javaid, Muhammad Faisal Nadeem:
Further results on super edge magic deficiency of unicyclic graphs. Ars Comb. 99: 129-138 (2011) - Muhammad Akram, Noura Omair Al-shehri:
Fuzzy K-ideals of K-algebras. Ars Comb. 99: 399-413 (2011) - Maref Y. M. Alzoubi:
The Basis Number of the Cartesian Product of Different Ladders. Ars Comb. 99: 89-95 (2011) - Nuh Aydin, T. Aaron Gulliver:
Some Good Cyclic and Quasi-Twisted Z4-Linear Codes. Ars Comb. 99: 503-518 (2011) - Azizolla Azad, Mehdi Eliasi:
Distance in the non-commuting graph of groups. Ars Comb. 99: 279-287 (2011) - Cristina Di Bari, Pasquale Vetro:
Common Fixed Points In Cone Metric Spaces For MK-Pairs and L-Pairs. Ars Comb. 99: 429-437 (2011) - M. Bergerson, Alexander Miller, A. Pliml, Victor Reiner, P. Shearer, Dennis Stanton, N. Switala:
Note On 1-Crossing Partitions. Ars Comb. 99: 83-87 (2011) - Flavia Bonomo, Mariano Cecowski Palacio:
Between coloring and list-coloring: μ-coloring. Ars Comb. 99: 383-398 (2011) - Simona Bonvicini, Giuseppe Mazzuoccolo:
Perfect one-factorizations in generalized Petersen graphs. Ars Comb. 99: 33-43 (2011) - Robert Brier, Darryn E. Bryant:
On the existence and embedding of edge-coloured graph decompositions. Ars Comb. 99: 445-459 (2011) - Bart De Bruyn:
A note on the spin-embedding of the dual polar space DQ-(2n+1, K). Ars Comb. 99: 365-375 (2011) - Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian:
On (k, t)-choosability of graphs. Ars Comb. 99: 321-333 (2011) - Adel T. Diab:
Genralization of Some Results on Cordial Graphs. Ars Comb. 99: 161-173 (2011) - Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method. Ars Comb. 99: 109-128 (2011) - Louis M. Friedler:
The Independence Number of the Cartesian Product of Graphs. Ars Comb. 99: 205-216 (2011) - Chin-Mei Fu, Yu-Fong Hsu, Wen-Chung Huang:
The spectrum of 4-cycles in 2-factorizations of Kn, n. Ars Comb. 99: 303-320 (2011) - T. Aaron Gulliver:
Quasi-Twisted Codes over F11. Ars Comb. 99: 3-17 (2011) - Wolfgang Haas:
Lower bounds for quaternary covering codes. Ars Comb. 99: 19-23 (2011) - Suresh Manjanath Hegde, Sudhakar Shetty, P. Shankaran:
Further Results On Super Edge-Magic Deficiency Of Graphs. Ars Comb. 99: 487-502 (2011) - Morteza Hivadi, Morteza Esmaeili:
High Stopping-distance LDPC Product Codes based on Hamming and Finite Geometry Codes. Ars Comb. 99: 97-107 (2011) - Pak Tung Ho:
The crossing number of K1, 1, 3, n. Ars Comb. 99: 461-471 (2011) - Lili Hu, Chunhui Lai:
On Potentially (K5 - C4)-graphic Sequences. Ars Comb. 99: 175-192 (2011) - Gee-Choon Lau, Y. H. Peng, H. H. Chu:
Chromatic Uniqueness of Certain Complete 4-partite Graphs. Ars Comb. 99: 377-382 (2011) - Hong Lin:
On the structure of graphs with exactly two near-perfect matchings. Ars Comb. 99: 353-358 (2011) - Daphne Der-Fen Liu:
Hamiltonian Spectra of Trees. Ars Comb. 99: 415-419 (2011) - Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.:
Landmarks in Binary Tree Derived Architectures. Ars Comb. 99: 473-486 (2011) - Ngurah Anak Agung Gede, Edy Tri Baskoro, Ioan Tomescu:
Magic graphs with pendant edges. Ars Comb. 99: 149-160 (2011) - Roslan Hasni, Y. H. Peng:
Chromaticity of Bipartite Graphs With Seven Edges Deleted. Ars Comb. 99: 257-277 (2011) - A. P. Santhakumaran, P. Titus:
Geodesic Graphs. Ars Comb. 99: 75-82 (2011)
skipping 14 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-05-06 19:23 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