


default search action
Journal of Computer and System Sciences, Volume 158
Volume 158, 2026
- Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza:

On the complexity of computing the co-lexicographic width of a regular language. 103759 - Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner:

Complexity of deciding the equality of matching numbers. 103760 - Yue Sun, Donglei Du, Longkun Guo, Dachuan Xu:

An optimal absolute approximation algorithm for computing k disjoint restricted shortest paths. 103761 - Verónica Becher, Simon Lew Deveali, Ignacio Mollo Cunningham:

Automata for the commutative closure of regular languages. 103762 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:

Rectilinear-upward planarity testing of digraphs. 103775 - Antoine Dailly, Florent Foucaud, Anni Hakanen:

Algorithms and hardness for Metric Dimension on digraphs. 103776 - Harmender Gahlawat, Meirav Zehavi:

Parameterized analysis of the cops and robber problem. 103781

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














