default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 66
Volume 66, Number 1, February 2022
- Reza Aghayan:
Generating Visual Invariants -a New Approach to Invariant Recognition. 1-37 - Po-An Chen, Chi-Jen Lu, Yu-Sin Lu:
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria. 38-55 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. 56-88 - Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. 89-113 - Laxman Saha
, Alamgir Rahaman Basunia, Satyabrata Das, Kalishankar Tiwary:
Radio k-chromatic Number of Full m-ary Trees. 114-142 - Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints. 143-308 - Jiabao Lin:
The Complexity of Counting CSPd. 309-321 - Péter Gács, Ilkka Törmä:
Stable Multi-Level Monotonic Eroders. 322-353 - Chien-Chung Huang, Naonori Kakimura:
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. 354-394 - Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. 395-415
Volume 66, Number 2, April 2022
- Greg Aloupis, Tamon Stephen, Olga Zasenko:
Computing Colourful Simplicial Depth and Median in ℝ2. 417-431 - Fedor V. Fomin, Vijayaragunathan Ramamoorthi:
On the Parameterized Complexity of the Expected Coverage Problem. 432-453 - Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche:
Multistage Vertex Cover. 454-483 - Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Factorizing Strings into Repetitions. 484-501 - Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. 502-515
Volume 66, Number 3, June 2022
- Dimitris Fotakis, Evangelos Markakis:
Special issue on algorithmic game theory (SAGT 2019). 517-518 - Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen:
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. 519-545 - Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta:
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is). 546-580 - Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. 581-615 - Siqi Liu, J. Benjamin Miller, Alexandros Psomas:
Risk-Robust Mechanism Design for a Prospect-Theoretic Buyer. 616-644 - Chi-Kit Lam, C. Gregory Plaxton:
Maximum Stable Matching with One-Sided Ties of Bounded Length. 645-678 - Chi-Kit Lam, C. Gregory Plaxton:
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences. 679-695 - Diodato Ferraioli, Carmine Ventre:
Obvious Strategyproofness, Bounded Rationality and Approximation. 696-720 - Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. 721-742
Volume 66, Number 4, August 2022
- John M. Hitchcock, Hadi Shafei:
Nonuniform Reductions and NP-Completeness. 743-757 - Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
Non-Existence of Stable Social Groups in Information-Driven Networks. 758-777 - Giannis Fikioris, Dimitris Fotakis:
Mechanism Design for Perturbation Stable Combinatorial Auctions. 778-801 - Paul Sauer:
The Complexity of Unavoidable Word Patterns. 802-820 - Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. 821-846 - Ching-Lueh Chang:
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters. 847-860 - Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. 861-909
Volume 66, Number 5, October 2022
- Mathias Hedenborg, Jonas Lundberg, Welf Löwe, Martin Trapp:
A Framework for Memory Efficient Context-Sensitive Program Analysis. 911-956 - Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien:
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. 957-995 - Suman Banerjee, Rogers Mathew, Fahad Panolan:
Target Set Selection Parameterized by Vertex Cover and More. 996-1018 - Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. 1019-1045
Volume 66, Number 6, December 2022
- Yaokun Wu, Yinfeng Zhu:
Submodular Functions and Rooted Trees. 1047-1073 - Anastasiya Chistopolskaya, Vladimir V. Podolskii:
On the Decision Tree Complexity of Threshold Functions. 1074-1098 - Yusong Du, Xiao Ma:
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers. 1099-1122
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 2025-10-29 01:37 CET 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:
