![](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 3,707 matches
- 2024
- Amir Abboud, Greg Bodwin
:
Reachability Preservers: New Extremal Bounds and Approximation Algorithms. SIAM J. Comput. 53(2): 221-246 (2024) - Tara Abrishami, Maria Chudnovsky
, Marcin Pilipczuk
, Pawel Rzazewski
, Paul D. Seymour:
Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. 53(3): 624-647 (2024) - Isolde Adler, Noleen Köhler
, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. 53(4): 825-883 (2024) - Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
:
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative? SIAM J. Comput. 53(3): 648-700 (2024) - Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53(2): 247-286 (2024) - Michael Benedikt
, Egor V. Kostylev, Tony Tan:
Two Variable Logic with Ultimately Periodic Counting. SIAM J. Comput. 53(4): 884-968 (2024) - Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal:
Rigid Matrices from Rectangular PCPs. SIAM J. Comput. 53(2): 480-523 (2024) - Sébastien Bubeck, Dan Mikulincer
:
How to Trap a Gradient Flow. SIAM J. Comput. 53(4): 803-824 (2024) - Arnaud Casteigts
, Michael Raskin
, Malte Renken
, Viktor Zamaraev
:
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53(2): 346-388 (2024) - Maria Chudnovsky
, Marcin Pilipczuk
, Michal Pilipczuk, Stéphan Thomassé:
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs. SIAM J. Comput. 53(1): 47-86 (2024) - Maria Chudnovsky
, Sophie Spirkl, Mingxian Zhong
:
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring. SIAM J. Comput. 53(1): 111-145 (2024) - Maria Chudnovsky
, Sophie Spirkl, Mingxian Zhong
:
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring. SIAM J. Comput. 53(1): 146-187 (2024) - Artur Czumaj, Christian Sohler:
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. SIAM J. Comput. 53(2): 524-571 (2024) - Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM J. Comput. 53(3): 764-802 (2024) - Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk:
Fast Metric Embedding into the Hamming Cube. SIAM J. Comput. 53(2): 315-345 (2024) - Jacob Focke
, Marc Roth
:
Counting Small Induced Subgraphs with Hereditary Properties. SIAM J. Comput. 53(2): 189-220 (2024) - David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics. SIAM J. Comput. 53(1): 1-46 (2024) - Mika Göös, Alexandros Hollender
, Siddhartha Jain
, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). SIAM J. Comput. 53(3): 573-587 (2024) - Zeyu Guo
, Ray Li
, Chong Shangguan
, Itzhak Tamo, Mary Wootters
:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53(2): 389-430 (2024) - Ishay Haviv
:
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems. SIAM J. Comput. 53(2): 287-314 (2024) - Zhiyi Huang
, Qiankun Zhang
, Yuhao Zhang:
AdWords in a Panorama. SIAM J. Comput. 53(3): 701-763 (2024) - Ravishankar Krishnaswamy, Viswanath Nagarajan
, Kirk Pruhs, Clifford Stein:
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. SIAM J. Comput. 53(3): 588-623 (2024) - Janardhan Kulkarni, Yang P. Liu
, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski:
Online Edge Coloring via Tree Recurrences and Correlation Decay. SIAM J. Comput. 53(1): 87-110 (2024) - Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized Complexity of Untangling Knots. SIAM J. Comput. 53(2): 431-479 (2024) - 2023
- Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52(5): 1319-1320 (2023) - Dan Alistarh, James Aspnes, Faith Ellen
, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. SIAM J. Comput. 52(4): 913-944 (2023) - Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. SIAM J. Comput. 52(6): S18-285 (2023) - Benny Applebaum
, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. SIAM J. Comput. 52(6): 1321-1368 (2023) - Albert Atserias, Joanna Fijalkow
:
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem. SIAM J. Comput. 52(5): 1193-1229 (2023) - Nikhil Bansal, Jatin Batra
, Majid Farhadi, Prasad Tetali:
On Min Sum Vertex Cover and Generalized Min Sum Set Cover. SIAM J. Comput. 52(2): 327-357 (2023)
skipping 3,677 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-08-08 08:42 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