Остановите войну!
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 29 matches
- 2016
- Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. WALCOM 2016: 55-67 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli:
Vertex-Coloring with Star-Defects. WALCOM 2016: 40-51 - Sang Won Bae:
Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract]. WALCOM 2016: 131-142 - Devsi Bantva:
On Hamiltonian Colorings of Block Graphs. WALCOM 2016: 28-39 - Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
As Close as It Gets. WALCOM 2016: 222-235 - Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. WALCOM 2016: 80-91 - Prosenjit Bose, Jean-Lou De Carufel:
A General Framework for Searching on a Line. WALCOM 2016: 143-153 - Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. WALCOM 2016: 95-106 - Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM 2016: 313-324 - Farah Chanchary, Anil Maheshwari:
Counting Subgraphs in Relational Event Graphs. WALCOM 2016: 194-206 - Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin:
Covering Points with Convex Sets of Minimum Size. WALCOM 2016: 166-178 - Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems. WALCOM 2016: 327-338 - Stefan Felsner, Daniel Heldt:
Mixing Times of Markov Chains of 2-Orientations. WALCOM 2016: 114-127 - Toshihiro Fujito, Daichi Suzuki:
Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers. WALCOM 2016: 251-262 - Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Approximation Algorithms for Generalized Bounded Tree Cover. WALCOM 2016: 263-273 - Alonso Gragera, Vorapong Suppakitpaisarn:
Semimetric Properties of Sørensen-Dice and Tversky Indexes. WALCOM 2016: 339-350 - Shun Hasegawa, Toshiya Itoh:
Optimal Online Algorithms for the Multi-objective Time Series Search Problem. WALCOM 2016: 301-312 - Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman:
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs. WALCOM 2016: 107-113 - Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. WALCOM 2016: 3-14 - Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding Mode Using Equality Comparisons. WALCOM 2016: 351-360 - Alejandro López-Ortiz, Daniela Maftuleac:
Optimal Distributed Searching in the Plane with and Without Uncertainty. WALCOM 2016: 68-79 - Matthias Mnich:
Large Independent Sets in Subquartic Planar Graphs. WALCOM 2016: 209-221 - Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. WALCOM 2016: 286-297 - Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon:
Efficient Generation of Top-k Procurements in a Multi-item Auction. WALCOM 2016: 181-193 - Dipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman:
Approximation Algorithms for Three Dimensional Protein Folding. WALCOM 2016: 274-285 - K. Subramani, Piotr Wojciechowski:
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. WALCOM 2016: 154-165 - Takeshi Yamada, Ryuhei Uehara:
Shortest Reconfiguration of Sliding Tokens on a Caterpillar. WALCOM 2016: 236-248 - Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. WALCOM 2016: 17-27 - Mohammad Kaykobad, Rossella Petreschi:
WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings. Lecture Notes in Computer Science 9627, Springer 2016, ISBN 978-3-319-30138-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-05-27 12:31 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