EUVIMED · CrossrefZeitschrift
Theoretical Computer Science
ISSN 0304-3975 · Elsevier BV
Neueste Artikel
Distributed distance sensitivity oracles
On asynchronous multiparty session types for federated learning
Cops and robber on variants of retracts and subdivisions of oriented graphs
Cyclic diagnosability of augmented cubes under the fault diagnosis model
Towards optimal kernel for Edge Triangle Deletion
The power of amortization on minimizing total completion time with explorable uncertainty
A randomized self-stabilizing luby-style MIS algorithm via geometric priority compression
Local infection in uniform hypergraphs
On one-way and two-way cellular automata: Bi-productiveness, Rice-style theorems, and succinctness
Approximating temporal modularity on graphs of small underlying treewidth
Special Issue on the 21st International Symposium on Algorithmics of Wireless Networks (ALGOWIN 2025)
Improved approximation for pathwidth one vertex deletion and parameterized complexity of its variants
A survey on the dynamical properties of additive cellular automata over finite abelian groups
An in-place maximum matching algorithm for graphs of minimum degree 5
Almost optimal adaptive proper learning polynomials
An approximation algorithm for minimum cost connected Roman dominating set problems
Tight linear inapproximability for the temporal graph exploration problem
The parity-constrained four-peg Tower of Hanoi problem and its state graph
Revocable multi-key fully homomorphic encryption with compact ciphertexts
When agents are powerful: Black hole search with verification in time-varying graphs
Faster FPT algorithms for Grundy number parameterized by distance to cluster with a bounded number of cliques
Constant-width circuits of polylogarithmic genus compute exactly ACC0
Editorial Board
Online budget-feasible mechanism design with predictions
Grassroots Platforms with Atomic Transactions: Social Graphs, Cryptocurrencies, and Democratic Federations
Broadcasting in Hypercubes with Non-Uniform Fault Rates: A Weight Function Framework Revisited
Parameterized Complexity of Disconnected Matchings
Finitely (In)tractable Promise Constraint Satisfaction Problems
Hardness and Tractability of Th+1-Free Edge Deletion
Smallest suffixient sets: Effectiveness, resilience, and calculation
Jahrgänge
2027 · 92026 · 2892025 · 4232024 · 4092023 · 4372022 · 4652021 · 5542020 · 6262019 · 5242018 · 4012017 · 4302016 · 5182015 · 5752014 · 4922013 · 4942012 · 5202011 · 6072010 · 3402009 · 4882008 · 4852007 · 4582006 · 5112005 · 4852004 · 5922003 · 6292002 · 4252001 · 4012000 · 3481999 · 3071998 · 3301997 · 3351996 · 3491995 · 3251994 · 3381993 · 2911992 · 2951991 · 2851990 · 1771989 · 1521988 · 142
EUVIMED