Остановите войну!
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 23 matches
- 2008
- Muhammad Ashraful Alam, Masud Hasan:
Computing Nice Projections of Convex Polyhedra. WALCOM 2008: 111-119 - Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman:
Upward Drawings of Trees on the Minimum Number of Layers. WALCOM 2008: 88-99 - Sébastien Angibaud, Guillaume Fertin, Irena Rusu:
On the Approximability of Comparing Genomes with Duplicates. WALCOM 2008: 34-45 - Yerim Chung, Jean-François Culus, Marc Demange:
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. WALCOM 2008: 180-187 - Reza Dorrigiv, Alejandro López-Ortiz:
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. WALCOM 2008: 13-24 - Reza Dorrigiv, Alejandro López-Ortiz:
On Certain New Models for Paging with Locality of Reference. WALCOM 2008: 200-209 - Henning Fernau, Daniel Raible:
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156 - Satoshi Fujita:
Vertex Domination in Dynamic Networks. WALCOM 2008: 1-12 - Costas S. Iliopoulos, M. Sohel Rahman:
Indexing Circular Patterns. WALCOM 2008: 46-57 - Hiro Ito, Mike Paterson, Kenya Sugihara:
Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179 - Muhammad Rezaul Karim, Md. Saidur Rahman:
Four-Connected Spanning Subgraphs of Doughnut Graphs. WALCOM 2008: 132-143 - Arindam Karmakar, Sasanka Roy, Sandip Das:
Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110 - Riadh Khennoufa, Olivier Togni:
Multilevel Bandwidth and Radio Labelings of Graphs. WALCOM 2008: 234-239 - Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability. WALCOM 2008: 188-199 - Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. WALCOM 2008: 157-168 - Kensuke Onishi, Mamoru Hoshi:
Cover Ratio of Absolute Neighbor. WALCOM 2008: 70-80 - Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abdullah-Al-Wadud, Oksam Chae:
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs. WALCOM 2008: 58-69 - Md. Abul Hassan Samee, Mohammad Tanvir Irfan, Md. Saidur Rahman:
Computing beta -Drawings of 2-Outerplane Graphs in Linear Time. WALCOM 2008: 81-87 - Ryuhei Uehara:
Simple Geometrical Intersection Graphs. WALCOM 2008: 25-33 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Plane Triangulations with Efficient Query Supports. WALCOM 2008: 120-131 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
Listing All Plane Graphs. WALCOM 2008: 210-221 - Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, Md. Saidur Rahman:
Pairwise Compatibility Graphs. WALCOM 2008: 222-233 - Shin-Ichi Nakano, Md. Saidur Rahman:
WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008. Lecture Notes in Computer Science 4921, Springer 2008, ISBN 978-3-540-77890-5 [contents]
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-08 10:49 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