Остановите войну!
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 48 matches
- 2023
- A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. WADS 2023: 1-14 - Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
The Mutual Visibility Problem for Fat Robots. WADS 2023: 15-28 - Shinwoo An, Kyungjin Cho, Eunjin Oh:
Faster Algorithms for Cycle Hitting Problems on Disk Graphs. WADS 2023: 29-42 - Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker:
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. WADS 2023: 43-64 - Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris:
Online TSP with Known Locations. WADS 2023: 65-78 - Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov:
Socially Fair Matching: Exact and Approximation Algorithms. WADS 2023: 79-92 - Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS 2023: 93-105 - Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS 2023: 106-119 - Jatin Batra, Syamantak Das, Agastya Vibhuti Jha:
Tight Approximation Algorithms for Ordered Covering. WADS 2023: 120-135 - Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Minimum Spanning Trees with Weight Predictions. WADS 2023: 136-148 - Mark de Berg, Geert van Wordragen:
Improved Bounds for Discrete Voronoi Games. WADS 2023: 291-308 - Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria:
Finding Diameter-Reducing Shortcuts in Trees. WADS 2023: 164-178 - Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. WADS 2023: 179-192 - Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Interval Scheduling with Predictions. WADS 2023: 193-207 - Gerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning:
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. WADS 2023: 644-659 - Kevin Buchin, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Carola Wenk:
On Length-Sensitive Fréchet Similarity. WADS 2023: 208-231 - Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk:
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. WADS 2023: 605-619 - Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth:
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. WADS 2023: 247-261 - Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang:
Hardness of Graph-Structured Algebraic and Symbolic Problems. WADS 2023: 232-246 - Jongmin Choi, Jaegun Lee, Hee-Kap Ahn:
Efficient k-Center Algorithms for Planar Points in Convex Position. WADS 2023: 262-274 - Marek Chrobak, Neal E. Young:
Classification via Two-Way Comparisons (Extended Abstract). WADS 2023: 275-290 - Ian DeHaan, Zachary Friggstad:
Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. WADS 2023: 326-339 - Shaleen Deep, Xiao Hu, Paraschos Koutris:
General Space-Time Tradeoffs via Relational Queries. WADS 2023: 309-325 - Chengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang:
Differentially Private Range Query on Shortest Paths. WADS 2023: 340-370 - Tamal K. Dey, Tao Hou, Salman Parsa:
Revisiting Graph Persistence for Updates and Efficiency. WADS 2023: 371-385 - Alexander Dobler, Martin Nöllenburg:
Block Crossings in One-Sided Tanglegrams. WADS 2023: 386-400 - Adrian Dumitrescu, Csaba D. Tóth:
Observation Routes and External Watchman Routes. WADS 2023: 401-415 - David Eppstein:
Lower Bounds for Non-adaptive Shortest Path Relaxation. WADS 2023: 416-429 - Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira:
Shortest Coordinated Motion for Square Robots. WADS 2023: 430-443
skipping 18 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-06-15 23:26 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