![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 64 matches
- 2021
- Anupam Gupta
, Amit Kumar, Sahil Singla:
Bag-Of-Tasks Scheduling on Related Machines. APPROX-RANDOM 2021: 3:1-3:16 - Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
:
Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. APPROX-RANDOM 2021: 34:1-34:23 - Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. APPROX-RANDOM 2021: 22:1-22:23 - Chandan Saha, Bhargav Thankey:
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. APPROX-RANDOM 2021: 50:1-50:26 - Srikanth Srinivasan
, S. Venkitesh:
On the Probabilistic Degree of an n-Variate Boolean Function. APPROX-RANDOM 2021: 42:1-42:20 - Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM 2021: 7:1-7:14 - Yi Li, David P. Woodruff:
The Product of Gaussian Matrices Is Close to Gaussian. APPROX-RANDOM 2021: 35:1-35:22 - Susanne Albers, Sebastian Schubert
:
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. APPROX-RANDOM 2021: 2:1-2:18 - Omar Alrabiah, Venkatesan Guruswami:
Visible Rank and Codes with Locality. APPROX-RANDOM 2021: 57:1-57:18 - Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. APPROX-RANDOM 2021: 18:1-18:22 - Sepehr Assadi, Soheil Behnezhad:
On the Robust Communication Complexity of Bipartite Matching. APPROX-RANDOM 2021: 48:1-48:17 - János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM 2021: 8:1-8:18 - Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (With Outliers). APPROX-RANDOM 2021: 16:1-16:16 - Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM 2021: 56:1-56:21 - Vishwas Bhargava
, Sumanta Ghosh:
Improved Hitting Set for Orbit of ROABPs. APPROX-RANDOM 2021: 30:1-30:23 - Umang Bhaskar, A. R. Sricharan, Rohit Vaish:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. APPROX-RANDOM 2021: 1:1-1:23 - Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal:
Hardness of Approximation for Euclidean k-Median. APPROX-RANDOM 2021: 4:1-4:23 - Kshipra Bhawalkar, Kostas Kollias, Manish Purohit:
Revenue Maximization in Transportation Networks. APPROX-RANDOM 2021: 26:1-26:16 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. APPROX-RANDOM 2021: 44:1-44:22 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. APPROX-RANDOM 2021: 6:1-6:15 - Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld:
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. APPROX-RANDOM 2021: 55:1-55:19 - Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. APPROX-RANDOM 2021: 45:1-45:16 - Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM 2021: 43:1-43:15 - Antonio Blanca, Alistair Sinclair, Xusheng Zhang:
The Critical Mean-Field Chayes-Machta Dynamics. APPROX-RANDOM 2021: 47:1-47:15 - Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier Growth of Structured 𝔽2-Polynomials and Applications. APPROX-RANDOM 2021: 53:1-53:20 - Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif:
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. APPROX-RANDOM 2021: 27:1-27:14 - Allan Borodin, Calum MacRury, Akash Rakheja:
Secretary Matching Meets Probing with Commitment. APPROX-RANDOM 2021: 13:1-13:23 - Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
On the Hardness of Average-Case k-SUM. APPROX-RANDOM 2021: 29:1-29:19 - Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann:
Fine-Grained Completeness for Optimization in P. APPROX-RANDOM 2021: 9:1-9:22 - Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM 2021: 23:1-23:22
skipping 34 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-18 14:04 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