default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 573
Volume 573, March 2015
- Monika Henzinger
, Veronika Loitzenbauer:
Truthful unit-demand auctions with budgets revisited. 1-15 - Christopher M. Homan, Sven Kosub:
Dichotomy results for fixed point counting in boolean dynamical systems. 16-25 - Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan:
Hardness results, approximation and exact algorithms for liar's domination problem in graphs. 26-42 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
The max-distance network creation game on general host graphs. 43-53 - Marziyeh Boroujeni, Abdolali Basiri, Sajjad Rahmany, Annick Valibouze:
F4-invariant algorithm for computing SAGBI-Gröbner bases. 54-62 - Yunlong Liu, Jianxin Wang, Jie You, Jianer Chen, Yixin Cao:
Edge deletion problems: Branching facilitated by modular decomposition. 63-70 - Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah:
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. 71-89
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-05-15 23:32 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
