Остановите войну!
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 71 matches
- 2002
- F. Aguiló-Gost:
A C.A.S. treatment of optimal-diameter double-loop digraphs families. Electron. Notes Discret. Math. 11: 1-11 (2002) - Jin Akiyama, Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon. Electron. Notes Discret. Math. 11: 12-19 (2002) - Yousef Alavi, Dawn Jones, Don R. Lick, Jiuqiang Liu:
Preface: Volume 11. Electron. Notes Discret. Math. 11: 761-762 (2002) - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. 11: 20-29 (2002) - Ahmed M. Assaf, H. Alhalees, L. P. S. Singh:
Directed Covering with Block Size 5 and Index Odd. Electron. Notes Discret. Math. 11: 30-52 (2002) - M. Cemil Azizoglu, Ömer Egecioglu:
The Isoperimetric Number and The Bisection Width of Generalized Cylinders. Electron. Notes Discret. Math. 11: 53-62 (2002) - Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. 11: 63-80 (2002) - Lowell W. Beineke, Robert C. Vandell:
No Cycling in the Graphs! Electron. Notes Discret. Math. 11: 81-88 (2002) - Fred Buckley, Frank Harary:
Unsolved Problems on Distance in Graphs. Electron. Notes Discret. Math. 11: 89-97 (2002) - Pavel Chebotarev:
Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains. Electron. Notes Discret. Math. 11: 108-116 (2002) - Pavel Chebotarev, Elena Shamis:
The Forest Metrics for Graph Vertices. Electron. Notes Discret. Math. 11: 98-107 (2002) - Zhibo Chen:
On Integral Sum Graphs. Electron. Notes Discret. Math. 11: 117-127 (2002) - Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). Electron. Notes Discret. Math. 11: 128-139 (2002) - Eddie Cheng, Marc J. Lipman:
Basic Structures of Some Interconnection Networks. Electron. Notes Discret. Math. 11: 140-156 (2002) - Eddie Cheng, Sven de Vries:
Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes. Electron. Notes Discret. Math. 11: 157-171 (2002) - Dennis Collins:
On the Rationale of the Transformity Method. Electron. Notes Discret. Math. 11: 172-200 (2002) - Agnes V. Dizon-Garciano, Ian June L. Garces, Mari-Jo P. Ruiz:
On Perfect Cayley Graphs. Electron. Notes Discret. Math. 11: 653-680 (2002) - Jean E. Dunbar, Marietjie Frick, Frank Bullock:
Path Partitions and Pn-free Sets. Electron. Notes Discret. Math. 11: 209-217 (2002) - Wayne M. Dymàcek, Matthew Koerlin, Jean-Guy Speton, Tom Whaley, Jennifer Yanulavich:
Disconnected Complements of Steinhaus graphs. Electron. Notes Discret. Math. 11: 218-232 (2002) - Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. Electron. Notes Discret. Math. 11: 253-264 (2002) - Bruce S. Elenbogen, John Frederick Fink:
Remarks on Distance Distributions for Graphs Modeling Computer Networks. Electron. Notes Discret. Math. 11: 265-277 (2002) - Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen:
Addressing the Petersen graph. Electron. Notes Discret. Math. 11: 278-283 (2002) - Hiroshi Era, Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
A note on construction of upper bound graphs. Electron. Notes Discret. Math. 11: 284-291 (2002) - Larry Ericksen:
Lacunary Polynomial Sums. Electron. Notes Discret. Math. 11: 292-298 (2002) - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
On the Super Edge-Magic Deficiency of Graphs. Electron. Notes Discret. Math. 11: 299-314 (2002) - David C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager:
The Domination Number of Cubic Graphs with Girth at least Five. Electron. Notes Discret. Math. 11: 751-759 (2002) - Hung-Lin Fu, Ming-Chun Tsai:
The Maximum Genus of a Graph with Given Diameter and Connectivity. Electron. Notes Discret. Math. 11: 322-329 (2002) - Hung-Lin Fu, Ming-Chun Tsai:
The Maximum Genus of a Graph with Given Diameter and Connectivity. Electron. Notes Discret. Math. 11: 330-337 (2002) - Heather Gavlas, Kelly Schultz:
Efficient Open Domination. Electron. Notes Discret. Math. 11: 681-691 (2002) - John Gimbel, Jaroslav Nesetril:
Partitions of Graphs into Cographs. Electron. Notes Discret. Math. 11: 705-721 (2002)
skipping 41 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-16 17:32 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