Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 53
Volume 53, Number 1, February 2024
- David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics. 1-46 - 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. 47-86 - Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski:
Online Edge Coloring via Tree Recurrences and Correlation Decay. 87-110 - Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring. 111-145 - Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring. 146-187
Volume 53, Number 2, 2024
- Jacob Focke, Marc Roth:
Counting Small Induced Subgraphs with Hereditary Properties. 189-220 - Amir Abboud, Greg Bodwin:
Reachability Preservers: New Extremal Bounds and Approximation Algorithms. 221-246 - Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. 247-286 - Ishay Haviv:
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems. 287-314 - Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk:
Fast Metric Embedding into the Hamming Cube. 315-345 - Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. 346-388 - Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. 389-430 - Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized Complexity of Untangling Knots. 431-479 - Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal:
Rigid Matrices from Rectangular PCPs. 480-523 - Artur Czumaj, Christian Sohler:
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. 524-571
Volume 53, Number 3, 2024
- Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). 573-587 - Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein:
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. 588-623 - Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced Subgraphs of Bounded Treewidth and the Container Method. 624-647
a service of 
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.
last updated on 2024-06-18 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
