default search action
Theoretical Computer Science, Volume 909
Volume 909, March 2022
- Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable matching with uncertain pairwise preferences. 1-11 - Yangyang Zhou, Dongyang Zhao, Mingyuan Ma, Jin Xu:
Total coloring of recursive maximal planar graphs. 12-18 - Luís M. S. Russo:
Range minimum queries in minimal space. 19-38 - Qian M. Zhou, Alice Calvert, Maxwell Young:
Singletons for simpletons revisiting windowed backoff with Chernoff bounds. 39-53 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca:
Cutting bamboo down to size. 54-67 - Louis Esperet, Benjamin Lévêque:
Local certification of graphs on surfaces. 68-75 - Anaïs Durand, Michel Raynal, Gadi Taubenfeld:
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results. 76-86 - Carlos V. G. C. Lima, Thiago Marcilon, Nicolas Almeida Martins, Rudini M. Sampaio:
PSPACE-hardness of variants of the graph coloring game. 87-96 - Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton dos Santos Souza:
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. 97-109
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.