default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 613
Volume 613, February 2016
- Tomoyuki Yamakami:
Pseudorandom generators against advised context-free languages. 1-27 - Kevin A. Naudé:
Refined pivot selection for maximal clique enumeration in graphs. 28-37 - Fedor V. Fomin
, Pinar Heggernes, Erik Jan van Leeuwen:
The Firefighter problem on graph classes. 38-50 - Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-competitive algorithms for cheapest set problems under uncertainty. 51-64 - Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The price of envy-freeness in machine scheduling. 65-78 - Tim Nonner:
Capacitated Max-Batching with interval graph compatibilities. 79-93 - Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi, Paola Vocca:
Min-max communities in graphs: Complexity and computational properties. 94-114 - Bernd Meyer:
Generalized Pete's Pike is PSPACE-complete. 115-125
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:09 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:
