Остановите войну!
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 47 matches
- 1998
- Vineet Bafna, Pavel A. Pevzner:
Sorting by Transpositions. SIAM J. Discret. Math. 11(2): 224-240 (1998) - Jørgen Bang-Jensen, Tibor Jordán:
Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discret. Math. 11(4): 603-623 (1998) - Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Rankings of Graphs. SIAM J. Discret. Math. 11(1): 168-181 (1998) - Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. SIAM J. Discret. Math. 11(3): 437-455 (1998) - Neil J. Calkin, Herbert S. Wilf:
The Number of Independent Sets in a Grid Graph. SIAM J. Discret. Math. 11(1): 54-60 (1998) - Yair Caro, Mark N. Ellingham, J. E. Ramey:
Local Structure When All Maximal Independent Sets Have Equal Weight. SIAM J. Discret. Math. 11(4): 644-654 (1998) - Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp:
An Optimal Acceptance Policy for an Urn Scheme. SIAM J. Discret. Math. 11(2): 183-195 (1998) - Victor Chepoi:
On Distance-Preserving and Domination Elimination Orderings. SIAM J. Discret. Math. 11(3): 414-436 (1998) - Benny Chor, Madhu Sudan:
A Geometric Approach to Betweenness. SIAM J. Discret. Math. 11(4): 511-523 (1998) - Karen L. Collins:
Circulants and Sequences. SIAM J. Discret. Math. 11(2): 330-339 (1998) - Artur Czumaj, Leszek Gasieniec, Andrzej Pelc:
Time and Cost Trade-Offs in Gossiping. SIAM J. Discret. Math. 11(3): 400-413 (1998) - Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
Sometimes Travelling is Easy: The Master Tour Problem. SIAM J. Discret. Math. 11(1): 81-93 (1998) - Margarida Espona, Oriol Serra:
Cayley Digraphs Based on the de Bruijn Networks. SIAM J. Discret. Math. 11(2): 305-317 (1998) - Tuvi Etzion, Alexander Vardy:
On Perfect Codes and Tilings: Problems and Solutions. SIAM J. Discret. Math. 11(2): 205-223 (1998) - Shimon Even, Ami Litman, Arnold L. Rosenberg:
Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11(4): 546-556 (1998) - Ulrich Faigle, Walter Kern:
Approximate Core Allocation for Binpacking Games. SIAM J. Discret. Math. 11(3): 387-399 (1998) - Rongquan Feng, Jin Ho Kwak, Juyoung Kim, Jaeun Lee:
Isomorphism Classes of Concrete Graph Coverings. SIAM J. Discret. Math. 11(2): 265-272 (1998) - Charles M. Fiduccia, Rodney W. Forcade, Jennifer S. Zito:
Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups. SIAM J. Discret. Math. 11(1): 157-167 (1998) - Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright:
Interference-Minimizing Colorings of Regular Graphs. SIAM J. Discret. Math. 11(1): 15-40 (1998) - András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discret. Math. 11(4): 557-589 (1998) - Hortensia Galeana-Sánchez, Xueliang Li:
Semikernels and (k, l)-Kernels in Digraphs. SIAM J. Discret. Math. 11(2): 340-346 (1998) - A. M. H. Gerards, F. Bruce Shepherd:
The Graphs with All Subgraphs T-Perfect. SIAM J. Discret. Math. 11(4): 524-545 (1998) - John G. Gimbel, Ann N. Trenk:
On the Weakness of an Ordered Set. SIAM J. Discret. Math. 11(4): 655-663 (1998) - D. J. Guan, Xuding Zhu:
Multiple Capacity Vehicle Routing on Paths. SIAM J. Discret. Math. 11(4): 590-602 (1998) - David R. Guichard:
Competition Graphs of Hamiltonian Digraphs. SIAM J. Discret. Math. 11(1): 128-134 (1998) - Yunghsiang S. Han:
A New Decoding Algorithm for Complete Decoding of Linear Block Codes. SIAM J. Discret. Math. 11(4): 664-671 (1998) - Michael Hofmeister:
A Note on Counting Connected Graph Covering Projections. SIAM J. Discret. Math. 11(2): 286-292 (1998) - Shiow-Fen Hwang, Gerard J. Chang:
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs. SIAM J. Discret. Math. 11(4): 633-643 (1998) - Jon M. Kleinberg, Michel X. Goemans:
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. SIAM J. Discret. Math. 11(2): 196-204 (1998) - Martin Kochol:
Partial Intersection Theorem and Flows in Abstract Networks. SIAM J. Discret. Math. 11(3): 468-486 (1998)
skipping 17 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-06-05 02:24 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