default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 135
Volume 135, August 2023
- Nicolas Maack, Hendrik Molter
, Rolf Niedermeier, Malte Renken:
On finding separators in temporal split and permutation graphs. 1-14 - Jin-Yi Cai, Austen Z. Fan, Yin Liu:
Bipartite 3-regular counting problems with mixed signs. 15-31
- Palash Dey, Neeldhara Misra:
On the exact amount of missing information that makes finding possible winners hard. 32-54
- John Andrews, Michele Ciampi, Vassilis Zikas:
Etherless Ethereum tokens: Simulating native tokens in Ethereum. 55-72
- Thomas Erlebach, Jakob T. Spooner:
Parameterised temporal exploration problems. 73-88
- Diksha Gupta, Jared Saia, Maxwell Young:
Bankrupting Sybil despite churn. 89-124 - Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized complexity of graph planarity with restricted cyclic orders. 125-144
- Markus Lohrey:
Complexity of word problems for HNN-extensions. 145-157
- Cristina G. Fernandes, Carla Negri Lintzmayer:
How heavy independent sets help to find arborescences with many leaves in DAGs. 158-174
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 2025-12-12 01:27 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
