default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 575
Volume 575, April 2015
- Sudebkumar Prasant Pal, Kunihiko Sadakane
:
Guest Editors' foreword. 1-2
- Satoshi Fujita:
Optimal serial broadcast of successive chunks. 3-9 - Tong-Wook Shinn, Tadao Takaoka:
Variations on the bottleneck paths problem. 10-16 - Subir Kumar Ghosh, Bodhayan Roy:
Some results on point visibility graphs. 17-32 - Alka Bhushan, Sajith Gopalan:
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs. 33-41 - Selim G. Akl, Robert Benkoczi, Daya Ram Gaur, Hossam S. Hassanein, Shahadat Hossain, Mark Thom:
On a class of covering problems with variable capacities in wireless networks. 42-55 - N. S. Narayanaswamy, G. Ramakrishna:
On minimum average stretch spanning trees in polygonal 2-trees. 56-70 - Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
Advancements on SEFE and Partitioned Book Embedding problems. 71-89 - Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Alignment with non-overlapping inversions and translocations on two strings. 90-101
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-05-12 21:45 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:
