default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 472
Volume 472, February 2013
- Ariana Angjeli, Eddie Cheng
, László Lipták:
Linearly many faults in dual-cube-like networks. 1-8 - Marc Demange, Dominique de Werra:
On some coloring problems in grids. 9-27 - Stefan Dobrev, Paola Flocchini, Rastislav Královic, Nicola Santoro:
Exploring an unknown dangerous graph using tokens. 28-45 - Qiang Dong, Junlin Zhou, Yan Fu, Hui Gao:
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model. 46-59 - Martin Farach-Colton, Antonio Fernández Anta, Miguel A. Mosteiro:
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). 60-80 - Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. 81-89 - Dimitris Fotakis, Christos Tzamos:
Winner-imposing strategyproof mechanisms for multiple Facility Location games. 90-103
- Ye Du:
On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix. 104-109
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-02-05 20:35 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:
