default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 145
Volume 145, May 2019
- Chun Jiang Zhu
, Kam-yiu Lam, Joseph Kee-Yin Ng, Jinbo Bi:
On the VC-dimension of unique round-trip shortest path systems. 1-5 - Ziwen Liu, Chao Yang:
Hanano Puzzle is NP-hard. 6-10 - Yuxing Yang, Lingling Zhang:
Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes. 11-15 - Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-width annulus with outliers: Circular, square, and rectangular cases. 16-23 - Pasin Manurangsi:
A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems. 24-29 - Anupriya Jha, Dinabandhu Pradhan, Sumanta Banerjee:
The secure domination problem in cographs. 30-38 - Dekel Tsur:
The effective entropy of next/previous larger/smaller value queries. 39-43 - John M. Machacek:
Partial words with a unique position starting a square. 44-47 - Frank Ban, Kamal Jain, Christos H. Papadimitriou, Christos-Alexandros Psomas, Aviad Rubinstein:
Reductions in PPP. 48-52 - Marwa Yusuf, Ahmed El-Mahdy, Erven Rohou:
Towards automatic binary runtime loop de-parallelization using on-stack replacement. 53-57 - Lena Schlipf, Jens M. Schmidt:
Simple computation of st-edge- and st-numberings from ear decompositions. 58-63 - Sebastian Siebertz:
Greedy domination on biclique-free graphs. 64-67 - Simon Halfon, Philippe Schnoebelen:
On shuffle products, acyclic automata and piecewise-testable languages. 68-73 - Naoyuki Kamiyama:
A note on balanced flows in equality networks. 74-76
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 2026-06-10 22:52 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:
