![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 38 matches
- 2020
- Saket Saurabh, Uéverton dos Santos Souza
, Prafullkumar Tale
:
On the Parameterized Complexity of Grid Contraction. SWAT 2020: 34:1-34:17 - László Kozma
:
Exact Exponential Algorithms for Two Poset Problems. SWAT 2020: 30:1-30:15 - Mohammad Ali Abam, Mark de Berg
, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian
:
Preclustering Algorithms for Imprecise Points. SWAT 2020: 3:1-3:12 - Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. SWAT 2020: 4:1-4:18 - Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex Downgrading to Minimize Connectivity. SWAT 2020: 5:1-5:15 - Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang:
Sea-Rise Flooding on Massive Dynamic Terrains. SWAT 2020: 6:1-6:19 - Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat
, Fabian Frank, Radoslav Fulek, Stephen G. Kobourov, Joseph S. B. Mitchell:
Computing β-Stretch Paths in Drawings of Graphs. SWAT 2020: 7:1-7:20 - Arturs Backurs, Sariel Har-Peled
:
Submodular Clustering in Low Dimensions. SWAT 2020: 8:1-8:14 - Max Bannach, Malte Skambath, Till Tantau:
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time. SWAT 2020: 9:1-9:16 - Amotz Bar-Noy, Keerti Choudhary
, David Peleg, Dror Rawitz:
Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT 2020: 10:1-10:17 - Ioana O. Bercea
, Guy Even:
A Dynamic Space-Efficient Filter with Constant Time Operations. SWAT 2020: 11:1-11:17 - Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund:
A Simple Algorithm for Minimum Cuts in Near-Linear Time. SWAT 2020: 12:1-12:18 - Sujoy Bhore
, Paz Carmi
, Sudeshna Kolay
, Meirav Zehavi
:
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT 2020: 13:1-13:18 - Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. SWAT 2020: 14:1-14:22 - Glencora Borradaile, Erin Wolf Chambers
, David Eppstein, William Maxwell, Amir Nayyeri:
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT 2020: 15:1-15:19 - Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. SWAT 2020: 16:1-16:10 - Bartlomiej Bosek
, Yann Disser
, Andreas Emil Feldmann
, Jakub Pawlewicz
, Anna Zych-Pawlewicz
:
Recoloring Interval Graphs with Limited Recourse Budget. SWAT 2020: 17:1-17:23 - Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon:
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives. SWAT 2020: 18:1-18:12 - Kevin Buchin
, Anne Driemel
, Martijn Struijs
:
On the Hardness of Computing an Average Curve. SWAT 2020: 19:1-19:19 - Jean Cardinal
, Aurélien Ooms:
Sparse Regression via Range Counting. SWAT 2020: 20:1-20:17 - Steven Chaplick
, Henry Förster
, Myroslav Kryven
, Alexander Wolff
:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. SWAT 2020: 21:1-21:14 - Stephane Durocher, Md Yeakub Hassan:
Clustering Moving Entities in Euclidean Space. SWAT 2020: 22:1-22:14 - Patrick Eades, Ivor van der Hoog
, Maarten Löffler, Frank Staals:
Trajectory Visibility. SWAT 2020: 23:1-23:22 - David Eppstein, Daniel Frishberg
, Elham Havvaei
:
Simplifying Activity-On-Edge Graphs. SWAT 2020: 24:1-24:14 - Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. SWAT 2020: 25:1-25:22 - Fedor V. Fomin
, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of PCA (Invited Talk). SWAT 2020: 1:1-1:5 - Niels Grüttemeier
, Christian Komusiewicz
, Nils Morawietz:
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT 2020: 26:1-26:17 - Bart M. P. Jansen
, Jari J. H. de Kroon
:
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. SWAT 2020: 27:1-27:15 - Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. SWAT 2020: 28:1-28:18 - Mikko Koivisto, Antti Röyskö
:
Fast Multi-Subset Transform and Weighted Sums over Acyclic Digraphs. SWAT 2020: 29:1-29:12
skipping 8 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-11 09:08 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