Остановите войну!
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 50 matches
- 2017
- Haitao Wang:
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. WADS 2017: 545-556 - Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Segments with Unit Squares. WADS 2017: 1-12 - Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral:
Replica Placement on Bounded Treewidth Graphs. WADS 2017: 13-24 - Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS 2017: 25-36 - Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia:
The Complexity of Tree Partitioning. WADS 2017: 37-48 - Sayan Bandyapadhyay, Aniket Basu Roy:
Effectiveness of Local Search for Art Gallery Problems. WADS 2017: 49-60 - Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh:
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow:
Obedient Plane Drawings for Disk Intersection Graphs. WADS 2017: 73-84 - Gali Bar-On, Paz Carmi:
\delta -Greedy t-spanner. WADS 2017: 85-96 - Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. WADS 2017: 97-108 - Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. WADS 2017: 109-120 - Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS 2017: 289-300 - Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS 2017: 121-132 - Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - Therese Biedl, Philippe Demontigny:
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. WADS 2017: 145-156 - Therese Biedl, Martin Derka:
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. WADS 2017: 157-168 - Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
A Deterministic Algorithm for Online Steiner Tree Leasing. WADS 2017: 169-180 - Gianfranco Bilardi, Lorenzo De Stefani:
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. WADS 2017: 181-192 - Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. WADS 2017: 193-204 - Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frédérik Paradis:
Local Routing in Spanners Based on WSPDs. WADS 2017: 205-216 - Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS 2017: 217-228 - Sebastian Brandt, Roger Wattenhofer:
Approximating Small Balanced Vertex Separators in Almost Linear Time. WADS 2017: 229-240 - Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky:
Balanced Line Separators of Unit Disk Graphs. WADS 2017: 241-252 - Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS 2017: 301-312 - Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Geometric Intersection Graphs. WADS 2017: 253-264 - Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS 2017: 265-276 - Philip Dasler, David M. Mount:
Modular Circulation and Applications to Traffic Management. WADS 2017: 277-288 - Erik D. Demaine, Quanquan C. Liu:
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. WADS 2017: 313-324 - Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li:
Capacitated Center Problems with Two-Sided Bounds and Outliers. WADS 2017: 325-336 - Ran Duan, Le Zhang:
Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity. WADS 2017: 337-348
skipping 20 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-04-25 14:23 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