default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 636
Volume 636, July 2016
- Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann
, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and drawing IC-planar graphs. 1-16 - Shlomi Dolev, Ephraim Korach, Ximing Li, Yin Li, Galit Uzan:
Magnifying computing gaps: Establishing encrypted communication over unidirectional channels. 17-26 - Paolo Serafino, Carmine Ventre:
Heterogeneous facility location without money. 27-46 - Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
Lower and upper bounds for long induced paths in 3-connected planar graphs. 47-55 - Dmitry Kosolobov:
Finding the leftmost critical factorization on unordered alphabet. 56-65 - Franz J. Brandenburg, Andreas Gleißner:
Ranking chain sum orders. 66-76 - Marina Groshaus, Leandro Montero:
Tight lower bounds on the number of bicliques in false-twin-free graphs. 77-84 - Jørgen Bang-Jensen, Frédéric Havet:
Finding good 2-partitions of digraphs I. Hereditary properties. 85-94
- Helmut Prodinger:
Batcher's odd-even exchange revisited: A generating functions approach. 95-100
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-09-28 01:28 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:
