


default search action
Theoretical Computer Science, Volume 918
Volume 918, May 2022
- Abolfazl Poureidi
:
Algorithmic results in secure total dominating sets on graphs. 1-17 - Biing-Feng Wang
:
Efficient algorithms for the minmax regret path center problem with length constraint on trees. 18-31 - Marieh Jahannia
, Morteza Mohammad Noori, Narad Rampersad
, Manon Stipulanti:
Closed Ziv-Lempel factorization of the m-bonacci words. 32-47 - Aviv Bar-Natan, Panagiotis Charalampopoulos
, Pawel Gawrychowski, Shay Mozes
, Oren Weimann
:
Fault-tolerant distance labeling for planar graphs. 48-59 - Tatsuya Gima
, Tesshu Hanaka
, Masashi Kiyomi, Yasuaki Kobayashi
, Yota Otachi
:
Exploring the gap between treedepth and vertex cover through vertex integrity. 60-76 - Hans-Joachim Böckenhauer
, Dennis Komm
, Raphael Wegner:
Call admission problems on grids with advice. 77-93 - András London
, Ryan R. Martin
, András Pluhár:
Graph clustering via generalized colorings. 94-104 - Viliam Geffert, Zuzana Bednárová, Alexander Szabari:
Input-driven pushdown automata for edit distance neighborhood. 105-122

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.