default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 478
Volume 478, March 2013
- Achim Blumensath
:
An algebraic proof of Rabin's Tree Theorem. 1-21 - Paul Dütting, Monika Henzinger, Ingmar Weber:
Bidder optimal assignments for general utilities. 22-32 - Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin:
New results on maximum induced matchings in bipartite graphs and beyond. 33-40 - Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single approximation for the biobjective Max TSP. 41-50 - Iyad A. Kanj, Fenghui Zhang:
On the independence number of graphs with maximum degree 3. 51-75 - Benoît Libert, Moti Yung:
Adaptively secure non-interactive threshold cryptosystems. 76-100 - Hossein Nevisi, Daniel Reidenbach:
Unambiguous 1-uniform morphisms. 101-117 - Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Linear time and space gathering of anonymous mobile agents in asynchronous trees. 118-126
- Wenbin Chen, Lingxi Peng, Jianxiong Wang, Fufang Li, Maobin Tang, Wei Xiong, Songtao Wang:
Inapproximability results for the minimum integral solution problem with preprocessing over ℓ∞ℓ∞ norm. 127-131
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-04 22:08 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:
