Остановите войну!
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 32 matches
- 2015
- Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara:
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. WALCOM 2015: 294-305 - Yuma Asada, Michiko Inoue:
An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks. WALCOM 2015: 187-198 - Sang Won Bae:
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract). WALCOM 2015: 125-136 - Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson:
Dynamic Online Multiselection in Internal and External Memory. WALCOM 2015: 199-209 - Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff:
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. WALCOM 2015: 222-233 - Mark de Berg, Ali D. Mehrabi:
Straight-Path Queries in Trajectory Data. WALCOM 2015: 101-112 - Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement. WALCOM 2015: 149-160 - Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth:
On Bar (1, j)-Visibility Graphs - (Extended Abstract). WALCOM 2015: 246-257 - Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy:
Fast Algorithms for Constrained Graph Density Problems. WALCOM 2015: 8-19 - Diptarka Chakraborty, Raghunath Tewari:
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs. WALCOM 2015: 258-269 - Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. WALCOM 2015: 329-334 - Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. WALCOM 2015: 113-124 - Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Unit Covering in Color-Spanning Set Model. WALCOM 2015: 44-52 - Christian Engels:
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. WALCOM 2015: 282-293 - Johannes Fischer, Daniel Peters:
A Practical Succinct Data Structure for Tree-Like Graphs. WALCOM 2015: 65-76 - Li Guan, Jianping Li, Xuejie Zhang, Weidong Li:
The Directed Ring Loading with Penalty Cost. WALCOM 2015: 20-31 - Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato:
Enumerating Eulerian Trails via Hamiltonian Path Enumeration. WALCOM 2015: 161-174 - Md. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, Md. Saidur Rahman:
On Triangle Cover Contact Graphs. WALCOM 2015: 323-328 - Ken Iwaide, Hiroshi Nagamochi:
An Improved Algorithm for Parameterized Edge Dominating Set Problem. WALCOM 2015: 234-245 - Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti:
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM 2015: 53-64 - Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao:
Forming Plurality at Minimum Cost. WALCOM 2015: 77-88 - Neerja Mhaskar, Michael Soltys:
Non-repetitive Strings over Alphabet Lists. WALCOM 2015: 270-281 - Yuji Obata, Takao Nishizeki:
Edge-Colorings of Weighted Graphs - (Extended Abstract). WALCOM 2015: 32-43 - Rajeev Raman:
Encoding Data Structures. WALCOM 2015: 1-7 - Santiago Valdés Ravelo, Carlos E. Ferreira:
PTAS's for Some Metric p-source Communication Spanning Tree Problems. WALCOM 2015: 137-148 - Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna:
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. WALCOM 2015: 89-100 - Thim Strothmann:
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees. WALCOM 2015: 175-186 - Morten Tiedemann, Jonas Ide, Anita Schöbel:
Competitive Analysis for Multi-objective Online Algorithms. WALCOM 2015: 210-221 - Morten Tiedemann, Jonas Ide, Anita Schöbel:
Erratum: Competitive Analysis for Multi-objective Online Algorithms. WALCOM 2015: E1-E2 - Takahisa Toda, Shogo Takeuchi, Koji Tsuda, Shin-ichi Minato:
Superset Generation on Decision Diagrams. WALCOM 2015: 317-322
skipping 2 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-05-24 02:12 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