default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 156
Volume 156, 2026
- Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
Approximately covering vertices by order-5 or longer paths. 103704 - Pallavi Jain
, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory budgeting with project groups. 103702 - Joshua A. Grochow, Michael Levet:
On the parallel complexity of group isomorphism via Weisfeiler-Leman. 103703 - Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. 103715 - Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster winner determination algorithms for (Colored) Arc Kayles. 103716 - Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard:
Interaction graphs of isomorphic automata networks II: Universal dynamics. 103717 - Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ryan Lou, Frank Stephan, Guohua Wu:
Quasi-isometric reductions between infinite strings. 103718 - Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Approximate Turing kernelization for problems parameterized by treewidth. 103720 - Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational complexity of covering multigraphs with semi-edges: Small cases. 103714 - Ivo F. D. Oliveira, Ricardo H. C. Takahashi:
Minmax optimal list searching with log2log2n average cost. 103719 - Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf:
Decomposing permutation automata. 103721 - Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming on bipartite tree decompositions. 103722 - Hoàng-Oanh Le, Van Bang Le:
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles. 103723 - R. Krithika, V. K. Kutty Malu, Prafullkumar Tale:
Revisiting path contraction and cycle contraction. 103724 - Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer:
Exploration of graphs with excluded minors. 103725 - Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski:
The complexity of (Pk,Pℓ)-arrowing. 103726 - Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy:
Algorithms and hardness results for the (k,ℓ)-cover problem. 103727 - Maximilien Gadouleau, Loïc Paulevé, Sara Riva:
Bringing memory to Boolean networks: A unifying framework. 103729 - Bart M. P. Jansen, Ruben F. A. Verhaegh:
Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion. 103730 - Hsu-Chun Yen, Di-De Yen:
Decomposing finite-valued two-way finite transducers. 103731
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 2026-07-14 00:34 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
