Остановите войну!
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
- 2018
- Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov:
Online Facility Assignment. WALCOM 2018: 156-168 - Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM 2018: 44-55 - Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh:
Minimum-Width Square Annulus Intersecting Polygons. WALCOM 2018: 56-67 - Aisha Aljohani, Pavan Poudel, Gokarna Sharma:
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement. WALCOM 2018: 169-182 - Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman:
A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison. WALCOM 2018: 183-194 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Two New Schemes in the Bitprobe Model. WALCOM 2018: 68-79 - Junhee Cho, Sewon Park, Martin Ziegler:
Computing Periods ... . WALCOM 2018: 132-143 - Jayesh Choudhari, I. Vinod Reddy:
On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. WALCOM 2018: 228-239 - Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. WALCOM 2018: 252-264 - Marc Demange, Martin Olsen:
A Note on Online Colouring Problems in Overlap Graphs and Their Complements. WALCOM 2018: 144-155 - Takahiro Fujita, Kohei Hatano, Eiji Takimoto:
Boosting over Non-deterministic ZDDs. WALCOM 2018: 195-206 - Toshihiro Fujito, Kei Kimura, Yuki Mizuno:
Approximating Partially Bounded Degree Deletion on Directed Graphs. WALCOM 2018: 32-43 - Hanyu Gu, Julia Memar, Yakov Zinder:
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach. WALCOM 2018: 119-131 - Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane:
Faster Network Algorithms Based on Graph Decomposition. WALCOM 2018: 80-92 - Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM 2018: 240-251 - Shin-Ichi Nakano:
A Simple Algorithm for r-gatherings on the Line. WALCOM 2018: 1-7 - Tong Qin, Osamu Watanabe:
An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem. WALCOM 2018: 93-105 - Suthee Ruangwises, Toshiya Itoh:
Random Popular Matchings with Incomplete Preference Lists. WALCOM 2018: 106-118 - Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph. WALCOM 2018: 20-31 - Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman:
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract). WALCOM 2018: 207-215 - Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. WALCOM 2018: 216-227 - Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM 2018: 8-19 - M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara:
WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings. Lecture Notes in Computer Science 10755, Springer 2018, ISBN 978-3-319-75171-9 [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-04-24 16:44 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