Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 596
Volume 596, September 2015
- Sara Brunetti, Elena Lodi, Walter Quattrociocchi
:
An inclusion hierarchy of irreversible dynamos. 1-11 - Andrew Twigg, Eduardo C. Xavier:
Locality-preserving allocations problems and coloured bin packing. 12-22 - Widmer Bland, William F. Smyth:
Three overlapping squares: The general case characterized & applications. 23-40 - Francine Blanchet-Sadri, Andrew Lohr:
Computing minimum length representations of sets of words of uniform length. 41-54 - Gerold Jäger, Marcin Peczarski:
Bounding memory for Mastermind might not make it harder. 55-66 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. 67-78 - Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online multi-coloring with advice. 79-91 - János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. 92-101 - Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti:
The minimum k-storage problem on directed graphs. 102-108 - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two agent scheduling with a central selection mechanism. 109-123 - Julien David, Loïck Lhote, Arnaud Mary, François Rioult:
An average study of hypergraphs and their minimal transversals. 124-141
- Guillaume Guégan, Pascal Ochem:
Complexity dichotomy for oriented homomorphism of planar graphs with large girth. 142-148 - György Dósa:
The tight absolute bound of First Fit in the parameterized case. 149-154
a service of 
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 2024-04-22 20:59 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:
