![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 2008
- Matthias Baumgart:
Partitioning Bispanning Graphs into Spanning Trees. IWOCA 2008: 50-62 - Daniel Berend, Shira Zucker:
An improved Algorithm for the Black-and-White Coloring Problem on Trees. IWOCA 2008: 173-181 - Lichao Chen, Francesc Comellas, Zhongzhi Zhang:
Self-similar planar graphs as models for complex networks. IWOCA 2008: 144-154 - Vasek Chvátal:
Combinatorial algorithms in concorde. IWOCA 2008: 3 - Johannes Fischer, Volker Heun:
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA 2008: 239-252 - Satoshi Fujita:
Loose Cover of Graphs by a Local Structure. IWOCA 2008: 212-223 - Tomas Gavenciak:
Cop-Win Graphs with Maximal Capture-Time. IWOCA 2008: 115-128 - Petr Hlinený, Robert Ganian:
Automata approach to graphs of bounded rank-width. IWOCA 2008: 4-15 - Heikki Hyyrö:
Notes on generating completely condensed d-neighborhoods. IWOCA 2008: 16-26 - Rikio Ichishima, Akito Oshima:
On partitional labelings of graphs. IWOCA 2008: 75-82 - Matthew Johnson, Luis Cereceda, Jan van den Heuvel:
Finding Paths Between 3-Colourings. IWOCA 2008: 182-196 - Matthew Johnson, Daniël Paulusma, Chantal Wood:
Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA 2008: 27-41 - Eunsang Kim, Kunsoo Park:
Improving Multikey Quicksort for Sorting Strings. IWOCA 2008: 89-99 - Reinhard Kutzelnigg:
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations. IWOCA 2008: 253-266 - Peter Che Bor Lam, Tao-Ming Wang, Guohua Gu:
L(2, 1)-labellings of integer distance graphs. IWOCA 2008: 166-172 - Taehyung Lee, Sung-Ryul Kim, Kunsoo Park:
Approximate Word Sequence Matching on an Inverted File Index. IWOCA 2008: 100-114 - S. Anthony Lee, Raymond Lister:
K-Phase Oscillator Synchronization for Graph Coloring. IWOCA 2008: 129-143 - Alison Marr, Nick Phillips, Walter D. Wallis:
Bimagic Labelings. IWOCA 2008: 83-88 - George B. Mertzios, Walter Unger:
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. IWOCA 2008: 197-211 - Stephan Olariu:
Delivering multimedia content in vehicular ad hoc networks. IWOCA 2008: 2 - Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
On Conditional Covering Problem. IWOCA 2008: 224-238 - Yuuki Tanaka, Yukio Shibata:
On the pagenumber of the cube-connected cycles. IWOCA 2008: 155-165 - Jianmin Tang, Yuqing Lin, Mirka Miller:
Construction of Extremal Graphs. IWOCA 2008: 42-49 - Tao-Ming Wang, Peter Che Bor Lam, Jun-Lin Kuo, Feng-Rung Hu:
On Irreducibility of Maximal Cliques. IWOCA 2008: 63-74 - Masafumi Yamashita:
Designing good random walks on finite graphs. IWOCA 2008: 1 - Mirka Miller, Koichi Wada:
Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan. College Publications 2008, ISBN 978-1-904987-74-1 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-21 00:03 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